On the Efficient Implementation of Fair Queueing

The performance of packet switched data networks is greatly influenced by the queue service discipline in routers and switches. In particular, the Fair Queueing discipline [1] has several advantages over the traditional first-come-first-served discipline. This paper studies data structures and algorithms for the efficient implementation of Fair Queueing. We present a novel performance evaluation methodology and use it to evaluate the relative merits of several alternate implementations.

[1]  Jon Postel,et al.  Transmission Control Protocol , 1981, RFC.

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

[3]  V. Jacobson,et al.  Congestion avoidance and control , 1988, CCRV.

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

[5]  Srinivasan Keshav,et al.  REAL: A Network Simulator , 1988 .

[6]  Scott Shenker,et al.  A theoretical analysis of feedback flow control , 1990, SIGCOMM '90.

[7]  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.

[8]  Scott Shenker.  Making greed work in networks: a game-theoretic analysis of gateway service disciplines , 1990, SIGMETRICS '90.

[9]  Raj Jain,et al.  A comparison of hashing schemes for address lookup in computer networks , 1992, IEEE Trans. Commun..

[10]  Ellis Horowitz,et al.  Fundamentals of Data Structures , 1984 .