QUEUEING ANALYSIS OF SOME BUFFERED RANDOM MULTIPLE ACCESS SCHEMES.

Efstathios D. Sykas; Dionysios E. Karvelas; Emmanuel N. Protonotarios

doi:10.1109/tcom.1986.1096622

QUEUEING ANALYSIS OF SOME BUFFERED RANDOM MULTIPLE ACCESS SCHEMES.

Efstathios D. Sykas, Dionysios E. Karvelas, Emmanuel N. Protonotarios

Research output: Contribution to journal › Article › peer-review

29 Scopus citations

Abstract

A queueing model is proposed that is appropriate for the analysis of multiple-access schemes with finite user buffer capacity. This model can be applied to several slotted random multiple-access schemes such as the URN, ALOHA, and the random TDMA channels. The examined system, in general, can be modeled as a multidimensional Markov chain. The enormous state-space for its complete description makes numerical analysis intractable. Nevertheless, the symmetry properties of the system can be exploited so that the state space will be reduced. In particular, the queue length at one station and the number of busy stations are used to characterize the behavior of the system. In this way, a two-dimensional Markov chain can be constructed and an approximate solution is obtained which is in agreement with simulation results.

Original language	English (US)
Pages (from-to)	790-798
Number of pages	9
Journal	IEEE Transactions on Communications
Volume	COM-34
Issue number	8
DOIs	https://doi.org/10.1109/tcom.1986.1096622
State	Published - 1986
Externally published	Yes

All Science Journal Classification (ASJC) codes

Electrical and Electronic Engineering

Access to Document

10.1109/tcom.1986.1096622

Cite this

@article{660c09efa85b4459872054bd57b29242,

title = "QUEUEING ANALYSIS OF SOME BUFFERED RANDOM MULTIPLE ACCESS SCHEMES.",

abstract = "A queueing model is proposed that is appropriate for the analysis of multiple-access schemes with finite user buffer capacity. This model can be applied to several slotted random multiple-access schemes such as the URN, ALOHA, and the random TDMA channels. The examined system, in general, can be modeled as a multidimensional Markov chain. The enormous state-space for its complete description makes numerical analysis intractable. Nevertheless, the symmetry properties of the system can be exploited so that the state space will be reduced. In particular, the queue length at one station and the number of busy stations are used to characterize the behavior of the system. In this way, a two-dimensional Markov chain can be constructed and an approximate solution is obtained which is in agreement with simulation results.",

author = "Sykas, {Efstathios D.} and Karvelas, {Dionysios E.} and Protonotarios, {Emmanuel N.}",

year = "1986",

doi = "10.1109/tcom.1986.1096622",

language = "English (US)",

volume = "COM-34",

pages = "790--798",

journal = "IEEE Transactions on Communications",

issn = "0096-1965",

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

number = "8",

}

TY - JOUR

T1 - QUEUEING ANALYSIS OF SOME BUFFERED RANDOM MULTIPLE ACCESS SCHEMES.

AU - Sykas, Efstathios D.

AU - Karvelas, Dionysios E.

AU - Protonotarios, Emmanuel N.

PY - 1986

Y1 - 1986

N2 - A queueing model is proposed that is appropriate for the analysis of multiple-access schemes with finite user buffer capacity. This model can be applied to several slotted random multiple-access schemes such as the URN, ALOHA, and the random TDMA channels. The examined system, in general, can be modeled as a multidimensional Markov chain. The enormous state-space for its complete description makes numerical analysis intractable. Nevertheless, the symmetry properties of the system can be exploited so that the state space will be reduced. In particular, the queue length at one station and the number of busy stations are used to characterize the behavior of the system. In this way, a two-dimensional Markov chain can be constructed and an approximate solution is obtained which is in agreement with simulation results.

AB - A queueing model is proposed that is appropriate for the analysis of multiple-access schemes with finite user buffer capacity. This model can be applied to several slotted random multiple-access schemes such as the URN, ALOHA, and the random TDMA channels. The examined system, in general, can be modeled as a multidimensional Markov chain. The enormous state-space for its complete description makes numerical analysis intractable. Nevertheless, the symmetry properties of the system can be exploited so that the state space will be reduced. In particular, the queue length at one station and the number of busy stations are used to characterize the behavior of the system. In this way, a two-dimensional Markov chain can be constructed and an approximate solution is obtained which is in agreement with simulation results.

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

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

U2 - 10.1109/tcom.1986.1096622

DO - 10.1109/tcom.1986.1096622

M3 - Article

AN - SCOPUS:0022769836

SN - 0096-1965

VL - COM-34

SP - 790

EP - 798

JO - IEEE Transactions on Communications

JF - IEEE Transactions on Communications

IS - 8

ER -

QUEUEING ANALYSIS OF SOME BUFFERED RANDOM MULTIPLE ACCESS SCHEMES.

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this