Paging Load Congestion Control in Cellular Mobile Networks

Koukoutsidis, LZ

dc.contributor.author	Koukoutsidis, LZ	en
dc.date.accessioned	2014-03-01T01:21:13Z
dc.date.available	2014-03-01T01:21:13Z
dc.date.issued	2004	en
dc.identifier.issn	0302-9743	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/16134
dc.subject	Blocking Probability	en
dc.subject	Cellular Mobile Network	en
dc.subject	Cellular Network	en
dc.subject	Congestion Control	en
dc.subject	Queueing Analysis	en
dc.subject.classification	Computer Science, Theory & Methods	en
dc.title	Paging Load Congestion Control in Cellular Mobile Networks	en
heal.type	journalArticle	en
heal.identifier.primary	10.1007/978-3-540-30199-8_5	en
heal.identifier.secondary	http://dx.doi.org/10.1007/978-3-540-30199-8_5	en
heal.language	English	en
heal.publicationDate	2004	en
heal.abstract	This paper addresses the requirement for a congestion control mechanism, in order to efficiently handle paging traffic over cellular networks. The standard simultaneous paging approach can easily result in congestion, for relatively small values of the offered load. Instead of differentiating paging capacity based on the incoming load, this approach is more oriented towards a limited-resource system. Considering that a paging channel usually experiences high and low utilization periods, it is proposed to differentiate the paging mechanism according to the processed load. Given medium or even mild overload conditions, several forms of sequential paging substantially decrease blocking probabilities, while presenting good delay behavior. Based on a queueing analysis, we are able to quantitatively estimate potential improvements, and pointout the basic points of such an adaptive scheme. © IFIP International Federation for Information Processing 2004.	en
heal.publisher	SPRINGER-VERLAG BERLIN	en
heal.journalName	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)	en
heal.bookName	LECTURE NOTES IN COMPUTER SCIENCE	en
dc.identifier.doi	10.1007/978-3-540-30199-8_5	en
dc.identifier.isi	ISI:000224093900005	en
dc.identifier.volume	3260	en
dc.identifier.spage	39	en
dc.identifier.epage	53	en