A deterministic call admission control protocol for bursty traffic in high-speed networks: modeling and analysis

2004 ◽  
Author(s):  
C.D. Madubata ◽  
M. Armullah
Keyword(s):  
Admission Control ◽  
High Speed ◽  
Call Admission Control ◽  
Bursty Traffic ◽  
Modeling And Analysis ◽  
Call Admission ◽  
High Speed Networks ◽  
Control Protocol

Novel Neutral Network Approach to Call Admission Control in High-speed Networks

2003 ◽  
Vol 13 (04) ◽  
pp. 251-262 ◽  
Author(s):  
Supeng Leng ◽  
K. R. Subramanian ◽  
N. Sundararajan ◽  
P. Saratchandran
Keyword(s):  
Admission Control ◽  
Bandwidth Allocation ◽  
High Speed ◽  
Call Admission Control ◽  
Design Procedure ◽  
Computational Time ◽  
Accurate Estimation ◽  
Network Approach ◽  
Call Admission ◽  
High Speed Networks

This paper presents a novel Call Admission Control (CAC) scheme which adopts the neural network approach, namely Minimal Resource Allocation Network (MRAN) and its extended version EMRAN. Though the current focus is on the Call Admission Control (CAC) for Asynchronous Transfer Mode (ATM) networks, the scheme is applicable to most high-speed networks. As there is a need for accurate estimation of the required bandwidth for different services, the proposed scheme can offer a simple design procedure and provide a better control in fulfilling the Quality of Service (QoS) requirements. MRAN and EMRAN are on-line learning algorithms to facilitate efficient admission control in different traffic environments. Simulation results show that the proposed CAC schemes are more efficient than the two conventional CAC approaches, the Peak Bandwidth Allocation scheme and the Cell Loss Ratio (CLR) upperbound formula scheme. The prediction precision and computational time of MRAN and EMRAN algorithms are also investigated. Both MRAN and EMRAN algorithms yield similar performance results, but the EMRAN algorithm has less computational load.

scholarly journals Congestion Control Call Admission Control (CC-CAC) Algorithm for Mobile Broadband Networks

2019 ◽  
Vol 3 (5) ◽  
Author(s):  
Ibrahim Saidu ◽  
Abubakar Roko ◽  
Nasir Aliyu Shinkafi ◽  
Solomon Yese
Keyword(s):  
Congestion Control ◽  
Admission Control ◽  
High Speed ◽  
Call Admission Control ◽  
Blocking Probability ◽  
Degradation Mechanism ◽  
Base Station ◽  
Broadband Networks ◽  
Mobile Broadband ◽  
Call Admission

Mobile broadband networks are continuously faced with the challenge of limited resources due to the increasing demand for high speed Internet services. To manage these resources, call admission control (CAC) which determines whether or not a connection request should be accepted or rejected is one of the resource management techniques usually deployed. A Dynamic QoS-aware CAC algorithm was recently proposed to improve resource utilization. However, the algorithm detects congestion of the network only after it has occurred, which leads to increase in blocking probability and thus lead to reduction in throughput. In this paper, a congestion control call admission control (CC-CAC) algorithm is proposed to reduce call blocking and increase throughput of all connection classes. The CC-CAC employs a congestion control mechanism that regulates the base station buffer to operate at a target threshold. It also employs a dynamic bandwidth degradation mechanism to degrade the resources of the admitted connections when resources are not sufficient to admit more connections. The algorithm is evaluated using simulation. The results show that the proposed scheme outperforms the benchmark scheme in terms of decrease in blocking probability and increase in throughput for all connection classes.

Sign in / Sign up

Export Citation Format

Share Document