On self-similar traffic in ATM queues: definitions, overflow probability bound, and cell delay distribution

Abstract

Recent traffic measurements in corporate local-area networks (LANs), variable-bit-rate video sources, ISDN control-channels, and other communication systems, have indicated traffic behaviour of self-similar nature. This paper first discusses some definitions and properties of (second-order) self-similarity and gives simpler criteria for it. It then gives a model of self-similar traffic suitable for queuing system analysis of an asynchronous transfer mode (ATM) queue. A lower bound to the overflow probability of a finite ATM buffer is obtained, as also a lower bound to the cell loss probability. Finally, the stationary distribution of the cell delay in an infinite ATM buffer is obtained.