Summary
This paper develops discrete event simulation methods for local area computer networks. We restrict attention to local network simulations with an underlying stochastic process that can be represented as a generalized semi-Markov process. Using a “geometric trials” criterion for recurrence, we establish a regenerative process structure for passage times in this setting. This leads to an estimation procedure for delay characteristics of ring and bus networks.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Crane, M.A., Iglehart, D.L.: Simulating stable stochastic systems: III, Regenerative processes and discrete event simulation. Operations Res. 23, 33–45 (1975)
Doob, J.L.: Stochastic Processes. New York: John Wiley, 1953
Eswaran, K.P., Hamacher, V.C., Shedler, G.S.: Collision-free access control for computer communication bus networks. IEEE Trans. Software Engrg. SE-7, 574–582 (1981)
Fossett, L.D.: Simulating generalized semi-Markov processes. Technical Report No. 4. Department of Operations Research. Stanford University. Stanford, CA, 1979
Glynn, P.W.: Forthcoming technical report. Department of Industrial Engineering. University of Wisconsin. Madison, WI, 1984
Haas, P.J., Shedler, G.S.: Regenerative simulation methods for local computer networks. Technical Report 25. Department of Operations Research. Stanford University. (Submitted for publication)
Iglehart, D.L., Shedler, G.S.: Statistical efficiency of regenerative simulation methods for networks of queues. Advances in Appl. Probability 15, 183–197 (1983)
Iglehart, D.L., Shedler, G.S.: Simulation of non-Markovian systems. IBM J. Res. Develop. 27, 472–480 (1983)
Kaye, A.R.: Analysis of a distributed control loop for data transmission. Proc. of the Symposium on Computer Communication Networks and Teletraffic, pp. 47–57. Polytechnic Institute of Brooklyn Press, 1972
König, D., Matthes, K., Nawrotzki, K.: Verallgemeinerungen der Erlangschen und Engsetschen Formeln. Berlin, Akademie-Verlag 1967
König, D., Matthes, K., Nawrotzki, K.: Unempfindlichkeitseigenschaften von Bedienungsprozessen. Appendix to Gnedenko, B.V., Kovalenko, I.N.: Introduction to Queueing Theory, German edition, 1974
Loucks, W.M., Harnacher, V.C., Preiss, B.: Performance of short packet local area rings. Technical Report. Departments of Electrical Engineering and Computer Science. University of Toronto. Toronto, Canada, 1982
Matthes, K.: Zur Theorie der Bedienungsprozesse. Trans. 3rd Prague Conference on Information Theory and Statistical Decision Functions. Prague, 1962
Miller, D.: Existence of limits in regenerative processes. Ann. Math. Statist. 43, 1275–1282 (1972)
Nummelin, E.: A splitting technique for φ-recurrent Markov chains. Technical Report MAT A 80. Helsinki University of Technology, Helsinki, 1976
Shedler, G.S., Southard, J.: Regenerative simulation of networks of queues with general service times: passage through subnetworks. IBM J. Res. Develop. 26, 625–633 (1982)
Smith, W.L.: Renewal theory and its ramifications. J. Roy. Statist. Soc. Ser. B20, 243–302 (1958)
Tuominen, P., Tweedie, R.L.: Exponential ergodicity in Markovian queueing and dam models. J. Appl. Probability 16, 867–880 (1979)
Whitt, W.: Continuity of generalized semi-Markov processes. Math. Operations Res. 5, 494–501 (1980)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Iglehart, D.L., Shedler, G.S. Simulation output analysis for local area computer networks. Acta Informatica 21, 321–338 (1984). https://doi.org/10.1007/BF00264614
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00264614