CA2234621A1 - Fair queue servicing using dynamic weights (dwfq) - Google Patents
Fair queue servicing using dynamic weights (dwfq) Download PDFInfo
- Publication number
- CA2234621A1 CA2234621A1 CA002234621A CA2234621A CA2234621A1 CA 2234621 A1 CA2234621 A1 CA 2234621A1 CA 002234621 A CA002234621 A CA 002234621A CA 2234621 A CA2234621 A CA 2234621A CA 2234621 A1 CA2234621 A1 CA 2234621A1
- Authority
- CA
- Canada
- Prior art keywords
- queue
- service
- weights
- fair queue
- real
- 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
Classifications
-
- 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
- H04Q—SELECTING
- H04Q11/00—Selecting arrangements for multiplex systems
- H04Q11/04—Selecting arrangements for multiplex systems for time-division multiplexing
- H04Q11/0428—Integrated services digital network, i.e. systems for transmission of different types of digitised signals, e.g. speech, data, telecentral, television signals
- H04Q11/0478—Provisions for broadband connections
-
- 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
- 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/5681—Buffer or queue management
Abstract
In a method of fair queue servicing at a queuing point in a multi-service class packet switched network, incoming packets are received in buffers and outgoing packets are scheduled by a weighted fair queue scheduler. Real-time information of buffer usage along with the minimum bandwidth requirement is used to dynamically modify the weights of the weighted fair queue scheduler.
Description
CA 0223462l l998-04-l4 Fair ~ueue Servicing using dynamic weights (DWFQ) This invention relates to the field of telecornmunications, and more particularly to a method of fair queue servicing in asynchronous data networks, such as Asynchronous Transfer Mode (ATM) networks or more generally any packet switched network that supports more than one class of service.
The use of ATM by a continually increasing number of applications is driving a requirement to increase the number of service classes and to allow more flexibility in the service offerings To support the application requirements, the ATM Forum is adding new service categories in new releases of ATM specifications. Furtherrnore, network providers are looking for the flexibility of defining multiple service classes for a given service categorv. The service classes are differentiated by their Quality-Of-Service requirements (QoS). The QoS requirements are configurable in accordance ~,vith a bi-dimensional matrix describing loss and delay. The delay jitter is another factor which needs to be bounded for some service classes.
Previously~ three service categories were supported on an ATM network element, namely constant bit rate (CBR), variable bit rate (VBR) and unspecified bit rate (UBR) The CBR service is the only service that guarantees a bound on delay. It is used for time sensitive data~ such as voice and video.
These v arious services can be supported by traditional exhaustive round-robin queuing among two priority queues. However, this simple technique cannot be usedwhen the number of queues increases beyond two, because of the high potential ofstarvation for lo~-er priority queues. Furthermore, the exhaustive round robin can only guarantee bounds on delay and delay variation for the highest priority queue. The support of multiple service class in an ATM switching product or multiplexer requires a minimum of one queue per class.
A queue scheduling algorithm. Weighted Fair Queuing (WFQ), has been recently proposed in the literature (see S. Golestani, ~ self-clocked Fair Queuing scheme for broadband applications INFOCOM 1994. ~une 1994) 06~as/ss as:s3 F~g CA 02234621 1998-04-14 ~08 .. ~ 2 ~
l~is s~ n~ scheme allows any nLunber queues (ser~ice classes) to be 1.
senriced, while providmg f~ir a~d work conser~ng access to b~ndwidth One of the key features of WFQ is thdt the CDV (Cell Delay Variation) ~s boul.d~l for any sen~ice class, as long as it is giv~n a ...1..,.."-.., weight~
~ Thisplo~os~ scheme can be imple.. ,L d in ATM products. Howe~er, it has not been ~ f-~rrnin~d how to set the servicin~ wei~hts ~-ffi-jfntly to take into account the dyn~ ic~llly ~hs~nein~ bandwidth ~.~ c.-~ of each service class (COnn~t'Or addition/removal, ABR flow control, Early packet Discard).
An object of the inverLtion is to p~ovide a Lan.e~voll; that ensures that the wei~hts are set d~ u~;ately to ~ e the desired Quality of Ser~rice and modified in real-time to ensure that the dynarnic Allnc~ n of bandwidth across the classes is opLi~
ALcor~ g to the present invention there is provided a me~od of fair queue servicing at a queu ng point in a multi~service class packet :,wiL~ihed network, where~n in~ min~ packets are received in buffers and outgoing packets are scheduled by aweightedfairqueues~ d~-lPrclL~dL.~;~e~inthatrePl-time;llf.ill,.Aii-nofbufferusage alongwiththeln.. ~;.~.. ~,baIldwidth~ tisusedtody.,~.nieAllymodifythe weighi:s of the weighted f~ur queue 5f~h~ r so as to cause buf~er queue si e to move toward a ~r~f ~ .i.,~l target value.
Preferablythe...illi.~ ll.bandw~dthr~ .Lis~ tP-l duri~gco~,Lon ~r1rniccir~n control Ihe medlod is pal1icularly suitable for use in ATM r~tworks.
The DWF Q (D~c Weighted Fair Queuing) can be impl.omPn~rrl at any queuing point which cl~lJiLLa~3 senr~c~g between n queues (n>2).
The invention also provides a fair queue servic~ng ~ ">~ ~1 in a multi-serv~ce class packet switched rletwork, comr~c;n~ a weighted f~ir queuing controller, and buffer means for rece~vLllg ;nco~ n~ packets in queues, ~ LP. ;7e~1 m that fi~her c~ .. ,l., ;~P~ I
means for mor~itoril~g buffer usage for each queue, means for det. ~ninin~ the bandwidth reqUir~ of each class of ser~r~ce, and a service weights nn~ns~e~r for dyn~min~lly modifying ~e weights of said weîghted fair queuing con~oller means in response to said bufferusage and bandw~dth~i~4.ne.~
A~k~l~ED StlEET
CA 0223462l l998-04-l4 Preferably, the means for monitoring buffer usage a queue growth monitor which perforrns real-time ~?s1im~tion of the queue growth in said buffer means.
The invention will now be described in more detail~ by way of example only. withreference to the accompanying drawings, in which:-Figure 1 is a diagram depicting the high level queuing scheme at an ATM switch;
Figure ~ shows the inforrnation provided by the Queue Growth Monitor, Figure 3 illustrates the data flow between the key components of the system andthe action of the Service Weight Manager (SWM); and Figure 4 describes the process performed by the SWM.
Referring now to Figure 1, ATM cells 2 arrive at buffer 1 and are placed in queues 11,12,...1n From there the cells are passed to a weighted fair queuing unit 3. The buffer I
is also connected to a queue growth monitor 4, which in turn is connected to congestion control unit 5, congestion analyzer 6, and connection admission controller 8, which in turn is connected to SVC & PVC (Switched Virtual Circuit and Permanent Virtual Circuit) connection handling unit 7, and service class manager 10. Queue growth monitor 4, connection admission controller 8 and service class manager 9 are connected to service weights manager 9, which is connected to weighted fair queuing scheduler 3 The key element of the Dynamic Weighted Fair Queuing (DWFQ) scheme is the service weight manager (SWM) 9, which dynamically modifies the service weights to be used by the WFQ Scheduler 3 It uses real-time information from the service classmanager 10, the connection admission controller 8, and the Queue growth monitor 4.
The service class manager 10 configures the service classes. A service class is configured with a given value of delay (CTD - Cell Transfer Delay) and loss (CLR - Cell Ratio Loss) requirements. These parameters represent the maximum nodal delay and loss allowed in order to meet the end-to-end QoS requirements of the connection. The service classes are mapped into a priority table as exemplified in Table 1. The priority table is used later by the service weight manager to allocate rem~ining bandwidth. The priority table is updated when a service class definition is modified. The service class manager also dictates which traff1c descriptors are used to compute the miniml-m bandwidth required by a connection of a given class.
CTD
CLR 100 ~s 500 lls None 10-~ 4 7 9 Table I ~ Example of a Queue Service Priority Mapping.
The connection admission controller (CAC) 8 computes the miniml-m bandwidth required for each service class. The minimum bandwidth is updated each time a connection of a given class is established or discormected, based on its traffic descriptor.
Table 2 shows a typical example of which traffic descriptors that can be used tocompute the minimum bandwidth for each basic service category relative to the queue service rate (SR) The CAC 8 communicates the minimum Weight table to the SWM
every time the value of the minimum weights have changed by a factor of ~,.
Queue; Category min Wi Ql CBR (~ PCR) / SR
Q2 RT-VBR (~ SCR) / SR
Q3 NRT- (~ SCR) / SR
VBR
Table 2 ~ Example of minimum weight table The CTD is further taken into account in the target queue size (TQS) table, which is the maximum queue size allowed to limit the CTD An example of TQSi computation is shown in Table 3, for typical service categories A zero TQS indicates that the queue can grow without limitation This table is computed by the CAC.
Queuei Category TQSi Q I CBR CTD / min Wi Q2 RT-VBR CTD / min Wi VBR
Table 2 ~ Example of a target queue size computation.
The Queue Growth Monitor (QGM) 4 performs real-time çstim~tion of the queue growth every Ts cell slots (sampling interval~. The information provided by the Queue Growth monitor 4 to the SWM 9 consists of ~Qi, the Queue Growth Rate of output queue i during an interval of duration Ts, Qi, the length of output queue i at the sampling time, and Ai, the arrival rate during the same interval of time.
The corresponding parameters: queue size Qi, queue growth ~Qi, number of arrivals Ai are collected or each queue by the QGM 4 for each Ts interval. From these parameters, auxiliary parameters such as average arrival rate ~i and service rate ~Li can be -derived by the SWM 9:
: average arrival rate, ?~j = Aj Ts llj: average service rate, llj = Sj - Ts~ where Sj = Aj--~Qj is the number of cells served during Ts.
Figure 2 shows the information provided by the Queue Growth Monitor 4. Using this inforrnation for the CAC 8, the service class manager 9 and the queue growth monitor 4, the SWM computes the service eight for each queue i (Wj) to be used during the next sampling interval.
As can be seen in Figure 3~ which shows the data flow between the key components of the system and the action of the SWM 9, the queue weights. Wi, areupdated usin~ information provided by the Queue Growth monitor 4.
If ~ j denotes the arrival rate of cells in queue i in the coming Ts interval, then ideally, the target service rate l~ j can be calculated as: (~ } Ts = Qi--TQSj . This means at the end of ne~t Ts interval, the queue size Qi will reach the target queue size TQSi. On the assurnption that ~j remains 1~nr.h:~n~ed from ~j, the service weight W, = ~ T5 can be approxim:~tecl as W~ Ts--~j ~ T5 + Qi--TQSj = Aj + Qj--TQSi .
However, the assurnption on the stable arrival rate may not hold, and also the actual number of serviced cells Si could be less than Wi; therefore a more conservative approach is ~Qj > 0, then Qj+~Qj, the predicted queue size at the end of the next Ts interval, is used to calculate the target service rate and weight. That is:
Ts = Q~ + ~Q,--TQSj and Wj--~j ~Ts +Qj +~Qj--TQSi = Aj +Qj + /~Qj--TQSi The detailed algorithm performed by the service weights manager 9 is shown in Figure 4. The queue size Qj at the end of each interval Ts~ the nurnber of arrivals Aj during the previous inten,~al Ts~ and the change in queue size ~Qi are input at step 20. Step 21 ~etermines whether the queue growth is positive: if yes, the sel~ice weight Wj is conservatively adjusted to bring the queue size to TQSi at step 22; if no, the service weight Wj is adjusted to bring the queue si~e to TQSi at step 23. The difference i~W is deterrnined in step 24.
Step ~5 determines whether the shared weights pool is empty: if yes, Wi is set to min_Wi in step 26; if no, step 27 determines whether Ws 2 ~Wi: if yes, step 28 sets Wj =
min_Wj + AWi and Ws = Ws ~ ~Wj; if no, step 29 sets Wj= min_Wi ~ Ws and Ws = 0.
Step 30 runs through all the Wj in the ordered list L and step 31 updates the ~eight table used by the Weighted Fair Queuing scheduler 3.
The described technique complies with ITU and ATM Forum standards and can be applied to any switching equipment which supports more than a single service class of servlce.
The use of ATM by a continually increasing number of applications is driving a requirement to increase the number of service classes and to allow more flexibility in the service offerings To support the application requirements, the ATM Forum is adding new service categories in new releases of ATM specifications. Furtherrnore, network providers are looking for the flexibility of defining multiple service classes for a given service categorv. The service classes are differentiated by their Quality-Of-Service requirements (QoS). The QoS requirements are configurable in accordance ~,vith a bi-dimensional matrix describing loss and delay. The delay jitter is another factor which needs to be bounded for some service classes.
Previously~ three service categories were supported on an ATM network element, namely constant bit rate (CBR), variable bit rate (VBR) and unspecified bit rate (UBR) The CBR service is the only service that guarantees a bound on delay. It is used for time sensitive data~ such as voice and video.
These v arious services can be supported by traditional exhaustive round-robin queuing among two priority queues. However, this simple technique cannot be usedwhen the number of queues increases beyond two, because of the high potential ofstarvation for lo~-er priority queues. Furthermore, the exhaustive round robin can only guarantee bounds on delay and delay variation for the highest priority queue. The support of multiple service class in an ATM switching product or multiplexer requires a minimum of one queue per class.
A queue scheduling algorithm. Weighted Fair Queuing (WFQ), has been recently proposed in the literature (see S. Golestani, ~ self-clocked Fair Queuing scheme for broadband applications INFOCOM 1994. ~une 1994) 06~as/ss as:s3 F~g CA 02234621 1998-04-14 ~08 .. ~ 2 ~
l~is s~ n~ scheme allows any nLunber queues (ser~ice classes) to be 1.
senriced, while providmg f~ir a~d work conser~ng access to b~ndwidth One of the key features of WFQ is thdt the CDV (Cell Delay Variation) ~s boul.d~l for any sen~ice class, as long as it is giv~n a ...1..,.."-.., weight~
~ Thisplo~os~ scheme can be imple.. ,L d in ATM products. Howe~er, it has not been ~ f-~rrnin~d how to set the servicin~ wei~hts ~-ffi-jfntly to take into account the dyn~ ic~llly ~hs~nein~ bandwidth ~.~ c.-~ of each service class (COnn~t'Or addition/removal, ABR flow control, Early packet Discard).
An object of the inverLtion is to p~ovide a Lan.e~voll; that ensures that the wei~hts are set d~ u~;ately to ~ e the desired Quality of Ser~rice and modified in real-time to ensure that the dynarnic Allnc~ n of bandwidth across the classes is opLi~
ALcor~ g to the present invention there is provided a me~od of fair queue servicing at a queu ng point in a multi~service class packet :,wiL~ihed network, where~n in~ min~ packets are received in buffers and outgoing packets are scheduled by aweightedfairqueues~ d~-lPrclL~dL.~;~e~inthatrePl-time;llf.ill,.Aii-nofbufferusage alongwiththeln.. ~;.~.. ~,baIldwidth~ tisusedtody.,~.nieAllymodifythe weighi:s of the weighted f~ur queue 5f~h~ r so as to cause buf~er queue si e to move toward a ~r~f ~ .i.,~l target value.
Preferablythe...illi.~ ll.bandw~dthr~ .Lis~ tP-l duri~gco~,Lon ~r1rniccir~n control Ihe medlod is pal1icularly suitable for use in ATM r~tworks.
The DWF Q (D~c Weighted Fair Queuing) can be impl.omPn~rrl at any queuing point which cl~lJiLLa~3 senr~c~g between n queues (n>2).
The invention also provides a fair queue servic~ng ~ ">~ ~1 in a multi-serv~ce class packet switched rletwork, comr~c;n~ a weighted f~ir queuing controller, and buffer means for rece~vLllg ;nco~ n~ packets in queues, ~ LP. ;7e~1 m that fi~her c~ .. ,l., ;~P~ I
means for mor~itoril~g buffer usage for each queue, means for det. ~ninin~ the bandwidth reqUir~ of each class of ser~r~ce, and a service weights nn~ns~e~r for dyn~min~lly modifying ~e weights of said weîghted fair queuing con~oller means in response to said bufferusage and bandw~dth~i~4.ne.~
A~k~l~ED StlEET
CA 0223462l l998-04-l4 Preferably, the means for monitoring buffer usage a queue growth monitor which perforrns real-time ~?s1im~tion of the queue growth in said buffer means.
The invention will now be described in more detail~ by way of example only. withreference to the accompanying drawings, in which:-Figure 1 is a diagram depicting the high level queuing scheme at an ATM switch;
Figure ~ shows the inforrnation provided by the Queue Growth Monitor, Figure 3 illustrates the data flow between the key components of the system andthe action of the Service Weight Manager (SWM); and Figure 4 describes the process performed by the SWM.
Referring now to Figure 1, ATM cells 2 arrive at buffer 1 and are placed in queues 11,12,...1n From there the cells are passed to a weighted fair queuing unit 3. The buffer I
is also connected to a queue growth monitor 4, which in turn is connected to congestion control unit 5, congestion analyzer 6, and connection admission controller 8, which in turn is connected to SVC & PVC (Switched Virtual Circuit and Permanent Virtual Circuit) connection handling unit 7, and service class manager 10. Queue growth monitor 4, connection admission controller 8 and service class manager 9 are connected to service weights manager 9, which is connected to weighted fair queuing scheduler 3 The key element of the Dynamic Weighted Fair Queuing (DWFQ) scheme is the service weight manager (SWM) 9, which dynamically modifies the service weights to be used by the WFQ Scheduler 3 It uses real-time information from the service classmanager 10, the connection admission controller 8, and the Queue growth monitor 4.
The service class manager 10 configures the service classes. A service class is configured with a given value of delay (CTD - Cell Transfer Delay) and loss (CLR - Cell Ratio Loss) requirements. These parameters represent the maximum nodal delay and loss allowed in order to meet the end-to-end QoS requirements of the connection. The service classes are mapped into a priority table as exemplified in Table 1. The priority table is used later by the service weight manager to allocate rem~ining bandwidth. The priority table is updated when a service class definition is modified. The service class manager also dictates which traff1c descriptors are used to compute the miniml-m bandwidth required by a connection of a given class.
CTD
CLR 100 ~s 500 lls None 10-~ 4 7 9 Table I ~ Example of a Queue Service Priority Mapping.
The connection admission controller (CAC) 8 computes the miniml-m bandwidth required for each service class. The minimum bandwidth is updated each time a connection of a given class is established or discormected, based on its traffic descriptor.
Table 2 shows a typical example of which traffic descriptors that can be used tocompute the minimum bandwidth for each basic service category relative to the queue service rate (SR) The CAC 8 communicates the minimum Weight table to the SWM
every time the value of the minimum weights have changed by a factor of ~,.
Queue; Category min Wi Ql CBR (~ PCR) / SR
Q2 RT-VBR (~ SCR) / SR
Q3 NRT- (~ SCR) / SR
VBR
Table 2 ~ Example of minimum weight table The CTD is further taken into account in the target queue size (TQS) table, which is the maximum queue size allowed to limit the CTD An example of TQSi computation is shown in Table 3, for typical service categories A zero TQS indicates that the queue can grow without limitation This table is computed by the CAC.
Queuei Category TQSi Q I CBR CTD / min Wi Q2 RT-VBR CTD / min Wi VBR
Table 2 ~ Example of a target queue size computation.
The Queue Growth Monitor (QGM) 4 performs real-time çstim~tion of the queue growth every Ts cell slots (sampling interval~. The information provided by the Queue Growth monitor 4 to the SWM 9 consists of ~Qi, the Queue Growth Rate of output queue i during an interval of duration Ts, Qi, the length of output queue i at the sampling time, and Ai, the arrival rate during the same interval of time.
The corresponding parameters: queue size Qi, queue growth ~Qi, number of arrivals Ai are collected or each queue by the QGM 4 for each Ts interval. From these parameters, auxiliary parameters such as average arrival rate ~i and service rate ~Li can be -derived by the SWM 9:
: average arrival rate, ?~j = Aj Ts llj: average service rate, llj = Sj - Ts~ where Sj = Aj--~Qj is the number of cells served during Ts.
Figure 2 shows the information provided by the Queue Growth Monitor 4. Using this inforrnation for the CAC 8, the service class manager 9 and the queue growth monitor 4, the SWM computes the service eight for each queue i (Wj) to be used during the next sampling interval.
As can be seen in Figure 3~ which shows the data flow between the key components of the system and the action of the SWM 9, the queue weights. Wi, areupdated usin~ information provided by the Queue Growth monitor 4.
If ~ j denotes the arrival rate of cells in queue i in the coming Ts interval, then ideally, the target service rate l~ j can be calculated as: (~ } Ts = Qi--TQSj . This means at the end of ne~t Ts interval, the queue size Qi will reach the target queue size TQSi. On the assurnption that ~j remains 1~nr.h:~n~ed from ~j, the service weight W, = ~ T5 can be approxim:~tecl as W~ Ts--~j ~ T5 + Qi--TQSj = Aj + Qj--TQSi .
However, the assurnption on the stable arrival rate may not hold, and also the actual number of serviced cells Si could be less than Wi; therefore a more conservative approach is ~Qj > 0, then Qj+~Qj, the predicted queue size at the end of the next Ts interval, is used to calculate the target service rate and weight. That is:
Ts = Q~ + ~Q,--TQSj and Wj--~j ~Ts +Qj +~Qj--TQSi = Aj +Qj + /~Qj--TQSi The detailed algorithm performed by the service weights manager 9 is shown in Figure 4. The queue size Qj at the end of each interval Ts~ the nurnber of arrivals Aj during the previous inten,~al Ts~ and the change in queue size ~Qi are input at step 20. Step 21 ~etermines whether the queue growth is positive: if yes, the sel~ice weight Wj is conservatively adjusted to bring the queue size to TQSi at step 22; if no, the service weight Wj is adjusted to bring the queue si~e to TQSi at step 23. The difference i~W is deterrnined in step 24.
Step ~5 determines whether the shared weights pool is empty: if yes, Wi is set to min_Wi in step 26; if no, step 27 determines whether Ws 2 ~Wi: if yes, step 28 sets Wj =
min_Wj + AWi and Ws = Ws ~ ~Wj; if no, step 29 sets Wj= min_Wi ~ Ws and Ws = 0.
Step 30 runs through all the Wj in the ordered list L and step 31 updates the ~eight table used by the Weighted Fair Queuing scheduler 3.
The described technique complies with ITU and ATM Forum standards and can be applied to any switching equipment which supports more than a single service class of servlce.
Claims (5)
1. A method of fair queue servicing at a queuing point in a multi-service class packet switched network, wherein incoming packets are received in buffers and outgoing packets are scheduled by a weighted fair queue scheduler characterized in that real-timeinformation of buffer usage along with the minimum bandwidth requirement is used to dynamically modify the weights of the weighted fair queue scheduler so as to cause buffer queue size to move toward a predetermined target value.
2. A method as claimed in claim 1, the minimum bandwidth requirement is extracted during connection admission control.
3. A method as claimed in claim 1, characterized in that said weights are also modified in accordance with real-time service class information.
4. A method as claimed in claim 1, characterized in that buffer usage is monitored by a queue growth monitor, which performs real-time estimation of the queue growth every sampling interval T5.
5. A method as claimed in any of claims 1 to 4, wherein said packet switched network is an ATM network and said packets are ATM cells.
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
GB9520807.0 | 1995-10-11 | ||
GBGB9520807.0A GB9520807D0 (en) | 1995-10-11 | 1995-10-11 | Fair queue servicing using dynamic weights |
Publications (1)
Publication Number | Publication Date |
---|---|
CA2234621A1 true CA2234621A1 (en) | 1997-04-17 |
Family
ID=10782138
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CA002234621A Abandoned CA2234621A1 (en) | 1995-10-11 | 1996-10-11 | Fair queue servicing using dynamic weights (dwfq) |
Country Status (7)
Country | Link |
---|---|
US (2) | US6317416B1 (en) |
EP (1) | EP0872088B1 (en) |
AU (1) | AU7123596A (en) |
CA (1) | CA2234621A1 (en) |
DE (1) | DE69618010T2 (en) |
GB (1) | GB9520807D0 (en) |
WO (1) | WO1997014240A1 (en) |
Families Citing this family (87)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6850540B1 (en) * | 1999-10-28 | 2005-02-01 | Telefonaktiebolaget Lm Ericsson (Publ) | Packet scheduling in a communications system |
GB9520807D0 (en) * | 1995-10-11 | 1995-12-13 | Newbridge Networks Corp | Fair queue servicing using dynamic weights |
US6452933B1 (en) | 1997-02-07 | 2002-09-17 | Lucent Technologies Inc. | Fair queuing system with adaptive bandwidth redistribution |
FI970998A (en) * | 1997-03-10 | 1998-11-13 | Nokia Telecommunications Oy | Procedure for determining whether to allow a connection on a broadband network |
JP2968757B2 (en) | 1997-05-16 | 1999-11-02 | 日本電気株式会社 | ATM traffic rate control method |
CA2223118A1 (en) * | 1997-11-28 | 1999-05-28 | Newbridge Networks Corporation | Virtual path level fairness |
US6389019B1 (en) * | 1998-03-18 | 2002-05-14 | Nec Usa, Inc. | Time-based scheduler architecture and method for ATM networks |
US7466703B1 (en) * | 1998-05-01 | 2008-12-16 | Alcatel-Lucent Usa Inc. | Scalable high speed router apparatus |
EP1013036B1 (en) * | 1998-06-16 | 2010-02-17 | Alcatel Lucent | Digital traffic switch with credit-based buffer control |
US6714517B1 (en) * | 1998-11-10 | 2004-03-30 | Extreme Networks | Method and apparatus for interconnection of packet switches with guaranteed bandwidth |
GB9828142D0 (en) * | 1998-12-22 | 1999-02-17 | Power X Limited | Approximate state control mechanism |
US6498781B1 (en) | 1999-08-13 | 2002-12-24 | International Business Machines Corporation | Self-tuning link aggregation system |
US7054267B2 (en) * | 1999-09-10 | 2006-05-30 | Lucent Technologies Inc. | Method and apparatus for scheduling traffic to meet quality of service requirements in a communication network |
US7072295B1 (en) | 1999-09-15 | 2006-07-04 | Tellabs Operations, Inc. | Allocating network bandwidth |
WO2001020876A1 (en) * | 1999-09-15 | 2001-03-22 | Tellabs Operations, Inc. | Allocating network bandwidth |
US6480911B1 (en) * | 1999-09-23 | 2002-11-12 | At&T Corp. | Grouping class sensitive queues |
US6614440B1 (en) * | 1999-09-30 | 2003-09-02 | Microsoft Corporation | System and method for load balancing in a multi-channel graphics system |
US6438135B1 (en) * | 1999-10-21 | 2002-08-20 | Advanced Micro Devices, Inc. | Dynamic weighted round robin queuing |
JP2001156785A (en) * | 1999-11-26 | 2001-06-08 | Nec Corp | Cell abort avoidance system and method in buffer |
JP2001177575A (en) * | 1999-12-20 | 2001-06-29 | Nec Corp | Preferential control system |
US6434155B1 (en) * | 1999-12-22 | 2002-08-13 | Alcatel Usa Sourcing, L.P. | Weighted round robin engine used in scheduling the distribution of ATM cells |
US6999420B1 (en) * | 1999-12-30 | 2006-02-14 | At & T Corp. | Method and apparatus for an architecture and design of internet protocol quality of service provisioning |
US6775292B1 (en) * | 2000-01-24 | 2004-08-10 | Cisco Technology, Inc. | Method for servicing of multiple queues carrying voice over virtual circuits based on history |
KR100369562B1 (en) * | 2000-02-25 | 2003-01-30 | 학교법인 한국정보통신학원 | Emulated weighted fair queueing algorithm for high-speed integrated service networks and the scheduler therefor |
GB0007394D0 (en) | 2000-03-27 | 2000-05-17 | Nokia Networks Oy | Transmitting packet data |
TW488135B (en) * | 2000-03-31 | 2002-05-21 | Ibm | Method and system for controlling flows in sub-pipes of computer networks |
US7215678B1 (en) * | 2000-04-10 | 2007-05-08 | Switchcore, A.B. | Method and apparatus for distribution of bandwidth in a switch |
US6795870B1 (en) | 2000-04-13 | 2004-09-21 | International Business Machines Corporation | Method and system for network processor scheduler |
US6952424B1 (en) | 2000-04-13 | 2005-10-04 | International Business Machines Corporation | Method and system for network processor scheduling outputs using queueing |
US6862292B1 (en) | 2000-04-13 | 2005-03-01 | International Business Machines Corporation | Method and system for network processor scheduling outputs based on multiple calendars |
US7315901B1 (en) | 2000-04-13 | 2008-01-01 | International Business Machines Corporation | Method and system for network processor scheduling outputs using disconnect/reconnect flow queues |
US7142558B1 (en) | 2000-04-17 | 2006-11-28 | Cisco Technology, Inc. | Dynamic queuing control for variable throughput communication channels |
EP1284071B1 (en) | 2000-05-18 | 2007-07-11 | Xyratex Technology Limited | Apparatus and method for resource arbitration |
US7061861B1 (en) * | 2000-07-06 | 2006-06-13 | Broadband Royalty Corporation | Method and system for weighted fair flow control in an asynchronous metro packet transport ring network |
US6909722B1 (en) * | 2000-07-07 | 2005-06-21 | Qualcomm, Incorporated | Method and apparatus for proportionately multiplexing data streams onto one data stream |
US6990113B1 (en) * | 2000-09-08 | 2006-01-24 | Mitsubishi Electric Research Labs., Inc. | Adaptive-weighted packet scheduler for supporting premium service in a communications network |
US6766376B2 (en) | 2000-09-12 | 2004-07-20 | Sn Acquisition, L.L.C | Streaming media buffering system |
US6975638B1 (en) * | 2000-10-13 | 2005-12-13 | Force10 Networks, Inc. | Interleaved weighted fair queuing mechanism and system |
JP2004514324A (en) * | 2000-11-08 | 2004-05-13 | モトローラ・インコーポレイテッド | Service weight class adaptation method |
US20040062261A1 (en) * | 2001-02-07 | 2004-04-01 | Rami Zecharia | Multi-service segmentation and reassembly device having integrated scheduler and advanced multi-timing wheel shaper |
US6990115B2 (en) * | 2001-02-26 | 2006-01-24 | Seabridge Ltd. | Queue control method and system |
US7486686B2 (en) * | 2001-02-26 | 2009-02-03 | Vitesse Semiconductor Corporation | Method and apparatus for scheduling data on a medium |
US7016364B2 (en) * | 2001-05-04 | 2006-03-21 | Alcatel Canada Inc. | Power pooling in network downstream data transmission |
GB2381406A (en) * | 2001-10-24 | 2003-04-30 | Ipwireless Inc | Packet data queuing and processing |
CA2440236C (en) * | 2001-12-28 | 2008-02-12 | Nokia Corporation | Packet scheduling method and apparatus |
JP3828431B2 (en) * | 2002-01-31 | 2006-10-04 | 株式会社エヌ・ティ・ティ・ドコモ | Base station, control apparatus, communication system, and communication method |
US7362749B2 (en) * | 2002-03-01 | 2008-04-22 | Verizon Business Global Llc | Queuing closed loop congestion mechanism |
GB0207507D0 (en) * | 2002-03-28 | 2002-05-08 | Marconi Corp Plc | An apparatus for providing communications network resource |
FI20020673A0 (en) * | 2002-04-09 | 2002-04-09 | Nokia Corp | Timing real-time packet data |
JP3872716B2 (en) * | 2002-04-30 | 2007-01-24 | 富士通株式会社 | Packet output control device |
US7142513B2 (en) * | 2002-05-23 | 2006-11-28 | Yea-Li Sun | Method and multi-queue packet scheduling system for managing network packet traffic with minimum performance guarantees and maximum service rate control |
JP2004086177A (en) * | 2002-06-27 | 2004-03-18 | Brother Ind Ltd | Method of manufacturing polymer resin particles for toner |
US7301943B2 (en) * | 2002-07-31 | 2007-11-27 | Industrial Technology Research Institute | QoS-oriented burstification method supporting various grades of burstification delay guarantee |
US7263065B1 (en) * | 2002-08-30 | 2007-08-28 | At&T Corp. | Network having multiple QoS levels |
FI112421B (en) | 2002-10-29 | 2003-11-28 | Tellabs Oy | Method and device for time allocation of transmission connection capacity between packet switched data communication flows |
US20040100903A1 (en) * | 2002-11-25 | 2004-05-27 | Seung-Jae Han | Quality of service mechanisms for mobility access device |
US7782885B1 (en) * | 2002-12-10 | 2010-08-24 | Cisco Technology, Inc. | System and method for queue management using queue sets |
US7272658B1 (en) | 2003-02-13 | 2007-09-18 | Adobe Systems Incorporated | Real-time priority-based media communication |
US7257083B2 (en) * | 2003-06-25 | 2007-08-14 | Motorola, Inc. | Method and apparatus for policy-based dynamic preemptive scheduling of data transmissions |
US7373420B1 (en) * | 2003-08-01 | 2008-05-13 | Nortel Networks Limited | Method and apparatus for weighted fair queuing |
US7376083B2 (en) * | 2003-12-09 | 2008-05-20 | International Business Machines Corporation | Apparatus and method for modeling queueing systems with highly variable traffic arrival rates |
US7403488B2 (en) * | 2004-02-17 | 2008-07-22 | Mitsubishi Electric Research Labortories, Inc. | Scheduling packet flows in multi-rate wireless local area networks |
US7712102B2 (en) * | 2004-07-30 | 2010-05-04 | Hewlett-Packard Development Company, L.P. | System and method for dynamically configuring a plurality of load balancers in response to the analyzed performance data |
US7545815B2 (en) * | 2004-10-18 | 2009-06-09 | At&T Intellectual Property Ii, L.P. | Queueing technique for multiple sources and multiple priorities |
US7352752B2 (en) * | 2004-11-29 | 2008-04-01 | Agere Systems Inc. | Frame mapping scheduler with compressed mapping table |
US20060187934A1 (en) * | 2005-02-18 | 2006-08-24 | Jordan Lu | Method and apparatus for monitoring and improving performance of a queuing scheduler |
WO2006109131A2 (en) * | 2005-04-11 | 2006-10-19 | Nokia Corporation, | Method and apparatus to facilitate real-time packet scheduling in a wireless communications system |
US20070165647A1 (en) * | 2006-01-19 | 2007-07-19 | Tellabs Operations, Inc. | Apparatus, method, and computer program for data packet scheduling |
US20080091866A1 (en) * | 2006-10-12 | 2008-04-17 | International Business Machines Corporation | Maintaining forward progress in a shared L2 by detecting and breaking up requestor starvation |
US8681807B1 (en) | 2007-05-09 | 2014-03-25 | Marvell Israel (M.I.S.L) Ltd. | Method and apparatus for switch port memory allocation |
US7961878B2 (en) | 2007-10-15 | 2011-06-14 | Adobe Systems Incorporated | Imparting cryptographic information in network communications |
US8134924B2 (en) * | 2007-11-27 | 2012-03-13 | Qualcomm Incorporated | Methods and apparatus related to scheduling in a wireless communications system using shared air link resources for traffic |
US8045563B2 (en) | 2007-12-27 | 2011-10-25 | Cellco Partnership | Dynamically adjusted credit based round robin scheduler |
US8208406B1 (en) * | 2008-03-25 | 2012-06-26 | Juniper Networks, Inc. | Packet forwarding using feedback controlled weighted queues dynamically adjusted based on processor utilization |
US8325687B2 (en) * | 2008-05-09 | 2012-12-04 | Qualcomm Incorporated | Techniques for enhanced backhaul flow control |
US8051287B2 (en) | 2008-10-15 | 2011-11-01 | Adobe Systems Incorporated | Imparting real-time priority-based network communications in an encrypted communication session |
JP5304670B2 (en) * | 2010-01-25 | 2013-10-02 | 富士通株式会社 | Portable communication terminal device, short-range wireless communication control method, and short-range wireless communication control program |
EP2510780A1 (en) * | 2011-03-25 | 2012-10-17 | Syngenta Participations AG. | Novel squash plant for protected culture |
CN105075202B (en) | 2013-03-28 | 2019-07-12 | 英国电讯有限公司 | For handling method, node and the packet network of grouping in packet network |
GB201313760D0 (en) * | 2013-07-31 | 2013-09-18 | British Telecomm | Fast friendly start for a data flow |
KR101877595B1 (en) * | 2013-10-28 | 2018-07-12 | 주식회사 케이티 | METHOD FOR CONTROLLING QoS USING TRAFFIC PROCESSING BASED ON SERVICE |
CN106030031B (en) | 2013-12-06 | 2019-11-19 | 哈里伯顿能源服务公司 | Control shaft bottom sub-assembly follows the computer implemented method and system in planning pit shaft path |
CN107852372B (en) | 2015-08-06 | 2021-05-11 | 英国电讯有限公司 | Data packet network |
WO2017021046A1 (en) | 2015-08-06 | 2017-02-09 | British Telecommunications Public Limited Company | Data packet network |
US10182017B2 (en) | 2016-06-30 | 2019-01-15 | Mellanox Technologies Tlv Ltd. | Estimating multiple distinct-flow counts in parallel |
US10218642B2 (en) | 2017-03-27 | 2019-02-26 | Mellanox Technologies Tlv Ltd. | Switch arbitration based on distinct-flow counts |
US11558775B2 (en) | 2021-02-16 | 2023-01-17 | Juniper Networks, Inc. | Determining rate differential weighted fair output queue scheduling for a network device |
Family Cites Families (19)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5179557A (en) * | 1989-07-04 | 1993-01-12 | Kabushiki Kaisha Toshiba | Data packet communication system in which data packet transmittal is prioritized with queues having respective assigned priorities and frequency weighted counting of queue wait time |
US5231633A (en) * | 1990-07-11 | 1993-07-27 | Codex Corporation | Method for prioritizing, selectively discarding, and multiplexing differing traffic type fast packets |
US5335224A (en) * | 1992-06-30 | 1994-08-02 | At&T Bell Laboratories | Service guarantees/congestion control in high speed networks |
NL9201668A (en) * | 1992-09-25 | 1994-04-18 | Nederland Ptt | Method for converting a polling frequency table into a polling sequence table. |
CA2104753C (en) * | 1992-10-29 | 1999-02-16 | Kotikalapudi Sriram | Bandwidth allocation, transmission scheduling, and congestion avoidance in broadband atm networks |
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 |
US5517495A (en) * | 1994-12-06 | 1996-05-14 | At&T Corp. | Fair prioritized scheduling in an input-buffered switch |
JP3434642B2 (en) * | 1995-07-07 | 2003-08-11 | 株式会社東芝 | Packet scheduling device |
GB9520807D0 (en) * | 1995-10-11 | 1995-12-13 | Newbridge Networks Corp | Fair queue servicing using dynamic weights |
DE19548985A1 (en) * | 1995-12-28 | 1997-07-03 | Siemens Ag | Method for prioritizing cell streams in systems that transmit information according to an asynchronous transfer mode (ATM) |
US6377583B1 (en) * | 1996-06-27 | 2002-04-23 | Xerox Corporation | Rate shaping in per-flow output queued routing mechanisms for unspecified bit rate service |
US6452933B1 (en) * | 1997-02-07 | 2002-09-17 | Lucent Technologies Inc. | Fair queuing system with adaptive bandwidth redistribution |
US6014367A (en) * | 1997-04-25 | 2000-01-11 | Mmc Networks, Inc | Method for weighted fair queuing for ATM cell scheduling |
US6721325B1 (en) * | 1998-04-23 | 2004-04-13 | Alcatel Canada Inc. | Fair share scheduling of multiple service classes with prioritized shaping |
US6501762B1 (en) * | 1999-04-21 | 2002-12-31 | Nortel Networks Limited | Scheduler implementing weighted fair queuing by a weight limited first in-first out methodology |
KR100343935B1 (en) * | 2000-10-09 | 2002-07-20 | 주식회사 하이닉스반도체 | Dbwrr cell scheduling device and method thereof in imt-2000 atm switch |
US7155716B2 (en) * | 2002-03-08 | 2006-12-26 | Intel Corporation | Weighted and prioritized task scheduler |
US20040151197A1 (en) * | 2002-10-21 | 2004-08-05 | Hui Ronald Chi-Chun | Priority queue architecture for supporting per flow queuing and multiple ports |
US20050047415A1 (en) * | 2003-08-28 | 2005-03-03 | Radhakrishna Channegowda | Data traffic manager and method therefor |
-
1995
- 1995-10-11 GB GBGB9520807.0A patent/GB9520807D0/en active Pending
-
1996
- 1996-10-11 AU AU71235/96A patent/AU7123596A/en not_active Abandoned
- 1996-10-11 EP EP96932416A patent/EP0872088B1/en not_active Expired - Lifetime
- 1996-10-11 CA CA002234621A patent/CA2234621A1/en not_active Abandoned
- 1996-10-11 WO PCT/CA1996/000681 patent/WO1997014240A1/en active IP Right Grant
- 1996-10-11 US US09/051,294 patent/US6317416B1/en not_active Expired - Lifetime
- 1996-10-11 DE DE69618010T patent/DE69618010T2/en not_active Expired - Lifetime
-
2001
- 2001-10-29 US US09/984,302 patent/US7023866B2/en not_active Expired - Lifetime
Also Published As
Publication number | Publication date |
---|---|
DE69618010T2 (en) | 2002-08-22 |
US6317416B1 (en) | 2001-11-13 |
WO1997014240A1 (en) | 1997-04-17 |
US20020044529A1 (en) | 2002-04-18 |
AU7123596A (en) | 1997-04-30 |
GB9520807D0 (en) | 1995-12-13 |
EP0872088B1 (en) | 2001-12-12 |
US7023866B2 (en) | 2006-04-04 |
EP0872088A1 (en) | 1998-10-21 |
DE69618010D1 (en) | 2002-01-24 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CA2234621A1 (en) | Fair queue servicing using dynamic weights (dwfq) | |
US5862126A (en) | Connection admission control for ATM networks | |
EP0901301B1 (en) | Dynamic rate control scheduler for ATM networks | |
US5917804A (en) | Connection admission control for ATM networks handling CBR and VBR services | |
US5999534A (en) | Method and apparatus for scheduling cells for use in a static priority scheduler | |
US6324165B1 (en) | Large capacity, multiclass core ATM switch architecture | |
US5850399A (en) | Hierarchical packet scheduling method and apparatus | |
Duffield et al. | On adaptive bandwidth sharing with rate guarantees | |
Chao et al. | A new QoS-guaranteed cell discarding strategy: self-calibrating pushout | |
Ahmed et al. | Systems approach to modeling the token bucket algorithm in computer networks | |
Vickers et al. | Congestion control and resource management in diverse ATM environments | |
EP2063580A1 (en) | Low complexity scheduler with generalized processor sharing GPS like scheduling performance | |
Chiussi et al. | Providing QoS guarantees in packet switches | |
Saran et al. | A scheduling discipline and admission control policy for Xunet 2 | |
Duan et al. | Resource allocation for quality of service provision in buffered crossbar switches | |
Peha | Scheduling and admission control for integrated-services networks: The priority token bank | |
KR100221324B1 (en) | Apparatus and method of dynamic priority queueing discipline using the per-session frame defined by the synchronus counter operation in atm networks | |
Katevenis et al. | Multi-queue management and scheduling for improved QoS in communication networks | |
Jain | A survey of scheduling methods | |
Hou et al. | Service disciplines for guaranteed performance service | |
Chiou et al. | DMGFQ: a novel traffic scheduler with differentiated QoS guarantee for Internet multimedia services | |
KR100191257B1 (en) | Apparatus for real-time queue service discipline using virtual clock algorithm in atm networks | |
Chen et al. | Traffic control approaches for voice over ATM networks | |
Burakowski et al. | BETTER: handling best effort traffic in the ATM networks | |
Fan et al. | Real-time video applications over ABR using FASTRAC-a rate control algorithm |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
EEER | Examination request | ||
FZDE | Discontinued |