Statistical Connection Admission Control Framework based on Achievable Capacity Estimation

Abstract

Abstract-Traditional traffic descriptor-based and measurementbased 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. *

Route Capacity Estimation Based Admission Control and QoS Routing for Mesh Networks

“…We also compare our scheme with conventional layer 2 and 3 techniques, the round robin scheduler (RR, [14]) and AODV routing protocol [15], and also the recent research output "SCAC" in [8] as benchmarks. The overall performances are investigated in terms of gateway goodput (Fig.…”

“…Similarly, in ad-hoc network settings, [7] proposed an AODV routing protocol based admission control, whereas it blocks the over-loaded flow requests during the routing discovery procedure. [8] is much related to our work that makes admission decision by estimating the achievable capacity between any pair of ingress and egress nodes with only packet loss constraint, assuming traffics arrive according to Gaussian distribution. However, in a multi-hop wireless network, multiple joint/disjoint routes exist between any pair of source and destination, thus it is more appropriate and accurate to make admission decision for each route.…”

Cross-Layer Design for QoS in Wireless Mesh Networks

“…The proposed algorithm ("Dist + IQoSR + RC − CAC") is compared with the "Dist + IQoSR" that does not include an efficient prediction scheme for connection admission control. We also compare our scheme with conventional layer 2 and 3 techniques "RR + AODV", and with the recently proposed statistical admission control "SCAC" [39] algorithm as benchmarks. The performances are investigated in terms of gateway goodput in Fig.…”

A new approach to architecture of sensor networks for mission-oriented applications

“…The issue of changing network state was studied in [13] where information quality is satisfied by choosing the most appropriate sensor nodes and sensor modalities for the current state of the network. Recent works in [14,15] are more related to this paper in that they tackle the connection admission control problem in wireless mesh networks to estimate the route capacity associated with each source/gateway pair.…”