標題: Pre-order Deficit Round Robin: a new scheduling algorithm for packet-switched networks
作者: Tsao, SC
Lin, YD
資訊工程學系
Department of Computer Science
關鍵字: packet scheduling;fair queueing;round robin;deficit
公開日期: 1-二月-2001
摘要: 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 in a 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.
URI: http://dx.doi.org/10.1016/S1389-1286(00)00172-9
http://hdl.handle.net/11536/29872
ISSN: 1389-1286
DOI: 10.1016/S1389-1286(00)00172-9
期刊: COMPUTER NETWORKS-THE INTERNATIONAL JOURNAL OF COMPUTER AND TELECOMMUNICATIONS NETWORKING
Volume: 35
Issue: 2-3
起始頁: 287
結束頁: 305
顯示於類別:期刊論文


文件中的檔案:

  1. 000166486200010.pdf