Exact Analysis of Markovian Networks

  • Simonetta Balsamo
  • Vittoria de Nitto Personé
  • Raif Onvural
Part of the International Series in Operations Research & Management Science book series (ISOR, volume 31)

Abstract

In this chapter we deal with analytical solutions of a class of networks that can be represented by a continuous-time Markov process.

Keywords

State Transition Diagram Markovian Network Queue Length Distribution Finite Capacity Upstream Node 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Balsamo, S., and C. Clò “State distribution at arrival times for closed queueing networks with blocking” Technical Report TR-35/92, Dept. of Comp. Sci., University of Pisa, 1992.Google Scholar
  2. Balsamo, S., and C. Clò “Delay distribution in a central server model with blocking”, Technical Report TR-14/93, Dipartimento di Informatica, University of Pisa, 1993.Google Scholar
  3. Balsamo, S., C. Clò, and L. Donatiello “Cycle Time Distribution of Cyclic Queueing Network with Blocking” Performance Evaluation, Vol. 17 (1993) 159–168.CrossRefGoogle Scholar
  4. Balsamo, S., and L. Donatiello “On the Cycle Time Distribution in a Two-stage Queueing Network with Blocking” IEEE Transactions on Software Engineering, Vol. 13 (1989) 1206–1216.CrossRefGoogle Scholar
  5. Balsamo, S., and L. Donatiello “Two-stage Queueing Networks with Blocking: Cycle Time Distribution and Equivalence Properties”, in Modelling Techniques and Tools for Computer Performance Evaluation (R. Puigjaner, D. Potier Eds.) Plenum Press, 1989.Google Scholar
  6. Baskett, F., K.M. Chandy, R.R. Muntz, and G. Palacios “Open, closed, and mixed networks of queues with different classes of customers” J. of ACM, 22 (1975) 248–260.CrossRefGoogle Scholar
  7. Boucherie, R., and N. Van Dijk “On the arrival theorem for product form queueing networks with blocking” Performance Evaluation, 29 (1997) 155–176.CrossRefGoogle Scholar
  8. Boxma, O., and H. Daduna “Sojourn time distribution in queueing networks” in ‘Stochastic Analysis of computer and Communication Systems’ (H. Takagi Ed.) North Holland, 1990.Google Scholar
  9. Kleinrock, L., Queueing Systems.Vol.1: Theory. Wiley (1975).Google Scholar
  10. Lavenberg, S. S., and M. Reiser “Stationary State Probabilities at Arrival Instants for Closed Queueing Networks with multiple Types of Customers” J. Appl. Prob., Vol. 17 (1980) 1048–1061.CrossRefGoogle Scholar
  11. Sevcik, K. S., and I. Mitrani “The Distribution of Queueing Network States at Input and Output Instants” J. of ACM, Vol. 28 (1981) 358–371.CrossRefGoogle Scholar
  12. Van Dijk, N. “On ‘stop = repeat’ servicing for non-exponential queueing networks with blocking” J. Appl. Prob., Vol. 28 (1991) 159–173.CrossRefGoogle Scholar
  13. Van Dijk, N. “‘Stop = recirculate’ for exponential product form queueing networks with departure blocking” Oper. Res. Lett., Vol. 10 (1991) 343–351.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2001

Authors and Affiliations

  • Simonetta Balsamo
    • 1
  • Vittoria de Nitto Personé
    • 2
  • Raif Onvural
    • 3
  1. 1.Universita’ di VeneziaItaly
  2. 2.Universita’ di Roma “Tor Vergata”Italy
  3. 3.IBMUSA

Personalised recommendations