Reallocatable GSMP with Sequentially Dependent Lifetimes: Clockwise Decomposability and its Applications

  • Masakiyo Miyazawa
Part of the International Series in Operations Research & Management Science book series (ISOR, volume 19)


In a recent communication, François Beccelli suggested the importance of a general formulation in research when he commented that we see many beautiful flowers in a garden but cannot see ground. Julian Keilson is honored as one of the great pioneers in cultivating the ground of applied probability. I am pleased to have an opportunity to contribute to this book dedicated to him, and I would like to consider queueing network problems under a general formulation.


Service Time Stationary Distribution Point Process Local Balance Batch Arrival 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Baccelli, F., and Bremaud, P. Elements of Queueing Theory. Springer-Verlag, New York, 1994.zbMATHGoogle Scholar
  2. [2]
    Baskett, F., Chandy, K, M., Muntz, R. R., and Palacios, F. G. Open, closed and mixed networks of queues with different classes of customers. JACM 22, 248–260, 1975.MathSciNetzbMATHCrossRefGoogle Scholar
  3. [3]
    Chandy, K. M., Howard, J. H. Jr., and Towsley, D. F. Product form and local balance in queueing networks. JACM 24, 250–263, 1977.MathSciNetzbMATHCrossRefGoogle Scholar
  4. [4]
    Chandy, K., and Martin, J. A characterization of product form queueing networks. JACM 24, 250–263, 1983.CrossRefGoogle Scholar
  5. [5]
    Chao, X., and Miyazawa, M. On quasi-reversibility and local balance: an alternative derivation of the product-form results. Oper. Res., to appear.Google Scholar
  6. [6]
    Feller, W. An Introduction to Probability Theory and Its Applications, Vol. II, 2nd ed. John Wiley & Sons, New York, 1971.zbMATHGoogle Scholar
  7. [7]
    Franken, P., Knig D., Arndt, U., and Schmidt, V. Queues and Point Processes. Wiley, Chichester, 1982.zbMATHGoogle Scholar
  8. [8]
    Jansen, U. A generalization of insensitivity results by cyclically marked stationary point processes. Elektron. Informationsverarb, u. Kybernet. 19, 307–320, 1983.MathSciNetzbMATHGoogle Scholar
  9. [9]
    Jansen U., König, D., and Nawrotzki, K. A criterion of insensitivity for a class of queueing systems with random marked point processes. Math. Oerationsforsch. u. Stat. Ser. Optimization 10, 379–403, 1979.zbMATHCrossRefGoogle Scholar
  10. [10]
    Kelly, F. P. Networks of queues. Adv. Appl. Prob. 8, 416–432, 1976.zbMATHCrossRefGoogle Scholar
  11. [11]
    Kelly, F. P. Reversibility and Stochastic Networks. Wiley, New York, 1979.zbMATHGoogle Scholar
  12. [12]
    Miyazawa, M. The derivation of invariance relations in complex queueing systems with stationary inputs. Adv. Appl. Prob. 15, 874–885, 1983.MathSciNetzbMATHCrossRefGoogle Scholar
  13. [13]
    Miyazawa, M. The characterization of the stationary distributions of the supplemented Self-clocking Jump Process. Math. OR 16, 547–565, 1991.MathSciNetzbMATHCrossRefGoogle Scholar
  14. [14]
    Miyazawa, M. Insensitivity and product form decomposability of Reallocatable GSMP. Adv. Appl. Prob. 25, 415–437, 1993.MathSciNetzbMATHCrossRefGoogle Scholar
  15. [15]
    Miyazawa, M. Rate conservation law: a survey. Queueing Syst. 15, 1–58, 1994.MathSciNetzbMATHCrossRefGoogle Scholar
  16. [16]
    Miyazawa, M., Schassberger, R., and Schmidt, V. On the structure of insensitive GSMP with reallocation and with point-process input. Adv. Appl. Prob. 27, 203–225, 1995.MathSciNetzbMATHCrossRefGoogle Scholar
  17. [17]
    Miyazawa, M., and Yamazaki, G. Note on batch arrival LCFS and related symmetric queues. Oper. Res. Lett. 14, 35–41, 1993.MathSciNetzbMATHCrossRefGoogle Scholar
  18. [18]
    Miyazawa, M., and Wolff, R. W. Symmetric queues with batch departures and their network. Adv. Appl. Prob. 28, 308–326, 1996.MathSciNetzbMATHCrossRefGoogle Scholar
  19. [19]
    Schassberger, R. Insensitivity of steady-state distributions of generalized semi-Markov processes with speeds. Adv. Appl. Prob. 10, 836–851, 1978.MathSciNetzbMATHCrossRefGoogle Scholar
  20. [20]
    Schassberger, R. Two remarks on insensitive stochastic models. Adv. Appl. Prob. 18, 791–814, 1986.MathSciNetzbMATHCrossRefGoogle Scholar
  21. [21]
    Serfozo, R. F. Markovian network processes with system-dependent transition rates. Queueing Syst. 5, 5–36, 1989.MathSciNetzbMATHCrossRefGoogle Scholar
  22. [22]
    Serfozo, R. F. Markovian network processes with system-dependent transition rates. Queueing Syst. 5, 5–36, 1993.MathSciNetCrossRefGoogle Scholar
  23. [23]
    Yamazaki, G, and Miyazawa, M. Decomposability in queues with background states. Queueing Syst., to appear.Google Scholar

Copyright information

© Springer Science+Business Media New York 1999

Authors and Affiliations

  • Masakiyo Miyazawa

There are no affiliations available

Personalised recommendations