skip to main content
10.1145/1837856.1837872acmotherconferencesArticle/Chapter ViewAbstractPublication PagesqtnaConference Proceedingsconference-collections
research-article

A dual tandem queueing system with a finite intermediate buffer and cross traffic

Published:24 July 2010Publication History

ABSTRACT

We analyze a dual tandem queue having a single server queueing system with infinite buffer at the first station and a multi-server queueing system with a finite buffer at the second station. Arrival flow is described by the Batch Markovian Arrival Process (BMAP). Service time at the first station is generally distributed while at the second station it is exponentially distributed. In situation when the intermediate buffer between the stations is full at the service completion of a customer at the first station, this customer is lost or blocks the server until service completion in one of the servers at the second station. Besides the customers, which got service at the first station, an additional MAP flow (cross traffic) arrives to the second station directly, not entering the first station.

Ergodicity condition for this system is derived. Stationary state distribution of the system at embedded and arbitrary time epochs is computed as well as the main performance measures of the system. Numerical results show possibility of optimization of the system operation by means of appropriate choosing the capacity of an intermediate buffer and the intensity of cross traffic. Necessity of the account of correlation in the arrival processes is illustrated.

References

  1. S. Balsamo, V. D. N. Persone and P. Inverardi, "A review on queueing network models with finite capacity queues for software architectures performance prediction," Performance Evaluation, vol. 51, pp. 269--288, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. B. W. Gnedenko and D. Konig, Handbuch der Bedienungstheorie. Berlin, Akademie Verlag, 1983.Google ScholarGoogle Scholar
  3. A. Gomez-Corral, "A tandem queue with blocking and Markovian arrival process," Queueing Systems, vol. 41, pp. 343--370, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. A. Gomez-Corral, "On a tandem G-network with blocking," Advances in Applied Probability, vol. 34. no. 3, pp. 626--661, 2002.Google ScholarGoogle ScholarCross RefCross Ref
  5. A. Gomez-Corral, "A matrix-geometric approximation for tandem queues with blocking and repeated attempts," Operations Research Letters, vol. 30, pp. 360--374, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. A. Gomez-Corral, "Sojourn times in a two-stage queueing network with blocking," Naval Research Logistics, vol. 51, pp. 1068--1089, 2004.Google ScholarGoogle ScholarCross RefCross Ref
  7. A. Gomez-Corral and M. E. Martos, "Performance of two-stage tandem queues with blocking: The impact of several flows of signals," Performance Evaluation, vol. 63, pp. 910--938, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. A. Gomez-Corral and M. E. Martos, "A. B. Clarke's tandem queues revisited -- sojourn times," Stochastic Analysis and Applications, vol. 26, pp. 1111--1135, 2008.Google ScholarGoogle ScholarCross RefCross Ref
  9. L. Breuer, A. N. Dudin, V. I. Klimenok and G. V. Tsarenkov, "A two-phase BMAP/G/1/NPH/1/M -- 1 system with blocking," Automation and Remote Control, vol. 65, pp. 117--130, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. V. I. Klimenok, L. Breuer, G. V. Tsarenkov and A. N. Dudin, "The BMAP/G/1/NPH/1/M system with losses, "Performance Evaluation, vol. 61, pp. 17--40, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. C. S. Kim, V. I. Klimenok, G. V. Tsarenkov, L. Breuer and A. N. Dudin, "The BMAP/G/1 → PH/1/M tandem queue with feedback and losses," Performance Evaluation, vol. 64, pp. 802--818, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. C. S. Kim, S. H. Park, A. Dudin, V. Klimenok and G. Tsarenkov, "Investigaton of the BMAP/G/1 →. /PH/1/M tandem queue with retrials and losses," Appled Mathematical Modelling, vol. 34, pp. 2926--2940, 2010.Google ScholarGoogle ScholarCross RefCross Ref
  13. C. S. Kim, V. Klimenok and O. Taramin, "A tandem retrial queueing system with two Markovian flows and reservation of channels," Computers and Operations Research, vol. 37, no. 7, pp. 1238--1246, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. V. I. Klimenok and O. S. Taramin, "Tandem service system with batch Markov flow and repeated calls," Automation and Remote Control, vol. 71, pp. 1--19, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. M. F. Neuts, Matrix-geometric solutions in stochastic models. The Johns Hopkins University Press, Baltimore, 1981.Google ScholarGoogle Scholar
  16. A. N. Dudin and V. I. Klimenok, "Multidimensional quasitoeplitz Markov chains," Journal of Applied Mathematical and Stochastic Analysis, vol. 12, no. 4. pp. 393--415, 1999.Google ScholarGoogle ScholarCross RefCross Ref
  17. M. F. Neuts, Structured stochastic matrices of M/G/1 type and their applications. New York, Marcel Dekker, 1989.Google ScholarGoogle Scholar
  18. V. I. Klimenok and A. N. Dudin, "Multi-dimensional asymptotically quasi-Toeplitz Markov chains and their application in queueing theory," Queueing Systems, vol. 54, pp. 245--259, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. E. Cinlar, Introduction to stochastic process. N.J., Prentice-Hall, 1975.Google ScholarGoogle Scholar
  20. S. R. Chakravarthy, "The batch Markovian arrival process: a review and future work," Advances in Probability Theory and Stochastic Processes: Proc. eds. Krishnamoorthy A. et al. NJ: Notable Publications, pp. 21--49, 2001.Google ScholarGoogle Scholar
  21. D. Lucantoni, "New results on the single server queue with a batch Markovian arrival process," Communication in Statistics-Stochastic Models, vol. 7, pp. 1--46, 1991.Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. A dual tandem queueing system with a finite intermediate buffer and cross traffic

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Other conferences
      QTNA '10: Proceedings of the 5th International Conference on Queueing Theory and Network Applications
      July 2010
      213 pages
      ISBN:9781450302128
      DOI:10.1145/1837856

      Copyright © 2010 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 24 July 2010

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader