Imbedded Markov Chain Analysis of Time-Division Multiplexing
In general terms, multiplexing is a means for sharing facilities among a number of users and sources. As we have seen in Section 2.4, the standard techniques for doing this in the telephone networks are frequency-division multiplexing (FDM) and time-division multiplexing (TDM). The explosive growth of digital technology has favored the development of TDM for sharing the capacity of transmission lines. Moreover, the digital basis of time-division multiplexing makes it a natural vehicle for data traffic. In this chapter we shall analyze the performance of time-division multiplexing and a variant, asynchronous time-division multiplexing. This analysis is closely related to the analysis of the M/G/1 queue in the previous chapter inasmuch as both use the imbedded Markov chain approach.
KeywordsArrival Process Average Delay Data Unit Idle Period State Transition Probability
Unable to display preview. Download preview PDF.
- 1.R. J. Camrass and R. G. Gallager, “Encoding Message Lengths for Data Transmission,” IEEE Transactions on Information Theory, IT-24, July 1978.Google Scholar
- 2.W. W. Chu, “A Study of Asynchronous TDM for Time Sharing Computer Systems,” AFIPS Conference Proceedings, Fall Joint Computer Conference (1969), Vol. 35, pp. 669–678.Google Scholar
- 8.N. T. J. Bailey, “On Queueing Processes with Bulk Service,” Journal of the Royal Statistical Society (1954).Google Scholar
- 9.K. Knopf, Theory of Functions. Part II: Application and Further Development of the General Theory. Dover, New York (1947).Google Scholar
- 12.G. J. Foschini, B. Gopinath, and J. F. Hayes, “Subframe Switching for Data Communications,” International Telemetry Conference, Los Angeles (1978).Google Scholar
- 16.M. Kaplan, “A Single-Server Queue with Cyclostationary Arrivals and Arithmetic Service,” Operations Research (in press).Google Scholar