Hierarchical packet fair queueing algorithms

Hierarchical Packet Fair Queueing (H-PFQ) algorithms have the potential to simultaneously support guaranteed real-time service, rate-adaptive best-effort, and controlled link-sharing service. In this paper, we design practical H-PFQ algorithms by using one-level Packet Fair Queueing (PFQ) servers as basic building blocks, and develop techniques to analyze delay and fairness properties of the resulted H-PFQ servers. We demonstrate that, in order to provide tight delay bounds in a H-PFQ server, it is essential for the one-level PFQ servers to have small Worst-case Fair Indices (WFI). We propose a new one-level PFQ algorithm called WF2Q+ that is the first to have all the following three properties: (a) providing the tightest delay bound among all PFQ algorithms; (b) having the smallest WFI among all PFQ algorithms; and (c) having a relatively low implementation complexity of O(log N). We show that practical H-PFQ algorithms can be implemented by using WF2Q+ as the basic building block and prove that the resulting H-WF2Q+ algorithms provide similar delay bounds and bandwidth distribution as those provided by a H-GPS server. Simulation experiments are presented to evaluate the proposed algorithm.

[1]  R. Varga,et al.  Proof of Theorem 1 , 1983 .

[2]  J. Turner,et al.  New directions in communications (or which way to the information age?) , 1986, IEEE Communications Magazine.

[3]  Scott Shenker,et al.  Analysis and simulation of a fair queueing algorithm , 1989, SIGCOMM 1989.

[4]  Dinesh C. Verma,et al.  A Scheme for Real-Time Channel Establishment in Wide-Area Networks , 1990, IEEE J. Sel. Areas Commun..

[5]  James R. Davin,et al.  A simulation study of fair queueing and policy enforcement , 1990, CCRV.

[6]  Paul E. McKenney,et al.  Stochastic fairness queueing , 1990, Proceedings. IEEE INFOCOM '90: Ninth Annual Joint Conference of the IEEE Computer and Communications Societies@m_The Multiple Facets of Integration.

[7]  Srinivasan Keshav,et al.  Comparison of rate-based service disciplines , 1991, SIGCOMM '91.

[8]  ZhangHui,et al.  Comparison of rate-based service disciplines , 1991 .

[9]  David Clark,et al.  Supporting Real-Time Applications in an Integrated Services Packet Network: Architecture and Mechanism , 1992, SIGCOMM.

[10]  Rene L. Cruz,et al.  Service Burstiness and Dynamic Burstiness Measures: A Framework , 1992, J. High Speed Networks.

[11]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the single-node case , 1993, TNET.

[12]  S. Jamaloddin Golestani,et al.  A self-clocked fair queueing scheme for broadband applications , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[13]  O. Ndiaye.  An Efficient Implementation of a Hierarchical Weighted Fair Queue Packet Scheduler , 1994 .

[14]  Scott Shenker,et al.  Making Greed Work in Networks: A Game-Theoretic Analysis of Switch Service Disciplines , 1994, SIGCOMM.

[15]  Van Jacobson,et al.  Link-sharing and resource management models for packet networks , 1995, TNET.

[16]  G. Varghese.  Ecient F Air Queuing Using Decit round Robin , 1995 .

[17]  Anujan Varma,et al.  FRAME-BASED FAIR QUEUEING: A NEW TRAFFIC SCHEDULING ALGORITHM FOR PACKET-SWITCHED NETWORKS , 1995 .

[18]  Ion Stoica,et al.  Earliest Eligible Virtual Deadline First : A Flexible and Accurate Mechanism for Proportional Share Resource Allocation , 1995 .

[19]  Eecient Fair Queuing Using Deecit round Robin , 1995 .

[20]  Anujan Varma,et al.  Latency-rate servers: a general model for analysis of traffic scheduling algorithms , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[21]  QueueingJon,et al.  WF 2 Q : Worst-case Fair Weighted Fair , 1996 .

[22]  Hui Zhang,et al.  WF/sup 2/Q: worst-case fair weighted fair queueing , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[23]  Harrick M. Vin,et al.  Determining end-to-end delay bounds in heterogeneous networks , 1997, Multimedia Systems.