US20050149563A1 - Random early detect and differential packet aging flow control in switch queues - Google Patents
Random early detect and differential packet aging flow control in switch queues Download PDFInfo
- Publication number
- US20050149563A1 US20050149563A1 US10/752,622 US75262204A US2005149563A1 US 20050149563 A1 US20050149563 A1 US 20050149563A1 US 75262204 A US75262204 A US 75262204A US 2005149563 A1 US2005149563 A1 US 2005149563A1
- Authority
- US
- United States
- Prior art keywords
- packet
- queue
- value
- lifetime
- packets
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Abandoned
Links
- 230000032683 aging Effects 0.000 title claims description 14
- 238000000034 method Methods 0.000 claims description 13
- 239000000872 buffer Substances 0.000 description 4
- 241000238876 Acari Species 0.000 description 2
- 238000001514 detection method Methods 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/28—Flow control; Congestion control in relation to timing considerations
- H04L47/283—Flow control; Congestion control in relation to timing considerations in response to processing delays, e.g. caused by jitter or round trip time [RTT]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/32—Flow control; Congestion control by discarding or delaying data units, e.g. packets or frames
Definitions
- the present invention relates to flow control in devices utilizing queuing systems for packets.
- Devices using queuing systems for packets for example gateways, switches and routers, are often used in networks supporting IP or TCPIP, such as Ethernet.
- IP or TCPIP such as Ethernet.
- a problem is, however, that packets get stuck in that queues when there is congestion in the network, or when a link is down or not ready. Under this stuck condition two things happen.
- Packets are stored in buffers and referenced through link lists. Complex conditions arise when packets are destined for multiple ports, and the packets can exit from some of the ports but not from others. Furthermore, new packets enter from other ports. The result can be that the packets can get stuck in the buffers indefinitely.
- Buffer space can be taken up by packets that are of lower priority, and higher priority packets get dropped.
- One prior art solution is to wait until the congesting condition in the port is removed, and then the packets can exit from the port.
- the disadvantage of this solution is that during the time when the packets are locked in the switching device, they take up valuable space resources. As such, a condition may arise that low priority packets remain locked in the device while high priority packets are dropped when they enter the switching device from other ports.
- Another solution is to remove all the packets when they have exceeded a time limit in the switching device. This is done indiscriminately for all packets regardless of priority.
- the disadvantage of this solution is that it does not differentiate between low and high priority packets. It also does not differentiate between time critical packets (e.g. for real time applications such as voice-over-IP, video-over-IP or other types of time critical packets).
- the present invention helps solve the problems of stagnant packets within queues, dropped high-priority packets and network congestion, using a random early detect and differential packet aging flow control method.
- a differential random early detect mechanism is used to prevent congestion in the Internet traffic.
- An aging mechanism solves the problem of packets being locked in the queue of a switching device for a certain time because it cannot exit the queue.
- flow control is provided for a packet switch.
- An incoming packet is classified according to its priority based on predefined rules to produce a weight value based on the priority of the packet.
- a lifetime value associated with the packet is produced based on the weight value and the queue occupancy in a queue to which the packet is assigned.
- the packet is discarded if its associated lifetime value is less than or equal to a threshold value. Otherwise the packet and associated lifetime value are sent to the queue.
- the lifetime value is periodically changed and compared to a threshold value. The packet is removed from the queue when its lifetime value reaches the threshold value.
- FIG. 1 is a schematic diagram illustrating a switching device implementing the differential packet aging and random early detect method of he present invention.
- FIG. 2 diagrammatically illustrates the method performed by the RED engine of FIG. 1 .
- FIG. 3 is a flowchart illustrating the method used by the aging engine of FIG. 1 .
- FIG. 1 is a schematic diagram illustrating a switching device 101 implementing the differential packet aging and random early detect method of the present invention to control one or more queues 11 , 13 , 15 .
- a packet 103 enters a packet classification engine 105 of the switching device 101 .
- the classification engine 105 checks the priority of the packet based on a set of rules 107 that can be programmed by a user or which can be hard-coded.
- a “weight” value 109 is determined by a weight value determination section 110 and is assigned to the packet 103 . Packets that should be aged out faster from the queue will have a smaller weight, and thus have a higher probability for a shorter lifetime.
- the weight value is then fed into a “random early detect” (RED) engine 111 .
- the queue occupancy (number of packets) 113 in the queue to which the packet 103 is assigned (in this example the queue 11 ) is determined by a queue occupancy section 114 and is fed into the RED engine 111 .
- the RED engine 111 uses the weight value 109 and the queue occupancy 113 to determine a lifetime 115 of the packet 103 in the queue 11 .
- the lifetime 115 a random aging time based on the random early detect scheme?
- the RED engine 111 checks the lifetime 115 against a lifetime threshold 117 .
- FIG. 2 shows the method performed by the RED engine 111 in more detail.
- the weight value 109 and the queue occupancy 113 are processed using an RED algorithm 201 of the RED engine 111 .
- the RED algorithm 201 calculates a lifetime 115 .
- the RED engine 111 then compares the lifetime 115 to the lifetime threshold 117 . If the lifetime 115 is below the threshold 117 , the packet is discarded. This helps control congestion in the network. Otherwise the lifetime 115 is attached to the packet 103 and sent to the queue 11 as shown in FIG. 1 .
- the packet 103 When the packet 103 reaches the queue 11 , its life-time is decremented periodically by an aging engine 119 . A tick is generated periodically, and the aging engine 119 acts upon this tick. The aging engine 119 looks through all the packets in the queues and decrements their lifetimes by the same amount. When the life time 115 of the packet 103 in the queue 11 reaches the threshold 117 , the packet 103 is removed from the queue 11 . The resource occupied can then be used by another packet.
- FIG. 3 is a flowchart illustrating the method used by the aging engine 119 in greater detail. Wait ticks are periodically generated at step 301 causing step 303 to determine whether or not the queue is empty. The subsequent steps are not performed until a determination is made that the queue has packets in it. If the queue has packets in it then a first packet pointer pointing to a first packet is fetched at step 305 . An aging step 307 is performed on the packets in the queue. At step 309 it is determined whether the packet has reached or is below the lifetime threshold 117 , and if it has then the packet is removed from the queue at step 311 . It then checks for the next available packet at step 313 .
- next packet is not available then the method goes back to periodically generating wait ticks at step 301 . If the next packet is found at step 313 , then the next packet pointer is fetched at step 315 (the pointer points to the packet next to the packet that was previously pointed to) and the method returns to the step 307 .
- the described invention is appropriate for complex gateways, switches and routers, where the extra gate-count introduced is not much compared to the overall count in the chip.
- the differential packet aging is performed without performing RED.
- the lifetime 115 is assigned directly to the packet based on the set of rules 107 without first determining the weight 109 or determining the queue occupancy 113 as in FIG. 1 . Packets that should be aged out faster are assigned a lower lifetime. All the packets in the queue are decremented at the same frequency. When the lifetime of the packet in the queue reaches a threshold, the packet is removed from the queue.
- packets are aged out if they exceed the time limits assigned to them or based on the priority assigned to them.
Abstract
Flow control is provided for a packet switch. An incoming packet is classified according to its priority based on predefined rules to produce a weight value based on the priority of the packet. A lifetime value associated with the packet is produced based on the weight value and the queue occupancy in a queue to which the packet is assigned. The packet is discarded if its associated lifetime value is less than or equal to a threshold value. Otherwise the packet and associated lifetime value are sent to the queue. The lifetime value is periodically changed and compared to a threshold value. The packet is removed from the queue when its lifetime value reaches the threshold value.
Description
- The present invention relates to flow control in devices utilizing queuing systems for packets.
- Devices using queuing systems for packets, for example gateways, switches and routers, are often used in networks supporting IP or TCPIP, such as Ethernet. A problem is, however, that packets get stuck in that queues when there is congestion in the network, or when a link is down or not ready. Under this stuck condition two things happen.
- (1) Packets are stored in buffers and referenced through link lists. Complex conditions arise when packets are destined for multiple ports, and the packets can exit from some of the ports but not from others. Furthermore, new packets enter from other ports. The result can be that the packets can get stuck in the buffers indefinitely.
- (2) Buffer space can be taken up by packets that are of lower priority, and higher priority packets get dropped.
- One prior art solution is to wait until the congesting condition in the port is removed, and then the packets can exit from the port. The disadvantage of this solution is that during the time when the packets are locked in the switching device, they take up valuable space resources. As such, a condition may arise that low priority packets remain locked in the device while high priority packets are dropped when they enter the switching device from other ports.
- Another solution is to remove all the packets when they have exceeded a time limit in the switching device. This is done indiscriminately for all packets regardless of priority. The disadvantage of this solution is that it does not differentiate between low and high priority packets. It also does not differentiate between time critical packets (e.g. for real time applications such as voice-over-IP, video-over-IP or other types of time critical packets).
- It would be desirable to prevent packets from becoming stagnant within queues. It would also be desirable to prevent high-priority packets from being dropped by buffers already filled with low priority packets. Finally, it would be desirable to control the congestion in the network that causes these other problems.
- The present invention helps solve the problems of stagnant packets within queues, dropped high-priority packets and network congestion, using a random early detect and differential packet aging flow control method. A differential random early detect mechanism is used to prevent congestion in the Internet traffic. An aging mechanism solves the problem of packets being locked in the queue of a switching device for a certain time because it cannot exit the queue.
- In more general terms, flow control is provided for a packet switch. An incoming packet is classified according to its priority based on predefined rules to produce a weight value based on the priority of the packet. A lifetime value associated with the packet is produced based on the weight value and the queue occupancy in a queue to which the packet is assigned. The packet is discarded if its associated lifetime value is less than or equal to a threshold value. Otherwise the packet and associated lifetime value are sent to the queue. The lifetime value is periodically changed and compared to a threshold value. The packet is removed from the queue when its lifetime value reaches the threshold value.
- Further preferred features of the invention will now be described for the sake of example only with reference to the following figures, in which:
-
FIG. 1 is a schematic diagram illustrating a switching device implementing the differential packet aging and random early detect method of he present invention. -
FIG. 2 diagrammatically illustrates the method performed by the RED engine ofFIG. 1 . -
FIG. 3 is a flowchart illustrating the method used by the aging engine ofFIG. 1 . -
FIG. 1 is a schematic diagram illustrating aswitching device 101 implementing the differential packet aging and random early detect method of the present invention to control one ormore queues packet 103 enters apacket classification engine 105 of theswitching device 101. Theclassification engine 105 checks the priority of the packet based on a set ofrules 107 that can be programmed by a user or which can be hard-coded. - Based on the priority determined by the
classification engine 105, a “weight”value 109 is determined by a weightvalue determination section 110 and is assigned to thepacket 103. Packets that should be aged out faster from the queue will have a smaller weight, and thus have a higher probability for a shorter lifetime. - The weight value is then fed into a “random early detect” (RED)
engine 111. Also, the queue occupancy (number of packets) 113 in the queue to which thepacket 103 is assigned (in this example the queue 11) is determined by aqueue occupancy section 114 and is fed into theRED engine 111. The REDengine 111 uses theweight value 109 and thequeue occupancy 113 to determine alifetime 115 of thepacket 103 in thequeue 11. The lifetime 115 a random aging time based on the random early detect scheme? - Once the
lifetime 115 is assigned to thepacket 103, the REDengine 111 checks thelifetime 115 against alifetime threshold 117.FIG. 2 shows the method performed by the REDengine 111 in more detail. Theweight value 109 and thequeue occupancy 113 are processed using anRED algorithm 201 of the REDengine 111. The REDalgorithm 201 calculates alifetime 115. The REDengine 111 then compares thelifetime 115 to thelifetime threshold 117. If thelifetime 115 is below thethreshold 117, the packet is discarded. This helps control congestion in the network. Otherwise thelifetime 115 is attached to thepacket 103 and sent to thequeue 11 as shown inFIG. 1 . - When the
packet 103 reaches thequeue 11, its life-time is decremented periodically by anaging engine 119. A tick is generated periodically, and theaging engine 119 acts upon this tick. Theaging engine 119 looks through all the packets in the queues and decrements their lifetimes by the same amount. When thelife time 115 of thepacket 103 in thequeue 11 reaches thethreshold 117, thepacket 103 is removed from thequeue 11. The resource occupied can then be used by another packet. -
FIG. 3 is a flowchart illustrating the method used by theaging engine 119 in greater detail. Wait ticks are periodically generated atstep 301 causingstep 303 to determine whether or not the queue is empty. The subsequent steps are not performed until a determination is made that the queue has packets in it. If the queue has packets in it then a first packet pointer pointing to a first packet is fetched atstep 305. Anaging step 307 is performed on the packets in the queue. Atstep 309 it is determined whether the packet has reached or is below thelifetime threshold 117, and if it has then the packet is removed from the queue atstep 311. It then checks for the next available packet atstep 313. If the next packet is not available then the method goes back to periodically generating wait ticks atstep 301. If the next packet is found atstep 313, then the next packet pointer is fetched at step 315 (the pointer points to the packet next to the packet that was previously pointed to) and the method returns to thestep 307. - Thus the present invention solves the problems of the prior art:
-
- a) The problem of packets locked within a port indefinitely is solved. A packet is aged out if they exceed the time limit assigned to it.
- b) The problem of packets being aged out indiscriminately is solved. Packets are aged out based on the differential random early detection scheme.
- c) Network congestion is reduced using the random early detection scheme.
- The described invention is appropriate for complex gateways, switches and routers, where the extra gate-count introduced is not much compared to the overall count in the chip. However, in a simpler embodiment, more appropriate for implementation in simple switches, routers, etc., where gate-count is an issue, the differential packet aging is performed without performing RED. The
lifetime 115 is assigned directly to the packet based on the set ofrules 107 without first determining theweight 109 or determining thequeue occupancy 113 as inFIG. 1 . Packets that should be aged out faster are assigned a lower lifetime. All the packets in the queue are decremented at the same frequency. When the lifetime of the packet in the queue reaches a threshold, the packet is removed from the queue. Thus, in this embodiment, packets are aged out if they exceed the time limits assigned to them or based on the priority assigned to them. - Thus, although the invention has been described above using particular embodiments, many variations are possible within the scope of the claims, as will be clear to a skilled reader.
Claims (6)
1. A method of flow control in a packet switch, comprising the steps of:
classifying an incoming packet according to its priority based on predefined rules to produce a lifetime value associated with the packet;
sending the packet and associated lifetime value to a queue;
periodically changing the lifetime value and comparing the changed value to a threshold value; and
removing the packet from the queue based on the comparing.
2. The method of claim 1 , further comprising the steps of:
determining a weight value based on the priority of the packet;
determining a queue occupancy in a queue to which the packet is assigned;
producing the lifetime value based on the weight value and the queue occupancy; and
discarding the packet if its associated lifetime value is below the threshold value.
3. The method of claim 2 , wherein the discarding of the packet occurs before sending the packet and associated lifetime value to the queue.
4. The method of claim 1 , the lifetime is periodically decremented and the packed is removed from the queue when reaching the threshold value.
5. A packet switch comprising:
a packet classification engine for classifying an incoming packet according to its priority based on predefined rules to produce a lifetime value associated with the packet;
a queue for receiving the packet and associated lifetime value;
an aging engine for periodically changing the lifetime value of the packet in the queue;
a comparator for comparing the changed value to a threshold value to remove the packet from the queue based on the comparing.
6. The packet switch of claim 5 , wherein the packet classification engine determines a weight value based on the priority of the packet;
and further comprising a random early detect engine for:
producing the lifetime value based on the weight value and the queue occupancy in a queue to which the packet is assigned; and
discarding the packet if its associated lifetime value is below the threshold value.
Priority Applications (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US10/752,622 US20050149563A1 (en) | 2004-01-06 | 2004-01-06 | Random early detect and differential packet aging flow control in switch queues |
US11/495,651 US7756977B2 (en) | 2004-01-06 | 2006-07-28 | Random early detect and differential packet aging flow control in switch queues |
US12/831,734 US20100274897A1 (en) | 2004-01-06 | 2010-07-07 | Random Early Detect and Differential Packet Aging Flow Control in Switch Queues |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US10/752,622 US20050149563A1 (en) | 2004-01-06 | 2004-01-06 | Random early detect and differential packet aging flow control in switch queues |
Related Child Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US11/495,651 Division US7756977B2 (en) | 2004-01-06 | 2006-07-28 | Random early detect and differential packet aging flow control in switch queues |
Publications (1)
Publication Number | Publication Date |
---|---|
US20050149563A1 true US20050149563A1 (en) | 2005-07-07 |
Family
ID=34711644
Family Applications (3)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US10/752,622 Abandoned US20050149563A1 (en) | 2004-01-06 | 2004-01-06 | Random early detect and differential packet aging flow control in switch queues |
US11/495,651 Active 2024-09-13 US7756977B2 (en) | 2004-01-06 | 2006-07-28 | Random early detect and differential packet aging flow control in switch queues |
US12/831,734 Abandoned US20100274897A1 (en) | 2004-01-06 | 2010-07-07 | Random Early Detect and Differential Packet Aging Flow Control in Switch Queues |
Family Applications After (2)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US11/495,651 Active 2024-09-13 US7756977B2 (en) | 2004-01-06 | 2006-07-28 | Random early detect and differential packet aging flow control in switch queues |
US12/831,734 Abandoned US20100274897A1 (en) | 2004-01-06 | 2010-07-07 | Random Early Detect and Differential Packet Aging Flow Control in Switch Queues |
Country Status (1)
Country | Link |
---|---|
US (3) | US20050149563A1 (en) |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20150078395A1 (en) * | 2013-09-17 | 2015-03-19 | Fujitsu Limited | Traffic control apparatus, buffering control method and packet relay apparatus |
CN108173784A (en) * | 2017-12-29 | 2018-06-15 | 湖南恒茂高科股份有限公司 | A kind of aging method and device of the data pack buffer of interchanger |
Families Citing this family (9)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20090010259A1 (en) * | 2007-07-08 | 2009-01-08 | Alexander Sirotkin | Device, system, and method of classification of communication traffic |
CN101616097B (en) * | 2009-07-31 | 2012-05-23 | 中兴通讯股份有限公司 | Method and system for managing output port queue of network processor |
US8184540B1 (en) * | 2009-12-11 | 2012-05-22 | Juniper Networks, Inc. | Packet lifetime-based memory allocation |
CN102868577A (en) * | 2012-10-09 | 2013-01-09 | 盛科网络(苏州)有限公司 | Weighted random early detection (WRED) automated testing method and device |
US9374387B2 (en) * | 2012-10-12 | 2016-06-21 | Rockwell Automation Technologies, Inc. | Hardware-based granular traffic storm protection |
US9042222B2 (en) | 2012-11-28 | 2015-05-26 | Broadcom Corporation | Deadlock recovery for distributed devices |
US10547561B1 (en) | 2017-11-22 | 2020-01-28 | Juniper Networks, Inc. | Queuing system to achieve maximum queuing latency in a computing device |
US10623329B2 (en) * | 2018-06-27 | 2020-04-14 | Juniper Networks, Inc. | Queuing system to predict packet lifetime in a computing device |
WO2020133218A1 (en) * | 2018-12-28 | 2020-07-02 | 华为技术有限公司 | Retransmission data processing method and device |
Citations (15)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US4642758A (en) * | 1984-07-16 | 1987-02-10 | At&T Bell Laboratories | File transfer scheduling arrangement |
US20020075805A1 (en) * | 2000-09-22 | 2002-06-20 | Narad Networks, Inc. | Broadband system with QOS based packet handling |
US6463068B1 (en) * | 1997-12-31 | 2002-10-08 | Cisco Technologies, Inc. | Router with class of service mapping |
US20030007452A1 (en) * | 2001-06-07 | 2003-01-09 | International Business Machines Corporation | Bandwidth allocation in accordance with shared queue output limit |
US20030086140A1 (en) * | 2000-10-26 | 2003-05-08 | Wave7 Optics, Inc. | Method and system for processing downstream packets of an optical network |
US20030154328A1 (en) * | 2002-02-04 | 2003-08-14 | Henderson Alex E. | Services processor having a queue operations unit and an output scheduler |
US20030189934A1 (en) * | 2002-04-08 | 2003-10-09 | International Business Machines Corporation | Method and system for priority enforcement with flow control |
US6657960B1 (en) * | 1999-11-23 | 2003-12-02 | International Business Machines Corporation | Method and system for providing differentiated services in computer networks |
US6791949B1 (en) * | 2000-04-28 | 2004-09-14 | Raytheon Company | Network protocol for wireless ad hoc networks |
US20050013248A1 (en) * | 2001-03-08 | 2005-01-20 | Adisak Mekkittikul | Method and system for bandwidth allocation tracking in a packet data network |
US6856596B2 (en) * | 2000-12-01 | 2005-02-15 | Marconi Communications, Inc. | Approximation of the weighted random early detection buffer admittance algorithm |
US6882623B1 (en) * | 2000-02-08 | 2005-04-19 | Native Networks Technologies Ltd. | Multi-level scheduling method for multiplexing packets in a communications network |
US6920109B2 (en) * | 2000-05-17 | 2005-07-19 | Hitachi, Ltd. | Packet shaper |
US7031341B2 (en) * | 1999-07-27 | 2006-04-18 | Wuhan Research Institute Of Post And Communications, Mii. | Interfacing apparatus and method for adapting Ethernet directly to physical channel |
US7095754B2 (en) * | 2000-11-03 | 2006-08-22 | At&T Corp. | Tiered contention multiple access (TCMA): a method for priority-based shared channel access |
Family Cites Families (15)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
FI103455B1 (en) * | 1996-10-08 | 1999-06-30 | Nokia Telecommunications Oy | Conductor for a packet network |
US6091709A (en) * | 1997-11-25 | 2000-07-18 | International Business Machines Corporation | Quality of service management for packet switched networks |
CA2223193A1 (en) * | 1997-12-01 | 1999-06-01 | Newbridge Networks Corporation | Adaptive buffering allocation under multiple quality of service |
US6081507A (en) * | 1998-11-04 | 2000-06-27 | Polytechnic University | Methods and apparatus for handling time stamp aging |
US6594268B1 (en) * | 1999-03-11 | 2003-07-15 | Lucent Technologies Inc. | Adaptive routing system and method for QOS packet networks |
GB2349312B (en) * | 1999-04-21 | 2001-03-07 | 3Com Corp | Ageing of data packets using queue pointers |
US6891834B1 (en) * | 1999-09-09 | 2005-05-10 | Avici Systems | Apparatus and method for packet scheduling |
US6839321B1 (en) * | 2000-07-18 | 2005-01-04 | Alcatel | Domain based congestion management |
US6904015B1 (en) * | 2000-09-01 | 2005-06-07 | Force10 Networks, Inc. | Congestion avoidance profiles in a packet switching system |
JP3526269B2 (en) * | 2000-12-11 | 2004-05-10 | 株式会社東芝 | Inter-network relay device and transfer scheduling method in the relay device |
US6741562B1 (en) * | 2000-12-15 | 2004-05-25 | Tellabs San Jose, Inc. | Apparatus and methods for managing packets in a broadband data stream |
US6990097B2 (en) * | 2001-06-01 | 2006-01-24 | 4198638 Canada Inc. | Cell-based switch fabric with inter-cell control for regulating packet flow |
US20030120795A1 (en) * | 2001-12-20 | 2003-06-26 | Marnetics Ltd. | Method for capacity enhancement of packet switched networks |
US7840696B2 (en) * | 2003-07-25 | 2010-11-23 | Broadcom Corporation | Apparatus and method for classifier identification |
US20050114540A1 (en) * | 2003-11-12 | 2005-05-26 | International Business Machines Corporation | Method and system of generically specifying congestion control and a voidance behavior |
-
2004
- 2004-01-06 US US10/752,622 patent/US20050149563A1/en not_active Abandoned
-
2006
- 2006-07-28 US US11/495,651 patent/US7756977B2/en active Active
-
2010
- 2010-07-07 US US12/831,734 patent/US20100274897A1/en not_active Abandoned
Patent Citations (16)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US4642758A (en) * | 1984-07-16 | 1987-02-10 | At&T Bell Laboratories | File transfer scheduling arrangement |
US6463068B1 (en) * | 1997-12-31 | 2002-10-08 | Cisco Technologies, Inc. | Router with class of service mapping |
US7031341B2 (en) * | 1999-07-27 | 2006-04-18 | Wuhan Research Institute Of Post And Communications, Mii. | Interfacing apparatus and method for adapting Ethernet directly to physical channel |
US6657960B1 (en) * | 1999-11-23 | 2003-12-02 | International Business Machines Corporation | Method and system for providing differentiated services in computer networks |
US6882623B1 (en) * | 2000-02-08 | 2005-04-19 | Native Networks Technologies Ltd. | Multi-level scheduling method for multiplexing packets in a communications network |
US6791949B1 (en) * | 2000-04-28 | 2004-09-14 | Raytheon Company | Network protocol for wireless ad hoc networks |
US6920109B2 (en) * | 2000-05-17 | 2005-07-19 | Hitachi, Ltd. | Packet shaper |
US20020075805A1 (en) * | 2000-09-22 | 2002-06-20 | Narad Networks, Inc. | Broadband system with QOS based packet handling |
US20030086140A1 (en) * | 2000-10-26 | 2003-05-08 | Wave7 Optics, Inc. | Method and system for processing downstream packets of an optical network |
US7095754B2 (en) * | 2000-11-03 | 2006-08-22 | At&T Corp. | Tiered contention multiple access (TCMA): a method for priority-based shared channel access |
US6856596B2 (en) * | 2000-12-01 | 2005-02-15 | Marconi Communications, Inc. | Approximation of the weighted random early detection buffer admittance algorithm |
US20050013248A1 (en) * | 2001-03-08 | 2005-01-20 | Adisak Mekkittikul | Method and system for bandwidth allocation tracking in a packet data network |
US20030007452A1 (en) * | 2001-06-07 | 2003-01-09 | International Business Machines Corporation | Bandwidth allocation in accordance with shared queue output limit |
US20030154328A1 (en) * | 2002-02-04 | 2003-08-14 | Henderson Alex E. | Services processor having a queue operations unit and an output scheduler |
US7058789B2 (en) * | 2002-02-04 | 2006-06-06 | Intel Corporation | System and method for packet storage and retrieval |
US20030189934A1 (en) * | 2002-04-08 | 2003-10-09 | International Business Machines Corporation | Method and system for priority enforcement with flow control |
Cited By (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20150078395A1 (en) * | 2013-09-17 | 2015-03-19 | Fujitsu Limited | Traffic control apparatus, buffering control method and packet relay apparatus |
US9825873B2 (en) * | 2013-09-17 | 2017-11-21 | Fujitsu Limited | Traffic control apparatus, buffering control method and packet relay apparatus |
CN108173784A (en) * | 2017-12-29 | 2018-06-15 | 湖南恒茂高科股份有限公司 | A kind of aging method and device of the data pack buffer of interchanger |
Also Published As
Publication number | Publication date |
---|---|
US20100274897A1 (en) | 2010-10-28 |
US7756977B2 (en) | 2010-07-13 |
US20060265424A1 (en) | 2006-11-23 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US7756977B2 (en) | Random early detect and differential packet aging flow control in switch queues | |
US11005769B2 (en) | Congestion avoidance in a network device | |
CA2227244C (en) | A method for supporting per-connection queuing for feedback-controlled traffic | |
JP4260631B2 (en) | Method and apparatus for network congestion control | |
US7813278B1 (en) | Systems and methods for selectively performing explicit congestion notification | |
US6999416B2 (en) | Buffer management for support of quality-of-service guarantees and data flow control in data switching | |
US7701849B1 (en) | Flow-based queuing of network traffic | |
US7899068B1 (en) | Coordinated queuing between upstream and downstream queues in a network device | |
US20070183332A1 (en) | System and method for backward congestion notification in network | |
US7324442B1 (en) | Active queue management toward fair bandwidth allocation | |
US8174985B2 (en) | Data flow control | |
US20130343398A1 (en) | Packet-based communication system with traffic prioritization | |
EP1417795B1 (en) | Switching node with classification-dependent mac buffer control | |
WO2014173315A1 (en) | Packet output controller and method for dequeuing multiple packets from one scheduled output queue and/or using over- scheduling to schedule output queues | |
JP2002026965A (en) | Transmission queue management system for packet exchange and management method | |
US7684422B1 (en) | Systems and methods for congestion control using random early drop at head of buffer | |
US10320686B2 (en) | Load balancing eligible packets in response to a policing drop decision | |
US7391785B2 (en) | Method for active queue management with asymmetric congestion control | |
US7313093B1 (en) | Methods and apparatus for selectively discarding packets during overload conditions | |
EP1327334B1 (en) | Policing data based on data load profile | |
US20040196792A1 (en) | Filtering data flows | |
JP4019027B2 (en) | Packet transfer apparatus and method | |
JP2003348140A (en) | Network system | |
JP2004032602A (en) | Packet transmitting apparatus and its method | |
CN112311678A (en) | Method and device for realizing message distribution |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AS | Assignment |
Owner name: INFINEON TECHNOLOGIES AG, GERMANY Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:YONG, YEAN KEE;KOO, HONG LEE;REEL/FRAME:014900/0570;SIGNING DATES FROM 20031224 TO 20040101 |
|
STCB | Information on status: application discontinuation |
Free format text: ABANDONED -- FAILURE TO RESPOND TO AN OFFICE ACTION |
|
AS | Assignment |
Owner name: INTEL CORPORATION, CALIFORNIA Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:LANTIQ BETEILIGUNGS-GMBH & CO. KG;REEL/FRAME:053259/0678 Effective date: 20200710 |