Some Topics in Queueing Network Theory

  • Ralph L. Disney
  • W. Peter Cherry
Conference paper
Part of the Lecture Notes in Economics and Mathematical Systems book series (LNE, volume 98)

Abstract

In this paper we present results obtained in the study of queueing networks. Such a network is illustrated in Fig. 1. Although numerous examples of queueing networks exist in real life, the study of such systems has not progressed at a pace commensurate with its importance. Rather, the theory of waiting line processes has proceeded largely as a study of single server systems. Isolated “network” results do exist but as yet no comprehensive treatment of the subject has appeared.

Keywords

Covariance Convolution 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Agnew, R. A., “Transformations on Uniform and Stationary Point Processes,” Doctoral Dissertation, Northwestern University, 1968.Google Scholar
  2. 2.
    Anderson, L. B., “Filtered Semi-Markov Procésses,” Masters Thesis, Northwestern University, 1967.Google Scholar
  3. 3.
    Cherry, W. P., “The Superposition of Two Independent Markov Renewal Processes,” Doctoral Dissertation, Department of Industrial and Operations Engineering, University of Michigan, 1972.Google Scholar
  4. 4.
    Cinlar, E., “Analysis of Systems of Queues in Parallel,” Doctoral Dissertation, Department of Industrial Engineering, University of Michigan, 1965.Google Scholar
  5. 5.
    Cinlar, E., “Queues with Semi-Markov Arrivals,”J.Appl. Probability, 4, 1967, pp. 365–379.CrossRefMATHMathSciNetGoogle Scholar
  6. 6.
    Cinlar, E., “On Semi-Markov Processes on Arbitrary State Spaces,” Proc. Cambridge Philos. Soc., 66, 1969, pp. 381–392.CrossRefMATHMathSciNetGoogle Scholar
  7. 7.
    Cinlar, E., “Superposition of Point Processes,”Stochastic Point Processes: Statistical Analysis, Theory and Applications(P. A. W. Lewis, ed.), John Wiley & Sons, Inc., New York, 1972.Google Scholar
  8. 8.
    Daley, D. J. and Vere-Jones, D., “A Summary of the Theory of Point Processes,” Stochastic Point Processes: Statistical Analysis, Theory and Applications(P. A. W. Lewis, Ed.), John Wiley & Sons, Inc, New York, 1972.Google Scholar
  9. 9.
    Davignon, G. R., “Queues with Dependend Feedback,” Department of Industrial and Operations Engineering Technical Report, University of Michigan, 1972.Google Scholar
  10. 10.
    Disney, R. L. and Morais, P. R. de, “Some Properties of Departure Processes from M/G/1/N Queues,” Department of Industrial and Operations Engineering Technical Report, University of Michigan, 1971.Google Scholar
  11. 11.
    Disney, R. L., “A Matrix Solution for the Two Server Queue with Overflow,” Management Sci., 19, 1972, pp. 254–265.CrossRefMATHMathSciNetGoogle Scholar
  12. 12.
    Disney, R. L., Farrell, R. L., and Morais, P. R. de, “A Characterization of M/G/1/N Queues with Renewal Departure Processes,” Management Sci., to appear.Google Scholar
  13. 13.
    Hall, W. K., “A Queueing Theoretic Approach to the Allocation and Distribution of Ambulances in an Urban Area,” Doctoral Dissertation, School of Business Administration, University of Michigan, 1969.Google Scholar
  14. 14.
    Hall, W. K.and Disney, R. L., “Finite Queues in Parallel with a Generalized Channel Selection Rule, ” J. Appl. Probability, 8, 1971, pp. 413–416.CrossRefMATHMathSciNetGoogle Scholar
  15. 15.
    Jackson, J. R., “Networks of Waiting Lines,” Operations Res., 5, 1957, pp. 518–521.CrossRefMathSciNetGoogle Scholar
  16. 16.
    Kemeny, J. and Snell, L. Finite Markov Chains, D. Van Nostrand, Inc., 1959.Google Scholar
  17. 17.
    King, R. A., “The Covariance Properties of the Departure Process from Single Channel Queues,” Doctoral Dissertation, Department of Industrial Engineering, University of Michigan, 1967.Google Scholar
  18. 18.
    Prabhu, U. N., Queues and Inventories, John Wiley & Sons, 1965.Google Scholar
  19. 19.
    Solberg, J. J., “A Graph Theoretic Approach to the Study of Networks of Queues,” Doctoral Dissertation, Department of Industrial Engineering, University of Michigan, 1969.Google Scholar
  20. 20.
    Takacs, L., “A Single-Server Queue with Feedback,” Bell System Tech. J., 42, 1963, pp. 505–519.MathSciNetGoogle Scholar
  21. 21.
    Vlach, T., “The Departure Process from the GI/G/1 Queue,” Doctoral Dissertation, Department of Industrial Engineering, University of Michigan, 1969.Google Scholar
  22. 22.
    Wallace, V. L., “The Solution of Quasi Birth-Death Processes Arising from Multiple Access Computer Systems,” Doctoral Dissertation, Department of Electrical Engineering, University of Michigan, 1969.Google Scholar

Copyright information

© Springer-Verlag Berlin · Heidelberg 1974

Authors and Affiliations

  • Ralph L. Disney
    • 1
  • W. Peter Cherry
    • 2
  1. 1.University of MichiganUSA
  2. 2.Vector Research, Inc.Ann ArborUSA

Personalised recommendations