STATE-SPACE ANALYSIS OF STATIC AND DYNAMIC MARKOVIAN ACCESS CONTROL PROTOCOLS.

Jong Tae Lim; Semyon M. Merrkov; Zeev Schuss

doi:10.1109/cdc.1984.272259

STATE-SPACE ANALYSIS OF STATIC AND DYNAMIC MARKOVIAN ACCESS CONTROL PROTOCOLS.

Jong Tae Lim^*, Semyon M. Merrkov, Zeev Schuss

^*Corresponding author for this work

Illinois Institute of Technology

Research output: Contribution to journal › Conference article › peer-review

1 Scopus citations

Abstract

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 equals 1,. . . , N. Asymptotic analysis of the resulting state-space model constitutes the basis for the developed method. The method gives analytical formulas 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.

Original language	English
Pages (from-to)	1364-1371
Number of pages	8
Journal	Proceedings of the IEEE Conference on Decision and Control
DOIs	https://doi.org/10.1109/cdc.1984.272259
State	Published - 1984
Externally published	Yes

Access to Document

10.1109/cdc.1984.272259

Cite this

@article{dbe8405916d9489681cb595d63890b51,

title = "STATE-SPACE ANALYSIS OF STATIC AND DYNAMIC MARKOVIAN ACCESS CONTROL PROTOCOLS.",

abstract = "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 equals 1,. . . , N. Asymptotic analysis of the resulting state-space model constitutes the basis for the developed method. The method gives analytical formulas 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.",

author = "Lim, {Jong Tae} and Merrkov, {Semyon M.} and Zeev Schuss",

year = "1984",

doi = "10.1109/cdc.1984.272259",

language = "אנגלית",

pages = "1364--1371",

journal = "Proceedings of the IEEE Conference on Decision and Control",

issn = "0191-2216",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - STATE-SPACE ANALYSIS OF STATIC AND DYNAMIC MARKOVIAN ACCESS CONTROL PROTOCOLS.

AU - Lim, Jong Tae

AU - Merrkov, Semyon M.

AU - Schuss, Zeev

PY - 1984

Y1 - 1984

N2 - 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 equals 1,. . . , N. Asymptotic analysis of the resulting state-space model constitutes the basis for the developed method. The method gives analytical formulas 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.

AB - 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 equals 1,. . . , N. Asymptotic analysis of the resulting state-space model constitutes the basis for the developed method. The method gives analytical formulas 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.

UR - http://www.scopus.com/inward/record.url?scp=0021642039&partnerID=8YFLogxK

U2 - 10.1109/cdc.1984.272259

DO - 10.1109/cdc.1984.272259

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.conferencearticle???

AN - SCOPUS:0021642039

SN - 0191-2216

SP - 1364

EP - 1371

JO - Proceedings of the IEEE Conference on Decision and Control

JF - Proceedings of the IEEE Conference on Decision and Control

ER -

STATE-SPACE ANALYSIS OF STATIC AND DYNAMIC MARKOVIAN ACCESS CONTROL PROTOCOLS.

Abstract

Access to Document

Other files and links

Fingerprint

Cite this