Numerical Methods for Modeling Computer Networks Under Nonstationary Conditions

IEEE Journal on Selected Areas in Communications

Volumn 8, Issue 9, 1990, Pages 1682-1695

  Tipper, David ^a   Sundareshan, Malur K ^b  

^a CLEMSON UNIVERSITY   (United States)

^b UNIVERSITY OF ARIZONA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; CONTROL SYSTEMS, OPTIMAL - APPLICATIONS; MATHEMATICAL TECHNIQUES - NUMERICAL METHODS; PROBABILITY - QUEUEING THEORY;

DIFFERENTIAL EQUATION MODELS; MULTIPLE TRAFFIC CLASSES; NONSTATIONARY CONDITION COMPUTER NETWORKS; STATE MODELS DEVELOPMENT; TIME VARYING PROBABILITY DISTRIBUTIONS;

COMPUTER NETWORKS;

EID: 0025635172     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/49.62855     Document Type: Article

References (31)

1. M. Schwartz, Telecommunication Networks: Protocols, Modeling and Analysis. Reading, MA: Addison-Wesley, 1987.
2. D. Bertsekas and R. Gallager, Data Networks. Englewood Cliffs, NJ: Prentice-Hall, 1987.
3. T. Stern, “Approximations of queue dynamics and their applications to adaptive routing in computer communication networks,” IEEE Trans. Commun., vol. COM-27, pp. 1331–1335, Sept. 1979.
4. J. Hammond and J. Spragins, “Rapidly reconfiguring computer communication networks: Definition and major issues,” in Proc. IEEE INFOCOM 87, San Francisco, CA, 1987, pp. 202–206.
5. H. Van As, “Transient analysis of Markovian queueing systems and its application to congestion control modeling,” IEEE J. Select. Areas Commun., vol. SAC-4, no. 6, pp. 891–904, Sept. 1986.
6. D. Tipper and M. K. Sundareshan, “Adaptive policies for optimal buffer management in dynamic load environments,” in Proc. IEEE INFOCOM’88, New Orleans, LA, Mar. 1988, pp. 535–544.
7. J. Filipiak, Modeling and Control of Dynamic Flows in Communication Networks. New York: Springer-Verlag, 1988.
8. A. Weiss and D. Mitra, “A transient analysis of a data network with a processor sharing switch,” AT&T Tech. J., pp. 4-16, Sept./Oct. 1988.
9. D. Mitra and A. Weiss, “The transient behavior in Erlang’s model for large trunk groups and various traffic conditions,” in Proc. 12th Int. Teletraffic Congress, Turin, Italy, June 1988. pp. 1364–1374.
10. J. Zhang and E. Coyle, “Matrix recursive solutions for the transient behavior of QBD-processes and its application to random access networks,” in Proc. Inform. Sci. Syst. Conf., Princeton, NJ, 1988.
11. J. McQuillan and D. Walden, “The Arpanet design decision,” Computer Networks, vol. 1, pp. 243–289, 1977.
12. S. Tripathi and A. Duda, “Time-dependent analysis of queueing systems,” INFOR, vol. 24, no. 3, pp. 199–219, 1986.
13. T. C. Kotiah, “Approximate transient analysis of some queueing systems,” Oper. Res., vol. 26, pp. 334–346, 1978.
14. P. E. Cantrell, “Computation of the transient M/M/l queue Cdf, Pdf, and mean with generalized Q functions,” IEEE Trans. Com-mun., vol. COM-34, pp. 814–817, Aug. 1986.
15. M. H. Ackroyd, “M/M/l transient state occupancy probabilities via the discrete Fourier transform,” IEEE Trans. Commun., vol. COM-30, pp. 557–559, Mar. 1982.
16. S. K. Jones, R. K. Cavin, and D. A. Johnson, “An efficient computational procedure for the evaluation of the M/M/1 transient state occupancy probabilities,” IEEE Trans. Commun., vol. COM-28, pp. 2019–2020, Dec. 1980.
17. A. R. Odoni and E. Roth, “An empirical investigation of the transient behavior of stationary queueing systems,” Oper. Res., vol. 31, no. 3, pp. 432–455, May-June, 1983.
18. W. Press, B. Flannery, S. Teukolsky, and W. Vetterling, Numerical Recipes. Cambridge, England: Cambridge University Press, 1986.
19. S. Ross, Stochastic Processes. New York: Wiley, 1983.
20. M. R. Taafe, “Approximating nonstationary queueing systems,” Ph.D. dissertation, Ohio State Univ., Columbus, OH, 1982.
21. D. Tipper, “Adaptive routing, flow control and buffer management in computer communication networks,” Ph.D. dissertation, Univ. of Arizona, 1988.
22. C. Agnew, “Dynamic modeling and control of congestion-prone systems,” Oper. Res., vol. 24, no. 3, pp. 400–419, 1976.
23. K. L. Rider, “A simple approximation to the average queue size in the time-dependent M/M/l queue,” J. Ass. Comput. Mach., vol. 23, no. 2, pp. 361–367, 1976.
24. G. Newell, Applications of Queueing Theory. London: Chapman and Hall, 1971.
25. D. Tipper and M. K. Sundareshan, “An optimal control approach to decentralized dynamic virtual circuit routing in computer networks,” in Proc. IEEE INFOCOM ’90, San Francisco, CA, June 5-7, 1990.
26. W. Lovegrove, “A methodology for simulation of the nonstationary behavior of computer networks,” Ph.D. dissertation, Clemson Univ., Clemson, SC, 1990.
27. A. P. Sage and C. White, Optimum Systems Control. Englewood Cliffs, NJ: Prentice-Hall, 1977.
28. L. Kleinrock, “Power and deterministic rules of thumb for probabilistic problems in computer communications,” in Proc. Int. Conf. Commun., vol. 1, June 1979, pp. 43.1.1–43.1.10.
29. S. Stidham, “Optimal control of admission to a queueing system,” IEEE Trans. Automat. Contr.,Vol. AC-30, no. 8, pp. 705–713, 1985.
30. P. Chemouil and J. Filipiak, “Kalman filtering of traffic fluctuations for real-time network management,” in Proc. 4th IFAC/IFORS Symp. Large Scale Syst., Zurich, Switzerland, 1986.
31. S. Hantler and Z. Rosberg, “Optimal estimation for an M/M/c queue with time varying parameters,” Stochastic Models, vol. 5, no. 2, pp. 295–313, 1989.