Asymmetric convolution algorithm for blocking probability calculation in full-availability group with bandwidth reservation

2008 ◽  
Vol 2 (1) ◽  
pp. 87 ◽  
Author(s):  
M. Głabowski ◽  
A. Kaliszan ◽  
M. Stasiak
Keyword(s):  
Blocking Probability ◽  
Bandwidth Reservation ◽  
Convolution Algorithm ◽  
Probability Calculation

Enhanced Adaptive Call Admission Control Scheme With Bandwidth Reservation for LTE Networks

2021 ◽  
Vol 12 (1) ◽  
pp. 23-42
Author(s):  
Maniru Malami Umar ◽  
Amimu Mohammed ◽  
Abubakar Roko ◽  
Ahmed Yusuf Tambuwal ◽  
Abdulhakeem Abdulazeez
Keyword(s):  
Real Time ◽  
Admission Control ◽  
Call Admission Control ◽  
Blocking Probability ◽  
Degradation Mechanism ◽  
Radio Resource Management ◽  
System Level ◽  
Bandwidth Reservation ◽  
Lte Networks ◽  
Call Admission

Call admission control (CAC) is one of the radio resource management techniques that regulates and provide resources for new or ongoing calls in the network. The existing CAC schemes wastes bandwidth due to its failure to check before degrading admitted real-time calls and it also increases the call dropping probability (CBP) and calling blocking probability (CBP) of real-time calls due to the delay incurred when bandwidth is degraded from them. This paper proposed an enhanced adaptive call admission control (EA-CAC) scheme with bandwidth reservation. The scheme employs a prior-check mechanism that ensured bandwidth to be degraded will be enough to admit the new call request. It further incorporates an adaptive degradation mechanism that degrades non-real time calls before degrading the RT calls. The performance of the EA-CAC scheme was evaluated against two existing schemes using Vienna LTE system level simulator. The EA-CAC scheme exhibits better performance compared to the two schemes in terms of throughput, CBP, and CDP of RT calls without sacrificing the performance of NRT calls.

On the Handoff-Call Blocking Probability Calculation in W-CDMA Cellular Networks

2008 ◽  
Author(s):  
Vassilios G. Vassilakis ◽  
Georgios A. Kallos ◽  
Ioannis D. Moscholios ◽  
Michael D. Logothetis
Keyword(s):  
Cellular Networks ◽  
Blocking Probability ◽  
Call Blocking ◽  
Handoff Call ◽  
Call Blocking Probability ◽  
Probability Calculation

Internal Blocking Probability Calculation in Switching Networks with Additional Inter-Stage Links and Mixture of Erlang and Engset Traffic

2012 ◽  
Vol 17 (1-2) ◽  
pp. 67-79 ◽  
Author(s):  
Mariusz Gła̧bowski ◽  
Michał Dominik Stasiak
Keyword(s):  
Approximate Method ◽  
Simulation Study ◽  
Infinite Number ◽  
Blocking Probability ◽  
High Accuracy ◽  
Switching Networks ◽  
Theoretical Assumptions ◽  
Probability Calculation

Abstract In the article a new analytical approximate method for modeling multi-service switching networks with overflow links is proposed. The method can be used for blocking probability calculation in switching networks that are offered multi-service traffic generated by finite and infinite number of sources, i.e., in switching networks with multi-service Engset traffic, in switching networks with multiservice Erlang traffic, as well as in multi-service switching networks with Erlang and Engset traffic. The simulation study performed proves high accuracy of the method proposed and confirms the correctness and validity of all adopted theoretical assumptions.

Sign in / Sign up

Export Citation Format

Share Document