A method for delay analysis of interacting queues in multiple access systems

Author

Modiano, Eytan ; Ephremides, Anthony

Author_Institution

US Naval Res. Lab., Washington, DC, USA

fYear

1993

fDate

1993

Firstpage

447

Abstract

An approximate model for analyzing interacting queues is developed. This approximation models an N-dimensional infinite Markov chain by means of two Markov chains, one being one-dimensional and infinite and the other being N-dimensional and finite. The transition probabilities of each chain are expressed in terms of statistics of the other chain. The two chains are solved together iteratively to yield an approximation to the original N-dimensional infinite chain. The model is used to analyze systems of dependent queues which often arise in multiple access protocols. It is shown how this model can be used to analyze the ALOHA multiple access protocol as well as a previously proposed broadcast algorithm for a mesh network. The results compare very well with simulation

Keywords

Markov processes; delays; multi-access systems; protocols; queueing theory; telecommunication networks; telecommunication traffic; ALOHA multiple access protocol; N-dimensional infinite Markov chain; approximate model; broadcast algorithm; delay analysis; finite chain; infinite chain; interacting queues; iterative solution; mesh network; multiple access systems; protocols; traffic; transition probabilities; Access protocols; Algorithm design and analysis; Broadcasting; Delay; Information analysis; Information technology; Laboratories; Mesh networks; Probability; Queueing analysis;

fLanguage

English

Publisher

ieee

Conference_Titel

INFOCOM '93. Proceedings.Twelfth Annual Joint Conference of the IEEE Computer and Communications Societies. Networking: Foundation for the Future, IEEE

Conference_Location

San Francisco, CA

Print_ISBN

0-8186-3580-0

Type

conf

DOI

10.1109/INFCOM.1993.253331

Filename

253331