Catalogo Articoli (Spogli Riviste)

OPAC HELP

Titolo:
Enhanced weighted round robin schedulers for accurate bandwidth distribution in packet networks
Autore:
Francini, A; Chiussi, FM; Clancy, RT; Drucker, KD; Idirene, NE;
Indirizzi:
Lucent Technol, Bell Labs, Holmdel, NJ 07733 USA Lucent Technol Holmdel NJ USA 07733 nol, Bell Labs, Holmdel, NJ 07733 USA
Titolo Testata:
COMPUTER NETWORKS-THE INTERNATIONAL JOURNAL OF COMPUTER AND TELECOMMUNICATIONS NETWORKING
fascicolo: 5, volume: 37, anno: 2001,
pagine: 561 - 578
SICI:
1389-1286(20011122)37:5<561:EWRRSF>2.0.ZU;2-2
Fonte:
ISI
Lingua:
ENG
Soggetto:
ALGORITHMS;
Keywords:
packet scheduling; packet switching; quality of service; differentiated services; multi-protocol label switching; best effort;
Tipo documento:
Article
Natura:
Periodico
Settore Disciplinare:
Engineering, Computing & Technology
Citazioni:
29
Recensione:
Indirizzi per estratti:
Indirizzo: Francini, A Lucent Technol, Bell Labs, Holmdel, NJ 07733 USA Lucent Technol Holmdel NJ USA 07733 bs, Holmdel, NJ 07733 USA
Citazione:
A. Francini et al., "Enhanced weighted round robin schedulers for accurate bandwidth distribution in packet networks", COMPUT NET, 37(5), 2001, pp. 561-578

Abstract

Weighted round robin (WRR) schedulers constitute a popular solution for differentiating the bandwidth guarantees of heterogeneous IP flows, mostly because of their minimal implementation cost. However, the existing WRR schedulers are not sufficient to satisfy all the requirements of emerging quality-of-service frameworks. Flexible bandwidth management at the network nodesrequires the deployment of hierarchical scheduling structures, where bandwidth can be allocated not only to individual flows, but also to aggregations of those flows. With currently available WRR schedulers, the superimposition of a hierarchical structure compromises the simplicity of the basic scheduler. WRR schedulers are also known for their burstiness in distributing service, which exposes the scheduled flows to higher packet-loss probability at downstream nodes. By construction, WRR schedulers distribute bandwidthproportionally to the service shares allocated to the individual flows. For best-effort (BE) flows, having no specified bandwidth requirements, existing WRR schedulers typically allocate arbitrary service shares. This approach conflicts with the intrinsic nature of BE flows and reduces the availability of bandwidth for the allocation of guaranteed-bandwidth (GB) flows. Wepresent three enhancements for WRR schedulers that solve these problems. In the first enhancement, we superimpose a "soft" scheduling layer on the basic WRR scheduler by simply redefining the computation of the flow timestamps. The second enhancement substantially reduces the service burstiness of the WRR scheduler with only marginal impact on its implementation cost. Finally, the third enhancement allows the smooth integration of GB and BE flows. with efficient management of the available bandwidth and total compliance with the nature of BE flows. (C) 2001 Elsevier Science B.V. All rights reserved.

ASDD Area Sistemi Dipartimentali e Documentali, Università di Bologna, Catalogo delle riviste ed altri periodici
Documento generato il 22/01/20 alle ore 09:30:06