Delay analysis of the n-ary stack random-access algorithm

Author

Merakos, Lazaros F. ; Bisdikian, Chatschik

Author_Institution

Dept. of Electr. & Comput. Eng., Northeastern Univ., Boston, MA, USA

Volume

34

Issue

5

fYear

1988

fDate

9/1/1988 12:00:00 AM

Firstpage

931

Lastpage

942

Abstract

An analysis is presented of the delay performance of the n-ary stack algorithm, an easy-to-implement random-access algorithm that uses collision-no-collision binary feedback and requires only limited feedback sensing by the users. Utilizing the regenerative character of the stochastic processes that are associated with the random-access system, tight upper and lower bounds on the mean packet delay and on the packet delay variance are derived. It is shown that the algorithm with n=3 has the best delay characteristics. Simulation results for the percentiles of the packet delay distribution are given

Keywords

delays; feedback; information theory; random processes; stochastic processes; collision-no-collision binary feedback; delay performance; n-ary stack random-access algorithm; regenerative character; stochastic processes; Algorithm design and analysis; Communication channels; Communication system control; Delay; Feedback; Monitoring; Radio broadcasting; Satellite broadcasting; Signal processing algorithms; Throughput;

fLanguage

English

Journal_Title

Information Theory, IEEE Transactions on

Publisher

ieee

ISSN

0018-9448

Type

jour

DOI

10.1109/18.21217

Filename

21217