skip to main content
10.1145/1626553.1626561acmconferencesArticle/Chapter ViewAbstractPublication PagesqtnaConference Proceedingsconference-collections
research-article

The tail asymptotic behavior of the stationary distribution of a double M/G/1 process and their applications to a batch arrival Jackson network

Published:29 July 2009Publication History

ABSTRACT

We consider a two dimensional reflected random walk on the nonnegative integer quadrant. This random walk is assumed to be skip free in the direction to the boundary, and referred to as a double M/G/1-type process. We are interested in tail asymptotic behavior of its stationary distribution, provided it exists. Assuming the arriving batch size distributions have light tails, we derive supremum for rough decay rates of the marginal stationary distributions in the coordinate directions. We then apply these results to a batch arrival Jackson network with two nodes. It is shown that the stochastic upper bound of Miyazawa and Taylor [4] is not tight except for a special case.

References

  1. A. A. Borovkov and A. A. Mogul'skii (2001) Large deviations for Markov chains in the positive quadrant, Russian Math. Surveys 56, 803--916.Google ScholarGoogle ScholarCross RefCross Ref
  2. W. L. Feller (1971) An Introduction to Probability Theory and Its Applications, 2nd edition, John Wiley&Sons, New York.Google ScholarGoogle Scholar
  3. M. Miyazawa (2009) Tail decay rates in double QBD processes and related reflected random walks, to appear in Mathematics of Operations Research. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. M. Miyazawa and P. G. Taylor (1997) A geometric product-form distribution for a queueing network with non-standard batch arrivals and batch transfers. Adv. Appl. Prob. 29, 523--544Google ScholarGoogle ScholarCross RefCross Ref
  1. The tail asymptotic behavior of the stationary distribution of a double M/G/1 process and their applications to a batch arrival Jackson network

    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 Conferences
      QTNA '09: Proceedings of the 4th International Conference on Queueing Theory and Network Applications
      July 2009
      143 pages
      ISBN:9781605585628
      DOI:10.1145/1626553

      Copyright © 2009 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: 29 July 2009

      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