Dynamic Admission Control Scheme Research Articles

Reservation-based dynamic admission control scheme for wideband code division multiple access systems

Call admission control (CAC) and resource reservation (RR) for mobile communication are two important factors that guarantee system efficiency and quality of service (QoS) required for different services in a very scarce resource as the radio spectrum. A new scheme was proposed which extends the concepts of resource sharing and reservations for wideband code division multiple access (WCDMA) systems with a unique feature of soft capacity. Voice and data traffic were considered. The traffic is further classified into handoff and new requests. The reservation thresholds were dynamically adjusted according to the traffic pattern and mobility prediction in order to achieve the maximum channel utilization, while guaranteeing different QoS constraints. The performance of proposed scheme was evaluated using Markov models. New call blocking probability, handoff call dropping probability, and channel utilization were used as benchmarks for the proposed scheme.

A dynamic admission control scheme to manage contention on shared computing resources

AbstractA virtual organization is established when physical organizations collaborate to share their computing resources with the aim of serving each other when there is a likelihood of insufficient local resources during peak resource usage periods at any organization. Contention becomes a potential problem when a large number of requests, which can overwhelm the aggregate capacity of shared resources, are submitted from the participating organizations coincidentally at the same period. In particular, when a small number of requests that require large amounts of computing resources are admitted in place of a large number of requests that require less computing resources, the overall system performance, in terms of admission ratio, can deteriorate significantly. Hence, admission control is necessary to reduce resource oversubscription. Because domain‐shared computing resources are likely to be combined to form a large‐scale system, it is not possible to define a fixed admission policy solely based on the request's CPU and execution time requirements. In this paper, we introduce an admission control framework, based on a pricing model, for a multi‐domain‐shared computing infrastructure. The performance of the admission control framework is evaluated under different scenarios that contribute to the overall degree of competition for shared resources. The results are presented and analyzed in this paper. Copyright © 2008 John Wiley & Sons, Ltd.

An analytical QoS service model for delay-based differentiation

The increased need for Quality of Service (QoS) in today's IP networks has concentrated a lot of research and implementation efforts. Carefully designed and managed priority services are essential for quality-demanding traffic, especially in large-scale IP-based environments where aggregation of flows is extensive and a variety of traffic types co-exist. Although individual mechanisms have been widely investigated, not much related work exists on integrated approaches to QoS provisioning that are also feasible to implement. This work presents a thorough approach to the design, dimensioning and provisioning of a high-priority service for high-quality-demanding traffic over an IP network. Our approach employs efficient scheduling and a dynamic admission control scheme while demonstrating an outstanding performance in terms of the quality offered to QoS-demanding traffic. A novel feature is also introduced: while other existing schemes only focus on provisioning of service rate guarantees, ours achieves in addition differentiation of the end-to-end delay perceived by IP flows.

Above packet level admission control and bandwidth allocation for IEEE 802.16 wireless MAN

IEEE 802.16 wireless Metropolitan Area Network (MAN) is expected to revolutionize the broadband wireless access technology. Efficient resource management is essential in providing scalability in such large IEEE 802.16-based wireless network and Quality of Service (QoS) for multimedia applications (VoIP, MPEG, FTP, WWW) is usually achieved by appropriate classification of scheduling services and grant/request mechanism. In this paper, we firstly discuss the QoS issue in IEEE 802.16 wireless MANs and propose a dynamic admission control scheme for scheduling services defined in the 802.16 specification. The proposed scheme provides the highest priority for Unsolicited Grant Service (UGS) connections and maximizes the bandwidth utilization by employing bandwidth borrowing and degradation. We develop an approximate analytical model to evaluate the system performance by assuming that the traffic processes of all scheduling services are Poisson processes. In fact, the self-similarity of non-voice traffic makes its traffic process far from Poisson process and should be modeled by Poisson Pareto Burst Process (PPBP). Therefore, in the later part of the paper, we analyze upper bound blocking probabilities of all scheduling services above the packet level using PPBP model for fractal traffic and Gaussian model for aggregated traffic in large wireless network as well as using the Chernoff bound method. Based on the analytical results, we give another admission control and bandwidth allocation mechanism above the packet level so as to minimize the blocking probability of each type of service in IEEE 802.16 wireless MAN. Analytical and simulation results are obtained and compared to demonstrate the effectiveness of proposed schemes and validate our analytical models.

Dynamic resource management using bandwidth brokers

The admission control issue in the design of a centralized bandwidth broker model for dynamic control and management of QoS provisioning is studied. A two-phase differentiated flow treatment based dynamic admission control scheme under the centralized bandwidth broker model is proposed. In the proposed scheme, the flow requests are classified into two classes and get differentiated treatment according to their QoS demands. We demonstrate that this admission control scheme can not only improve the resource utilization but also guarantee the flows' QoS. Furthermore, the admission control is divided into two phases: edge admission control and interior admission control. During the interior phase, the PoQ scheme is adopted, which enhances the call processing capability of the bandwidth broker. The simulation results show that the proposed scheme can result in lower flow blocking probability and higher resource utilization. And it also reduces the number of QoS state accesses/updates, thereby increasing the overall call processing capability of the bandwidth broker.