A Parallel Algorithm of Admission Control for Leaky Bucketed Multi-segment Arrival Envelope

Abstract

Owing to the importance of quality of service (QoS) in the future communication networks, in spite of wired networks or wireless ones, the control mechanisms are important issues. The connection admission control (CAC) is the basic and necessary control mechanism for provision of QoS. This paper studies the CAC for a very general arrival envelope, called leaky bucketed multi-segment arrival envelope. By theoretical approach, we derived the minimum delay that can be provided by the network and developed an efficient algorithm to calculate the minimum delay. With the result of the paper, many arrival processes can be exactly and fast calculated the minimum delay to assist the decision of CAC.