Call admission control for leaky bucket regulated traffic in ATM networks

grantor: University of TorontoA major part of the traffic in BISDN networks would be variable bit rate (VBR) traffic. Traditional resource allocation schemes for constant bit rate (CBR) traffic prove to be highly inefficient for VBR traffic, because the bandwidth requirement for such sources varies with time. Another factor complicating the resource allocation is the quality of service (QoS) guarantee for each call. A good call admission algorithm for VBR traffic will lead to an efficient utilization of resources and a decrease in call blocking. In this thesis I have developed a new algorithm for call admission in ATM networks, considering a leaky bucket regulated input model for the VBR sources. This algorithm is based on a shared buffer switch with General Processor Sharing (GPS) scheduling, it uses the random phase difference between sources for statistical multiplexing gain. The algorithm uses the Chernoff Bound to approximate the Cell Loss Probability (CLP). The results show that the CLP bound derived in this algorithm is an improvement over the existing algorithms for leaky bucket regulated traffic. *The research was supported by The Broadband Networks Project of Canadian Institute for Telecommunication Research (CITR).M.A.Sc