Factbites
 Where results make sense
About us   |   Why use us?   |   Reviews   |   PR   |   Contact us  

Topic: Deficit round robin DRR


Related Topics

In the News (Sat 2 Jun 12)

  
  Weighted round robin - Wikipedia, the free encyclopedia
Weighted round robin (WRR) is a best-effort connection scheduling discipline.
Another problem with WRR is that in a scale of one round WRR doesn't provide fair link sharing.
There's a modified version of WRR called deficit round robin (DRR) which is able to properly handle packets of different size without knowing their mean size of each connection in advance.
en.wikipedia.org /wiki/Weighted_round_robin   (250 words)

  
 Weighted Round Robin -- Recommendations and Resources   (Site not responding. Last check: 2007-10-29)
Round robin has the great advantage of the fact that it is easy to implement in software.
Deficit round robin (DRR), also deficit weighted round robin (DWRR), is a modified weighted round robin scheduling discipline.
WRR serves every nonempty queue whereas DRR serves packets at the head of every nonempty queue which ''deficit counter'' is greater than the packet's size.
www.becomingapediatrician.com /health/170/weighted-round-robin.html   (991 words)

  
 On the Latency Bound of Deficit Round Robin - Kanhere, Sethu (ResearchIndex)   (Site not responding. Last check: 2007-10-29)
On the Latency Bound of Deficit Round Robin - Kanhere, Sethu (ResearchIndex)
On the Latency Bound of Deficit Round Robin (2002)
Deficit Round Robin (DRR), a popular fair scheduling discipline, is very efficient with an O(1) dequeuing complexity.
citeseer.ist.psu.edu /568592.html   (467 words)

  
 [No title]
This scheme is a combination of the distributed deficit round robin scheme together with its centralized counterpart.
Keywords: Contention free period, Deficit round robin, Distributed deficit round robin, Fair queueing, Medium access control, Point coordinator, Wireless local area network Introduction There is an increasing demand for wireless multimedia networks due to the attractiveness of providing network services to communicate using any type of media without any geographical restrictions.
The DRR service discipline does not give services to the ith queue until the value of DCi is greater than or equal to X, length of the next packet waiting for service in the ith queue.
www.cs.caltech.edu /~lachlan/abstract/wlan_mmt99.doc   (4410 words)

  
 Deficit Round Robin   (Site not responding. Last check: 2007-10-29)
Deficit Round-Robin (DRR) modifies WRR to allow it to handle variable packet sizes without knowing the mean packet size of each connection in advance [
The packet at the head of the queue is served if it is not larger than the quantum size.
If the scheduler visits a connection such that the sum of the connection's deficit counter and the quantum is larger than or equal to the size of the packet at the head of the queue, the packet at the head of the queue is served, and the deficit counter is reduced by the packet size.
www.ee.ust.hk /~heixj/publication/thesis/node23.html   (168 words)

  
 On the Latency Bound of Pre-Order Deficit Round Robin - Kanhere, Sethu (ResearchIndex)   (Site not responding. Last check: 2007-10-29)
On the Latency Bound of Pre-Order Deficit Round Robin - Kanhere, Sethu (ResearchIndex)
On the Latency Bound of Pre-Order Deficit Round Robin (2002)
Kanhere, H. Sethu, On the latency bound of pre-order deficit round robin, in: Proceedings of the IEEE Conference on Local Computer Networks, Tampa, FL, 2002, pp.
citeseer.ist.psu.edu /562150.html   (411 words)

  
 9.7 Differential Queueing
The implementation of Fair Queueing that we are using is Deficit Round Robin (DRR).
The important point to understand from this example is that, although the DRR queue did what it was supposed to, namely divide the outgoing link bandwidth, it was insufficient for the types of service that we required.
RIP requires predominately low loss, it is important that a packet arrives at the destination in the order of 100s; clearly in most cases the end-to-end delay is unlikely to be this high.
dreeve.org /thesis/node72.html   (1614 words)

  
 Hierachical token bucket
Most CBQ implementations use deficit round-robin (DRR) [4] in which excess bandwidth is distributed according to the weight parameters specified.
When class oscilates between being and not being regulated it is often skipped in DRR loop and it loses it's quantum.
The simple solution is to change DRR to use separate deficit and active class pointer for each borrowing level.
luxik.cdi.cz /~devik/qos/htb/old/htbtheory.htm   (1471 words)

  
 sapra
Drop (FRED), Deficit Round Robin (DRR) and CSFQ queueing mechanisms.
The latter guarantees a minimum number of buffers for each flow, having a better performance than FRED-1 when there is a high number of flows.
SAPRA and all these mechanisms, with the exception of DRR, use first-in-first-out scheduling.
eden.dei.uc.pt /~pmendes/sapra/sapracomp.html   (311 words)

  
 7. Queue Management and Packet Scheduling   (Site not responding. Last check: 2007-10-29)
Buffer management refers to any particular discipline used to regulate the occupancy of a particular queue.
At present, support is included for drop-tail (FIFO) queueing, RED buffer management, CBQ (including a priority and round-robin scheduler), and variants of Fair Queueing including, Fair Queueing (FQ), Stochastic Fair Queueing (SFQ), and Deficit Round-Robin (DRR).
In the common case where a delay element is downstream from a queue, the queue may be blocked until it is re-enabled by its downstream neighbor.
www-rp.lip6.fr /~ridoux/Docs/Manuel-NS2/node63.html   (180 words)

  
 Scout IP Router
Our main objective is to understand how Scout paths map onto traffic flows, and how Scout's scheduling mechanism can be used to schedule packets according to a network reservation.
The router functions and supports the DRR and VC scheduling algorithms.
Flow reservations are made "off-line." An implementation of RSVP is in progress.
www.cs.arizona.edu /scout/ip.html   (258 words)

  
 DRR (Deficit Round Robin)   (Site not responding. Last check: 2007-10-29)
Could somebody help me to understand what is going on?
Next by Date: Re: DRR (Deficit Round Robin)
Next by thread: Re: DRR (Deficit Round Robin)
www.isi.edu /nsnam/archive/ns-users/webarch/1999/msg02129.html   (108 words)

  
 9.8 Conclusion   (Site not responding. Last check: 2007-10-29)
We used this set of tests as a base line comparison.
Next we changed the queueing discipline to a variant of Fair Queueing (FQ) called Deficit Round Robin (DRR).
We found that this did behave as it was designed, namely it correctly shared the outgoing link to a number of classes.
dreeve.org /thesis/node73.html   (248 words)

  
 RFC3247
A class-based WF2Q scheduler, in which all EF traffic shares a single queue with the weight corresponding to the configured rate of the EF aggregate satisfies the EF definition with the latency term E = MTU/C+MTU/R. Deficit Round Robin (DRR)
For DRR [12], E can be shown to grow linearly with N*(r_max/r_min)*MTU, where r_min and r_max denote the smallest and the largest rate among the rate assignments of all queues in the scheduler, and N is the number of queues in the scheduler.
For Start-Time Fair Queuing (SFQ) [9] and Self-Clocked Fair Queuing (SCFQ) [8] E can be shown to grow linearly with the number of queues in the scheduler.
www.scit.wlv.ac.uk /rfc/rfc32xx/RFC3247.html   (6425 words)

  
 Network Simulator   (Site not responding. Last check: 2007-10-29)
Ns-2 provides substantial support for the simulation of TCP, routing, and multicast protocols.
At present, support is included for Drop-Tail queueing, RED buffer management, CBQ (including a priority and round-robin scheduler), and variants of Fair Queueing including, Fair Queueing (FQ), Stochastic Fair Queueing (SFQ), and Deficit Round-Robin (DRR)
All simulations in this thesis are carried out in this simulator, in particular, the EDF scheduler and its newly-built variants that are also developed in ns-2.
www.ee.ust.hk /~heixj/publication/thesis/node48.html   (185 words)

  
 Baw's Presentations   (Site not responding. Last check: 2007-10-29)
Presentation covers the InterConnection Network Simulator (ICNS), the Gemini Optical-Electrical Dual Network, the various protocols developed for the Gemini Network, and the Distributed Deficit Round Robin (dDRR) fair scheduler.
This presentation is supplemented by the DRR-dDRR Slide Show.
This slide show briefly shows how Deficit Round Robin (DRR) works, and then shows how the Distributed Deficit Round Robin (dDRR) works using comparable input.
www.bawchng.com /PRESENTATIONS   (88 words)

  
 SoftPerfect Research Forum :: SoftPerfect Bandwidth Manager :: Overbooking
Options: Reply To This Message Quote This Message
In this case these users will have to share the link speed in accordance with the Deficit Round Robin (DRR) algorithm.
This means if all the users are downloading a file at the same time, each will get ~16 Kb (100 divided by 6).
www.softperfect.com /board/read.php?7,646   (108 words)

Try your search on: Qwika (all wikis)

Factbites
  About us   |   Why use us?   |   Reviews   |   Press   |   Contact us  
Copyright © 2005-2007 www.factbites.com Usage implies agreement with terms.