Stochastic bounds on delays of fair queueing algorithms

Proceedings - IEEE INFOCOM

Volumn 3, Issue , 1999, Pages 1212-1219

  Pekergin, Nihal ^a,b  

^a LABORATOIRE DES SCIENCES DU CLIMAT ET DE L ENVIRONNEMENT   (France)

^b UNIVERSITÉ PARIS 1 PANTHÉON SORBONNE   (France)

Author keywords

Fair Queuing policy; Sample path stochastic ordering; Stochasticcomparison

Indexed keywords

ANALYTICAL ANALYSIS; BURSTINESS; COMPLEX DYNAMICS; DELAY BOUND; DELAY DISTRIBUTIONS; DETERMINISTIC DELAY BOUNDS; FAIR ALLOCATION; FAIR QUEUEING; FAIR QUEUEING ALGORITHMS; GENERAL SOURCE; GENERALIZED PROCESSOR SHARING; INTEGRATED SERVICES NETWORKS; LARGE CLASS; LEAKY BUCKETS; MINIMUM TIME; STOCHASTIC BOUND; STOCHASTIC COMPARISONS; STOCHASTIC ORDERINGS; STOCHASTICCOMPARISON; TIME STAMPS; WEIGHTED ROUND ROBINS;

ALGORITHMS; PACKET NETWORKS; QUALITY OF SERVICE; QUEUEING NETWORKS; QUEUEING THEORY; STOCHASTIC SYSTEMS; BANDWIDTH; RANDOM PROCESSES; TELECOMMUNICATION TRAFFIC;

STOCHASTIC MODELS; QUEUEING NETWORKS;

FAIR QUEUEING ALGORITHMS; GENERALIZED PROCESSOR SHARING (GPS);

EID: 0032676905     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.1999.751678     Document Type: Conference Paper

References (18)

1. O. Abuamsha, and N. Pekergin, A new Fair Queueing policy and its analysis with a stochastic comparison approach, Technical Report 97/015, PRISM, Univ. de Versailles, July 1997.
2. J. Bennett, D. Stephens and H. Zhang, High Speed, Scalable, and Accurate Implementation of Fair Queueing Algorithms in ATM Networks, Int. Conf. Net. Prot.'97, Oct. 97.
3. J. Bennett and H. Zhang, Hierarchical Packet Fair Queueing Algorithms, IEEE/ACM Trans. on Networking Vol.5, No.5, Oct. 1997.
4. EM. Chiussi and A. Francini, Implementing Fair Queueing in ATM Switches Part 1: A Practical Methodology for the Analysis of Delay Bounds, IEEE Globecom'97, Nov.97.
5. P. Goyal, and H.M. Vin, Generalized Guaranteed Rate Scheduling Algorithms: A Framework, IEEE/ACM Trans, on Networking, Vol. 5, No. 4, August 1997.
6. P. Goyal, and H.M. Vin, Start-time Fair Queueing: a Scheduling aAlgorithm for Integrated Packet Switching Networks, IEEE/ACM Trans, on Networking, Vol. 5, No. 5, October 1997.
7. S. Golestani, A Self-clocked Fair Queueing Scheme for High Speed Applications IEEE INFOCOM'94, April 1994.
8. D. P. Heymann, Approximating the Stationary Distribution of an Infinite Stochastic Matrix, J. Appl. Prob. no. 28, pp.96-103, 1991.
9. D.P. Heymann, Further Comparisons of Direct Methods for Computing Stationary Distributions of Markov chains, Siam J. Alg. Disc. Meth., Vol. 8, N 2, (April 1987) 226-232.
10. A. K. Parekh and R.G. Galleger, A generalized processor sharing approach to flow control in integrated services networks, IEEE/ACM Trans. Networking, Vol. 2, pp. 137-150, April 1994.
11. J.M. Foumeau, L. Mokdad and N. Pekergin, Bounding the loss rates in a multistage ATM switch, Proceedings of Modelling Techniques and Tools, LNCS 1245, June 1997.
12. N. Pekergin, Stochastic Bounds on Delays of Fair Queueing Algorithms, PRISM research rapport, RR98010.
13. J.L. Rexford, A.G. Greenberg and F. G. Bonomi, Hardware Efficient Fair Queueing Architectures for High-Speed Networks, INFOCOM'96, March 1996.
14. M. Shreedhar, and G. Varghese, Efficient Fair Queueing using Deficit Round Robin, Proc. SIGCOMM'95, 1995.
15. D. Stiliadis and A. Varma, Latency-Rate Servers: A General Model for Analysis of Traffic Scheduling Algorithms, Proc. Infocom'96, 1996.
16. D. Stiliadis and A. Varma, Rate-Propotional Servers: a Design Methodology for Fair Queueing Algorithms, IEEE/ACM Trans, on Networking Vol. pp. 164-174, April 1988.
17. D. Stiliadis and A. Varma, A General Methodology for Efficient Traffic Scheduling and Shaping Algorithms, Proc. Infocom'97, 1997.
18. D. Stoyan, Comparison Methods for Queues and Other Stochastic Models, Wiley, New York, 1983.