Performance analysis of reservation random access protocols for cellular packet communications

Author

Jangi, Shrirang ; Merakos, Lazaros

Author_Institution

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

fYear

1991

fDate

2-5 Dec 1991

Firstpage

895

Abstract

An analysis method for evaluating the performance of a class of RRA (reservation random access) protocols is developed. The method is based on a Markovian model whose stationary solution is obtained via an iterative computational procedure based on matrix decomposition techniques. Subject to a maximum delay constraint, the steady state probability of voice packet dropping is evaluated for three RRA protocol examples and comparisons are made with the performance of an ideal hypothetical multiplexer. Suggestions for the design of integrated voice/data RRA protocols are made. The transient performance of RRA protocols is evaluated

Keywords

Markov processes; cellular radio; iterative methods; matrix algebra; packet radio networks; protocols; Markovian model; analysis method; cellular packet communications; design; integrated voice/data RRA protocols; iterative computational procedure; matrix decomposition techniques; performance; reservation random access protocols; steady state probability; voice packet dropping; Access protocols; Base stations; Data engineering; Delay; Digital signal processing; Iterative methods; Matrix decomposition; Performance analysis; Speech; Time division multiple access;

fLanguage

English

Publisher

ieee

Conference_Titel

Global Telecommunications Conference, 1991. GLOBECOM '91. 'Countdown to the New Millennium. Featuring a Mini-Theme on: Personal Communications Services

Conference_Location

Phoenix, AZ

Print_ISBN

0-87942-697-7

Type

conf

DOI

10.1109/GLOCOM.1991.188510

Filename

188510