Charles D. Pack
Abstract
A study is made of the way in which asynchronous time division multiplexing changes the stochastic nature of the arrival process from a user to the computer and, consequently, affects the performance of a time-shared computer-communications system. It is concluded that while, for certain values of system parameters, there is noticeable improvement in the performance of the computer (model), in the sense that time-shared scheduling delays are reduced, these improvements are offset by the transmission delays imposed by multiplexing so that there may be little or no change in the computer-communications system performance.
Analytical and simulation results are based on the model of the computer-communications system being an M/D/1 queue (the multiplexor) in tandem with a single exponential server (the computer). Analytical results include a general description of the output process of an M/D/1 queue and the conditions under which this output process is approximately Poisson.
- 1 Chu, W. A study of asynchronous time-division multiplexing for time-sharing computer systems. Proc. AFIPS 1969 FJCC, Vol. 35, AFIPS Press, Montvale, N.J., pp. 669-678.Google Scholar
- 2 Jackson, P.E., and Stubbs, C.D. A study of multiaccess computer communications. Proc. AFIPS 1969 SJCC, Vol. 34, AFIPS Press, Montvale, N.J., pp. 491-504.Google Scholar
- 3 Prabhu, N.U. Queues and Inventories. Wiley, New York, 1965.Google Scholar
- 4 Takacs, L. Introduction to the Theory of Queues. Oxford University Press, New York, 1962.Google Scholar
- 5 Daley, D. J. The correlation structure of the output process of some single server queuing systems. Annals of Math. Stat. 39, 3 (1968), 1007-10019.Google ScholarCross Ref
- 6 Kleinrock, L. Time-shared systems: a theoretical treatment. J. ACM 14, 2 (Apr. 1967), 242-261. Google ScholarDigital Library
- 7 Fuchs, E., and Jackson, P.E. Estimates of distributions of random variables for certain computer communications traffic models. Comm. ACM 13, 12 (Dec. 1970), 752-757. Google ScholarDigital Library
- 8 Feller, W. An Introduction to Probability Theory and Its Applications, Vol. 2. Wiley, New York, 1966, p. 1.Google Scholar
- 9 Coffman, E.G., and Kleinrock, L. Feedback queueing models for time-shared systems. J. ACM 15, 4 (Oct. 1968), 549-576. Google ScholarDigital Library
- 10 Unpublished report on Study of Short Holding Time Computer-Communications Systems.Google Scholar
- 11 Pack, C.D. Output of an M/D/I queue. To be published.Google Scholar
- 12 Dudick, A.L., and Pack, C.D. Round robin scheduling in a computer communications system with finite swap time and statistically multiplexed arrivals. Proc. ACM-IEEE Second Symp. on Problems in the Optimization of Data Communications Systems, Oct. 1971. Google ScholarDigital Library
Recommendations
Performance Analysis of Reassembly and Multiplexing Queueing with Long-Range-Dependent Input Traffic
This paper studies the impact of long-range-dependent (LRD) traffic on the performance of reassembly and multiplexing queueing. A queueing model characterizing the general reassembly and multiplexing operations performed in packet networks is developed ...
Analysis, approximations and admission control of a multi-service multiplexing system with priorities
INFOCOM '95: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2We consider an ATM system with an architecture which is designed to accommodate users with very different quality of service requirements. Sources which belong to a high priority class share a FCFS buffer, which has priority access to the trunk. A low ...
Computable exponential bounds for intree networks with routing
INFOCOM '95: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1In this paper, we refine the calculus proposed previously by Chang et al. (1994). The new calculus, including network operations for multiplexing, input-output relation, and routing, allows us to compute tighter exponential bounds for the tail ...
Comments