Abstract: Examples disclosed herein relate to methods and systems for enhancing performance of robust header compression (RoHC) compressor when encountering silence suppression. In one example, an RTP timestamp increment is calculated for successive packets, until a predetermined number of packets have a constant timestamp increment value. The constant RTP timestamp increment value is assigned as a timestamp stride (TS_STRIDE) value for compression, the value of each RTP timestamp (TS) is scaled by timestamp stride (TS_STRIDE) and the header is compressed using the assigned value.

Abstract: A device may receive a fragment of a fragmented data unit, determine a flow identifier that identifies a data flow with which the fragment is associated, and create a flow entry, based on the flow identifier, to store information associated with the data flow. The device may also determine a fragment key associated with the fragment, store a pointer to the flow entry based on the fragment key, correlate the fragment and another fragment, associated with the data flow, based on the fragment key and the pointer to the flow entry, and accumulate statistics associated with the fragment and the other fragment after correlating the fragment and the other fragment.

Abstract: A system, apparatus, and method are directed to managing network communications by, in part, reducing a number of packets between a client and a server communicating through another device, such as a traffic management device (TMD). The invention reduces the number of packets communicated, in part, by coalescing acknowledgements (ACKs) and/or finish (FIN) flags into another packet. In one embodiment, if the client provides a substantially complete request for the server, an ACK to the request may be coalesced into a corresponding response from the server. When another request is to be provided to the server, within about half of the minimum retransmission timeout, an ACK to the prior response may be coalesced into a subsequent request to the server. Packet reduction may also be achieved by stretching a packet to insert additional data when the insertion maintains a packet size that is within a negotiated maximum segment size (MSS).

Abstract: A method for bandwidth allocation for delivery of multimedia data from at least one server to one or more clients over a network. The method includes the steps of: determining a maximum flow rate and a minimum flow rate for each client; determining a flow rate range for each client as given by the difference between the maximum flow rate and the minimum flow rate; sorting the one or more clients according to the flow rate range; initializing a current flow rate for each client as the minimum flow rate and summing the flow rate into total server flow rate; establishing remaining server bandwidth; and allocating the remaining server bandwidth to clients, based upon the sorted client's flow rate ranges.

Abstract: Methods and apparatus for compression of headers in broadcasting BCMCS services in a wireless communication system are described. Techniques used in BCMCS systems without feedback include sending static context information during BCMCS service initialization for use in a decompressor in a mobile station. Techniques used in BCMCS systems with feedback include receiving feedback from distributed mobile station decompressors and adjusting the broadcasting compressor in response to the feedback. Techniques that reduce the number of operating states in both the compressor and the decompressor are described. Techniques to classify flows so that a reduced number of contexts are used to compress/decompress session packet headers in a push-to-talk service are described.

Abstract: Methods and apparatus are provided for allocating resources in a distributed environment. The disclosed resource allocation techniques make resource allocation decisions when resources become available. A resource becomes available when the resource completes its previous work or becomes activated. Once it is determined that a resource has become available, the available resource is assigned to an appropriate request. The requests may be stored, for example, in a queue of requests. The available resource may be assigned to an appropriate request based on one or more predefined criteria, such as to service a request associated with a service class having the “greatest need.” The resources may be, for example, a plurality of call agents that are associated with a call center.

Abstract: An apparatus and method for transmitting and receiving wireless packet data are provided. In a wireless packet data transmitter for transmitting to a wireless packet data receiver data packet on a transport channel and control information for supporting the transport channel on a control channel in a wireless packet data communications system, a padding bit eliminator eliminates optional padding bits of a variable size from a transport block for data packet transmission. A transport channel encoder for transport channel-encodes the transport block without the padding bits and transmits the encoded transport block on the transport channel. A control channel encoder control channel-encodes the control information including a padding bit number indicator indicating the number of the eliminated padding bits and transmits the encoded control information on the control channel.

Abstract: A method of optimizing bandwidth usage in a link aggregated network includes identifying available bandwidth on a plurality of data links in a link aggregation group, selecting the data link with the least available bandwidth, and determining whether the available bandwidth of the selected data link is less than a guaranteed bandwidth of an incoming data flow. If the available bandwidth of the selected data link is less than the guaranteed bandwidth of the incoming data flow, the method includes selecting the data link with the next least available bandwidth and repeating the previous steps until the available bandwidth of the selected data link is greater than the guaranteed bandwidth of the incoming data flow. The method further includes assigning the data flow to the data link determined to have an available bandwidth greater than the guaranteed bandwidth of the incoming data flow.

Abstract: A method for compressing a message is described comprising: identifying a first field and a second field within the message; applying a first set of code words to encode data in the first field; and applying a second set of code words to encore data in the second field.

Abstract: A scheduling technique useful in a mesh network includes scheduling a selected amount of traffic in the mesh network using a linear program approach that minimizes a time for the selected amount of traffic to reach its intended destination. The linear program is subject to a plurality of constraints that insure that the selected amount of traffic will reach its intended destination within the minimized time. An example is disclosed that uses such a technique for a mesh network having a root node that is a base station for wireless communications and a plurality of child nodes that comprise subscriber stations. A disclosed example is useful for centralized scheduling in a Wimax mesh network.

Abstract: A communication system processes blocks of input data that include control words and a packet of information words are received. The packet has a start preceded by ones of the control words and an end followed by others of the control words. When the block consists exclusively of information words, a one bit block header having a first sense is appended to the block to form a frame. When the block does not consist exclusively of information words, the block is condensed to accommodate a TYPE word, the TYPE word is generated and inserted into the block and a one bit block header is appended to the block to form the frame. When the block does not consist exclusively of information words the one bit block header has a second sense, opposite to the first sense. Use of a one bit block header reduces overhead. Forward error correction is also utilized.

Abstract: Systems and methods for reducing overhead in a communication system are disclosed. Different frame types are aggregated into an enhanced aggregated frame in response to a determination that the different frames are suitable for transmission within a single reservation period.

Abstract: A method of presenting content from a remote device is provided. Limited bandwidth content, transmitted from a remote device, is received at a local device. The limited bandwidth content is superimposed on enhanced content retrieved by the local device. The limited bandwidth content overlaps with the enhanced content such that the limited bandwidth content is a subset of what is represented by the enhanced content. The limited bandwidth or enhanced content may either be still images or video that is stitched together and displayed at the local device.

Abstract: A wireless communication system (20) includes a wireless network (30) that selectively modifies an aggregation of voice over internet protocol wireless transmissions. In one example, a mobile station geometry provides an indication whether modification of the aggregation is desirable. For example, a mobile station with a better geometry allows for a higher level of aggregation. Another disclosed example includes determining a current cell load condition and increasing the amount of aggregation and the level of aggregation as cell load conditions increase. Another disclosed technique includes staggering the scheduling of aggregated packets to avoid delays at a scheduler. One or more of the disclosed techniques may be used to efficiently transmit voice over internet protocol communications.

Abstract: A communication apparatus includes a transmitter device and a receiver device connected to the transmitter device through a communication line. The transmitter device generates a multiplexed binary signal by adding together N types of binary signals having the same amplitude at a low level and different amplitudes at a high level, where N is an integer more than 1. The receiver device receives the multiplexed binary signal and translates the multiplexed binary signal into the N types of binary signals. One of the N types of binary signals has the minimum amplitude of all the N types of binary signals at the high level. An amplitude of each of the N types of binary signals is defined as a product of the minimum amplitude and 2M-1, where M is an integer from 1 to N.

Abstract: A packet communication apparatus that carries out packet communication with a second packet communication apparatus via a logical connection through header processing of compressing or decompressing a packet header, the apparatus managing a first state machine of a first header processing state concerning a first packet flow of the connection and a second state machine of a second header processing state concerning a second packet flow of the connection; and controlling a state transition of a third state machine that is one of the first state machine and the second state machine on the basis of a state transition of a fourth state machine that is the other of the first state machine and the second state machine.

Abstract: Methods and apparatus including a virtual machine and a compression network platform are provided especially for improving the application of compression algorithms and unique identifiers for bytecode and bytecode packages including associated static dictionaries utilized to advantage in wireless networks. In particular, a given virtual machine need only identify to a receiving virtual machine the unique package identifier for one or more of an algorithm, a static dictionary or a hash for decompressing a received data signal. The receiving virtual machine may advertise what it has locally available to it so that no uploading is necessary. The actuation of bytecode by identifier may be requested at a given destination within the parameters set by RFC 3320.

Abstract: In a method and arrangement for preparation of data for loading from a first data processing device into a second data processing device via a first data connection, a number of transmission-ready transmission data packets are generated in at least one packetizing step from the data to be loaded into the second data processing device; and at least one load parameter influencing the total load time until a complete loading of the data into the second data processing device is determined in a determination step preceding the packetizing step. The generation of the transmission data packets ensues in the at least one packetizing step dependent on the first load parameter.

Abstract: Methods, systems, and computer program products for providing transcoder-free operation in a media gateway are disclosed. In one method, first and second lists of media encoding rates and corresponding indices used by first and second media endpoints of a media stream connection are received. It is determined whether transcoder-free operation is possible for the media stream connection based on the first and second lists. In response to determining that transcoder-free operation is possible for the media stream connection, a transcoder-free connection is established in the media gateway between the first and second endpoints using a single digital signal processor to monitor and map between indices and encoding rates used by the first and second endpoints during the media stream connection.

Abstract: Methods of capturing and compressing trace data for use in network packet traffic analysis are described. In an embodiment, when a packet is received, two records of the packet are created and stored. One record is stored in a file associated with the source address of the packet and the other record is stored in a file associated with the destination address of the packet. Various packet compression techniques are described and one example compares a newly received packet to the previous packet which has been stored in the same file and sets bits in the record which denote whether fields in the newly received packet are the same as the corresponding fields in the previous packet.

Abstract: A method for communicating data is provided that includes receiving a plurality of bits associated with a communications flow and determining whether one or more samples included in the flow should be suppressed. The method also includes suppressing a selected one or more of the samples if the selected samples are similar to previously received samples. In a more particular embodiment, the method also includes positioning unique samples that are included in the flow in a super-frame to be communicated to a next destination. Additionally, the method may include receiving the unique samples and evaluating the unique samples in order to restore a plurality of bits associated with the communications flow.

Abstract: A method of generating a data block to be transmitted from a protocol layer to a receiving side in a wireless communication system, the protocol layer having a header compression function, comprises generating at least one of a control packet which includes control information and a compressed packet generated by header compression for an upper layer data block, and generating a first lower layer data block which includes type indication information and the control packet, if the control packet is generated, the type indication information indicating a type of control information included in the generated control packet.

Abstract: A wireless communication system and method is provided for the transfer and processing of data in accordance with specialized data transfer protocols while utilizing conventional base station equipment. For example, the wireless communication system may include a subscriber station that provides for the modification of data packets in accordance with a proprietary protocol and the addressing of the modified data packets to a server. The server is adapted to reconstruct the data packets for transmission to other local subscriber stations or to a packet-switched network. In additional embodiments, the base station itself rather than a server operates to reconstruct the data packets.

Abstract: Media and methods are provided for constructing data structures associating data segments in packets with reference identifiers to optimize bandwidth usage within a network during transmission. In one embodiment, a data structure is initialized to contain no data. A minimum length of a data segment to be examined is determined. For each packet in the transmission, data segments of the packet are examined. Data segments are added to the data structure as necessary. Examination is repeated along with an appropriate addition until the packet contains less data than a segment of the minimum length and further continued until all packets are examined. The data structure is constructed associating the portions of the packet and respective reference identifiers. In certain embodiments, the count can be a total count of frequently occurring segments, the count of unique segments or the count of packets containing unique segments. In other embodiments, the construction is accomplished by a compression library.

Abstract: Details of media encoding and decoding devices which support generic homing sequences, and methods for operating such devices are disclosed. The use of generic homing sequences may permit an embodiment of the disclosed invention to support real-time, bit-exact testing of existing and future media encoding and decoding devices. An embodiment of the present invention may permit the initialization of encoding and decoding algorithms to a known state, enabling bit-exact testing of a large group of devices using these algorithms, including those whose specifications do not support such functionality. This capability may permit the full-speed, bit-exact, testing, of both locally and remotely situated media encoders and decoders.

Abstract: A wireless communication system and method is provided for the transfer and processing of data in accordance with specialized data transfer protocols while utilizing conventional base station equipment. For example, the wireless communication system may include a subscriber station that provides for the modification of data packets in accordance with a proprietary protocol and the addressing of the modified data packets to a server. The server is adapted to reconstruct the data packets for transmission to other local subscriber stations or to a packet-switched network. In additional embodiments, the base station itself rather than a server operates to reconstruct the data packets.

Abstract: Various exemplary embodiments relate to a method and related network node including one or more of the following: receiving a packet belonging to a flow, the packet including a marking used to identify a quality of service (QoS) required for the packet; performing buffer management to determine whether a current occupancy level of a buffer in the network node is greater than a threshold level; when the current occupancy level of the buffer does not exceed the threshold level, performing header compression on the packet in the network node; after performing header compression, performing traffic scheduling to queue the packet in a queue selected from a plurality of queues based on the marking in the packet and to output the packet from the selected queue; and forwarding the packet towards a destination, whereby buffer management, header compression, and traffic scheduling are all performed in a single network node.

Abstract: A method for reducing overhead includes identifying a plurality of packets that are all to comprise at least one common piece of security information. The method also includes concatenating the plurality of packets into a single jumbo packet. The method further includes applying a single set of security information to the jumbo packet. The single set of security information is based on the at least one common piece of security information.

Abstract: Load balancing for layer-2 link aggregation involves initial assignment of link aggregation keys (LAGKs) and reassignment of LAGKs when a load imbalance condition that merits action is discovered. Load conditions change dynamically and for this reason load balancing tends to also be dynamic. Load balancing is preferably performed when it is necessary. Thus an imbalance condition that triggers load balancing is preferably limited to conditions such as when there is frame drop, loss of synchronization or physical link capacity exceeded.

Abstract: Systems and methods for optimizing usage of an available bandwidth for VoIP communications include a communications system, such as the Internet, for carrying the VoIP communication signals. A switch and a bandwidth limiter connected to the switch restrict bandwidth usage by applications other than those required for the VoIP communications. In the system, a modem or other narrowband network interface, a router, a network adapter, and a VoIP element are housed as a unit. The switch turns “on” and “off” the bandwidth limiter, and the bandwidth limiter when “on” restricts bandwidth usage of the adapter. The communications system is a digital data network, and the modem accesses the digital data network via connection of the modem to the network. Features for emergency bypass and external power supplies are included.

Abstract: Multi-channel network communication is improved by reducing the amount of data that is transmitted over connections that can stem from a similar source. Content of data packets transmitted from the source are reduced and the result is compared to previously transmitted data packets. If identical packets are found, then only an identification of the packet is transmitted. At the receiving side, the identification is used to identify a previously received data packet and use that as though it was the recently received packet.

Abstract: Communication system bandwidth reservation management techniques are disclosed. If actual usage of a reserved amount of bandwidth in a communication system reflects a reduced usage state, a determination is made as to whether the reserved amount of bandwidth is to be adjusted. A portion of the bandwidth that has been reserved for a Video-on-Demand session, for example, may be released when playback of a video is paused. A time-based series of reduced usage states may be defined such that reserved bandwidth is gradually released if the reserved bandwidth is not actually used for a period of time. Embodiments of the invention may be implemented in various forms of apparatus, methods, data structures, and Graphical User Interfaces (GUIs).

Abstract: The decode rate of an MPEG decoder of streaming video is set to a relatively slow value at the start of a stream to permit playing, albeit at relatively low speeds, of the video until an appropriate number of packets are in a receive buffer, at which time the decode rate is speeded up to normal.

Abstract: Method of using existing SONET transport overhead bytes (202) to provide additional bandwidth for increased management traffic, without the need to make use of SONET payload capacity (204). Overhead bytes that are undefined by the SONET Telecommunication Standard for certain STS-1 frames (200) of an STS-n frame (500) are used to form data channels. Using the undefined bytes, data can be communicated between a plurality of nodes (402, 404, 406) in the network.

Abstract: A multi input multi output (MIMO) receiver is disclosed for transmitting and receiving packets having a preamble format of a packet of information and having a short training sequence (STS), a long training sequence (LTS) and signal (SIG) for training receivers, in accordance with an embodiment of the present invention. The packets having a preamble format for allowing data to be piggy-backed, e.g. transmitted and received using the physical layer rather than the transport layer of networking layers.

Abstract: A transmitter for transmitting data packets including a Media Access Control (MAC) address extractor configured to extract one or more MAC addresses from packet headers included in data packets, a MAC compression unit configured to provide compressed MAC data including one or more pointers associated with each of the one or more extracted MAC addresses respectively, a packet modifier configured to modify the data packets by adding the compressed MAC data to the data packets, and a transmission unit configured to transmit the modified data packets. A receiver for receiving data packets including compressed MAC data, the compressed MAC data including pointers associated with MAC addresses, including a receiving unit configured to receive data packets, a compressed MAC data extractor configured to find and extract compressed MAC data from received data packets, and a packet modifier configured to modify the received data packets by removing the compressed MAC data from the received data packet.

Abstract: Firmware of an InfiniBand (IB) host computer device provides a representation of an IB Host Channel Adapter (HCA) within the hierarchical data structure during system initialization. An ib-boot support package encapsulates arguments for booting over an IB network using an ibport device. The ib-boot support package supports use of one or more command keywords, each identifying a specific type of support package utilized to retrieve the boot image. When the srp keyword is provided, an SRP protocol is used to access the storage boot device and retrieve the boot file. Access to the boot server is thus provided via one of the support packages, and the boot image is returned to the host device via the IB network for completion of boot operations.

Abstract: According to some embodiments of the invention, a method of minimizing buffer requirements, in a packet based multimedia system having a multimedia source device coupled to a multimedia display device by way of a bi-directional auxiliary channel arranged to transfer information between the display device and the source device and vice versa and a unidirectional main link arranged to carry multimedia data packets from the multimedia source device to the multimedia display device is disclosed. Interspersing special characters that allow the display device to distinguish each bit of pixel data included in the data packets thereby requiring only a small FIFO type buffer unit.

Abstract: A method and a system for setting up header compression communication and a header compression policy function entity are disclosed herein. The method includes: a header compression enforcement function entity receives a header compression indication from a header compression policy function entity; and the header compression enforcement function entity negotiates header compression channel parameters with the other corresponding header compression enforcement function entity to set up header compression channel. A communication system and a header compression policy function entity are disclosed. The embodiments of the present disclosure overcome the failure of implementing the header compression communication in the prior art.

Abstract: A transmitting apparatus that transmits data to a plurality of receiving apparatuses. The transmitting apparatus includes a transmission part that transmits information for extracting the data whose header is compressed, and a control part that controls the transmission part to transmit the information in a specified cycle to the one or more first receiving apparatus and to transmit the information to a second receiving apparatus at a timing independent of the specified cycle when that second receiving apparatus did not receive the information during the specified cycle.

Abstract: A method and system for efficient utilization of transmission resources in a wireless network includes requesting retransmission of an unsuccessfully received radio frame up to an allowed number of times. In response to at least unsuccessfully receiving the frame from the allowed number of retransmissions, a signal is generated for transmission to a device transmitting the frame. The signal is operable to prevent the device from transmitting a set of remaining frames for a packet to which the frame belongs.

Abstract: A driving circuit of a display device includes a timing controller for combining p first digital data signals (p being a positive integer greater than 1) corresponding to colors for displaying images to generate q second digital data signals and for supplying the q second digital data signals to first to qth data transmission lines (q being a positive integer smaller than p), and a plurality of data driver integrated circuits for processing the q second digital data signals from the timing controller to restore the p first digital data signals, converting the p restored digital data signals into analog data signals, and supplying the analog data signals to a display panel.

Abstract: A system, method, and computer program for compressing packet data is provided. In exemplary embodiments, one or more blocks may be identified that include block data similar to packet data of one or more packets. The one or more blocks may comprise archives of previously transferred packets. The packet data may be compressed based, at least partially, on the block data. Accordingly, the compressed packet data may be transferred over a communication network.

Abstract: The invention is concerned with the transmission of streaming scalable data, particularly video data, through lossy communication channels, for applications in which limited retransmission is possible, and the associated reception and decoding of transmitted data. The PET (Priority Encoding Transmission) framework is used and the invention exploits both unequal error protection and limited retransmission. Each element in the scalable representation of each frame can be transmitted in one or both of two transmission slots, depending on the availability of the data received from the first of the two transmission slots. An optimization algorithm determines the level of protection which should be assigned to each element in each slot, subject to transmission bandwidth constraints.

Abstract: A method and system for managing channels in a voice response system is provided. The method comprises periodically monitoring utilization of a system resource and determining a number, N, of voice channels required to be quiesced based on the utilization level of the system resource. This number is compared with the number of channels currently quiescing, Q, and the number of quiescing channels is adjusted accordingly. A quiescing channel is disabled when it becomes inactive.

Abstract: A method for shifting the position of a symbol to reduce transmission overhead is described. A frame with a plurality of symbols is provided. A determination is made whether the frame includes an indication of an event. At least one symbol of the plurality of symbols is shifted based on the determination. A counter is set to an initial value. The frame with the at least one shifted symbol is transmitted.

Abstract: Methods, apparatus and computer readable code for compression, encoding and decoding of units of data such as packets are disclosed. In some embodiments, methods, apparatus and computer readable code for transmitting and/or receiving the data packets (for example, transmitting from a sending location to a receiving location where packets are received) are provided. For at least some packets, a dictionary is determined from a respective group of packets, including a first set of historical packets and excluding a second set of historical packet. Each target packet is encoded and/or compressed and/or decoded using the respective dictionary. Optionally, the respective group of packet includes the actual target packet to be encoded and/or compressed and/or decoded.

Abstract: Systems and methodologies are described that facilitate compressing packet headers for cell relay communications. Since cell relays can support a number of evolved packet system (EPS) bearers over a given dedicated radio bearer (DRB), robust header compression (RoHC) can be multiplexed for communications to/from a given cell relay. Thus, an upstream node compressing one or more packet headers can indicate a RoHC context, which can be represented by a RoHC context identifier in a RoHC header. A receiving entity can decompress the headers based on determining the RoHC context. Alternatively, the RoHC context can be associated with an identifier of a related UE bearer such as a tunnel endpoint identifier (TEID), a relay identifier, and/or the like, that is received in a tunneling protocol header to facilitate packet routing.

Abstract: Header compression system for compressing the header of the data packets of a flow transmitted from an ingress node to an egress node through a data transmission network comprising template creating means, in both ingress node and egress node, adapted for creating the same compression template from a predetermined number of uncompressed data packets at the beginning of the flow respectively transmitted by the ingress node and received by the egress node, and header compression means, in the ingress node, adapted for compressing the header of each packet following the predetermined number of uncompressed data packets before transmitting it through the data transmission network, the compression being achieved by using the compression template.

Abstract: An apparatus and method for performing procedures (protocols) of a PDCP (Packet Data Convergence Protocol) layer and an RLC (Radio layer in an E-UMTS (Evolved Universal Mobile Telecommunications System) which has evolved from UMTS, among radio protocols of a mobile communication system. The PDCP layer performs ciphering on data (i.e., PDCP SDU) received from an upper layer, generates an indicator discriminating ciphered data and non-ciphered data (i.e., an ROHC feedback packet directly generated by the PDCP layer), and transmits the same to a lower layer (i.e., MAC layer). A PDCP SN (Sequence Number) is defined as an algorithm for ciphering the data in the PDCP layer to perform ciphering in the PDCP layer.