WO2001078420A1 - Method and apparatus for distribution of bandwidth in a switch - Google Patents
Method and apparatus for distribution of bandwidth in a switch Download PDFInfo
- Publication number
- WO2001078420A1 WO2001078420A1 PCT/SE2001/000733 SE0100733W WO0178420A1 WO 2001078420 A1 WO2001078420 A1 WO 2001078420A1 SE 0100733 W SE0100733 W SE 0100733W WO 0178420 A1 WO0178420 A1 WO 0178420A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- traffic class
- bandwidth
- packet
- counter
- scheduling according
- Prior art date
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q3/00—Selecting arrangements
- H04Q3/64—Distributing or queueing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/54—Store-and-forward switching systems
- H04L12/56—Packet switching systems
- H04L12/5601—Transfer mode dependent, e.g. ATM
- H04L12/5602—Bandwidth control in ATM Networks, e.g. leaky bucket
-
- 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/12—Avoiding congestion; Recovering from congestion
- H04L47/125—Avoiding congestion; Recovering from congestion by balancing the load, e.g. traffic engineering
-
- 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/24—Traffic characterised by specific attributes, e.g. priority or QoS
-
- 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/30—Flow control; Congestion control in combination with information about buffer occupancy at either end or at transit nodes
-
- 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
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L49/00—Packet switching elements
- H04L49/30—Peripheral units, e.g. input or output ports
- H04L49/3081—ATM peripheral units, e.g. policing, insertion or extraction
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/54—Store-and-forward switching systems
- H04L12/56—Packet switching systems
- H04L12/5601—Transfer mode dependent, e.g. ATM
- H04L2012/5638—Services, e.g. multimedia, GOS, QOS
- H04L2012/5646—Cell characteristics, e.g. loss, delay, jitter, sequence integrity
- H04L2012/5651—Priority, marking, classes
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/54—Store-and-forward switching systems
- H04L12/56—Packet switching systems
- H04L12/5601—Transfer mode dependent, e.g. ATM
- H04L2012/5678—Traffic aspects, e.g. arbitration, load balancing, smoothing, buffer management
- H04L2012/5679—Arbitration or scheduling
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
- H04Q2213/1302—Relay switches
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
- H04Q2213/1304—Coordinate switches, crossbar, 4/2 with relays, coupling field
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
- H04Q2213/13056—Routines, finite state machines
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
- H04Q2213/13141—Hunting for free outlet, circuit or channel
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
- H04Q2213/13332—Broadband, CATV, dynamic bandwidth allocation
Definitions
- the present invention relates to a method and an apparatus for distribution of bandwidth in a switch or router. More particularly, the invention relates to a scheduler and an associated algorithm for distributing bandwidth over data traffic directed to output ports and received in various traffic classes and flows.
- the bandwidth scheduler may be located before the output queues leading to early discarding of packets and efficient use of output buffer memory.
- the algorithm includes logical rules operating on counters and variables recording the accepted traffic to implement the bandwidth distribution. The algorithm enables weighted distribution and short term as well as lone term fairness.
- One object of the present invention is to split the scheduler is into two parts, a bandwidth scheduler and a latency scheduler.
- Bandwidth scheduling is performed before packets arrive in the output queues. Packets eligible for dropping are pro- actively blocked. Thus, it is no longer necessary to differentiate flows and/or traffic flows in order to allocate bandwidth and the output queues can be used solely for latency priorities.
- the bandwidth scheduler is located before output queues, and the method comprises: receiving a stream of data from the switching fabric; subjecting the stream to a decision making algorithm in the bandwidth scheduler resulting in that the stream is forwarded or interrupted (accepted or rejected).
- the stream of data includes identifiable data packets and the decision making algorithm in the bandwidth scheduler results in that the data packet is accepted or rejected.
- fig 1 is a block diagram of a prior art scheduler
- fig 2 is a block diagram of a split scheduler architecture according to the present invention
- fig 3 is a diagram of bandwidth distribution in accordance with the prior art Max-Min algorithm
- fig 4 is a diagram of accepted bandwidth using the backlogging and charity counters according to the present invention
- fig 5 is a diagram of the backlogging counter associated with figure 4.
- fig 6 is a diagram of experienced bandwidth associated with figure 4.
- fig 7 is a diagram of a hierarchical structure of traffic at different levels.
- FIG 1 the prior art architecture with a combined latency and bandwidth scheduler is shown.
- Traffic is switched by a switching fabric and distributed on ports which may have a number of queues each.
- the scheduler is located after the output queues. Examples of this kind of scheduler are Round Robin, Weighted Round Robin and Weighted Fair Queuing.
- the queues are used to separate different flows and/or traffic classes so that the scheduler can differentiate them.
- This type of architecture uses common techniques like tail-drop or push-out to drop packets.
- FIG 2 the scheduler architecture according to the present invention is shown.
- the scheduler is split into two parts, a bandwidth scheduler and a latency scheduler.
- Bandwidth scheduling is performed before packets arrive in the output queues. Packets eligible for dropping are pro-actively blocked. Thus, it is no longer necessary to differentiate flows and/or traffic flows in order to allocate bandwidth and the output queues can be used solely for latency priorities.
- bandwidth is distributed much earlier, resulting in smaller buffer requirements and smaller buffer usage fluctuations.
- the algorithm is totally independent of the number of output queues per port, while algorithms like Weighted Round Robin and Weighted Fair Queuing need as many queues as possible.
- Any latency scheduler can work together with the bandwidth scheduler according to the present invention and strict priority is proposed.
- Another aspect of the present invention is the bandwidth scheduler algorithm as such.
- the algorithm aims at a fair distribution of the bandwidth between traffic classes and flows at each port.
- the algorithm takes into account many factors, such as the bandwidth demand of each flow, and short term and long term fairness as will be described more in detail below.
- the algorithm as such is general and may in principle be located before or after the output ports.
- a fair bandwidth distribution can be accomplished in many different ways. Also fairness has different definitions and could be measured in various ways. Fairness could be defined as distributing a bandwidth equal to the wanted bandwidth divided by the sum of the wanted bandwidth. This can be accomplished by several Round Robin schemes. However, in the present invention the Max-Min algorithm is preferred. As the name indicates, this algorithm maximizes the minimum flow. This is considered the fairest algorithm, if all flows can benefit equally to increased bandwidths. The Max-Min algorithm is illustrated in figure 3. If the basic concept is that equal bandwidth is equal utility, then it is most fair to find a limit / were all flows that are offering less than / experience no losses. Flows that are offering more traffic only get bandwidth equal to /, no matter how much bandwidth they are offering.
- a fair share is defined for all flows. Since the fair share is not used by all flows, a spare bandwidth remains after fair share allocation. This spare bandwidth is distributed on flows offering more traffic than the fair share, up to the limit /. Flows offering more traffic than the limit / have this part of the traffic blocked.
- the present invention proposes a further extension of the Max-Min algorithm:
- Each flow is associated with a weight such that the bandwidth is distributed in relation to the weight of each flow.
- Preferably, each traffic class has a weight and the flows within a traffic class are treated equally.
- Second, some flows can be guaranteed bandwidth. In other words, no data packets are lost until the flow exceeds the guaranteed bandwidth limit.
- Third, some flows can be restricted to certain bandwidth maximum. Under no circumstances should a maximized flow get more bandwidth than its limit, even if the line will be left under-utilized.
- a short term fairness is introduced between flows. If a flow is bursty, i.e. more packets are sent than the accepted bandwidth, this should be accepted for a short period of time to make the scheduling flexible. The other flows will be compensated in the future.
- the bandwidth scheduler generally receives a stream of data.
- the stream may be organized into cells or data packets according to different protocols, such as TCP (Transport Control Protocol) and UDP (User Datagram Protocol).
- TCP Transmission Control Protocol
- UDP User Datagram Protocol
- the term data packet and similar in this application is intended to encompass any kind of data entity. It is also practical to use the term flow which can have different meanings
- SUBSTiTU l E SHhE ⁇ (HULE 26) under different circumstances. If e.g. TCP/IP is used the flow may be an application flow (address and port on both source and destination) or a host flow (only address of source and destination). It is assumed that each flow may be classified with regard to its identity with respect to the following categories. The traffic is distributed on the respective ports. This is straightforward but usually the operator puts a limit on the maximum accepted bandwidth per port.
- an application flow is the smallest unit treated by the scheduler.
- the invention proposes to group application flows together by means of a hash function into a set of hashed groups which in this application by definition will be referred to as flow groups.
- the hashing function is stationary and deterministic in a way that all packets belonging to one flow always must be mapped into the same flow group. If flow groups are used, the invention does not distinguish between the flows within the flow group.
- the physical implementation of the invention resides in a program stored in the scheduler either before or after the output queues.
- the program contains the algorithm defining logic rules operating on constants, configuration parameters and various variables and counters.
- the incoming data stream is stored in a buffer while the algorithm operates on some part of the data stream, for instance headers of individual data packets.
- the extracted information or header is processed through the algorithm and the result is that the data stream is forwarded or interrupted or, in case of a data packet, the packet is accepted or rejected.
- Various counters keep track of the accepted traffic for each traffic class and flow group. Also, the variables and counters are updated at regular intervals. The process is described in further details below, with reference to the various parts of the algorithm.
- each port receives its respective part of the data stream.
- the scheduler is configured to limit the amount of accepted bandwidth per port by means of a configuration parameter B WP max (maximum bandwidth per port).
- B WP max maximum bandwidth per port.
- a virtual queue is implemented.
- a counter VQLP virtual queue length of the port
- the limit is maintained automatically. If the virtual queue grows too long (VQLP > constant), packets will be rejected.
- each port also usually accept traffic in various traffic classes.
- the present invention involves a further extension of the Max-Min algorithm with the additions mentioned above.
- the additions operate in parallel and independently of one another. Not all the additions have to be implemented but may be combined in various ways.
- weights are associated with each traffic class.
- a configuration parameter WTC weight traffic class
- WTC weight traffic class
- the respective counters are increased in a weighted manner, so that the algorithm automatically prioritizes certain traffic classes.
- the counter TC is increased with the packet length multiplied by the weight WTC when the traffic class accepts a packet.
- the weight function may be disabled by setting all weights WTC to unity (1).
- the traffic class can use the charity function to force the packet to be accepted. Then, the charity counter CH of a port is decreased with the packet length multiplied with the weight of the respective traffic class (or underlying level): -packet length x WTC (-packet length x WAL). Similarly, for an added level the
- FIG. 4 is a first diagram showing the total accepted bandwidth and figure 5 is a diagram showing the backlogging counters for two flows A and B. The backlogging counter is increased every time a packet is accepted, such as shown in figure 4.
- the backlogging counter is limited to a fixed value, e.g. ⁇ 128 kB. If one backlogging counter for a flow reaches the upper limit, all the counters belonging to this port are decreased in order to maintain the internal difference. If one backlogging counter for a flow reaches the lower limit, this counter remains at the lower limit (but the other counters are not affected). This way only the near past is remembered. Hence the term short term fairness. Now we have two variables
- class H If a class offers more than its maximum bandwidth it is not accepted (class H).
- B min (offered bandwidth, BWTC max , BWTC m i n + WTC / ⁇ WTC x BW spare )
- the method and apparatus according to the invention may be extended to more levels. Any number of levels may be added. An example is shown in figure 7.
- a physical connection is often shared by several users.
- the connection may be an overseas cable or link with a number of ports.
- One port may e.g. be leased to one or several telecommunication operators at Level 1 of which one is shown. Only one instance is shown at each level. In turn, this operator may have a number of customers, each to be provided with a specific share of the traffic. These are located at Level 2.
- the customer may in turn want to control the traffic by prioritising certain users or subscribers or the like. This is done at Level 3. Below Level 3, the ordinary levels of traffic class, flow group and application flows may be as before.
- the added levels are inserted above the traffic class level.
- An example with tables listing the configuration parameters and the respective counters and variables is set forth below with one added level. It will be appreciated that the port interfaces with the added level in the same way as with the traffic class as described above. Of course, the counters and variables have to be replaced with the corresponding counters and variables of the added level.
- the traffic class interfaces upward to the added level as with the port as described previously.
- the counters and variables have the same name as before, but the absolute values have will have to be changed to take the added level into consideration since in fact other sets of traffic classes are located in parallel at the same level. The same applies to the flow group level and flow level.
- BWAL max maximum bandwidth per added level BWAL min minimum bandwidth per added level WAL weight per added level
- BWTC max maximum bandwidth per traffic class BWTC mm minimum bandwidth per traffic class WTC weight per traffic class
- VQLAL virtual queue length per added level
Abstract
Description
Claims
Priority Applications (7)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
JP2001575740A JP2003530792A (en) | 2000-04-10 | 2001-04-04 | Method and apparatus for distributing bandwidth in a switch |
EP01918130A EP1277357A1 (en) | 2000-04-10 | 2001-04-04 | Method and apparatus for distribution of bandwidth in a switch |
IL15214901A IL152149A0 (en) | 2000-04-10 | 2001-04-04 | Method and apparatus for distribution of bandwidth in a switch |
AU4499601A AU4499601A (en) | 2000-04-10 | 2001-04-04 | Method and apparatus for distribution of bandwidth in a switch |
AU2001244996A AU2001244996B2 (en) | 2000-04-10 | 2001-04-04 | Method and apparatus for distribution of bandwidth in a switch |
CA002406074A CA2406074A1 (en) | 2000-04-10 | 2001-04-04 | Method and apparatus for distribution of bandwidth in a switch |
NO20024882A NO20024882L (en) | 2000-04-10 | 2002-10-09 | Method and apparatus for distributing bandwidth in a switch |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US09/546,494 | 2000-04-10 | ||
US09/546,494 US7215678B1 (en) | 2000-04-10 | 2000-04-10 | Method and apparatus for distribution of bandwidth in a switch |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2001078420A1 true WO2001078420A1 (en) | 2001-10-18 |
Family
ID=24180685
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/SE2001/000733 WO2001078420A1 (en) | 2000-04-10 | 2001-04-04 | Method and apparatus for distribution of bandwidth in a switch |
Country Status (14)
Country | Link |
---|---|
US (1) | US7215678B1 (en) |
EP (1) | EP1277357A1 (en) |
JP (1) | JP2003530792A (en) |
KR (1) | KR20030001412A (en) |
CN (1) | CN1271830C (en) |
AU (2) | AU4499601A (en) |
CA (1) | CA2406074A1 (en) |
EG (1) | EG22898A (en) |
IL (1) | IL152149A0 (en) |
MY (1) | MY136305A (en) |
NO (1) | NO20024882L (en) |
TW (1) | TW525395B (en) |
WO (1) | WO2001078420A1 (en) |
ZA (1) | ZA200208608B (en) |
Cited By (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
EP1328094A1 (en) * | 2002-01-14 | 2003-07-16 | Fujitsu Network Communications, Inc. | Weighted credit-based arbitration using credit history |
WO2004017650A2 (en) * | 2002-08-19 | 2004-02-26 | Soma Networks, Inc. | Scheduler for a shared channel |
CN1802815B (en) * | 2003-06-06 | 2011-06-08 | 微软公司 | Method and system for global routing and bandwidth sharing |
US8341283B2 (en) * | 2006-12-08 | 2012-12-25 | Deutsche Telekom Ag | Method and system for peer-to-peer content dissemination |
CN114338523A (en) * | 2014-12-30 | 2022-04-12 | 华为技术有限公司 | Message forwarding method and device |
Families Citing this family (24)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7072353B2 (en) * | 2000-06-15 | 2006-07-04 | At&T Corp. | Flexible bandwidth allocation in high-capacity grooming switches |
US8370517B2 (en) * | 2001-09-27 | 2013-02-05 | International Business Machines Corporation | Conserving energy in a data processing network |
AU2003250509A1 (en) * | 2002-09-13 | 2004-04-30 | Passave Ltd. | Operations method in an ethernet passive optical network that includes a network unit with multiple entities |
DE60305040T2 (en) * | 2003-10-21 | 2006-11-30 | Alcatel | Double-sided bandwidth allocation by detection of short-term traffic change |
CN100359888C (en) * | 2003-11-27 | 2008-01-02 | 华为技术有限公司 | A data poll dispatching method |
JP4419541B2 (en) * | 2003-12-03 | 2010-02-24 | 株式会社日立製作所 | Polishing equipment |
FI118072B (en) * | 2004-09-24 | 2007-06-15 | Tellabs Oy | A method and apparatus for scheduling transmission link capacity between packet switched communication networks maintaining retention characteristics |
US7525962B2 (en) * | 2004-12-27 | 2009-04-28 | Intel Corporation | Reducing memory access bandwidth consumption in a hierarchical packet scheduler |
CN100450076C (en) * | 2004-12-30 | 2009-01-07 | 中兴通讯股份有限公司 | Method of shaping network flow in use for multiple inputs and single output, and of distributing bandwidth |
DE602006001512D1 (en) * | 2006-04-20 | 2008-07-31 | Alcatel Lucent | Method and apparatus for efficient weighted and fair data monitoring |
JP4899961B2 (en) * | 2007-03-19 | 2012-03-21 | 富士通株式会社 | Communication apparatus and output control method |
US7839864B1 (en) * | 2007-05-21 | 2010-11-23 | Cisco Technology, Inc. | Priority propagation with a hierarchical asynchronous transfer mode (ATM) scheduler |
CN101272348B (en) * | 2008-04-30 | 2012-07-04 | 杭州华三通信技术有限公司 | Bandwidth control method and system |
US8593950B2 (en) * | 2008-06-24 | 2013-11-26 | At&T Intellectual Property I, L.P. | Method and apparatus for providing a weighted bandwidth allocation for a network |
KR200452223Y1 (en) * | 2008-11-28 | 2011-02-14 | 주식회사골드라인 | Folding type box |
US9116893B2 (en) | 2011-10-21 | 2015-08-25 | Qualcomm Incorporated | Network connected media gateway for communication networks |
US9148381B2 (en) | 2011-10-21 | 2015-09-29 | Qualcomm Incorporated | Cloud computing enhanced gateway for communication networks |
US20130100955A1 (en) * | 2011-10-24 | 2013-04-25 | Qualcomm Incorporated | Technique for prioritizing traffic at a router |
US8285141B1 (en) * | 2011-12-15 | 2012-10-09 | Level 3 Communications, Llc | Apparatus, system, and method for asymmetrical and dynamic routing |
US8849112B2 (en) | 2011-12-15 | 2014-09-30 | Level 3 Communications, Llc | Apparatus, system, and method for asymmetrical and dynamic routing |
US9641438B2 (en) | 2011-12-15 | 2017-05-02 | Level 3 Communications, Llc | Apparatus, system, and method for asymmetrical and dynamic routing |
US10033657B2 (en) * | 2016-06-30 | 2018-07-24 | Juniper Networks, Inc. | Generating automatic bandwidth adjustment policies per label-switched path |
CN113194007B (en) * | 2021-04-22 | 2023-03-28 | 西安交通大学 | Method, system and equipment for measuring available bandwidth of network and readable storage medium |
CN116800693A (en) * | 2022-03-16 | 2023-09-22 | 华为技术有限公司 | Queue scheduling method and device |
Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5748629A (en) * | 1995-07-19 | 1998-05-05 | Fujitsu Networks Communications, Inc. | Allocated and dynamic bandwidth management |
US5764641A (en) * | 1995-09-08 | 1998-06-09 | Cisco Systems, Inc. | Early and integrated tail packet discard system |
US5768257A (en) * | 1996-07-11 | 1998-06-16 | Xylan Corporation | Input buffering/output control for a digital traffic switch |
Family Cites Families (21)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5381413A (en) | 1992-12-28 | 1995-01-10 | Starlight Networks | Data throttling system for a communications network |
US5432790A (en) | 1993-09-17 | 1995-07-11 | Motorola, Inc. | Method for allocating internodal link bandwidth in a packet oriented communication network to guarantee delay quality-of-service |
JP2928452B2 (en) | 1994-03-17 | 1999-08-03 | 富士通株式会社 | ATM switch and call receiving apparatus and method in ATM switch |
AU6502496A (en) | 1995-07-19 | 1997-02-18 | Ascom Nexion Inc. | Allocated and dynamic bandwidth management |
GB9520807D0 (en) | 1995-10-11 | 1995-12-13 | Newbridge Networks Corp | Fair queue servicing using dynamic weights |
US5917822A (en) | 1995-11-15 | 1999-06-29 | Xerox Corporation | Method for providing integrated packet services over a shared-media network |
GB9606711D0 (en) | 1996-03-29 | 1996-06-05 | Plessey Telecomm | Routing and bandwidth allocation |
US5828653A (en) * | 1996-04-26 | 1998-10-27 | Cascade Communications Corp. | Quality of service priority subclasses |
US5742594A (en) | 1996-06-13 | 1998-04-21 | Motorola, Inc. | Method and apparatus for allocating shared bandwidth among a plurality of users |
JP3409966B2 (en) * | 1996-06-21 | 2003-05-26 | 株式会社日立製作所 | Packet switch and packet transfer control method |
JP3525656B2 (en) * | 1996-12-06 | 2004-05-10 | 株式会社日立製作所 | Packet switch and congestion notification method |
JP2970571B2 (en) | 1997-01-30 | 1999-11-02 | 日本電気株式会社 | Multiplexing method of virtual path connection group |
JP2965070B2 (en) | 1997-04-23 | 1999-10-18 | 日本電気株式会社 | ATM device and port shaping method |
US6292465B1 (en) * | 1997-05-27 | 2001-09-18 | Ukiah Software, Inc. | Linear rule based method for bandwidth management |
US6072800A (en) * | 1997-08-18 | 2000-06-06 | Nec Usa, Inc. | Weighted longest queue first adaptive scheduling discipline for ATM networks |
US6104700A (en) * | 1997-08-29 | 2000-08-15 | Extreme Networks | Policy based quality of service |
US6853638B2 (en) * | 1998-04-01 | 2005-02-08 | Cisco Technology, Inc. | Route/service processor scalability via flow-based distribution of traffic |
US6628609B2 (en) * | 1998-04-30 | 2003-09-30 | Nortel Networks Limited | Method and apparatus for simple IP-layer bandwidth allocation using ingress control of egress bandwidth |
ATE290743T1 (en) * | 1998-07-31 | 2005-03-15 | Cit Alcatel | METHOD, SEQUENCER, INTELLIGENT BUFFER MEMORY, PROCESSOR AND TELECOMMUNICATIONS SYSTEM FOR DISTRIBUTING AVAILABLE BANDWIDTH |
US6549938B1 (en) * | 1998-12-10 | 2003-04-15 | Nokia Corporation | System and method for prioritizing multicast packets in a network service class utilizing a priority-based quality of service |
US6570883B1 (en) * | 1999-08-28 | 2003-05-27 | Hsiao-Tung Wong | Packet scheduling using dual weight single priority queue |
-
2000
- 2000-04-10 US US09/546,494 patent/US7215678B1/en not_active Expired - Lifetime
-
2001
- 2001-04-04 JP JP2001575740A patent/JP2003530792A/en active Pending
- 2001-04-04 AU AU4499601A patent/AU4499601A/en active Pending
- 2001-04-04 AU AU2001244996A patent/AU2001244996B2/en not_active Ceased
- 2001-04-04 EP EP01918130A patent/EP1277357A1/en not_active Withdrawn
- 2001-04-04 KR KR1020027013568A patent/KR20030001412A/en not_active Application Discontinuation
- 2001-04-04 CA CA002406074A patent/CA2406074A1/en not_active Abandoned
- 2001-04-04 IL IL15214901A patent/IL152149A0/en not_active IP Right Cessation
- 2001-04-04 CN CNB01809144XA patent/CN1271830C/en not_active Expired - Fee Related
- 2001-04-04 WO PCT/SE2001/000733 patent/WO2001078420A1/en active IP Right Grant
- 2001-04-09 MY MYPI20011687A patent/MY136305A/en unknown
- 2001-04-10 EG EG20010353A patent/EG22898A/en active
- 2001-07-04 TW TW090108427A patent/TW525395B/en not_active IP Right Cessation
-
2002
- 2002-10-09 NO NO20024882A patent/NO20024882L/en not_active Application Discontinuation
- 2002-10-24 ZA ZA200208608A patent/ZA200208608B/en unknown
Patent Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5748629A (en) * | 1995-07-19 | 1998-05-05 | Fujitsu Networks Communications, Inc. | Allocated and dynamic bandwidth management |
US5764641A (en) * | 1995-09-08 | 1998-06-09 | Cisco Systems, Inc. | Early and integrated tail packet discard system |
US5768257A (en) * | 1996-07-11 | 1998-06-16 | Xylan Corporation | Input buffering/output control for a digital traffic switch |
Non-Patent Citations (7)
Title |
---|
DEBBIE ROBINSON: "Wire speed quality of service over ethernet", 19 May 2000 (2000-05-19), XP002957047, Retrieved from the Internet <URL:http://www.chipcenter.com/networking/techarch.html> * |
GOYAL P. ET AL.: "Fair airport scheduling algorithms", PROCEEDINGS OF THE IEEE 7TH INTERNATIONAL WORKSHOP ON NETWORK AND OPERATING SYSTEM SUPPORT FIR DIGITAL AUDIO AND VIDEO, 19 May 1997 (1997-05-19) - 21 May 1997 (1997-05-21), pages 257 - 265, XP010251704 * |
GUIJARRO L. ET AL.: "Guaranteeing fairness and protection in ABR by means of fair queueing", 2ND INTERNATIONAL CONFERENCE ON ATM, ICATM '99, 21 June 1999 (1999-06-21) - 23 June 1999 (1999-06-23), pages 22 - 31, XP010346195 * |
HUI ZHANG: "Service disciplines for guaranteed performance service in packet-switching networks", PROCEEDINGS OF THE IEEE, October 1995 (1995-10-01), pages 1374 - 1396, XP000545667 * |
RACZ A. ET AL.: "Weighted fair early packet discard at an ATM swtich output port", PROCEEDINGS. IEEE EIGHTEENTH ANNUAL JOINT CONFERENCE OF THE IEEE COMPUTER AND COMMUNICATIONS SOCIETIES, INFOCOM '99, vol. 3, 21 March 1999 (1999-03-21) - 25 March 1999 (1999-03-25), pages 1160 - 1168, XP010323858 * |
YIWEI THOMAS HOU ET AL.: "ATM ABR traffic control with a generic weight-based bandwith sharing policy: Theory and a simple implementation", IEICE TRANS. COMMUN., vol. E81-B, no. 5, May 1998 (1998-05-01), pages 958 - 972, XP000779502 * |
YUAN WU ET AL.: "Improved virtual queueing and dynamic EPD techniques for TCP over ATM", PROCEEDINGS OF INTERNATIONAL CONFERENCE ON NETWORK PROTOCOLS, 28 October 1997 (1997-10-28) - 31 October 1997 (1997-10-31), pages 212 - 219, XP010258702 * |
Cited By (8)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
EP1328094A1 (en) * | 2002-01-14 | 2003-07-16 | Fujitsu Network Communications, Inc. | Weighted credit-based arbitration using credit history |
US7324452B2 (en) | 2002-01-14 | 2008-01-29 | Fujitsu Limited | Weighted credit-based arbitration using credit history |
WO2004017650A2 (en) * | 2002-08-19 | 2004-02-26 | Soma Networks, Inc. | Scheduler for a shared channel |
WO2004017650A3 (en) * | 2002-08-19 | 2004-05-06 | Soma Networks Inc | Scheduler for a shared channel |
CN1330153C (en) * | 2002-08-19 | 2007-08-01 | 索马网络公司 | Scheduler for a shared channel |
CN1802815B (en) * | 2003-06-06 | 2011-06-08 | 微软公司 | Method and system for global routing and bandwidth sharing |
US8341283B2 (en) * | 2006-12-08 | 2012-12-25 | Deutsche Telekom Ag | Method and system for peer-to-peer content dissemination |
CN114338523A (en) * | 2014-12-30 | 2022-04-12 | 华为技术有限公司 | Message forwarding method and device |
Also Published As
Publication number | Publication date |
---|---|
EP1277357A1 (en) | 2003-01-22 |
TW525395B (en) | 2003-03-21 |
CN1428054A (en) | 2003-07-02 |
NO20024882L (en) | 2002-12-10 |
CN1271830C (en) | 2006-08-23 |
AU4499601A (en) | 2001-10-23 |
EG22898A (en) | 2003-10-30 |
JP2003530792A (en) | 2003-10-14 |
ZA200208608B (en) | 2003-10-24 |
US7215678B1 (en) | 2007-05-08 |
AU2001244996B2 (en) | 2005-12-22 |
KR20030001412A (en) | 2003-01-06 |
MY136305A (en) | 2008-09-30 |
IL152149A0 (en) | 2003-05-29 |
CA2406074A1 (en) | 2001-10-18 |
NO20024882D0 (en) | 2002-10-09 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
AU2001244996B2 (en) | Method and apparatus for distribution of bandwidth in a switch | |
AU2001244996A1 (en) | Method and apparatus for distribution of bandwidth in a switch | |
US7023856B1 (en) | Method and system for providing differentiated service on a per virtual circuit basis within a packet-based switch/router | |
JP4394203B2 (en) | Methods for sharing available bandwidth, processors implementing such methods, and schedulers, intelligent buffers, and communication systems including such processors | |
US7457313B2 (en) | Hierarchical prioritized round robin (HPRR) scheduling | |
CA2365677C (en) | Allocating buffers for data transmission in a network communication device | |
US7499454B2 (en) | Pipeline scheduler with fairness and minimum bandwidth guarantee | |
JP3347926B2 (en) | Packet communication system and method with improved memory allocation | |
US6795870B1 (en) | Method and system for network processor scheduler | |
US20040151197A1 (en) | Priority queue architecture for supporting per flow queuing and multiple ports | |
JP4163044B2 (en) | BAND CONTROL METHOD AND BAND CONTROL DEVICE THEREOF | |
US6246687B1 (en) | Network switching system supporting guaranteed data rates | |
CA2462793C (en) | Distributed transmission of traffic streams in communication networks | |
WO2001024428A1 (en) | Hierarchical prioritized round robin (hprr) scheduling | |
EP1526686A1 (en) | Switching unit with scalable and QoS aware flow control | |
US7266612B1 (en) | Network having overload control using deterministic early active drops | |
EP2063580B1 (en) | Low complexity scheduler with generalized processor sharing GPS like scheduling performance | |
JP3783628B2 (en) | Node device in communication system and operation control method thereof | |
KR100598342B1 (en) | Multi-class quality of service control method for DiffServ-Enabled core router | |
US20070133561A1 (en) | Apparatus and method for performing packet scheduling using adaptation round robin | |
KR100475783B1 (en) | Hierarchical prioritized round robin(hprr) scheduling | |
JP4391346B2 (en) | COMMUNICATION CONTROL METHOD, COMMUNICATION CONTROL DEVICE, CONTROL PROGRAM, AND RECORDING MEDIUM | |
Krachodnok et al. | Buffer management for TCP over GFR service in an ATM network | |
Dastangoo | Performance consideration for building the next generation multi-service optical communications platforms | |
JP2003023460A (en) | Rate controller |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AK | Designated states |
Kind code of ref document: A1 Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BY BZ CA CH CN CR CU CZ DE DK DM DZ EE ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NO NZ PL PT RO RU SD SE SG SI SK SL TJ TM TR TT TZ UA UG US UZ VN YU ZA ZW |
|
AL | Designated countries for regional patents |
Kind code of ref document: A1 Designated state(s): GH GM KE LS MW MZ SD SL SZ TZ UG ZW AM AZ BY KG KZ MD RU TJ TM AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE TR BF BJ CF CG CI CM GA GN GW ML MR NE SN TD TG |
|
121 | Ep: the epo has been informed by wipo that ep was designated in this application | ||
DFPE | Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101) | ||
WWE | Wipo information: entry into national phase |
Ref document number: 2001918130 Country of ref document: EP |
|
WWE | Wipo information: entry into national phase |
Ref document number: 152149 Country of ref document: IL |
|
WWE | Wipo information: entry into national phase |
Ref document number: IN/PCT/2002/01004/DE Country of ref document: IN |
|
ENP | Entry into the national phase |
Ref document number: 2001 575740 Country of ref document: JP Kind code of ref document: A |
|
WWE | Wipo information: entry into national phase |
Ref document number: 1020027013568 Country of ref document: KR Ref document number: 2406074 Country of ref document: CA |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2001244996 Country of ref document: AU Ref document number: 200208608 Country of ref document: ZA |
|
WWE | Wipo information: entry into national phase |
Ref document number: 01809144X Country of ref document: CN |
|
WWP | Wipo information: published in national office |
Ref document number: 1020027013568 Country of ref document: KR |
|
WWP | Wipo information: published in national office |
Ref document number: 2001918130 Country of ref document: EP |
|
WWG | Wipo information: grant in national office |
Ref document number: 2001244996 Country of ref document: AU |