Probabilistic call admission control in wireless multiservice networks

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

dc.contributor.author	Stratogiannis, DG	en
dc.contributor.author	Tsiropoulos, GI	en
dc.contributor.author	Kanellopoulos, JD	en
dc.contributor.author	Cottis, PG	en
dc.date.accessioned	2014-03-01T01:31:42Z
dc.date.available	2014-03-01T01:31:42Z
dc.date.issued	2009	en
dc.identifier.issn	1089-7798	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/19896
dc.subject	Call admission control	en
dc.subject	Call blocking probability	en
dc.subject	Quality of service	en
dc.subject	Wireless networks	en
dc.subject.classification	Telecommunications	en
dc.subject.other	Admission rate	en
dc.subject.other	Analytical expressions	en
dc.subject.other	Analytical method	en
dc.subject.other	Call admission control	en
dc.subject.other	Call blocking probabilities	en
dc.subject.other	Call blocking probability	en
dc.subject.other	Channel holding time	en
dc.subject.other	Different distributions	en
dc.subject.other	Markov Chain theory	en
dc.subject.other	Multiservice network	en
dc.subject.other	Multiservice wireless networks	en
dc.subject.other	Service class	en
dc.subject.other	Markov processes	en
dc.subject.other	Quality control	en
dc.subject.other	Quality of service	en
dc.subject.other	Security of data	en
dc.subject.other	Telecommunication networks	en
dc.subject.other	Wireless networks	en
dc.subject.other	Wireless telecommunication systems	en
dc.subject.other	Blocking probability	en
dc.title	Probabilistic call admission control in wireless multiservice networks	en
heal.type	journalArticle	en
heal.identifier.primary	10.1109/LCOMM.2009.091327	en
heal.identifier.secondary	http://dx.doi.org/10.1109/LCOMM.2009.091327	en
heal.language	English	en
heal.publicationDate	2009	en
heal.abstract	A new probabilistic call admission control scheme is proposed for multiservice wireless networks. The new scheme gradually suppresses the admission rate of the new calls and of the calls of each service class (SC) supported considering their priorities independently. The scheme is examined both for a single SC and for multiple SCs under general conditions. The analysis employs Markov chain theory and yields analytical expressions for the call blocking probabilities. The proposed analytical method was validated via simulations employing different distributions for the channel holding time; the simulations demonstrated the accuracy of the proposed framework. © 2009 IEEE.	en
heal.publisher	IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC	en
heal.journalName	IEEE Communications Letters	en
dc.identifier.doi	10.1109/LCOMM.2009.091327	en
dc.identifier.isi	ISI:000270947900010	en
dc.identifier.volume	13	en
dc.identifier.issue	10	en
dc.identifier.spage	746	en
dc.identifier.epage	748	en