Statistical connection admission control framework based on achievable capacity estimation

Huiling Zhu, Victor O K Li, Zhengxin Ma, Miao Zhao

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic researchpeer-review

9 Citations (Scopus)


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.
Original languageEnglish
Title of host publication2006 IEEE International Conference on Communications, ICC 2006
Number of pages6
Publication statusPublished - 1 Dec 2006
Externally publishedYes
Event2006 IEEE International Conference on Communications, ICC 2006 - Istanbul, Turkey
Duration: 11 Jul 200615 Jul 2006


Conference2006 IEEE International Conference on Communications, ICC 2006


  • Admission control
  • QoS
  • Statistical estimation

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this