Probabilistic framework and performance evaluation for prioritized call admission control in next generation networks

Tsiropoulos, GI; Stratogiannis, DG; Kanellopoulos, JD; Cottis, PG

dc.contributor.author	Tsiropoulos, GI	en
dc.contributor.author	Stratogiannis, DG	en
dc.contributor.author	Kanellopoulos, JD	en
dc.contributor.author	Cottis, PG	en
dc.date.accessioned	2014-03-01T01:36:40Z
dc.date.available	2014-03-01T01:36:40Z
dc.date.issued	2011	en
dc.identifier.issn	0140-3664	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/21391
dc.subject	Call admission control	en
dc.subject	Fairness	en
dc.subject	Multi service class	en
dc.subject	Next generation networks (NGN)	en
dc.subject	Quality of service (QoS)	en
dc.subject.classification	Computer Science, Information Systems	en
dc.subject.classification	Engineering, Electrical & Electronic	en
dc.subject.classification	Telecommunications	en
dc.subject.other	Call admission control	en
dc.subject.other	Fairness	en
dc.subject.other	Multi-services	en
dc.subject.other	Next generation network	en
dc.subject.other	Quality of service (QoS)	en
dc.subject.other	Bandwidth	en
dc.subject.other	Blocking probability	en
dc.subject.other	Markov processes	en
dc.subject.other	Quality control	en
dc.subject.other	Quality of service	en
dc.subject.other	Telecommunication services	en
dc.subject.other	Telecommunication networks	en
dc.title	Probabilistic framework and performance evaluation for prioritized call admission control in next generation networks	en
heal.type	journalArticle	en
heal.identifier.primary	10.1016/j.comcom.2010.01.016	en
heal.identifier.secondary	http://dx.doi.org/10.1016/j.comcom.2010.01.016	en
heal.language	English	en
heal.publicationDate	2011	en
heal.abstract	Next generation networks (NGN) are designed to support a wide range of applications with various service classes (SCs) guaranteeing the respective quality of service (QoS) levels. Since such networks are resource constrained, call admission control (CAC) is imperative to achieve the required QoS levels. In this paper, a new probabilistic framework for CAC schemes is proposed based on controlling each SC independently by admitting low priority SC calls with a variable imposed probability. The incorporation of such a probabilistic framework is considered under a bandwidth-centric approach named probabilistic bandwidth reservation scheme (PBRS). Though equal service times are usually assumed in the literature, the present analysis considers SCs of different service times. By employing Markov chain analysis to treat the independent SCs that correspond to different call specifications, analytical expressions for the call blocking probabilities (CBPs) are derived. The performance of the proposed CAC scheme is studied not only with regard to CBP but, also, taking into account the priorities assigned to different SCs as well as fairness among various SCs and total network throughput. The proposed probabilistic framework allows the dynamic control of network resources considering also priority assignment, fairness and throughput. Analytical results concerning delay tolerant (DT) and delay-non-tolerant (DNT) traffic have been obtained applying the proposed scheme. Moreover, the relevant simulations have verified the accuracy of the proposed analysis. (C) 2010 Elsevier B.V. All rights reserved.	en
heal.publisher	ELSEVIER SCIENCE BV	en
heal.journalName	Computer Communications	en
dc.identifier.doi	10.1016/j.comcom.2010.01.016	en
dc.identifier.isi	ISI:000291417200002	en
dc.identifier.volume	34	en
dc.identifier.issue	9	en
dc.identifier.spage	1045	en
dc.identifier.epage	1054	en