Calculating performance bounds in communication networks
- 31 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 539-546 vol.2
- https://doi.org/10.1109/infcom.1993.253320
Abstract
A way to calculate the performance of packet switching communication networks under a fixed (session-based) routing strategy, based on properly bounding the probability distribution functions of the system input processes, is proposed. The bounds suggested, which are decaying exponentials, posses three convenient properties. When the inputs to an isolated network element are all bounded, they result in bounded outputs and ensure that the delays and queues in this element have exponentially decaying distribution. In some network settings, the bounded inputs result in bounded outputs. Finally, natural traffic processes can be shown to satisfy such bounds. These properties enable the calculation of upper bounds for all the interesting parameters of network performance, in a variety of settings.Keywords
This publication has 4 references indexed in Scilit:
- A calculus for network delay. II. Network analysisIEEE Transactions on Information Theory, 1991
- A calculus for network delay. I. Network elements in isolationIEEE Transactions on Information Theory, 1991
- Stochastic Theory of a Data-Handling System with Multiple SourcesBell System Technical Journal, 1982
- Virtual cut-through: A new computer communication switching techniqueComputer Networks (1976), 1979