direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

All publications

Impact of non-Poisson arrival sequences for call admission algorithms with and without delay
Citation key F-INASCAAD-96
Author Feldmann, Anja
Title of Book GLOBECOM'96: Proceedings of the IEEE Global Telecommunications Conference: The Key to Global Prosperity
Pages 617–622
Year 1996
ISBN 0-7803-3336-5
DOI http://dx.doi.org/10.1109/GLOCOM.1996.594436
Location London, UK
Volume 1
Month November
Abstract New networking technologies such as ATM can carry a wide variety of traffic–-voice, video, and data–-over a single digital network. Since some of these services depend on bandwidth guarantees, the network should employ call admission algorithm to limit congestion. Call admission includes making intelligent decisions about whether to accept a call, and if so, when to schedule it, and how to route it. Challenges in the design of such algorithms include high bandwidth requirements and the bursty nature of call arrivals. Recent empirical studies of traffic measurements from a variety of networks have demonstrated that characteristics of network traffic are non-poisson. In particular, connection arrivals are much burstier than Poisson processes would predict; they actually show evidence of self-similarity behavior. In this paper we show that bursty traffic poses a significant challenge to existing call admission algorithms. To cope with bursty traffic and high bandwidth demands we suggest algorithms that may delay calls.
Link to publication Download Bibtex entry

Zusatzinformationen / Extras

Quick Access:

Schnellnavigation zur Seite über Nummerneingabe