Hostname: page-component-76fb5796d-wq484 Total loading time: 0 Render date: 2024-04-26T15:17:23.129Z Has data issue: false hasContentIssue false
  • English
  • Français

Message Delay Distribution in Generalized Time Division Multiple Access (TDMA)

Published online by Cambridge University Press:  27 July 2009

Raphael Rom  and
Moshe Sidi
Raphael Rom
Affiliation:
Department of Electrical Engineering Technion-Israel Institute of Technology Haifa, Israel 32000
Moshe Sidi
Affiliation:
Department of Electrical Engineering Technion-Israel Institute of Technology Haifa, Israel 32000
Get access Rights & Permissions [Opens in a new window]

Abstract

In the classical TDMA, which has been the subject of extensive research in the past, a single slot is allocated to each and every user within every frame. In many situations this leads to an inefficient utilization of the channel calling for a nonhomogeneous allocation of slots. This paper focuses on a generalized TDMA scheme in which users are allocated more than a single slot per frame, not necessarily contiguous. We derive the delay distribution and buffer occupancy for such a scheme as well as the expected values of these quantities.

Type
Articles
Information
Probability in the Engineering and Informational Sciences , Volume 4 , Issue 2 , April 1990 , pp. 187 - 202
Copyright
Copyright © Cambridge University Press 1990

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Birdstall, T.G., Ristenbatt, M.P. & Weinstein, S. B. (1962). Analysis of asynchronous time multiplexing of speech sources. IRE Transactions on Communication Systems CS-10: 390–397.CrossRefGoogle Scholar
Chu, W.W. (1970). Buffer behavior for batch Poisson arrivals and single constant output. IEEE Transactions on Communications COM-18: 613–618.CrossRefGoogle Scholar
Clare, L.P. & Rubin, I. (1982). Queueing analysis of TDMA with limited and unlimited buffer capacity. Tech. Rep. UCLA-ENG-82−63, UCLA.Google Scholar
Dor, N.M. (1967). Guide to the length of the buffer storage required for random (Poisson) input and constant output rates. IEEE Transactions on Electronic Computers EC-16: 683–684.Google Scholar
Fredrikson, G.F.W. (1974). Buffer behavior for binomial input and constant service. IEEE Transactions on Communications COM-22: 1862–1866.CrossRefGoogle Scholar
Georganas, N.D. (1976). Buffer behavior for Poisson arrival and bulk geometric service. IEEE Transactions on Communications COM-24: 938–940.Google Scholar
Heines, T.S. (1979). Buffer behavior in computer communication systems. IEEE Transactions on Electronic Computers C-28: 573–576.Google Scholar
Hsu, J. (1974). Buffer behavior with Poisson arrival and geometric output process. IEEE Transactions on Communications COM-22: 1940–1941.CrossRefGoogle Scholar
Kekre, H.B. & Saxena, C.L. (1978). Finite buffer behavior with Poisson arrivals and random server interruptions. IEEE Transactions on Communications COM-26: 470–474.Google Scholar
Lam, S.S. (1977). Delay analysis of a time division multiple access (TDMA) channel. IEEE Transactions on Communications COM-25(12): 1489–1494.Google Scholar
Rubin, I. (1979). Message delays in FDMA and TDMA communication channels. IEEE Transactions on Communications COM-27(5): 769–777.CrossRefGoogle Scholar
Shanthikumar, J.G. (1988). On some queueing models of time division multiple access communication system. Performance Evaluation: 289–304.Google Scholar
Yan, T.Y. (1982). On the delay analysis of a finite capacity TDMA channel. IEEE Transactions on Communications COM-30: 1937–1942.Google Scholar
Hayes, J.F. (1984). Modeling and analysis of computer communication networks. New York: Plenum Press.CrossRefGoogle Scholar
Ko, K.T. & Davis, B.R. (1984). Delay analysis for a TDMA channel with contiguous output and Poisson message arrival. IEEE Transactions on Communications COM-32: 707–709.Google Scholar
Bruneel, H. (1986). Message delay in TDMA channels with contiguous output. IEEE Transactions on Communications COM-34: 681–684.Google Scholar
Anderson, R.R., Foschini, G.J. & Gopinath, B. (1979). A queueing model for a hybrid data multiplexer. Bell System Technical Journal: 297–301.Google Scholar
Hofri, M. & Rosberg, Z. (1987). Packet delay under the golden ratio weighted TDM policy in a multiple access channel. IEEE Transactions on Information Theory IT-33(3): 341–349.CrossRefGoogle Scholar
Mueller, D.E. (1956). A method of solving algebraic equations using an automatic computer. Mathematical Tables and Other Aids to Computation (MTAC) 10: 208–215.CrossRefGoogle Scholar
Conte, S.D. & de, Boore C. (1980). Elementary Numerical Analysis: An Algorithmic Approach (3rd ed.). New York: McGraw Hill.Google Scholar
Neuts, M. F. (1981). Matrix-geometric solutions in stochastic models: An algorithmic approach. Baltimore, MD: The John Hopkins Press.Google Scholar