Generalized processor sharing networks with exponentially bounded burstiness arrivals

Publisher Website

17 December 2002

conference paper
Published by Institute of Electrical and Electronics Engineers (IEEE)

https://doi.org/10.1109/infcom.1994.337678

Abstract

No abstract available

Keywords

This publication has 7 references indexed in Scilit:

Performance and stability of communication networks via robust exponential bounds
IEEE/ACM Transactions on Networking, 1993
A generalized processor sharing approach to flow control in integrated services networks: the single-node case
IEEE/ACM Transactions on Networking, 1993
How fair is fair queuing
Journal of the ACM, 1992
A calculus for network delay. II. Network analysis
IEEE Transactions on Information Theory, 1991
A calculus for network delay. I. Network elements in isolation
IEEE Transactions on Information Theory, 1991
Analysis and simulation of a fair queueing algorithm
Published by Association for Computing Machinery (ACM) ,1989
New directions in communications (or which way to the information age?)
IEEE Communications Magazine, 1986