DocumentCode
3553309
Title
Preassigned retransmission slots multiple access scheme (PARS)
Author
Sarraf, Mohsen
Author_Institution
AT&T Bell Lab., Middletown, NJ, USA
fYear
1991
fDate
7-11 Apr 1991
Firstpage
1306
Abstract
A new multiple-access scheme for a finite number of stations, called preassigned retransmission slots (PARS), is introduced. The delay-throughput performance of the algorithm has been analyzed under single buffer assumption, and simulated under the infinite buffer assumption. Both performance studies show that the algorithm is stable and performs like slotted-ALOHA in light traffic situations and like time division multiple access (TDMA) in heavy traffic situations. The adaptation to traffic intensity is inherent in the algorithm and no dynamic control of any parameters of the algorithm is needed to achieve this property. Hence, implementation of PARS is much easier than some other algorithms with the same property. It is also shown that in cases in which traffic is not uniformly generated among stations, PARS performs better than TDMA, even in heavy traffic situations
Keywords
data communication systems; multi-access systems; packet switching; protocols; PARS; TDMA; data communication; delay-throughput performance; heavy traffic; light traffic; multiple access scheme; packet transmission; preassigned retransmission slots; slotted-ALOHA; time division multiple access; Algorithm design and analysis; Analytical models; Communication system traffic control; Delay; Heuristic algorithms; Performance analysis; Testing; Throughput; Time division multiple access; Traffic control;
fLanguage
English
Publisher
ieee
Conference_Titel
INFOCOM '91. Proceedings. Tenth Annual Joint Conference of the IEEE Computer and Communications Societies. Networking in the 90s., IEEE
Conference_Location
Bal Harbour, FL
Print_ISBN
0-87942-694-2
Type
conf
DOI
10.1109/INFCOM.1991.147656
Filename
147656
Link To Document