Skip to main content
SpringerLink
Log in
Book cover

Deterministic and Stochastic Scheduling pp 211–222Cite as

Queueing Networks and their Computer System Applications: An Introductory Survey

  • Conference paper

Part of the book series: NATO Advanced Study Institutes Series ((ASIC,volume 84))

Abstract

Queueing networks and their properties have been subjected to intensive study in the past ten years. The primary application considered has been the analysis of computer system and computer-communication network performance. We present a brief introductory survey of some of the relevant literature.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S.L. Albin, Approximating superimposition arrival processes of queues, report, Bell Laboratories (April 1980).

    Google Scholar 

  2. A.D. Barbour, Networks of queues and the method of stages, Adv. Appl. Prob 8 (1976), 584–591.

    Article  MathSciNet  MATH  Google Scholar 

  3. F. Baskett, K.M. Chandy, R.R. Muntz and F. Palacios-Gomez, Open, closed and mixed networks of queues with different classes of customers, J.ACM 22, 2 (April 1975), 248–260.

    Article  MATH  Google Scholar 

  4. R.M. Bryant, On Homogeneity in M/G/1 queueing systems, Performance Evaluation Review 9, 2 (Summer 1980), 199–208.

    Article  Google Scholar 

  5. P.J. Burke, The Output of a queueing system, Oper. Res. 4, (1956), 699–714.

    Article  MathSciNet  Google Scholar 

  6. P.J. Burke, The Dependence of sojourn times in tandem M/M/s queues, Oper. Res. 77 (1969), 754–755.

    Article  Google Scholar 

  7. P.J. Burke, Output processes and tandem queues, Proc. Symp. on Comp. Comm. Networks and Teletraffic, Polytechnic Inst. of Brooklyn (April 1972), 419–428.

    Google Scholar 

  8. P.J. Burke, Proof of a conjecture on the interarrival-time distribution in an M/M/1 queue with feedback, IEEE-TC-24, 5 (1976), 175–176.

    Google Scholar 

  9. J.P. Buzen, Computational algorithms for closed queueing networks with exponential servers, Comm. ACM 16, 9 (September 1973), 527–531.

    Google Scholar 

  10. J.P. Buzen and P.J. Denning, Operational treatment of queue distributions and mean-value analysis, Computer Performance 1, 1 (1980).

    Google Scholar 

  11. K.M. Chandy, The Analysis and solutions for general queueing networks, Proc. 6th Ann. Princeton Conf. on Inf. Sci and Systems (1972), 224-228.

    Google Scholar 

  12. K.M. Chandy, U. Herzog, and L.S. Woo, Parametric anaysis of queueing networks, IBM J.R. & D. 19, 1 (January 1975), 43–49.

    Article  MathSciNet  MATH  Google Scholar 

  13. K.M. Chandy, J.H. Howard and D.F. Towsley, Product form and local balance in queueing networks, J. Acm 24, 2 (April 1977), 250–263.

    Article  MathSciNet  MATH  Google Scholar 

  14. K.M. Chandy and D. Neuse, A Heuristic algorithm for queueing network models of computer systems, Proc. SIGMETRICS Conf. on Meas. and Mod. of Comp. Syst., Las Vegas (September 1981).

    Google Scholar 

  15. K.M. Chandy and C.H. Sauer, Approximate methods of analysis of queueing network models of computer systems, Computing Surveys 10, 3 (September 1978), 263–280.

    Article  Google Scholar 

  16. K.M. Chandy and C.H. Sauer, Computational algorithms for product form queueing networks, Comm. ACM 23, 10 (October 1980).

    Article  MathSciNet  Google Scholar 

  17. W.M. Chow, The Cycle time distribution of exponential central server models, Proc. AFIPS NCC 43, (1978).

    Google Scholar 

  18. W.M. Chow and P.S. Yu, An Approximation technique for central server queueing models with a priority dispatching rule, IBM Research Report, York-town Heights (1979).

    Google Scholar 

  19. R.B. Cooper, Introduction to Queueing Theory, second edition, MacMillan (1980).

    Google Scholar 

  20. P.J. Courtois, Decomposability: queueing and computer system applications, Academic Press (1977).

    Google Scholar 

  21. D.R. Cox, A Use of complex probabilities in the theory of stochastic processes, Proc. Cambridge Phil Soc 51 (1955), 313–319.

    Article  MATH  Google Scholar 

  22. D.J. Daley, Queueing output processes, Adv. Appl. Prob. 8 (1976), 395–415.

    Article  MathSciNet  MATH  Google Scholar 

  23. P.J. Denning and G.S. Graham, Multiprogrammed Memory management, Proc. IEEE 63, 6 (June 1975), 924–939.

    Article  Google Scholar 

  24. P.J. Denning, K.C. Kahn, J. Leroudier, D. Potier, and R. Suri, Optimal multiprogramming, Acta Informatica 7, 2 (1976), 197–216.

    Article  MathSciNet  MATH  Google Scholar 

  25. P.J. Denning and J.P. Buzen, The Operational analysis of queueing network models, Computing Surveys 10, 3 (September 1978), 225–261.

    Article  MATH  Google Scholar 

  26. R.L. Disney and W.P. Cherry, Some topics in queueing network theory, Mathematical Methods in Queueing Theory, A.B. Clarke (ed.), Springer-Verlag (1974).

    Google Scholar 

  27. R.L. Disney, Random flow in queueing networks: a review and critique, Trans. Amer. Inst. Industr. Engr. 7 (1975), 268–288.

    MathSciNet  Google Scholar 

  28. R.L. Disney, Queueing networks, Report VTR-7923, Dept. of Ind. Eng. and Oper. Res., Virginia Polytechnic Institute (August 1980).

    Google Scholar 

  29. R.L. Disney, D.C. McNickle, and B. Simon, The M/G/1 queue with instantaneous Bernoulli feedback, Nav. Rsch. Log. Qtrly. 27, 4 (December 1980), 635–644.

    Article  MathSciNet  MATH  Google Scholar 

  30. D.P. Gaver, Probability models of multiprogramming computer systems, J. Acm 14, 3 (1967), 423–428.

    Article  MATH  Google Scholar 

  31. E. Gelenbe, On Approximate computer system models, J. Acm 22, 2 (April 1975), 261–269.

    Article  MathSciNet  MATH  Google Scholar 

  32. E. Gelenbe and A. Kurinckx, Random injection control of multiprogramming in virtual memory, IEEE Trans. Softwr. Eng. 4, 1 (1978), 2–17.

    Article  Google Scholar 

  33. E. Gelenbe and I. Mitrani, Analysis and Synthesis of Computer Systems, Academic Press (1980).

    Google Scholar 

  34. W.J. Gordon and G.F. Newell, Closed queueing systems with exponential servers, Oper. Res. 75 (1967), 254–265.

    Article  Google Scholar 

  35. G.S. Graham and P.J. Denning, On the relative controllability of memory policies, Computer Performance, K.M. Chandy and M. Reiser (editors), Elsevier North-Holland (1977), 411-428.

    Google Scholar 

  36. J.R. Jackson, Jobshop-like queueing systems, Mgmt. Sci. 10 (1963), 131–142.

    Article  Google Scholar 

  37. F.P. Kelly, Networks of queues, Adv. Appl. Prob. 8 (1976), 416–432.

    Article  MATH  Google Scholar 

  38. F. P. Kelly, Reversibility and Stochastic Networks, John Wiley and Sons, Toronto (1979).

    MATH  Google Scholar 

  39. P.C. Kiessler, A Simulation analysis of sojourn times in a Jackson network, Report VTR-8016, Dept. of Ind. Eng. and Oper. Res., Virginia Polytechnic Institute and State University (December 1980).

    Google Scholar 

  40. L. Kleinrock, Queueing Systems: Volume I — Theory, Wiley-Interscience (1975).

    Google Scholar 

  41. L. Kleinrock, Queueing Systems: Volume II—Computer Applications, Wiley-Interscience (1976).

    Google Scholar 

  42. H. Kobayashi and M. Reiser, On Generalization of job routing behavior in a queueing network model, IBM Research Report RC-5252, Yorktown Heights (1975).

    Google Scholar 

  43. H. Kobayashi and A. Konheim, Queueing models for computer communication systems, IEEE Trans. Comm. Com-25, 1 (January 1977), 2–29.

    Article  MathSciNet  Google Scholar 

  44. H. Kobayashi, Modeling and Analysis: An Introduction To System Performance Evaluation Methodology, Addison-Wesley (1978).

    Google Scholar 

  45. P. Kuhn, Analysis of complex queueing networks by decomposition, 8th International Teletraffic Congress, Melbourne, Australia (November 1976), 236-1-8.

    Google Scholar 

  46. J. Labetoulle, G. Pujolle, and C. Soula, Distribution of the flows in a general Jackson network, Report 341, IRIA Laboria (1979).

    Google Scholar 

  47. S.S. Lam, Queueing networks with population size constraints, IBM J.R. & D. 21, 4 (July 1977), 370–378.

    Article  MATH  Google Scholar 

  48. S. S. Lam and Y. K. Lien, A Tree convolution algorithm for the solution of queueing networks, Report TR-165, University of Texas at Austin (January 1981).

    Google Scholar 

  49. S.S. Lam and J.W. Wong, Queueing network models of packet-switching networks, Report CS-81-06, Dept. of Comp. Sci., Univ. of Waterloo, (February 1981).

    Google Scholar 

  50. S.S. Lavenberg and M. Reiser, Stationary state probabilities at arrival instants for closed queueing networks with multiple types of customers, J. of Appl. Prob. (December 1980).

    Google Scholar 

  51. E.D. Lazowska, The Use of percentiles in modelling cpu service time distributions, Computer Performance, K.M. Chandy and M. Reiser (editors), Elsevier North-Holland (1977), 53-66.

    Google Scholar 

  52. E.D. Lazowska and K.C. Sevcik, Exploiting decomposability to approximate quantiles of response times in queueing networks, Proc. 2nd Int. Conf. on Operating Systems, IRIA, Paris (October 1978).

    Google Scholar 

  53. A.J. Lemoine, Networks of queues —a survey of equilibrium analysis, Mgmt. Sci. 24, 4 (1977), 464–481.

    Article  MathSciNet  MATH  Google Scholar 

  54. R. Marie, An Approximate analytical method for general queueing networks, IEEE Trans. on Softwr. Eng. SE-5, 5 (September 1979).

    Google Scholar 

  55. B. Melamed, On Markov jump processes imbedded at jump epochs and their queueing theoretic applications, Dept. of Ind. Eng. and Mgmt. Sci., Northwestern University (August 1979).

    Google Scholar 

  56. B. Melamed, Characterizations of Poisson traffic streams in Jackson queueing networks, Adv. Appl. Prob. 11 (1979), 422–438.

    Article  MathSciNet  MATH  Google Scholar 

  57. B. Melamed, Sojourn times in queueing networks, Dept. of Ind. Eng. and Mgmt. Sci., Northwestern Univ. (August 1979).

    Google Scholar 

  58. I. Mitrani, A Critical note on a result by Lemoine, Mgmt. Sci. 25, 10 (October 1979), 1026–1027.

    Article  Google Scholar 

  59. M. Molle and L. Kleinrock, Virtual time CSMA: a new protocol with improved delay characteristics, UCLA (November 1980).

    Google Scholar 

  60. R.R. Muntz, Poisson departure processes and queueing networks, Proc. 7th Ann. Princeton Conf. (March 1973), 435-440.

    Google Scholar 

  61. R.R. Muntz and J.W. Wong, Efficient computational procedures for closed queueing networks, Note 17, Computer Science Dept., UCLA (June 1973).

    Google Scholar 

  62. R.R. Muntz and J. Wong, Asymptotic properties of closed queueing network models, Proc. of 8th Annual Princeton Conf. on Inf. Sci. and Systems, Preince-ton University (March 1974).

    Google Scholar 

  63. M. Reiser and H. Kobayashi, Numerical solution of semiclosed exponential server queueing networks, Proc. 7th Asilomar Conf. and Cir. and Syst., Asi-lomar (November 1973).

    Google Scholar 

  64. M. Reiser and H. Kobayashi, Queueing networks with multiple closed chains: theory and computational algorithms, IBM J.R. & D. 19, 3 (May 1975).

    Google Scholar 

  65. M. Reiser and H. Kobayashi, On the convolution algorithm for separable queueing networks, Proc. Int. Symp. on Comp. Perf. Mod. Meas. and Eval. Cambridge, Massachusetts (March 1976), 109-117.

    Google Scholar 

  66. M. Reiser and S.S. Lavenberg, Mean value analysis of closed multichain queueing networks, J. Acm 27, 2 (April 1980), 313–322.

    Article  MathSciNet  MATH  Google Scholar 

  67. M. Reiser, A Queueing network analysis of computer communication networks with window flow control, IBM Research Report RC-7218, Yorktown Heights (July 1978).

    Google Scholar 

  68. S. Salza and S. S. Lavenberg, Approximating response time distributions in closed queueing network models of computer system performance, IBM Research Report RC-8735, Yorktown Heights (March 1981).

    Google Scholar 

  69. C.H. Sauer and K.M. Chandy, The Impact of distributions and disciplines on multiprocessor systems, Comm. ACM 22, 1 (January 1979), 25–34.

    Article  MATH  Google Scholar 

  70. C.H. Sauer and K.M. Chandy, Approximate solution of queueing models, IEEE Computer 13, 4 (April 1980), 25–32.

    Article  Google Scholar 

  71. C.H. Sauer and K.M. Chandy, Computer System Performance Modeling, Prentice Hall (1981).

    Google Scholar 

  72. C.H. Sauer, Computational algorithms for state-dependent queueing networks, IBM Research Report RC-8698, IBM Yorktown Heights (February 1981).

    Google Scholar 

  73. A.L. Scherr, An Analysis of Time-Shared Computer Systems, M.I.T. Press, Cambridge, Massachusetts (1967).

    MATH  Google Scholar 

  74. K.C. Sevcik, Priority scheduling disciplines in queueing network models of computer systems, Proc. IFIP Congress 77 (1977), 565–570.

    Google Scholar 

  75. K.C. Sevcik, Data base system performance prediction using an analytical model, Proc. 8th Conf. On Very Large Data Bases, Cannes (September 1981).

    Google Scholar 

  76. K.C. Sevcik, A.I. Levy, S.K. Tripathi and J. Zahorjan, Improved approximations of aggregated queueing network subsystsms, Computer Performance, K.M. Chandy and M. Reiser (editors), Elsevier North-Holland (1977), 1-22.

    Google Scholar 

  77. K.C. Sevcik and M.M. Klawe, Operational analysis versus stochastic modelling of computer systems, Proc. Computer Science and Statistics: 12th Annual Symposium on the Interface, Waterloo, Canada (1979).

    Google Scholar 

  78. K.C. Sevcik and I. Mitrani, The Distribution of queueing network states at input and output instants, J. Acm 28, 2 (April 1981).

    Google Scholar 

  79. B. Simon and R.D. Foley, Some results on sojourn times in acyclic Jackson networks, Mgmt. Sci. 25, (1979), 1027–1034.

    Article  MathSciNet  MATH  Google Scholar 

  80. W.J. Stewart, A Comparison of numerical techniques in Markov modelling, Comm. ACM 21, 2 (February 1978), 144–151.

    Article  MATH  Google Scholar 

  81. A. Tanenbaum, Computer Networks, Prentice Hall (1981).

    Google Scholar 

  82. D.F. Towsley, Queueing network models with state-dependent routing, J. Acm 27, 2 (April 1980), 323–337.

    Article  MathSciNet  MATH  Google Scholar 

  83. S.K. Tripathi, On Approximate solution techniques for queueing networks models of computer systems, Report CSRG-106, Computer Systems Research Group, Univ. of Toronto (September 1979).

    Google Scholar 

  84. H. Vantilborgh, Exact aggregation in exponential queueing networks, J. Acm 25, 4 (October 1978).

    Google Scholar 

  85. J. Walrand and P. Varaiya, When is a flow in a queueing network Pois-sonian?, Memorandum ERL-M78/59, Electronics Research Laboratory, Univ. of California at Berkeley (August 1978).

    Google Scholar 

  86. J. Walrand and P. Varaiya, Sojourn times and the overtaking condition in Jacksonian networks, Memorandum ERL-M79/35, Electronics Research Laboratory, Univ, of California at Berkeley (May 1979).

    Google Scholar 

  87. W. Whitt, The Continuity of queues, Adv. Appl. Prob. 6 (1974), 175–183.

    Article  MathSciNet  MATH  Google Scholar 

  88. P. Whittle, Nonlinear migration processes, Internat. Stat. Inst. Bull. 42, Book 1 (1969), 642–647.

    MathSciNet  MATH  Google Scholar 

  89. R.W. Wolff, The Effect of service time regularity on system performance, Computer Performance, K.M. Chandy and M. Reiser (editors), Elsvier North-Holland (1977), 297-304.

    Google Scholar 

  90. J.W. Wong, Distribution of end-to-end delay in message-switched networks, Computer Networks 2, 1 (February 1978), 44–49.

    MathSciNet  MATH  Google Scholar 

  91. J.W. Wong, Queueing network modeling of computer communication networks, Computing Surveys 10, 3 (September 1978), 343–352.

    Article  Google Scholar 

  92. J. Zahorjan, The Approximate Solution of Large Queueing Network Models, Report CSRG-122, Computer Systems Research Group, Univ. of Toronto (1980).

    Google Scholar 

  93. J. Zahorjan, K.C. Sevcik, D.L. Eager, and B.I. Galler, Balanced job bound analysis of queueing networks, to appear in Comm. ACM.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Systems Research Group University of Toronto, Canada

    Kenneth C. Sevcik

Authors
  1. Kenneth C. Sevcik
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics, Dalhousie University, Halifax, Nova Scotia, Canada

    M. A. H. Dempster

  2. Balliol College, Oxford, England

    M. A. H. Dempster

  3. Mathematisch Centrum, P.O. Box 4079, 1009 AB, Amsterdam, The Netherlands

    J. K. Lenstra

  4. Econometric Institute H2-11, Erasmus University, P.O. Box 1738, 3000 DR, Rotterdam, The Netherlands

    A. H. G. Rinnooy Kan

Rights and permissions

Reprints and permissions

Copyright information

© 1982 D. Reidel Publishing Company

About this paper

Cite this paper

Sevcik, K.C. (1982). Queueing Networks and their Computer System Applications: An Introductory Survey. In: Dempster, M.A.H., Lenstra, J.K., Rinnooy Kan, A.H.G. (eds) Deterministic and Stochastic Scheduling. NATO Advanced Study Institutes Series, vol 84. Springer, Dordrecht. https://doi.org/10.1007/978-94-009-7801-0_11

Download citation

  • DOI: https://doi.org/10.1007/978-94-009-7801-0_11

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-94-009-7803-4

  • Online ISBN: 978-94-009-7801-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation