Koukoutsidis 2010a - Revision history

Scipediacontent at 15:00, 21 January 2021

2021-01-21T15:00:16Z

Scipediacontent: Scipediacontent moved page Draft Content 307470183 to Koukoutsidis 2010a

2020-10-14T14:34:59Z

Scipediacontent moved page Draft Content 307470183 to Koukoutsidis 2010a

Scipediacontent: Created page with " == Abstract == This paper addresses the requirement for a congestion control mechanism, in order to efficiently handle paging traffic over cellular networks. The standard si..."

2020-10-14T14:34:56Z

Created page with " == Abstract == This paper addresses the requirement for a congestion control mechanism, in order to efficiently handle paging traffic over cellular networks. The standard si..."

New page

== 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 point out the basic points of such an adaptive scheme.

Document type: Part of book or chapter of book

== Full document ==
<pdf>Media:Draft_Content_307470183-beopen1046-9097-document.pdf</pdf>

== Original document ==

The different versions of the original document can be found in:

* [https://link.springer.com/content/pdf/10.1007%2F978-3-540-30199-8_5.pdf https://link.springer.com/content/pdf/10.1007%2F978-3-540-30199-8_5.pdf]

← Older revision		Revision as of 15:00, 21 January 2021
Line 3:		Line 3:

	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 point out the basic points of such an adaptive scheme.		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 point out the basic points of such an adaptive scheme.
−
−	~~Document type: Part of book or chapter of book~~
−
−	~~== Full document ==~~
−	~~<pdf>Media:Draft_Content_307470183-beopen1046-9097-document.pdf</pdf>~~


Line 15:		Line 10:

	* [https://link.springer.com/content/pdf/10.1007%2F978-3-540-30199-8_5.pdf https://link.springer.com/content/pdf/10.1007%2F978-3-540-30199-8_5.pdf]		* [https://link.springer.com/content/pdf/10.1007%2F978-3-540-30199-8_5.pdf https://link.springer.com/content/pdf/10.1007%2F978-3-540-30199-8_5.pdf]
		+
		+	* [http://link.springer.com/content/pdf/10.1007/978-3-540-30199-8_5 http://link.springer.com/content/pdf/10.1007/978-3-540-30199-8_5],
		+	: [http://dx.doi.org/10.1007/978-3-540-30199-8_5 http://dx.doi.org/10.1007/978-3-540-30199-8_5]
		+
		+	* [https://link.springer.com/chapter/10.1007/978-3-540-30199-8_5 https://link.springer.com/chapter/10.1007/978-3-540-30199-8_5],
		+	: [https://core.ac.uk/display/38441911 https://core.ac.uk/display/38441911],
		+	: [https://dblp.uni-trier.de/db/conf/ifip6-8/pwc2004.html#Koukoutsidis04 https://dblp.uni-trier.de/db/conf/ifip6-8/pwc2004.html#Koukoutsidis04],
		+	: [https://www.scipedia.com/public/Koukoutsidis_2010a https://www.scipedia.com/public/Koukoutsidis_2010a],
		+	: [https://rd.springer.com/chapter/10.1007/978-3-540-30199-8_5 https://rd.springer.com/chapter/10.1007/978-3-540-30199-8_5],
		+	: [https://academic.microsoft.com/#/detail/2167978556 https://academic.microsoft.com/#/detail/2167978556]

← Older revision	Revision as of 14:34, 14 October 2020
(No difference)