Stochastically bounded burstiness for communication networks
- 1 January 2000
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 46 (1) , 206-212
- https://doi.org/10.1109/18.817518
Abstract
A network calculus is developed for processes whose burstiness is stochastically bounded by general decreasing functions. This calculus is useful for a large class of input processes, including important processes exhibiting “subexponentially bounded burstiness” such as fractional Brownian motion. Moreover, it allows judicious capture of the salient features of real-time traffic, such as the “cell” and “burst” characteristics of multiplexed traffic. This accurate characterization is achieved by setting the bounding function as a sum of exponentialsKeywords
This publication has 12 references indexed in Scilit:
- Generalized processor sharing networks with exponentially bounded burstiness arrivalsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Computable exponential bounds for intree networks with routingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Specification of Guaranteed Quality of ServicePublished by RFC Editor ,1997
- Experimental queueing analysis with long-range dependent packet trafficIEEE/ACM Transactions on Networking, 1996
- Large deviations and overflow probabilities for the general single-server queue, with applicationsMathematical Proceedings of the Cambridge Philosophical Society, 1995
- Statistical analysis of the generalized processor sharing scheduling disciplineIEEE Journal on Selected Areas in Communications, 1995
- Statistical multiplexing of multiple time-scale Markov streamsIEEE Journal on Selected Areas in Communications, 1995
- A generalized processor sharing approach to flow control in integrated services networks: the multiple node caseIEEE/ACM Transactions on Networking, 1994
- Performance and stability of communication networks via robust exponential boundsIEEE/ACM Transactions on Networking, 1993
- A calculus for network delay. I. Network elements in isolationIEEE Transactions on Information Theory, 1991