Efficient Transient Analysis of Markovian Models Using a Block Reduction Approach

References

• Ahn S, Ramaswami V (2005) Efficient algorithms for transient analysis of stochastic fluid flow models. J. Appl. Probab. 42:531–549.Crossref, Google Scholar
• Altman E, Nain P, Shwartz A, Xu Y (2011) Predicting the impact of measures against P2P networks on the transient behaviors. IEEE INFOCOM 2011 Proc., 1440–1448.Crossref, Google Scholar
• Coffman EGJr, Fayolle G, Mitrani I (1987) Two queues with alternating service periods. Proc. Performance '87 Proc. 12th IFIP WG 7.3 Internat. Sympos. Comput. Performance Model., Measurement and Evaluation (North-Holland, Amsterdam), 227–239.Google Scholar
• Cohen B (2003) Incentives build robustness in BitTorrent. First Workshop on Economics of Peer-to-Peer Systems, Berkeley, CA.Google Scholar
• de Souza e Silva E, Gail HR (1992) Performability analysis of computer systems: From model specification to solution. Performance Eval. 14(3–4):157–196.Crossref, Google Scholar
• de Souza e Silva E, Gail HR (2000) Transient solutions for Markov chains. Grassmann W, ed. Computational Probability (Kluwer, Norwell, MA), 44–79.Crossref, Google Scholar
• de Souza e Silva E, Gail HR (2001) The uniformization method in performability analysis. Rubino G, Haverkort BR, Marie R, Trivedi KS, eds. Performability Modelling: Techniques and Tools, Chap. 3 (John Wiley and Sons, Hoboken, NJ), 31–58.Google Scholar
• de Souza e Silva E, Figueiredo D, Leão RMM (2009) The TANGRAM-II integrated modeling environment for computer systems and networks. Performance Eval. Rev. 36(4):64–69.Crossref, Google Scholar
• de Souza e Silva E, Gail HR, Muntz RR (1995) Polling systems with server timeouts and their application to token passing networks. IEEE/ACM Trans. Networking 3:560–575.Crossref, Google Scholar
• Golub GH, van Loan CF (1989) Matrix Computation, 2nd ed. (The John Hopkins University Press, Baltimore).Google Scholar
• Grassmann WK (1982) The GI/PH/1 queue: A method to find the transition matrix. INFOR 20:144–156.Google Scholar
• Grassmann WK (1991) Finding transient solutions in Markovian event systems through randomization. Stewart WJ, ed. Numerical Solution of Markov Chains (Marcel Dekker, New York), 357–371.Google Scholar
• Grassmann WK, Heyman DP (1990) Equilibrium distribution of block-structured Markov chains with repeating rows. J. Appl. Probab. 27:557–576.Crossref, Google Scholar
• Grassmann WK, Stanford DA (2000) Matrix analytic methods. Grassmann W, ed. Computational Probability (Kluwer, Norwell, MA), 153–203.Crossref, Google Scholar
• Grassmann WK, Tavakoli J (2008) Stochastic and substochastic solutions for infinite-state Markov chains with applications to matrix-analytic methods. Adv. Appl. Prob. 40:1157–1173.Crossref, Google Scholar
• Grassmann WK, Taksar MI, Heyman DP (1985) Regenerative analysis and steady state distributions for Markov chains. Oper. Res. 33(5):1107–1116.Link, Google Scholar
• Hajek B, Zhu J (2010) The missing piece syndrome in peer-to-peer communication. 2010 IEEE Internat. Sympos. Inform. Theory Proc. (ISIT), 1748–1752.Crossref, Google Scholar
• Heyman DP (1987) Further comparisons of direct methods for computing stationary distributions of Markov chains. SIAM J. Alg. Disc. Meth. 8(2):226–232.Crossref, Google Scholar
• Jensen A (1953) Markoff chains as an aid in the study of Markoff processes. Skandinavsk Aktuarietidskrift 36:87–91.Google Scholar
• Kaufman L (1983) Matrix methods for queueing problems. SIAM J. Sci. Stat. Comput. 4(3):525–552.Crossref, Google Scholar
• Mathieu F, Reynier J (2006) Missing piece issue and upload strategies in flashcrowds and P2P-assisted filesharing. Proc. Adv. Int'l Conf. Telecomm. Int'l Conf. Internet and Web Appl. Services, AICT-ICIW '06, 112.Crossref, Google Scholar
• Menasché DS, de A. Rocha AA, de Souza e Silva EA, Towsley D, Leão RMM (2011) Implications of peer selection strategies by publishers on the performance of P2P swarming systems. Performance Eval. Rev. 39(3):55–57.Crossref, Google Scholar
• Meyer CD (1989) Stochastic complementation, uncoupling Markov chains, and the theory of nearly reducible systems. SIAM Rev. 31(2):240–272.Crossref, Google Scholar
• Meyer JF (1992) Performability: A retrospective and some pointers to the future. Performance Eval. 14(3–4):139–156.Crossref, Google Scholar
• Meyer JF (1995) Performability evaluation: Where it is and what lies ahead. IEEE Int'l Comput. Performance and Dependability Sympos. (IPDS'95), 334–343.Crossref, Google Scholar
• Ross SM (1987) Approximating transition probabilities and mean occupation times in continuous-time Markov chains. Probab. Engrg. Inform. Sci. 1(3):251–264.Crossref, Google Scholar
• Stewart WJ (1994) Introduction to the Numerical Solution of Markov Chains (Princeton University Press, Princeton, NJ).Google Scholar
• Wang B, Kurose J, Shenoy P, Towsley D (2008) Multimedia streaming via TCP: An analytic performance study. ACM Trans. Multimedia Comput. Commun. Appl. 4(2):16:1–16:22.Crossref, Google Scholar
• Yoon BS, Shanthikumar JG (1989) Bounds and approximations for the transient behavior of continuous-time Markov chains. Probab. Engrg. Inform. Sci. 3(2):175–198.Crossref, Google Scholar