Abstract
Two simple and tight delay lower bounds are derived for packet satellite protocols with memoryless packet arrival process and single copy transmission. One bound is for protocols with contention‐free reservation and the other is for protocols with contention‐based reservation. The derivation indicates that for minimum delay, a protocol should strive to maintain a balance between transmitting packets immediately and making reservations before transmissions.
Similar content being viewed by others
References
D.M. Chite and J.S. McCoskey, VSAT networks: architectures, protocols, and management, IEEE Communications Magazine 26(7) (July 1988).
Kleinrock, Queueing Systems, Vol. 1: Theory (Wiley, New York 1975), p. 134.
H.W. Lee and J.W. Mark, Combined random/reservation access for packet switched transmission over a satellite with on-board processing: Part I - Global beam satellite, IEEE Trans. Commun. 31 (October 1983) 1161–1171.
F.A. Tobagi, Multiaccess protocols in packet communication systems, IEEE Trans. Commun. 28(4) (April 1980).
E.W.M. Wong and T.S. Yum, The controlled multiaccess protocol for packet satellite communication, IEEE Trans. Commun. 39(7) (July 1991).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Wong, E.W., Yum, T.P. Delay bounds for packet satellite protocols. Telecommunication Systems 8, 277–291 (1997). https://doi.org/10.1023/A:1019169606393
Issue Date:
DOI: https://doi.org/10.1023/A:1019169606393