Calculating performance bounds in communication networks

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.