By Topic

State-space analysis of static and dynamic Markovian access control protocols

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
$33 $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

3 Author(s)
Jong-tae Lim ; Illinois Institute of Technology, Chicago, IL ; Semyon M. Meerkov ; Zeev Schuss

A state-space approach to the problem of analysis of static and dynamic Markovian access control protocols in large decentralized communication networks is presented. The state is chosen to be the number of users having at least i packets in their buffers, i = 1, ..., N. Asymptotic analysis of the resulting state-space model constitutes the basis for the developed method. The method gives analytical formulae for calculating (i) steady state throughput, (ii) steady state time delay, (iii) steady state buffer occupancy, (iv) local stability of each equilibrium, and (v) residence time in the domain of attraction of every metastable steady state. Global behavior and state-space portraits are also discussed. Numerical experiments are reported (using the ALOHA and Symmetric ALOHA systems as examples) which support the described findings.

Published in:

Decision and Control, 1984. The 23rd IEEE Conference on

Date of Conference:

12-14 Dec. 1984