Stochastic delay bounds of fair queuing policies by analyzing weighted round robin-related policies

We propose to apply the stochastic comparison method to evaluate the delay characteristics of generalized processor sharing (GPS)-related fair queuing (FQ) policies in a stochastic setting. These policies have complex dynamics, and their delays are evaluated through deterministic worst-case bounds under the leaky bucket-constrained traffics. Our approach consists to define "bounding" weighted round robin (WRR)-related policies for some GPS-related policies: under the same arrival process, the departure instants under the bounding policy are later or equal to the departure instants under the FQ policy for each cell. This sample-path comparison allows us to establish the stochastic comparison of delay distributions in the strong stochastic ordering sense. By defining WRR-related policies as bounding policies, we are able to carry out the Markovian analysis. Since our approach lets us to take into account explicitly the arrival process, the proposed bounds give more insight on delay characteristics than the deterministic bounds.

[1]  Ward Whitt,et al.  Comparison methods for queues and other stochastic models , 1986 .

[2]  Nihal Pekergin.  Stochastic bounds on delays of fair queueing algorithms , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[3]  D. Stiliadis,et al.  Rate-proportional servers: a design methodology for fair queueing algorithms , 1998, TNET.

[4]  Daniel P. Heyman,et al.  Further comparisons of direct methods for computing stationary distributions of Markov chains , 1987 .

[5]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks-the multiple node case , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.

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

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

[8]  N. L. Lawrie,et al.  Comparison Methods for Queues and Other Stochastic Models , 1984 .

[9]  George Varghese,et al.  Efficient fair queueing using deficit round-robin , 1996, TNET.

[10]  Hui Zhang,et al.  High speed, scalable, and accurate implementation of packet fair queueing algorithms in ATM networks , 1997, Proceedings 1997 International Conference on Network Protocols.

[11]  Harrick M. Vin,et al.  Generalized guaranteed rate scheduling algorithms: a framework , 1997, TNET.

[12]  F. M. Chiussi,et al.  Implementing fair queueing in ATM switches. I. A practical methodology for the analysis of delay bounds , 1997, GLOBECOM 97. IEEE Global Telecommunications Conference. Conference Record.