Statistical connection admission control framework based on achievable capacity estimation

Abstract

Traditional traffic descriptor-based and measurement-based admission control schemes are typically combined with a node by node resource reservation scheme, rendering them unscalable. Although some Endpoint Admission Control schemes can resolve this problem, they impose significant signaling overhead. To cope with these two problems, this paper proposes a statistical connection admission control framework which can easily and efficiently estimate the network resource for a pair of ingress-egress nodes and make admission decision based on this estimated result. In this framework, the network is considered as a "black box." For a certain ingress-egress node pair, the egress node measures the QoS constraint violation ratio and feeds this information back to the ingress node periodically. With this information and the measured statistical characteristics of the existing aggregated traffic, the ingress node estimates the achievable capacity between the ingress-egress node pair, and makes the admission decision for a new traffic connection request. The signaling overhead of this framework is very small. Simulation results show the effective throughput is relatively high. © 2006 IEEE.