Dynamic control of time slot assignment in multiaccess reservation protocols

TitleDynamic control of time slot assignment in multiaccess reservation protocols
Publication TypeJournal Article
Year of Publication1996
AuthorsRoorda, P. D., and V. C. M. Leung
JournalCommunications, IEE Proceedings-
Volume143
Pagination167 -175
Date Publishedjun.
ISSN1350-2425
KeywordsBayes methods, data packet transmissions, data subframes, decision theory, delay-throughput performance, delays, dynamic control, finite user population, fixed length frames, frame structures, heuristic dynamic assignment policy, long propagation delays, Markov decision process, Markov processes, MF policy, multiaccess channels, multiaccess reservation protocols, optimal time slot assignment policy, packet reservation multiple access, pseudoBayesian estimator, reservation protocols, reservation subframes, reserved time slots, satellite channels, satellite communication, slotted ALOHA random access, state estimation, state information, telecommunication channels, telecommunication congestion control, time slot assignment
Abstract

The authors consider the dynamic control of time slot assignment in reservation protocols for multiaccess channels employing frame structures similar to those investigated by Roberts (1973) and others. Such protocols are particularly suitable for channels with long propagation delays, such as satellite channels. Fixed length frames are dynamically divided on a frame by frame basis into reservation subframes with minislots for reservation requests transmitted by slotted ALOHA random access, and data subframes with reserved time slots for data packet transmissions. Formulating the problem as a Markov decision process, the authors derive the optimal time slot assignment policy, which makes use of complete state information of the finite user population, and obtain the delay-throughput performance. Results show that the optimal policy provides substantial performance improvements over fixed assignment policies. Furthermore, a heuristic dynamic assignment policy called the MF policy is proposed that is much easier to derive and implement, particularly for large networks, while maintaining performance very close to the optimal. Both of these dynamic policies depend on system state information, which the authors estimate using a generalised pseudo-Bayesian estimator. The use of this estimator results in only a small reduction in performance

URLhttp://dx.doi.org/10.1049/ip-com:19960474
DOI10.1049/ip-com:19960474

a place of mind, The University of British Columbia

Electrical and Computer Engineering
2332 Main Mall
Vancouver, BC Canada V6T 1Z4
Tel +1.604.822.2872
Fax +1.604.822.5949
Email:

Emergency Procedures | Accessibility | Contact UBC | © Copyright 2020 The University of British Columbia