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

Networks with cascading overloads

Published:23 August 2011Publication History

ABSTRACT

Here we study large deviations in networks that are more likely to result from the accumulation of many slightly unusual events. We are particularly interested in analyzing large deviations where the most probable path changes direction. These deviations arise when a large deviation in one part of the system cascades across the network to produce a large deviation in another part of the network.

References

  1. Ivo J. B. F. Adan, Robert D. Foley, David R. McDonald, (2009). Exact asymptotics for the stationary distribution of a Markov chain: a production model. Queueing Syst., 311--344Google ScholarGoogle Scholar
  2. V. Anantharam, P. Heidelberger, P. Tsoucas, (1990). Analysis of Rare Events in Continuous Time Markov Chains via Time Reversal and Fluid Approximation. Research Report, RC 16280, Computer Science Division, IBM T. J. Watson Center, Yorktown Heights, New York.Google ScholarGoogle Scholar
  3. F Baccelli, P. Bremaud, (2003). Elements of Queueing Theory Springer Verlag.Google ScholarGoogle Scholar
  4. F Baccelli, D McDonald, (1997). Rare events for stationary processes. Stochastic Processes and their Applications Vol. 89. 141--173Google ScholarGoogle Scholar
  5. A. A. Borovkov and A. A. Mogul'skii, (2001). Limit Theorems in the Boundary Hitting Problem for a Multidimensional Random Walk. Siberian Mathematical Journal 4, 245--270.Google ScholarGoogle ScholarCross RefCross Ref
  6. R. Foley, D. McDonald, (2001). Join the Shortest Queue: Stability and Exact Asymptotics, Annals of Applied Probability, 11. 11, 569--607.Google ScholarGoogle ScholarCross RefCross Ref
  7. Foley, R. and McDonald, D., (2004). Large Deviations of a Modified Jackson Network: Stability and Rough Asymptotics, Ann. Appl. Probab., 15, 519--541.Google ScholarGoogle Scholar
  8. Foley, R. D. and D. R. McDonald, (2005). "Bridges and Networks: Exact Asymptotics," Annals of Applied Probability, 15, pp. 542--586.Google ScholarGoogle ScholarCross RefCross Ref
  9. Foley, R. D., McDonald, D. R. Constructing a harmonic function for an irreducible non-negative matrix with convergence parameter R > 1. Accepted subject to revisions London Mathematical Society.Google ScholarGoogle Scholar
  10. Irina Ignatiouk-Robert and Christophe Loree, (2010). Martin boundary of a killed random walk on a quadrant Ann. Probab. 38, 1106--1142.Google ScholarGoogle ScholarCross RefCross Ref
  11. Kurtz, T. G., (1978). Strong approximation theorems for density dependent Markov chains, Stoch. Proc. Appl. 6, 223--240.Google ScholarGoogle ScholarCross RefCross Ref
  12. K. Majewski, K. Ramanan, (2008). How large queue lengths build up in a Jackson network. preprint.Google ScholarGoogle Scholar
  13. S. P. Meyn, R. L. Tweedie, (1993). Markov chains and stochastic stability. Springer-Verlag, London. Available at: probability.ca/MT.Google ScholarGoogle Scholar
  14. Masakiyo Miyazawa, Yiqiang Zhao, (2009). Tail Decay Rates in Double QBD Processes and Related Reflected Random Walks Mathematics of Operations Research, 34, 547--575. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. V. Nicola, T. Zaburnenko, (2007). Efficient Importance Sampling Heuristics for the Simulation of Population Overflow in Jackson Networks. ACM Transactions on Modeling and Computer Simulation, 17. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Networks with cascading overloads

        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 '11: Proceedings of the 6th International Conference on Queueing Theory and Network Applications
          August 2011
          234 pages
          ISBN:9781450307581
          DOI:10.1145/2021216

          Copyright © 2011 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: 23 August 2011

          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