Share Email Print

Proceedings Paper

Fairness of burst-level admission control protocols
Author(s): Indra Widjaja; Aruna Kumar Kompella
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

Burst-level admission control protocols have been proposed to perform access control to sources that exhibit high burstiness and need not require real-time delivery. To this end, two broad approaches of burst-level admission control can be classified. In the first approach, called tell-and-go, the source transmits its messages immediately in the form of bursts as soon as it receives the message from its application layer. In the second approach, called tell-and- wait, the source first reserves the bandwidth along the virtual circuit using a short request message. The burst is transitted only after the requested bandwidth has been allotted. In this paper, we analyze the performance of both protocols taking into consideration of the fact that the sources are heterogeneous, an important assumption which is absent in all previous analyses. We show that sources which request a higher peak bit rate encounter higher blocking probability, resulting in lower throughput. We then propose a solution to fix this fairness problem so the equitable performance is achieved.

Paper Details

Date Published: 1 October 1995
PDF: 12 pages
Proc. SPIE 2608, Emerging High-Speed Local-Area Networks and Wide-Area Networks, (1 October 1995); doi: 10.1117/12.224210
Show Author Affiliations
Indra Widjaja, Univ. of Arizona (United States)
Aruna Kumar Kompella, Univ. of Arizona (United States)

Published in SPIE Proceedings Vol. 2608:
Emerging High-Speed Local-Area Networks and Wide-Area Networks
Kadiresan Annamalai; Krishna Bala; C. Brendan S. Traw; Ronald P. Bianchini, Editor(s)

© SPIE. Terms of Use
Back to Top