Abstract: A method for communication is disclosed and may include dynamically changing the bit-rate of an audio and/or video stream communicated over a Bluetooth connection based on conditions of the Bluetooth connection. A rate at which corresponding audio and/or video samples, for said audio and/or video stream, are encoded for communication via the Bluetooth connection, may be based on Bluetooth piconet event information. The bit-rate of the audio and/or video stream may be dynamically adjusting based on bandwidth of the Bluetooth connection. The bit-rate of the audio and/or video stream may be dynamically increased based on bandwidth of the Bluetooth connection. The bit-rate of the audio and/or video stream may be dynamically decreased based on bandwidth of the Bluetooth connection. The audio and/or video samples may be encoded utilizing a variable bit rate.

Abstract: Systems and methods that provide receive queue provisioning are provided. In one embodiment, a communications system may include, for example, a first queue pair (QP), a second QP, a general pool and a resource manager. The first QP may be associated with a first connection and with at least one of a first limit value and an out-of-order threshold. The first QP may include, for example, a first send queue (SQ). The second QP may be associated with a second connection and with a second limit value. The second QP may include, for example, a second SQ. The general pool may include, for example, a shared receive queue (SRQ) that is shared by the first QP and the second QP. The resource manager may provide, for example, provisioning for the SRQ and may manage the first limit value and the second limit value.

Abstract: In a network monitor system having a plurality of line cards, each of the line cards monitors a communication data amount in consideration of a group or a finer group with conditions other than an IP address added thereto. Each of the line cards controls the communication data amount by the use of a line interface section 11, a header extraction section 12, a flow identification section 13, and a counter section 16.

Abstract: In one embodiment, the present invention comprises transmitting a broadcast burst in a broadcast channel from a base station of a radio communications system. The invention further comprises receiving a request burst from a user terminal, and transmitting a message burst from the base station to the user terminal from which the request was received. The message burst includes a description of the channels available on the radio communications system for receiving messages from user terminals.

Abstract: Systems and methods for queuing and de-queuing packets in a two-dimensional link list data structure. A network processor processes data for transmission for a plurality of Virtual Connections (VCs). The processor creates a two-dimensional link list data structure for each VC. The data field of each data packet is stored in one or more buffer memories. Each buffer memory has an associated buffer descriptor that includes a pointer to the location of the buffer memory, and a pointer pointing to the memory of the next buffer descriptor associated with a buffer memory storing data for the same packet. Each data packet also has an associated packet descriptor including a pointer pointing to the memory location of the first buffer descriptor associated with that packet, and a pointer pointing to the memory location of the packet descriptor associated with the next data packet queued for transmission.

Abstract: A method of switching a network access configuration associated with a first electronic system to a second electronic system via a network is described. The first electronic system is inoperable. The second electronic system replaces the first electronic system such that a user seamlessly transitions from the first electronic system to the second electronic system. The user continues to access the network resources using the second electronic system rather than the first electronic system.

Abstract: A packet processing system architecture and method are provided. According to a first aspect of the invention, a plurality of quality of service indicators are provided for a packet, each with an assigned priority, and a configurable priority resolution scheme is utilized to select one of the quality of service indicators for assigning to the packet. According to a second aspect of the invention, wide data paths are utilized in selected areas of the system, while avoiding universal utilization of the wide data paths in the system. According to a third aspect of the invention, one or more stacks are utilized to facilitate packet processing. According to a fourth aspect of the invention, a packet size determiner is allocated to a packet from a pool of packet size determiners, and is returned to the pool upon or after determining the size of the packet.

Abstract: The present invention is directed to a system for linking a first autonomous network system to at least one second autonomous network system. The first autonomous network system having a first private IP address space and the at least one second autonomous network system having at least one second private IP address space. The first private IP address space and the at least one second private IP address space are at least partially overlapping. The system includes a first routing domain including the first autonomous network system and at least one second routing domain including the at least one second autonomous network system. A geographically diverse linking autonomous system couples the first autonomous network system and the at least one second autonomous network system.

Abstract: A method of monitoring a network that includes a number of nodes interconnected by trunks has a step of obtaining processor usage data pertaining to a plurality of node processors, the processor usage data including information representative of a rate of usage of each of the plurality of node processors. The method also includes obtaining memory usage data pertaining to a plurality of memories, each of the plurality of memories associated with a node processor, the memory usage data including information representative of a rate of usage of each of the plurality of memories. The method further includes determining from the memory usage data and the processor usage data whether a network congestion event is occurring.

Abstract: A system improves reconstruction of real-time data in a packetized network. The system includes the following elements. A play-out buffer receives packets from the network. A playback element, coupled with the play-out buffer, retrieves packets from the play-out buffer and outputs data for the reconstruction of real-time data. A time adjuster alters the rate at which the data is output in accordance with the availability of the packets.

Abstract: A First-In-First-Out (FIFO) block to buffer a packet having a size is presented. The FIFO block includes a receiver to receive a data frame including the packet and overhead information, and to extract the packet from the data frame. A buffer has a plurality of memory locations to store the packet in a FIFO configuration. A buffer manager, in response to detecting a buffer low packet condition, stalls reads of the packet from the buffer.

Abstract: Routing data packets includes receiving data packets from a network element at a routing gateway. The data packets are determined to be destined for a mobile node. A location of the mobile node is obtained. The data packets are forwarded to the mobile node according to the location on behalf of the network element.

Abstract: Responsibility can be established for specific copies or instances of copies of digitized multimedia content using digital watermarks. Management and distribution of digital watermark keys (e.g., private, semiprivate and public) and the extension of information associated with such keys is implemented to create a mechanism for the securitization of multimedia titles to which the keys apply. Bandwidth rights can be created to provide for a distributed model for digital distribution of content which combines the security of a digital watermark with efficient barter mechanisms for handling the actual delivery of digital goods. Distributed keys better define rights that are traded between transacting parties in exchanging information or content. More than one party can cooperate in adding distinguished watermarks at various stages of distribution without destroying watermarks previously placed in the content.

Abstract: Embodiments of the invention are concerned with data distribution apparatus, for use on each of a plurality of machines in distributing a set of data over a network amongst said machines. The apparatus comprises: i) multicast apparatus for use in multicasting said set of data over the network for receipt by others of said machines; and ii) a data retrieval arrangement for use in retrieving data from a set of data previously multicast by at least one of said machines, and supplying retrieved data to the multicast apparatus for use in multicasting the retrieved data over the network to others of the plurality of machines, wherein more than one of said plurality of machines is enabled to act as a multicast source in distributing the set of data over the network. In embodiments of the invention, a first machine is elected as download master and multicasts downloaded data, via a group address, to the networked machines.

Abstract: A system employs space-time coding characterized at the transmitter by bit-interleaved coded modulation (BICM) combined with multi-carrier Orthogonal Frequency Division Multiplexing (OFDM) modulation. Space-Time coding techniques improve transmission efficiency in radio channels by using multiple transmit and/or receive antennas and coordination of the signaling over these antennas. Bit-interleaved coded modulation provides good diversity gain with higher-order modulation schemes that employ binary convolutional codes. OFDM modulation allows for wideband transmission over frequency selective radio channels. A receiver demodulates the OFDM signal and applies multi-input, multi-output (MIMO) demapping to estimate the BICM encoded bitstream. After deinterleaving of the BICM encoded bitstream, maximum a posteriori (MAP) decoding is applied to the resulting bit stream to generate soft output values.

Abstract: The present invention provides for a method for reserving spare bandwidth for a link in a communication network including a plurality of links. The method provides for monitoring the volume of traffic routed through each link of the communication network. A single link failure for each link is then simulated and one volume of traffic which would be rerouted through each link for maintaining communication and the volume of traffic removed from each link are determined for each simulated single link failure. The difference between the volume of traffic which would need to be rerouted through each link and the corresponding volume of traffic removed from each link is then computed, and a maximum difference value is determined for each link for all simulated single link failures. An amount of spare bandwidth equivalent to the determined maximum difference is then reserved for each link.

Abstract: A method and apparatus are provided for frame packing for nodes in a network. In one example, the method includes receiving packet streams from network nodes; parsing the packet streams into individual calls; grouping the individual calls having the same destined node together into grouped calls; packing the grouped calls into single packets; and sending the single packets to the destined nodes.

Abstract: A telecommunication system includes a base station, a router allocated to the base station, and several subscriber stations that are connected to the base station via an access network. Subscriber station routers set up a telecommunication link with the base station router. The base station router controls the variable transfer rates that are allocated to a telecommunication link between the base station and the subscriber station. The access network is only loaded with the transfer bandwidth that is actually required for data transmission.

Abstract: A method and apparatus for performing byte rate adaptation. Specifically, embodiments of the present invention describe a method for deleting bytes when performing byte rate adaptation. The method begins by receiving data at a first rate. The data comprises valid data and deletable data. The data also comprises a plurality of cycles, wherein each cycle comprises a word length of W bytes. The method continues by compressing the plurality of cycles into a compressed cycle by deleting redundant deletable bytes. The compressed cycle comprises at least one valid data byte. Thereafter, the method substitutes remaining deletable bytes in the first compressed cycle with a uniform character, and sends the compressed cycle to a FIFO buffer for further transmission.

Abstract: A content addressable merged queue (camQ) architecture for switching data. The camQ architecture comprises a first array of priority cells for indicating a priority of a plurality of cells and a second array of destination cells for indicating a destination of the plurality of cells. A priority selector is operable to select a portion of said plurality of cells according to a priority selection. A grant generator is operable to grant at least one connection request associated with cells of the portion.