A QoS Guaranteed Call Admission Control (QOG-CAC) Algorithm for Broadband Networks

A QoS Guaranteed Call Admission Control (QOG-CAC) Algorithm for Broadband Networks

Aminu Mohammed (Usmanu Danfodiyo University, Sokoto, Nigeria), Yese Orduen Solomon (Usmanu Danfodiyo University Sokoto, Nigeria) and Ibrahim Saidu (Usmanu Danfodiyo University, Sokoto, Nigeria)
DOI: 10.4018/IJWNBT.2019010104
OnDemand PDF Download:
No Current Special Offers


Call admission control (CAC) is one of the techniques deployed in managing network resources. Recently, the dynamic QoSaware CAC (DQA-CAC) algorithm was proposed to reduce the new connection blocking rate and improve resource utilization. However, the algorithm admits new connections and degrades existing ones without recourse to delay requirements of delay-intolerant extended real-time polling service (ertPS) and real-time polling service (rtPS) connections—which may incur additional delay, leading to an increase in packet drop rate and, consequently, reduced throughput. In this article, a QoS-guaranteed call admission control (QOG-CAC) algorithm is proposed to ensure QoS and consequently increase the throughput of all class of connections. The proposed QOG-CAC is simulated using a Java-based discrete event simulator. The results of the extensive simulation experiments conducted show that the proposed algorithm outperforms the compared scheme with regard to average system throughput, new connection blocking rate, and per-flow throughput of real-time as well as non-real-time connections
Article Preview


This section provides a review of some of the CAC schemes that have been proposed to manage network resources in WiMAX networks.

Complete Article List

Search this Journal:
Open Access Articles
Volume 11: 2 Issues (2022): 1 Released, 1 Forthcoming
Volume 10: 2 Issues (2021)
Volume 9: 2 Issues (2020)
Volume 8: 2 Issues (2019)
Volume 7: 2 Issues (2018)
Volume 6: 2 Issues (2017)
Volume 5: 1 Issue (2016)
Volume 4: 3 Issues (2015)
Volume 3: 4 Issues (2014)
Volume 2: 4 Issues (2012)
Volume 1: 4 Issues (2011)
View Complete Journal Contents Listing