Efficient Connection Admission Control algorithms for adaptive QoS real-time connections over ATM networks

In this paper, we extend the traditional QoS model into one that is adaptiv e. We address how to admit real-time connections under this new model. We i nvestigate various search techniques in connection admission and assess the ir tradeoffs under different performance criteria. We show that our connect ion admission control algorithm with heuristic search techniques can increa se the probability that a connection is admitted, and provide the best poss ible QoS to admitted connections while at the same time maintaining the exe cution time of the algorithm at a reasonable lever. Many existing CAC algor ithms for real-time connections use direct testing techniques to determine if deadlines constraints can be satisfied. This is usually time consuming d ue to the extensive computation involved in obtaining delay bounds. We intr oduce an indirect testing method that can substantially reduce the executio n time of CAC algorithms.