By Topic

On a positive recurrence criterion for multidimensional Markov chains with application to the stability of slotted-Aloha with a finite number of queues

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Kompalli, S.C. ; Dept. of Electr. & Comput. Eng., Univ. of Waterloo, Waterloo, ON, Canada ; Mazumdar, R.R.

In this paper, we revisit the stability analysis of well known slotted-Aloha protocol with finite number of queues. Under standard modeling assumptions, we derive a sufficient condition for the stability by invoking stochastic dominance arguments in conjunction with recurrence criterion due to Rosberg. Our sufficiency condition for stability is linear in arrival rates and does not require knowledge of the stationary joint statistics of queue lengths. We believe that the technique reported here could be useful in analyzing other stability problems in countable-space Markovian settings.

Published in:

Teletraffic Congress, 2009. ITC 21 2009. 21st International

Date of Conference:

15-17 Sept. 2009