| Patent application number | Description | Published |
|---|
| 20100188974 | IMPLEMENTATION OF INTERNET PROTOCOL HEADER COMPRESSION WITH TRAFFIC MANAGEMENT QUALITY OF SERVICE - 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. | 07-29-2010 |
| 20100188977 | INTERNET PROTOCOL HEADER COMPRESSION REORDERING - Various exemplary embodiments relate to a method and related network node including one or more of the following: receiving, at the network node, a packet belonging to a flow, the packet including a marking used to identify a quality of service (QoS) required for the packet; assigning a compression context identifier to the packet; queuing the packet in a queue selected from a plurality of queues based on the marking in the packet; identifying a period of congestion and, in response, blocking the packet; when the period of congestion has ended and the packet is dequeued, determining whether the QoS associated with the packet is the same as a QoS stored in a context identifier storage; and when the QoS associated with the packet is not the same as the QoS stored in the context identifier storage, determining that the flow has expired and discarding the packet. | 07-29-2010 |
| 20110032952 | TWO STAGE INTERNET PROTOCOL HEADER COMPRESSION - Various exemplary embodiments relate to a method and related network system including one or more of the following: receiving a packet having a header and belonging to a flow; identifying a context identifier (CID) associated with the flow; morphing the header into a pseudo-compressed header, the pseudo-compressed header including the CID associated with the flow; determining whether the packet should be transmitted with a compressed header, a full header, or an uncompressed header; morphing the pseudo-compressed header into a compressed header to form an outgoing packet when the packet should be transmitted with a compressed header; morphing the pseudo-compressed header into a full header to form an outgoing packet when the packet should be transmitted with a full header; restoring the uncompressed header to form an outgoing packet when the packet should be transmitted with an uncompressed header; and transmitting the outgoing packet over the communications network. | 02-10-2011 |
| Patent application number | Description | Published |
|---|
| 20100226385 | LCR SWITCH WITH HEADER COMPRESSION - Various exemplary embodiments relate to a method and related network node including one or more of the following: maintaining a line card activity number at each line card in the node; receiving a first packet belonging to a flow; storing, at each line card, a flow record in a line card context identifier storage, wherein the flow record contains a flow activity number being initially set equal to a current value of the line card activity number; detecting, by the second line card, a change in designation to active and changing the value of the line card activity number maintained by the second line card; receiving a second packet belonging to the flow; and transmitting, to the decompressor node, an update packet including the flow context identifier and the flow identifying information, upon determining that the flow activity number is not equal to the updated line card activity number. | 09-09-2010 |
| 20110149976 | DISTRIBUTING CELLS ON AN IMA LOGICAL LINK HAVING INACTIVE IMA SUB-LINKS - The invention is directed to a method and system for efficiently distributing Inverse Multiplexing over ATM (IMA) filler cells on IMA logical links having inactive or unusable IMA sub-links. Inactive IMA sub-links are identified during round-robin distribution of ATM data cells to active IMA sub-links. Predefined IMA filler cells are transmitted simultaneously on the identified inactive IMA sub-links when an ATM data cell is transmitted on an active IMA sub-link, thereby reducing the delay between transmitting ATM data cells. | 06-23-2011 |
| 20120106567 | MLPPP OCCUPANCY BASED ROUND ROBIN - Embodiments of the invention are directed to providing a method for selecting a link for transmitting a data packet, from links of a Multi-Link Point-to-Point Protocol (MLPPP) bundle, by compiling a list of links having a minimum queue depth and selecting the link in a round robin manner from the list. Some embodiments of the invention further provide for a flag to indicate if the selected link has been assigned to a transmitter so that an appropriate link will be selected even if link queue depth status is not current. | 05-03-2012 |
