Catalogo Articoli (Spogli Riviste)

OPAC HELP

Titolo:
Pre-order Deficit Round Robin: a new scheduling algorithm for packet-switched networks
Autore:
Tsao, SC; Lin, YD;
Indirizzi:
Natl Chiao Tung Univ, Dept Comp & Informat Sci, Hsinchu 30050, Taiwan NatlChiao Tung Univ Hsinchu Taiwan 30050 mat Sci, Hsinchu 30050, Taiwan Chunghwa Telecom Co Ltd, Telecommun Labs, Taoyuan, Taiwan Chunghwa TelecomCo Ltd Taoyuan Taiwan Telecommun Labs, Taoyuan, Taiwan
Titolo Testata:
COMPUTER NETWORKS-THE INTERNATIONAL JOURNAL OF COMPUTER AND TELECOMMUNICATIONS NETWORKING
fascicolo: 2-3, volume: 35, anno: 2001,
pagine: 287 - 305
SICI:
1389-1286(200102)35:2-3<287:PDRRAN>2.0.ZU;2-7
Fonte:
ISI
Lingua:
ENG
Soggetto:
EFFICIENT;
Keywords:
packet scheduling; fair queueing; round robin; deficit;
Tipo documento:
Article
Natura:
Periodico
Settore Disciplinare:
Engineering, Computing & Technology
Citazioni:
14
Recensione:
Indirizzi per estratti:
Indirizzo: Lin, YD Natl Chiao Tung Univ, Dept Comp & Informat Sci, 1001 Ta Hsueh Rd, Hsinchu 30050, Taiwan Natl Chiao Tung Univ 1001 Ta Hsueh Rd Hsinchu Taiwan30050 Taiwan
Citazione:
S.C. Tsao e Y.D. Lin, "Pre-order Deficit Round Robin: a new scheduling algorithm for packet-switched networks", COMPUT NET, 35(2-3), 2001, pp. 287-305

Abstract

In recent years, many packet fair queueing algorithms have been proposed to approximate generalized processor sharing (GPS). Most of them provide a low end-to-end delay bound and ensure that all connections share the link ina fair manner. However, scalability and simplicity are two significant issues in practice. Deficit Round Robin (DRR) requires only O(1) work to process a packet and is simple enough to be implemented in hardware. However, its large latency and unfair behavior are not tolerated. In this work, a new scheme, Pre-order Deficit Round Robin, is described, which overcomes the problems of DRR. A limited number, Z, of priority queues are placed behind the DRR structure to reorder the transmission sequence to approximate packet by packet generalized processor sharing (PGPS). We provide an analysis on latency and fairness, which shows our scheme as a better alternative to DRR. In most cases PDRR has a per-packet time complexity of O(1), and O(log Z) in other specific cases. Simulation results are also provided to further illustrate its average behavior. (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 23/01/20 alle ore 12:58:12