Abstract: The invention relates to apparatuses, a method, computer program and computer-readable medium for resource allocation (selection of channel and maximum allowed transmission power) in a coexisting secondary communications system, overlapping with a primary system. Allocation is performed based on an interference table indicating measured interference per cell of the primary system from other cells of the primary and secondary system.

Abstract: A history management unit within a discard determination unit manages transmission and reception packets related to a resource to be protected for each of users, and records communication history information for users high in use frequency through stateful measurement. A priority determination unit determines the priority of a communication on a per received packet basis on the basis of communication history information. A load determination unit determines a load level of the resource to be protected, and combines the load level with the priority of the communication determined on the per received packet basis. A discard rate determination unit and a packet discard unit implement forwarding processing, determine the priority of the communication on the per user basis, and discard communications low in the priority at a high ratio.

Abstract: A method is intended for computing online a feasible rates region in a network using a random access MAC protocol and comprising nodes having links there between. This method comprises the steps of i) determining, for each link, a primary extreme point corresponding to a maximum output rate when this link transmits alone at a maximum input rate, and ii) determining secondary extreme points by combining these primary extreme points with a chosen interference model, these primary and secondary extreme points defining a boundary of a feasible rates region.

Abstract: Systems and methods for controlling mobile devices are provided. A Bluetooth signal is received at a mobile device. The Bluetooth signal may include a broadcaster request which is configured to convey a set of desired actions to the wireless handheld device. Once the signal is received, the mobile device is able to determine if each action in the set of desired actions conveyed by the broadcaster request would be allowable on the mobile device. Then, the device performs each of the actions which have been determined to be allowable on the receiving device.

Abstract: A multi-mainframe operating system serialization method can include receiving, in a first computing system, a request to access a data set on behalf of a first peer application, sending, in the first computing system, a notification to a second peer application to obtain a normal enqueue, in response to the second peer application obtaining the normal enqueue, obtaining, in the first computing system, a first rider enqueue for the data set and sending, in the first computing system, a communication to peer instances to obtain additional rider enqueues for the data set, the additional rider enqueues corresponding to the first rider enqueue.

Abstract: Network condition prediction and multimedia streaming consumption prediction are provided. The prediction may be based on a device's prior location, behavior, and statistics thereof. By gathering location data from users anonymously and securely, a virtual location network with millions of nodes are provided. Each virtual location, at a given time, is stored with associated network metrics gathered from various devices in a database. The database may comprise a probabilistic model and a behavioral model tracking device metrics.

Abstract: A network device includes an antenna connected to an RF chip and a processor coupled to an Ethernet port, the RF chip, a program memory, a packet buffer memory, a pointer buffer memory, and a program memory. The program memory contains instruction that, when executed by the processor, cause a plurality of packets received by the antenna and the RF chip in a first order to be stored in the packet buffer memory in such order, cause a pointer associated with each one of the plurality of packets to be stored in the pointer buffer memory, cause the pointers stored in the pointer buffer memory to be placed in a second order in accordance with a timestamp that is included with each packet, cause the packets stored in the packet buffer memory to be passed along to the Ethernet port in accordance with the sorted pointer to each packet.

Abstract: A distributed fabric system includes multiple switches coupled to a cell-based switching fabric. A logical system port that is globally unique within the distributed fabric system is mapped to each physical network port in the distributed fabric system. To partition the system into multiple non-overlapping switching domains, each system port is associated with a look-up table having at least one table entry for each other system port to be allocated to the same switching domain as that system port. Each switch that receives a packet over a given system port is limited to switching the packet to only those other system ports for which the look-up table associated with the given system port has a table entry.

Abstract: A system for scheduling data for transmission in a communication network includes a credit distributor and a transmit selector. The communication network includes a plurality of children. The transmit selector is communicatively coupled to the credit distributor. The credit distributor operates to grant credits to at least one of eligible children and children having a negative credit count. Each credit is redeemable for data transmission. The credit distributor further operates to affect fairness between children with ratios of granted credits, maintain a credit balance representing a total amount of undistributed credits available, and deduct the granted credits from the credit balance. The transmit selector operates to select at least one eligible and enabled child for dequeuing, bias selection of the eligible and enabled child to an eligible and enabled child with positive credits, and add credits to the credit balance corresponding to an amount of data selected for dequeuing.

Abstract: A buffer level for jitter data buffer is determined. A frame payload size difference is determined for a plurality of video frames encoded into data packets sequentially received from a network. The difference is a difference in a payload size of a current frame and a previous frame. A frame network transit delay is determined as a difference in a transport time between the current frame and the previous frame and an expected transport time between the current frame and the previous frame. A slope and a variance of a linear relationship between the frame payload size difference and the frame network transit delay are determined for the plurality of video frames. Finally, a buffer level of a jitter data buffer is determined using a maximum frame payload size, an average frame payload size, the slope and the variance.

Abstract: The disclosure disclosed a system and method for processing a Multimedia Messaging Service (MMS). The system comprises: a first and second storage units for storing MMS data, a first control unit for controlling the storage of received MMS data outside the system into the first storage unit and data acquisition from the first storage unit, and a second control unit for controlling the writing of the MMS data stored in the first storage unit into the second storage unit according to performance of the second storage unit. The disclosure improves the processing performance of a Multimedia Messaging Service Center (MMSC) system, lowers the construction cost of an MMS server of the MMSC system, and guarantees the stable running of the MMSC system.

Abstract: There is provided a system, method and computer program product for managing network communications to a Session Initiation Protocol (SIP) server. In the system, a packet limiter receives packets relating to SIP messages from a network and selectively forwards said packets for initial SIP processing. A work scheduler then accesses the result of the initial SIP processing and determines whether to proceed with further SIP processing based on a level of system activity. If a level of system activity is such that the system should proceed with further SIP processing, then further SIP processing may be scheduled. Initial SIP processing may involve one or more of parsing, request handling and response handling. Further SIP processing may involve one or more of initiating a new dialog, processing SIP messages relating to an existing dialog and processing messages that do not require a dialog.

Abstract: Stacked (i.e., hierarchically arranged) rate wheels schedule traffic flows in a network. A first rate wheel operates to efficiently schedule traffic flows in which traffic shaping parameters may be applied to individual traffic flows. A second rate wheel schedules group of the traffic flows in which traffic shaping parameters may be applied at the group level. In the context of an ATM network, the first rate wheel may operate at the virtual circuit level and the second rate wheel may operate at the virtual path level.

Abstract: A system for optimizing response time to events or representations thereof waiting in a queue has a first server having access to the queue; a software application running on the first server; and a second server accessible from the first server, the second server containing rules governing the optimization. In a preferred embodiment, the software application at least periodically accesses the queue and parses certain ones of events or tokens in the queue and compares the parsed results against rules accessed from the second server in order to determine a measure of disposal time for each parsed event wherein if the determined measure is sufficiently low for one or more of the parsed events, those one or more events are modified to a reflect a higher priority state than originally assigned enabling faster treatment of those events resulting in relief from those events to the queue system load.

Abstract: A first cache stores preferential packets to be preferentially processed. A second cache stores packets other than the packets stored in the first cache. A processing circuit adjusts the number of preferential packets stored in the first cache in a manner such that the preferential packets are processed at the amount of processing that is equal to or less than a set value set as the amount of processing applicable to the preferential packets within a predetermined period, processes the packets stored in the first cache, and reads from the second cache as many packets as are processable at a surplus value, and processes the read packets, the surplus value being obtained by subtracting the amount of processing to be applied to the preferential packets stored in the first cache from the amount of processing that the processing circuit is capable of performing within the predetermined period.

Abstract: Aspects of the subject disclosure relate to ways to capture packet metadata following an incast event. In some implementations, a method of the subject technology can include steps for receiving a plurality of data packets at a network device, storing each of the plurality of packets in a buffer, and detecting a packet drop event for one or more incoming packets, wherein the one or more incoming packets are not stored in the queue. In some aspects, the method can further include steps for indicating a marked packet from among the received data packets, dequeuing each of the plurality of packets in the buffer, capturing metadata for each dequeued packet until the marked packet is dequeued.

Abstract: Multiple listlets function as a single master linked list to manage data packets across one or more banks of memory in a first-in first-out (FIFO) order, while allowing multiple push and/or pop functions to be performed per cycle. Each listlet can be a linked list that tracks pointers and is stored in a different memory bank. The nodes can include a pointer to a data packet, a pointer to the next node in the listlet and a next listlet identifier that identifies the listlet that contains the next node in the master linked list. The head and tail of each listlet, as well as an identifier each to track the head and tail of the master linked list, can be maintained in cache. The individual listlets are updated accordingly to maintain order of the master linked list as pointers are pushed and popped from the master linked list.

Abstract: A work conserving scheduler can be implemented based on a ranking system to provide the scalability of time stamps while avoiding the fast search associated with a traditional time stamp implementation. Each queue can be assigned a time stamp that is initially set to zero. The time stamp for a queue can be incremented each time a data packet from the queue is processed. To provide varying weights to the different queues, the time stamp for the queues can be incremented at varying rates. The data packets can be processed from the queues based on the tier rank order of the queues as determined from the time stamp associated with each queue. To increase the speed at which the ranking is determined, the ranking can be calculate from a subset of the bits defining the time stamp rather than the entire bit set.

Abstract: A method and apparatus are provided for scheduling a heterogeneous communication flow. A heterogeneous flow is a flow comprising packets with varying classes or levels of service, which may correspond to different priorities, qualities of service or other service characteristics. When a packet is ready for scheduling, it is queued in order in a flow queue that corresponds to the communication flow. The flow queue then migrates among class queues that correspond to the class or level of service of the packet at the head of the flow queue. Thus, after the head packet is scheduled, the flow queue may be dequeued from its current class queue and requeued at the tail of another class queue. If the subsequent packet has the same classification, it may be requeued at the tail of the class queue or may remain in place for another servicing round.

Abstract: This disclosure describes enhancements to Ethernet for use in higher performance applications like Storage, HPC, and Ethernet based fabric interconnects. This disclosure provides various mechanisms for lossless fabric enhancements with error-detection and retransmissions to improve link reliability, frame pre-emption to allow higher priority traffic over lower priority traffic, virtual channel support for deadlock avoidance by enhancing Class of service functionality defined in IEEE 802.1Q, a new header format for efficient forwarding/routing in the fabric interconnect and header CRC for reliable cut-through forwarding in the fabric interconnect. The enhancements described herein, when added to standard and/or proprietary Ethernet protocols, broadens the applicability of Ethernet to newer usage models and fabric interconnects that are currently served by alternate fabric technologies like Infiniband, Fibre Channel and/or other proprietary technologies, etc.

Abstract: A data processing apparatus includes multiple processing means that are connected in a ring shape via corresponding communication means respectively. Each communication means includes a reception means for receiving data from a previous communication means, and a transmission means for transmitting data to a next communication means. Connection information is assigned to each of the reception means and the transmission means. The communication means, when receiving a packet that has same connection information as one assigned to its reception means, causes the corresponding processing means to perform data processing on the packet, sets the connection information assigned to its transmission means to the packet, and transmits the packet to the next communication means, and when receiving a packet that has connection information that is not same as one assigned to its reception means, transmits the packet to the next communication means without changing the connection information of the packet.

Abstract: The present invention includes a network telephone having a microphone coupled to provide voice data to a network, a speaker coupled to facilitate listening to voice data from the network, a dialing device coupled to facilitate routing of voice data upon the network, a first port configured to facilitate communication with a first network device, a second port configured to facilitate communication with a second network device and a prioritization circuit coupled to apply prioritization to voice data provided by the microphone.

Abstract: A notification from a source host is received at a network interface device that indicates that a data packet is ready for transmission to a destination host. The data packet may be transmitted to the destination host via the network interface device, and a first completion queue event is generated. The first completion queue event may be used as a trigger to re-transmit the data packet to a port mirroring destination via the network interface device. In another example, a network interface device receives a data packet transmitted from a source host to a destination host. A first completion queue event is generated based on the receipt of the packet, and is used as a trigger to re-transmit the data packet to a port mirroring destination via the network interface device.

Abstract: A system to route media information content may include a router that analyzes predetermined content of a plurality of data packets of the media information content and prioritizes forwarding the plurality of data packets from the router based on applying at least one rule to the predetermined content.

Abstract: A data handling system network includes a data handling system that is communicatively coupled to a switch by a network. The data handling system includes one or more logical partitions. Each logical partition includes a plurality of virtual switches and a plurality of virtual network interface cards. Each virtual network interface card is associated with a particular virtual switch and includes a plurality of QoS queues. The switch includes one or more switch partitions. Each switch partition includes a plurality of QoS queues that are associated with the QoS queues of the virtual network interface card. A packet is received with the virtual switch and the virtual switch sets and associates a QoS priority flag with the received packet. The virtual switch forwards the packet to a QoS queue comprised within the virtual network interface card based upon the QoS priority flag.

Abstract: Methods and systems for a more efficient transmission of network traffic are provided. According to one embodiment, payload data originated by a user process running on a host processor of the computer system is fetched by an interface of the computer system by performing direct virtual memory addressing of a user memory space of a system memory of the computer system on behalf of a network processor of the computer system. The direct virtual memory addressing maps a physical address of the payload data to a virtual address. The payload data is segmented by the network processor across one or more packets.

Abstract: A plurality of frames of data are transmitted over a serial interface in a manner that limits interference on the interface. This involves generating a pseudo-random number and asserting a read control signal at a moment in time, wherein a timing of the moment in time is influenced by the pseudo-random number. In response to the asserted read control signal, a frame of data is read from a data buffer. The read frame of data is then transmitted over the serial interface. A number of alternative embodiments are possible, such as embodiments in which buffer read operations are triggered based on the buffer fill level, and other embodiments in which buffer read operations are triggered by a timer. By using the pseudo-random number to influence the buffer read operations, timing coherency between the reading of frames is made low, thereby limiting interference.

Abstract: Methods and apparatuses for routing voice Internet Protocol (IP) packet to a selected processor are described herein. The methods may include initially receiving at a digital baseband receiver of a device a plurality of IP packets. After receiving the IP packets, the digital baseband receiver may determine whether the IP packets are voice or non-voice IP packets. If the IP packets are determined to be non-voice IP packets, the digital baseband receiver may route the non-voice IP packets to a first processor for processing. On the other hand, if the IP packets are determined to be voice IP packets, the digital baseband receiver may route the voice IP packets to a second processor for processing.

Abstract: Aspects of the disclosure provide a device transmitting a sequence of packets. The device may include a first queue configured to queue the sequence of packets for transmission by an egress port to a receiving device, and a queue control module configured to transmit the sequence of packets in time slots of the egress port. The sequence of packets can be uniformly distributed across the time slots to satisfy an agreed data rate between the device and the receiving device.

Abstract: A system to improve a Fiber Channel over Convergence Enhanced Ethernet (FCoCEE) network may include a sender in an FCoCEE network in which data packets having different data link layer structures are transmitted by the sender on a single data link. The system may also include a receiver to receive the data packets at the data link layer and to transmit an ACK and/or NAK in response to a sequence number in the data packets. The system may further include a replay buffer to retransmit the data packets where the replay buffer is sized by the length of the data link, data rate of the data link, the ACK and/or NAK processing time at either the sender and/or the receiver, and/or a threshold time for transmission and/or reception of the data packets.

Abstract: A system and method for forwarding network traffic includes receiving a first flow of network traffic at an ingress port on a switch, collecting flow control metrics for a plurality of egress ports assigned to a link aggregation group of the switch, selecting a first egress port from the plurality of egress ports using a hashing strategy based on at least information associated with the flow control metrics, assigning the first flow to the first egress port, directing the first flow to the first egress port, and transmitting network traffic associated with the first flow using the first egress port.

Abstract: A method and apparatus controlling, either individually or in the aggregate, traffic flows associated with a plurality of queues by transmitting traffic source FlowON messages at first times selected to avoid queue underflow conditions, and traffic source FlowOFF message at second times selected to avoid queue overflow conditions, where the first and second times are determined as a function of delay time D of a link supporting the traffic source.

Abstract: A system to improve a Fiber Channel over Convergence Enhanced Ethernet (FCoCEE) network may include a sender in an FCoCEE network in which data packets having different data link layer structures are transmitted by the sender on a single data link. The system may also include a receiver to receive the data packets at the data link layer and to transmit an ACK and/or NAK in response to a sequence number in the data packets. The system may further include a replay buffer to retransmit the data packets where the replay buffer is sized by the length of the data link, data rate of the data link, the ACK and/or NAK processing time at either the sender and/or the receiver, and/or a threshold time for transmission and/or reception of the data packets.

Abstract: In one embodiment, a system includes a network interface card (NIC) having a plurality of network ports including multiple Peripheral Component Interconnect express (PCIe) ports, a multi-lane PCIe interface adapted for communicating with a server, an Ethernet controller adapted for communicating with a network, and logic adapted for providing overlay network gateway functionality. In another embodiment, a NIC includes a plurality of network ports including multiple PCIe ports, a multi-lane PCIe interface adapted for communicating with a server, an Ethernet controller adapted for communicating with a network, and logic adapted for providing overlay network gateway functionality to traffic that passes through the NIC. In yet another embodiment, a method for providing overlay network gateway functionality in a network includes providing overlay network gateway functionality for network traffic received by a NIC implemented in a server, wherein the NIC provides an interface between a server and a network.

Abstract: There is provided a relay device including: a buffer configured to store a received frame; a discarding unit configured to discard the received frame, when a utilization amount of the buffer exceeds a first value set corresponding to a communication type of the received frame; a first calculating unit configured to calculate the utilization amount of the buffer for each communication type at least two points in time, and calculate an amount of change in the utilization amount of the buffer for each communication type; and a setting unit configured to calculate the first value for each communication type, based on the amount of change in the utilization amount, and set the first value in the discarding unit.

Abstract: Disclosed are various embodiments of a network switch for storing a prefix address and a mask corresponding to the prefix address, the prefix address and the mask each representing a binary value, the mask representing a number of significant bits of an address beginning with a most significant bit. The network switch obtains a network frame via one of a plurality of network interfaces, the network frame comprising a network address in a header of the network frame, the network address being a binary value representing a physical address of a network interface device. The network switch determines a truth value associated with a comparison of a mask number of bits of the prefix and network addresses, the truth value indicating an equivalence of the comparison. In response to the truth value, the network switch may initiate at least one action associated with the network frame.

Abstract: Byte utilization is improved in Remote Direct Memory Access (RDMA) communications by detecting a plurality of concurrent messages on a plurality of application sockets which are destined for the same application, client or computer, intercepting those messages and consolidating their payloads into larger payloads, and then transmitting those consolidated messages to the destination, thereby increasing the payload-to-overhead byte utilization of the RDMA transmissions. At the receiving end, multiplexing information is used to unpack the consolidated messages, and to put the original payloads into a plurality of messages which are then fed into the receiving sockets to the destination application, client or computer, thereby making the consolidation process transparent between the initiator and the target.

Abstract: Provided are a method and apparatus for buffering image data for motion compensation. One of two buffers of a double register array buffer, i.e., a first buffer, is selected as a buffer in which data corresponding to a row of a block of an image is to be written and the other of the double register array buffer is selected as a buffer from which data corresponding to another row of the block is to be read, thereby speeding up motion compensation processing when compared with the use of a single register array buffer.

Abstract: A computing network, including: a plurality of peer computing devices including code, which when executed by a peer computing device causes the executing peer computing device to cooperate with at least one other of the peer computing devices; at least one server including code, which when executed by the at least one server locates at least one of the peer computing devices; and at least one mediator including code, which when executed by the at least on mediator collects charging information from at least some of the peer computing devices; wherein, the peer computing devices, at least one sever and at least one mediator are communicatively coupled via an at least carrier-grade telecommunications network being suitable for enhancing cooperation among the cooperating ones of the peer computing devices relative to best-efforts communications among the cooperating ones of the peer computing devices.

Abstract: A fluctuation absorbing device includes a buffer 22 for temporarily storing packets, a pulse generating section 24 for generating a pulse at a same interval as a transmitting interval of the packets, a fluctuation time derivation section (25) for deriving a fluctuation time of delay of the packets based on the pulse, a maximum fluctuation time estimate section (25) for estimating a maximum fluctuation time based on a plurality of fluctuation time derived in the fluctuation time derivation section (25), and a setting section (25) for setting data storage capacity of the buffer 22 based on the maximum fluctuation time.

Abstract: A method, apparatus, and machine readable storage medium is disclosed for establishing a test protocol processor which identifies and removes predetermined messages from a network element port buffer. Subsequent to removal the test protocol processor may perform one or more of several actions according to the results of statistical calculations. These actions include allowing the message to drop, replacing the message after a delay, replacing the message after altering the payload of the message, and replacing the message after altering the message type. The disclosed autonomous self disrupting network element is particularly useful for providing a means to perform in situ field testing of network performance indicators under desired statistical conditions.

Abstract: Systems and methods provide a parameterized scheduling system that incorporates end-user application awareness and can be used with scheduling groups that contain data streams from heterogeneous applications. Individual data queues within a scheduling group can be created based on application class, specific application, individual data streams or some combination thereof. Application information and Application Factors (AF) are used to modify scheduler parameters such as weights and credits to differentiate between data streams assigned to a scheduling group. Dynamic AF settings may adjust relative importance of user applications to maximize user Quality of Experience (QoE) in response to recurring network patterns, one-time events, application characteristics, protocol characteristics, device characteristics, service level agreements, or combinations thereof.

Abstract: One method includes: (a) providing a memory storage device having a plurality of storage locations for storing information received by a plurality of sub-ports of a base port of the network device, where the memory storage device is shared among the plurality of sub-ports such that each sub-port is given access to the memory storage device at a certain phase of a system clock cycle; (b) storing a packet or a portion thereof at one of the storage locations when a sub-port that receives the packet has access to one or more of the storage locations; and (c) scrambling addresses for the memory storage locations such that a different one of the storage location is available to the sub-port of step (b) for a next write operation in a next phase when the sub-port of step (b) is given access to the memory storage device.

Abstract: In a network device packets are marked with sequence identifiers at ingress of the device, switched through a plurality of switching planes and re-sequenced on a per flow basis at egress of the device. The re-sequencing system includes a controller that allocates to each received data packet a temporary storage location in a packet buffer. A plurality of output registers are provided, with each one associated with a flow. A pointer uses predefined parameters to point to an output register that has been previously assigned to receive data packets from the corresponding flow. Parameters in the pointed output register are correlated with parameters in a received packet to determine if the received packet is next in sequence to packets processed through a particular queue.

Abstract: Systems and methods can operate to transmit embedded control data (ECD) information within the payload of packet data. Payload packet data can contain a plurality of data elements of equal value. A transmitter can replace the repeating data elements with ECD information. A receiver can extract the ECD information and replace with the repeating data value to reconstruct the original. ECD information can be communicated between communication systems and between interfaces within a communication system.

Abstract: Systems and methods are provided for counting a number of received packets and a number of bytes contained in the received packets. A system includes a first memory disposed in an integrated circuit, the first memory being configured as a first combination counter having a first set of bits for storing a subtotal of received packets, and a second set of bits for storing a subtotal of bytes contained in the received packets. A second memory is external to the integrated circuit. The second memory is configured to store a total number of received packets and a total number of bytes contained in the received packets. Update circuitry is configured to update the total number of packets stored in the second whenever either of the first set of bits or the second set of bits overflows in the first memory.

Abstract: Aspects of port empty transition scheduling are described herein. In one embodiment, when one or more cells are added to a queue in a network communications device, an enqueue indicator is generated. The enqueue indicator identifies a number of cells added to the queue. With reference to the enqueue indicator, a queue scheduler maintains a count of cells enqueued for communication and issues a port pick credit for a port of the network communications device. A port scheduler schedules a pick for communicating over the port with reference to the port pick credit and forwards the pick to the queue scheduler. In turn, the queue scheduler forwards a queue pick to the queue, and at least one of the cells is forwarded to dequeue logic. According to aspects of the embodiments described herein, empty port scheduling inefficiencies may be avoided and network throughput increased.

Abstract: A plurality of game apparatuses function as a master, a client, and an audience. The master and the client register each other by performing therebetween an authentication process. The authentication process is not performed between the master and the audience. The audience receives a beacon from the master and registers the master in an own apparatus while the audience is not registered in the master. The master and the client execute a predetermined program, exchanging data by communicating with each other. The audience receives the data exchanged between the master and the client, and executes the predetermined program using the received data, thereby watches a game which is progressed between the master and the client, as a spectator.

Abstract: A method and apparatus for wireless communication may provide a multi-link PDCP sublayer in a radio network controller capable of allocating PDCP PDUs among a plurality of RLC entities for use in a multi-point HSDPA network. Some aspects of the disclosure address issues relating to out-of-order delivery of the PDCP PDUs to a UE, such as unnecessary retransmissions. That is, the disclosed multi-link PDCP may be capable of distinguishing between sequence number gaps that are caused by physical layer transmission failures and those caused merely by skew.

Abstract: A method and apparatus are described including a data packet having a data packet header, storing the received data packet as shared payload, determining if the received data packet is a first data packet, initializing a sequence starting number responsive to the determination, generating a new data packet header, calculating a sequence number for the received data packet using the sequence starting number, inserting the new sequence number into the new data packet header, unicasting the new data packet header and the shared payload to a plurality of client devices.