A simple window random access algorithm with advantageous properties

Author

Paterakis, Michael ; Papantoni-Kazakos, P.

Author_Institution

Dept. of Electr. Eng., Virginia Univ., Charlottesville, VA, USA

fYear

1988

fDate

27-31 March 1988

Firstpage

907

Lastpage

915

Abstract

A simple full-feedback-sensing window random-access algorithm is proposed and analyzed in the presence of the Poisson user model. The throughput of the algorithm is 0.43. The proposed algorithm is better than J.I. Capetanaki´s dynamic algorithm (1979) with respect to its delay and resistance to channel errors. The simple operations of the algorithm, along with its regenerative properties, facilitate the computation of the output traffic interdeparture distribution. The obtained distribution is useful in the evaluation of interacting systems which adopt the algorithm for their internal transmissions.<>

Keywords

delays; feedback; packet switching; protocols; telecommunication traffic; Poisson user model; delay analysis random access transmission; full-feedback-sensing window random-access algorithm; internal transmissions; output traffic interdeparture distribution; regenerative properties; throughput; Algorithm design and analysis; Computer numerical control; Delay systems; Distributed computing; Feedback; Heuristic algorithms; History; Road accidents; Throughput; Traffic control;

fLanguage

English

Publisher

ieee

Conference_Titel

INFOCOM '88. Networks: Evolution or Revolution, Proceedings. Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies, IEEE

Conference_Location

New Orleans, LA, USA

Print_ISBN

0-8186-0833-1

Type

conf

DOI

10.1109/INFCOM.1988.13006

Filename

13006