Call Admission Control Process Research Articles

Delay Aware and Users Categorizing-Based Call Admission Control for Multi-Services LTE-A Networks

In this paper, we introduce the user’s privileges and traffic maximum delay tolerance as additional dimensions in the call admission control processes to efficiently control the utilization of LTE-A network resources. Based on this idea, we propose an efficient call admission control scheme named “Delay Aware and User Categorizing-based CAC with Adaptive Resource Reservation”, where the user priority is adjusted dynamically based on the current network conditions and the users’ categorizations and traffic delay tolerances, to increase the network’s resource utilization and at the same time to maximize the operators’ revenue. In this proposed scheme, the users are classified into Golden users and Silver users, and the type of service per user is classified as real-time (RT) and non-real-time (NRT) services. We compare the performance of the proposed scheme with the corresponding results of previous schemes, referred to as the adaptive resource reservation-based Call Admission Control (ARR-CAC), where user categorization and delay were not taken into consideration in the call admission control process. Simulation results indicate the superiority of the proposed scheme because it is able to achieve a better balance between system utilization, users’ privileges provided by network operators and QoS provisioning compared to the ARR-CAC scheme.

Users’ classification-based call admission control with adaptive resource reservation for LTE-A networks

In this paper, we introduce the user’s privileges and traffic maximum delay tolerance as additional dimensions in the call admission control processes to efficiently control the utilization of LTE-A network resources. Based on this idea, we propose an efficient call admission control scheme named “delay aware and user categorizing-based CAC with adaptive resource reservation (DA–UC-ARR)”, where the user priority is adjusted dynamically based on the current network conditions and the users’ categorizations and traffic delay tolerances, to increase the network’s resource utilization and at the same time to maximize the operators’ revenue. In this proposed scheme, the users are classified into Golden users and Silver users, and the type of service per user is classified as real time (RT) and non-real time (NRT) services. We compare the performance of the proposed scheme with the corresponding results of previous schemes, referred to as the adaptive resource reservation-based call admission control (ARR-CAC) (Andrews et al., 2010; AlQahtani, 2014), where user categorization and delay were not taken into consideration in the call admission control process. Simulation results indicate the superiority of the proposed scheme because it is able to achieve a better balance between system utilization, users’ privileges provided by network operators and QoS provisioning compared to the ARR-CAC scheme.

Modeling multi-traffic admission control in OFDMA system using Colored Petri Net

Call Admission Control (CAC) is one of the key traffic management mechanisms that must be deployed in order to meet the strict requirements for dependability imposed on the services provided by modern wireless networks. In this paper, we develop an executable top-down hierarchical Colored Petri Net (CPN) model for multi-traffic CAC in Orthogonal Frequency Division Multiple Access (OFDMA) system. By theoretic analysis and CPN simulation, it is demonstrated that the CPN model is isomorphic to Markov Chain (MC) assuming that each data stream follows Poisson distribution and the corresponding arrival time interval is an exponential random variable, and it breaks through MC’s explicit limitation, which includes MC’s memoryless property and proneness to state space explosion in evaluating CAC process. Moreover, we present four CAC schemes based on CPN model taking into account call-level and packet-level Quality of Service (QoS). The simulation results show that CPN offers significant advantages over MC in modeling CAC strategies and evaluating their performance with less computational complexity in addition to its flexibility and adaptability to different scenarios.

Proactive load balancing with admission control for heterogeneous overlay networks

ABSTRACTThe next generation wireless networks will be the coexistence of heterogeneous wireless technologies. Balancing the traffic load among different networks can effectively utilize the overall radio resources in the system. In this paper, we propose an efficient load balancing scheme for the heterogeneous overlay systems, which is applied in the call admission control process. If the available network(s) cannot provide enough resource for the request call without degrading the quality‐of‐service (QoS) obtained by the ongoing calls, the system will perform load balancing operations first by initiating vertical handoffs among networks in order to create more rooms for the request call. The load balancing algorithm is to minimize the variance between the network utilizations of the entire system, which can be formulated as a quadratic binary programming problem. Simulation results show that the proposed scheme can admit more calls into the system compared with the other three reference schemes and then improve the overall throughput. Meanwhile, the scheme can keep the networks working in effective states and provide a better QoS support for users. Copyright © 2011 John Wiley & Sons, Ltd.

Near optimal routing and capacity management for PWCE-based survivable WDM networks

Protected Working Capacity Envelope (PWCE) has been proposed to simplify resource management and traffic control for survivable WDM networks. In a PWCE-based network, part of the link capacity is reserved for accommodating working routes, and the remaining capacity is reserved for backup routes. The shortest path routing is applied in PWCE-based networks. An arrival call is accepted only when each link along the shortest path has a free working channel. Such a working path routing scheme greatly simplifies the call admission control process for dynamic traffic, and it is especially suitable for implementation in a distributed manner among network nodes. In this article, we investigate two protection strategies: Bundle Protection (BP) and Individual Protection (IDP). In BP, only one backup path can be used to protect a failure component, whereas multiple backup paths can be used in IDP. We formulate four mixed integer non-linear programming (MINLP) problems using BP and IDP strategies for single link and single node failure protection. Each model is designed to determine link metrics for shortest working path routing, working and backup channel assignments, and backup path planning. Our objective is to minimize call-blocking probability on the bottleneck link. Since these models are highly non-linear and non-convex, it is difficult to obtain exact global optimal solutions. We propose a Simulated Annealing-based Heuristic (SAH) algorithm to obtain near optimal solutions. This SAH adopts the concepts of simulated annealing as well as the bi-section technique to minimize call-blocking probabilities. To evaluate the performance, we made simulation comparisons between SAH and the unity link weight assignment scheme. The results indicate that SAH can greatly reduce call-blocking probabilities on benchmark and the randomly generated networks.

Integration of pricing with call admission control to meet QoS requirements in cellular networks

Call admission control (CAC) plays a significant role in providing the desired quality of service (QoS) in cellular networks. We investigate the role of pricing as an additional dimension of the call admission control process in order to efficiently and effectively control the use of wireless network resources. First, we prove that, for a given wireless network, there exists a new call arrival rate which can maximize the total utility of users while maintaining the required QoS. Based on this result and observation, we propose an integrated pricing and call admission control scheme where the price is adjusted dynamically based on the current network conditions in order to alleviate the problem of congestion. Our proposed integrated approach implicitly implements a distributed user-based prioritization mechanism by providing negative incentives according to the current network conditions and therefore shaping the aggregate traffic in the network. We compare the performance of our approach in terms of congestion prevention, achievable total user utility, and obtained revenue, with the corresponding results of conventional systems where pricing is not taken into consideration in the call admission control process. These performance results verify the considerable improvement that can be achieved by the integration of pricing in the call admission control process in cellular networks.

Design of wide-sense nonblocking multicast ATM switches

Nonblocking multicast asynchronous transfer mode (ATM) switches can simplify the call admission control process and increase the external links' utilization. We derive the wide-sense nonblocking condition for multicast ATM switches based on a general Clos network. We also propose a routing algorithm to achieve wide-sense nonblocking. It is illustrated by an example that the number of required middle stages in our switch is significantly less than that of strictly nonblocking multicast switches.

Wide-sense non-blocking multicast ATM switches

Non-blocking multicast ATM switches can simplify the call admission control process and increase the utilisation level of external links. The condition for wide-sense non-blocking multicast ATM switches is derived and the routing algorithm is proposed. The required number of middle switches for the wide-sense non-blocking multicast switch is significantly less than that of the strictly non-blocking multicast switch.