An adaptive algorithm for measurement-based admission control in integrated services packet networks
β Scribed by C Casetti; J Kurose; D Towsley
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 321 KB
- Volume
- 23
- Category
- Article
- ISSN
- 0140-3664
No coin nor oath required. For personal study only.
β¦ Synopsis
Call admission control is typically devised so as to employ the declared worst-case traffic descriptors for incoming calls, a solution resulting in poor bandwidth utilization. A measurement-based admission scheme is an appealing alternative, offering adaptivity to the changing traffic conditions, while allowing statistical multiplexing gains to be exploited. In this paper, we examine the problem of determining which traffic characterization a measurement-based admission control algorithm should require of sources requesting access. We also propose an adaptive measurement-based admission control algorithm that simplifies the estimation process. We test the new algorithm under different traffic scenarios and show that a high utilization level is achieved without violating delay-based QoS guarantees.
π SIMILAR VOLUMES
We propose an adaptive measurement-based admission control algorithm that uses optimization procedure to choose an appropriate measurement window size dynamically. Previous designs on measurement-based admission control mainly focused on strategies that consider the worst case traffic source model t
A rate-based congestion control algorithm has been developed and standardized in the ATM forum for ABR service class. In the standard the behaviour of source and destination end systems is specified by several control parameters such as RIF (rate increase factor) and RDF (rate decrease factor). In s