Paper
1 October 1995 Fairness of burst-level admission control protocols
Indra Widjaja, Aruna Kumar Kompella
Author Affiliations +
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.
© (1995) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Indra Widjaja and Aruna Kumar Kompella "Fairness of burst-level admission control protocols", Proc. SPIE 2608, Emerging High-Speed Local-Area Networks and Wide-Area Networks, (1 October 1995); https://doi.org/10.1117/12.224210
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Switches

Asynchronous transfer mode

Packet switching

Performance modeling

Network security

Computer engineering

Fiber reinforced polymers

RELATED CONTENT

ATM to the desktop
Proceedings of SPIE (October 01 1995)
DBS: a powerful tool for TCP performance evaluations
Proceedings of SPIE (October 10 1997)

Back to Top