dc.contributor.author |
Ibrahim, S |
|
dc.contributor.author |
Abubakar, R |
|
dc.contributor.author |
Nasiru, A.S |
|
dc.contributor.author |
Solomon, O.Y |
|
dc.date.accessioned |
2020-03-16T09:45:03Z |
|
dc.date.available |
2020-03-16T09:45:03Z |
|
dc.date.issued |
2019-09 |
|
dc.identifier.issn |
2506-9853 |
|
dc.identifier.uri |
http://hdl.handle.net/123456789/896 |
|
dc.description.abstract |
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. |
en_US |
dc.language.iso |
en |
en_US |
dc.publisher |
EJECE, European Journal of Electrical and Computer Engineering |
en_US |
dc.subject |
Department of Mathematics |
en_US |
dc.subject |
Department of ICT |
en_US |
dc.title |
Congestion Control Call Admission Control (CC-CAC) Algorithm for Mobile Broadband Networks |
en_US |
dc.type |
Article |
en_US |