Overflow and losses in a network queue with a self-similar input |
| |
Authors: | Tsybakov Boris Georganas Nicolas D |
| |
Institution: | (1) QUALCOMM Inc., 5775 Morehouse Drive, San Diego, CA 92121-1714, USA;(2) Multimedia Communications Research Laboratory (MCRLab), School of Info. Tech. & Engin. (SITE), University of Ottawa, Ottawa, Ontario, Canada, K1N 6N5 |
| |
Abstract: | This paper considers a discrete time queuing system that models a communication network multiplexer which is fed by a self-similar
packet traffic. The model has a finite buffer of size h, a number of servers with unit service time, and an input traffic which is an aggregation of independent source-active periods
having Pareto-distributed lengths and arriving as Poisson batches. The new asymptotic upper and lower bounds to the buffer-overflow
and packet-loss probabilities P are obtained. The bounds give an exact asymptotic of log P/log h when h → to ∞. These bounds decay algebraically slow with buffer-size growth and exponentially fast with excess of channel capacity
over traffic rate. Such behavior of the probabilities shows that one can better combat traffic losses in communication networks
by increasing channel capacity rather than buffer size. A comparison of the obtained bounds and the known upper and lower
bounds is done.
This revised version was published online in June 2006 with corrections to the Cover Date. |
| |
Keywords: | communications networks buffer overflow self-similarity long-range dependence |
本文献已被 SpringerLink 等数据库收录! |
|