Skip to main content
Have a personal or library account? Click to login
Semi-Markov-Based Approach for the Analysis of Open Tandem Networks with Blocking and Truncation Cover

Semi-Markov-Based Approach for the Analysis of Open Tandem Networks with Blocking and Truncation

International Journal of Applied Mathematics and Computer Science
Volume 19 (2009): Issue 1 (March 2009)
By:   
Open Access
|Apr 2009
References

References

  1. Akyildiz, I.F. (1988). Mean value analysis for blocking queuing networks,14(4): 418-428.
    Open DOISearch in Google Scholar
  2. Balsamo, S. and de Nitto Persone, V. (1994). A survey of product form queueing networks with blocking and their equivalences,48(1/4): 31-61.
    Open DOISearch in Google Scholar
  3. Balsamo, S., de Nito Persone, V. and Onvural, R. (2001)., Kluwer Academic Publishers, Boston, MA.
    Open DOISearch in Google Scholar
  4. Balsamo, S., de Nito Persone, V. and Inverardi, P. (2003). A review on queueing network models with finite capacity queues for software architectures performance predication,51(2-4): 269-288.
    Open DOISearch in Google Scholar
  5. Badrah, A., Czachórski, T., Domańska, J., Fourneau, J.-M. and Quessette, F. (2002). Performance evaluation of multistage interconnection networks with blocking—Discrete and continuous time Markov models,14(2): 145-162.
    Search in Google Scholar
  6. Boucherie, R.J. and van Dijk, N.M. (1997). On the arrival theorem for product form queueing networks with blocking,29(3): 155-176.
    Open DOISearch in Google Scholar
  7. Bouhchouch, A., Frein, Y. and Dallery, Y. (1996). Performance evaluation of closed tandem queueing networks,26: 115-132.
    Open DOISearch in Google Scholar
  8. Bradley, J.T. and Davies, N.J. (2000). A matrix-based method for analysing stochastic process algebras,, Geneva, Switzerland, pp. 579-590.
    Search in Google Scholar
  9. Bradley, J.T. and Wilson, H.J. (2005). Iterative convergence of passage-time densities in semi-Markov performance models,60(1-4): 237-254.
    Open DOISearch in Google Scholar
  10. Clo, M.C. (1998). MVA for product-form cyclic queueing networks with blocking,79: 83-96.
    Search in Google Scholar
  11. Economou, A. and Fakinos, D. (1998). Product form stationary distributions for queueing networks with blocking and rerouting,30(3/4): 251-260.
    Open DOISearch in Google Scholar
  12. Gomez-Corral, A. (2002). A tandem queue with blocking and Markovian arrival process,41(4): 343-370.
    Open DOISearch in Google Scholar
  13. Heindl, A. (2003). Decomposition of general queueing networks with MMPP inputs and customer losses,51(2-4): 117-136.
    Open DOISearch in Google Scholar
  14. Kaufman, J.S. and Rege, K.M. (1996). Blocking in a shared resource environment with batched arrival processes,24(4): 249-263.
    Open DOISearch in Google Scholar
  15. Korolyuk, V.S. and Korolyuk, V.V. (1999)., Kluwer Academic Publishers, Dordrecht.
    Open DOISearch in Google Scholar
  16. Kouvatsos, D. and Almond, J. (1988). Maximum entropy two-station cyclic queues with multiple general servers,26(3): 241-267.
    Open DOISearch in Google Scholar
  17. Kouvatsos, D.D., Awan, I.U., Fretwell, R.J. and Dimakopoulos, G. (2000). A cost-effective approximation for SRD traffic in arbitrary multi-buffered networks,34(1):97-113.
    Open DOISearch in Google Scholar
  18. Martin, J.B. (2002). Large tandem queueing networks with blocking,41(1/2): 45-72.
    Open DOISearch in Google Scholar
  19. Morrison, J.A. (1996). Blocking probabilities for multiple class batched arrivals to a shared resource,25(2): 131-150.
    Open DOISearch in Google Scholar
  20. Oniszczuk, W. (2006). Tandem models with blocking in the computer subnetworks performance analysis,K. Saeed, J. Pejaś and R. Mosdorf (Eds.),, Springer, New York, NY, pp. 259-267.
    Open DOISearch in Google Scholar
  21. Onvural, R. (1990). Survey of closed queuing networks with blocking,22(2): 83-121.
    Open DOISearch in Google Scholar
  22. Perros, H.G. (1994)., Oxford University Press, New York, NY.
    Search in Google Scholar
  23. Ramesh, S. and Perros, H.G. (2000). A two-level queueing network model with blocking and non-blocking messages,93(1/4): 357-372.
    Open DOISearch in Google Scholar
  24. Sereno, M. (1999). Mean value analysis of product form solution queueing networks with repetitive service blocking,(1): 19-33.
    Open DOISearch in Google Scholar
  25. Sharma, V. and Virtamo, J.T. (2002). A finite buffer queue with priorities,47(1): 1-22.
    Open DOISearch in Google Scholar
  26. Strelen, J. Ch., Bärk, B., Becker, J. and Jonas, V. (1998). Analysis of queueing networks with blocking using a new aggregation technique,79(0): 121-142.
    Open DOISearch in Google Scholar
  27. Tolio, T. and Gershwin, S.B. (1998). Throughput estimation in cyclic queueing networks with blocking,79(0): 207-229.
    Open DOISearch in Google Scholar
  28. Zhuang, L., Buzacott, J.A. and Liu, X.-G. (1994). Approximate mean value performance analysis of cyclic queueing networks with production blocking,16(1-2): 139-165.
    Open DOISearch in Google Scholar
  29. Zhuang, L. (1996). Acceptance instant distributions in product-form closed queueing networks with blocking,26(2): 133-144.
    Open DOISearch in Google Scholar
DOI: https://doi.org/10.2478/v10006-009-0014-6 | Journal eISSN: 2083-8492 | Journal ISSN: 1641-876X
Journal RSS Feed
Language: English
Page range: 151 - 164
Published on: Apr 2, 2009
Published by: University of Zielona Góra
In partnership with: Paradigm Publishing Services
Publication frequency: 4 issues per year
Keywords:
two-node network with blocking and truncation,
semi-Markov model,
Markov exact algorithm
Related subjects:
Mathematics,
Applied mathematics

© 2009 Walenty Oniszczuk, published by University of Zielona Góra
This work is licensed under the Creative Commons License.

Volume 19 (2009): Issue 1 (March 2009)
Previous article
Next article