Abstract: A method of changing a fragment size of data packets in a router where a data packet is divided into the data packets having the fragment size, and are transmitted to a network along with audio packets includes the steps of acquiring, in the router, a parameter indicative of whether proper audio quality is maintained through transmission of the audio packets, and changing the fragment size of the data packets in response to the acquired parameter.

Abstract: The invention relates to a receiver for receiving a signal of a desired user, which signal may arrive at the receiver in different components along several different paths at several different delays. The receiver includes an antenna array, rake branches, and at least one search branch. At least one rake branch includes a plurality of beam formers, a plurality of correlators coupled to the inputs of the beam formers, a demodulator coupled to the outputs of the correlators, a code generator for generating codes required by the correlators, controls means, and calculation means. The calculation means are adapted to calculate and transmit to the control means, on the basis of the outputs of the correlators, information on how the code generator and the beam formers are to be controlled.

Abstract: A full duplex wireless communication system (100) one or more wireless communication devices (101) and fixed infrastructure equipment that includes at least a transcoder (201), a router (203) and a base transceiver site (BTS, 103). To reduce delays of information packets communicated between the transcoder and the BTS, the transcoder, router and BTS employ a unique synchronization-based priority scheme. In accordance with the priority scheme, an indication of the status of synchronization between the transcoder and the BTS is included in an information pace to guide the router's processing of the packet. In the event that the router stores the packet the router preferably inserts a time-delay indication into a portion of the packet. The BTS uses the time-delay indication to determine a desired transcoder transmission time, and communicates an indication of the desired transcoder transmission time to the transcoder.

Abstract: An alternative network service replaces long distance and international ISDN service for H.320 video conferencing applications. The network utilizes ATM technology and high-performance international fiber-optic transmission facilities to provide improved support for these applications. The alternative network service includes access through local ISDN service providers using ISDN dial-out and dial-in server devices to provide routing and called address transfer to the local alternative service gateway. The server devices also provide routing for calls using the ISDN long distance service and reroute capability to backup the alternative network service.

Abstract: A method for transmitting orthogonal frequency division multiplexing (OFDM) signals including coding the OFDM signals; forming a block of N coded data and dividing the block into L M-sized small blocks; M-point inverse fast Fourier transforming the L small blocks; combining the transformed blocks to generate an N-sized inversely-transformed block; attaching a cyclic prefix to the N-sized block; and transforming the blocks into an analog signal; and transmitting the analog signal. A method of receiving OFDM signals including digitally converting received OFDM signals and obtaining a samples from the transformed signals; detecting the starting point of an N-sized signal sample block from the samples; dividing the signal sample block into L M-sized small blocks M-point fast Fourier transforming the L small blocks; combining the transformed small blocks to generate an N-sized transform block; detecting data from the generated block, and decoding the detected data. N, M and L are integers of 1 or more and L=N/M.

Abstract: A network switch, configured for performing layer 2 and layer 3 switching in an Ethernet (IEEE 802.3) network without blocking of incoming data packets, includes network switch ports, each including a flow module configured for generating a packet signature based on layer 3 information within a received data packet. The flow module generates first and second hash keys according to a prescribed hashing function upon obtaining first and second portions of layer 3 information. The flow module combines the first and second hash keys to form the packet signature, and searches an on-chip signature table that indexes addresses of layer 3 switching entries by entry signatures, where the entry signatures are generated using the same prescribed hashing function on the first and second layer 3 portions of the layer 3 switching entries.

Abstract: A method of forwarding data out of a processor includes receiving data by the processor, then using two schedulers to assign processing threads to transmit data out of the processor. Each of the schedulers supports forwarding data out of ports that are mutually exclusive from those of the other scheduler. The processing threads can operate at least partially simultaneously.

Abstract: A system and method where a data transmitter retransmits data frames to a receiver for combination with previously transmitted data frames that were received with errors to increase gain at the receiver. The data transmitter receives a retransmission request from the receiver and retransmits a particular data frame without a signaling message. The receiver compares the retransmitted data frame to other data frames stored in a buffer to determine the likelihood of a match between the transmitted data frame and a buffered data frame. When the likelihood of a match exceeds at least one predetermined threshold, the receiver combines the retransmitted data frame with the matching data frame. If the likelihood of a match is below any of the predetermined thresholds, the receiver stores either the combined data frame, or the retransmitted and matching data frame, depending on which threshold is not exceeded, and sends another retransmission request.

Abstract: A channel spreading device for a CDMA communication system is disclosed.

Abstract: The invention pertains to methods and apparatus for determining when and how to perform communications network congestion control tactics, such as reconfiguring pipeline bandwidths, with respect to packet-based networks.

Abstract: A method, apparatus, and computer program product for determining a drop probability for use in a congestion control module located in a node in a network is disclosed. A weight value for determining a weighted moving average of a queue in a node is first systematically calculated. The weighted moving average is calculating and an average queue size for the node is determined based upon the weighted moving average. A control function associated with the congestion control module is evaluated using the average queue size to determine the drop probability. In a further embodiment, the control function is calculated based upon a queue function where the queue function is calculated based upon predetermined system parameters. Thus, when the congestion control module drops packets based upon the drop probability determined by the control function the queue will not oscillate.

Abstract: A queue scheduler that distributes a partition worth of bandwidth to a plurality of queues according to a weight assigned to each of the queues. The plurality of queues are arranged from a highest priority to a lowest priority. The queues are serviced by the scheduler until each of the corresponding weights is consumed for each queue. The higher priority queues are serviced before the lower priority queues.

Abstract: Session services are employed in a networked computing environment to apply specific processing to an exchange of data between processes. In a wireless communication network, a single wireless link is typically shared among multiple users through wireless channels, which are allocated and switched among the users on a demand basis. Packets sent over the wireless link need to be signaled and tagged accordingly to initiate and employ the session service for the intended packets which comprise the flow. A method for identifying and applying session services to a wireless link includes identifying a packet flow over the wireless link corresponding to a received message by employing a flow identifier and filter. The packet flow corresponds to a session, and is mapped to at least one session service. The mapped session service is then applied to the received message.

Abstract: A method for reducing current drain in a communication device includes a step of determining when the communication device is transmitting. A next step includes lowering the current level to the receiver when communication device is not transmitting. A next step includes raising the current level to the receiver when communication device is transmitting. Changing the current level alters the linearity of the receiver. As a result, the communication device reduces power consumption while operating in a traffic channel. The system is applicable to full duplex systems such as code division multiple access (CDMA) systems.

Abstract: A receiver for a multi-carrier CDMA system receives a signal transmitted having a known pilot sequence on plural sub-carriers. The system includes plural down-converters for down-converting the received signal to baseband signals. A delay and channel estimator correlates at least one of the baseband signals with a single wideband pilot signal, the single wideband pilot signal including all of the known pilot sequences, to produce an estimate of channel gain and multi-path delay. Plural demodulators, one for each of the plural sub carriers, are operatively coupled to the delay and channel estimator, each for demodulating one of the plural baseband signals using the estimate of channel gain and multi-path delay.

Abstract: A cross-connect is provided which uses “mask” and “rotate” parameters, rather than “source” and “destination” parameters. In a first step (1300), a word representing a full time slot of data is read from a desired source time slot. In a following step (1302), the aforementioned word is masked to enable only the desired bits which are to be output. Thereafter, in a step (1304), the masked word is rotated to ensure that the target bits are in the correct bit positions for a target time slot, to which the masked and rotated word is written in a step (1306). This cross-connection method supports efficient use of cross-connection control memory, and of buffer RAM memory.

Abstract: Fair scheduling in broadcast environments is disclosed. In one embodiment, a computerized system includes a link through which packets are transmitted, and a plurality of nodes. Each node transmits a packet through the link when counting from a back-off interval reaches a predetermined transmission time. The back-off interval for each packet is based on at least a start tag of the packet, which is assigned to the packet when it arrives at or within the node for transmission over the link, such as at a controller (e.g., a medium-access controller, or MAC) of the node.

Abstract: An apparatus and method for efficient hashing uses both an identifying portion of a data packet, e.g., source and destination ID, and an identifying value of the node, e.g., the IP address of the node, to generate a hash result. By inserting a unique value into the hash operation at each node, the invention effectively provides for a different hash implementation at each node. As a result, in situations where multiple paths or multiple links within a path are available to forward packets, traffic can be split over the multiple paths and links. Inefficient utilization of network links found in prior systems which use the same hash operation at each node are eliminated.

Abstract: A method and system for implementing of Data Link Switching-like protocols within a high speed packet switching network environment. The invention relates to new access services for NBBS (Networking Broad Band Services) networks. A new access agent (implementing the DLSw Access Services) provides a dramatically simplified but comprehensive Data Link Switching Services across a wide area network and minimizes the latency to set up SNA paths across the network, while maximizing the efficiency of setting up these paths. The invention does not require the implementation of a complex and large TCP/IP protocol stack within the Data Link Switching node. The Access Agent implementing the DLSw node makes intensive use of such NBBS facilities as the Spanning Tree with the use of internode functional addresses, for the exchange of the control information necessary to efficiently set up paths across the network between DLSw access agents.

Abstract: The present invention is a telecommunications network having a hierarchical architecture which reduces the amount of equipment and processing required to recover from network failures. In an exemplary embodiment, the nodes of the network are divided into high level nodes and low level nodes. High granularity traffic is collected, routed and manipulated at high level nodes, but generally passes through low level nodes, which generally lack the capability for routing and manipulating such high granularity traffic. Equipment savings results from low level nodes lacking the capability to manipulate traffic other than traffic relevant to those nodes or nearby nodes. Each high level node pair is connected by at least three node disjoint paths of low level nodes and links. Less protection capacity is needed, as each node disjoint path is expected to handle only a portion of rerouted traffic in the event of a network equipment failure.