|
|
| Line 1: |
Line 1: |
| {{sources|date=May 2013}}
| | Eusebio is the name persons use to call me and my friends and I think [http://www.Dict.cc/englisch-deutsch/it%27s+sounds.html it's sounds] quite good when you say it. I used to be unemployed yet still now I am a huge cashier. My house is now in South Carolina yet I don't plan using changing it. It's not a common item but what I desire doing is bottle best collecting and now My family and i have time to think about on new things. I'm not awesome at webdesign but retailers . want to check the actual website: http://circuspartypanama.com<br><br> |
|
| |
|
| '''Weighted [[Round-robin scheduling|round robin]]''' ('''WRR''') is a [[scheduling discipline]]. Each packet [[flow (computer networking)|flow]] or connection has its own packet queue in a [[network interface card]]. It is the simplest approximation of [[generalized processor sharing]] (GPS). While GPS serves infinitesimal amounts of data from each nonempty queue, WRR serves a number of [[packet (information technology)|packet]]s for each nonempty queue: <math>number = normalized( weight / mean packet size )</math>.
| | my webpage [http://circuspartypanama.com hack clash of clans] |
| | |
| == Algorithm ==
| |
| | |
| WRR mechanism (pseudo-code):
| |
| | |
| // calculate number of packets to be served each round by connections
| |
|
| |
| for each flow f
| |
| f.normalized_weight = f.weight / f.mean_packet_size
| |
|
| |
| min = findSmallestNormalizedWeight
| |
|
| |
| for each flow f
| |
| f.packets_to_be_served = f.normalized_weight / min
| |
|
| |
| // main loop
| |
| loop
| |
| for each non-empty flow queue f
| |
| min(f.packets_to_be_served, f.packets_waiting).times do
| |
| servePacket f.getPacket
| |
| | |
| == Limitations and Improvements ==
| |
| | |
| WRR for network packet scheduling was first proposed by Katevenis, Sidiropoulos and Courcoubetis in 1991, specifically for scheduling in ATM networks using fixed size packets (cells). In the more general case of [[IP network]]s with variable size packets, in order to approximate GPS the weight factors must be normalized. That requires estimation of the mean packet size, which makes a good GPS approximation hard to achieve in practice with WRR.
| |
| | |
| [[Deficit round robin]] is a later variation of WRR that achieves better GPS approximation without knowing the mean packet size of each connection in advance. More effective scheduling disciplines were also introduced which handle the limitations mentioned above (e.g. [[weighted fair queuing]]).
| |
| | |
| ==References==
| |
| Manolis Katevenis, Stefanos Sidiropoulos, Costas Courcoubetis, "[http://ieeexplore.ieee.org/xpl/login.jsp?tp=&arnumber=105173&url=http%3A%2F%2Fieeexplore.ieee.org%2Fxpls%2Fabs_all.jsp%3Farnumber%3D105173 Weighted round-robin cell multiplexing in a general-purpose ATM switch chip]", IEEE Journal on Selected Areas in Communications, (Vol. 9, Issue:8), October 1991[[Category:Scheduling algorithms]]
| |
Eusebio is the name persons use to call me and my friends and I think it's sounds quite good when you say it. I used to be unemployed yet still now I am a huge cashier. My house is now in South Carolina yet I don't plan using changing it. It's not a common item but what I desire doing is bottle best collecting and now My family and i have time to think about on new things. I'm not awesome at webdesign but retailers . want to check the actual website: http://circuspartypanama.com
my webpage hack clash of clans