Skip to main content
SpringerLink
Log in

Preprocessing

  • Chapter
  • First Online:
Kronecker Modeling and Analysis of Multidimensional Markovian Systems

  • 569 Accesses

Abstract

In this chapter, we discuss preprocessing techniques to aid the analysis of MCs based on Kronecker products and improve time and memory requirements. There are a number of techniques that can be used to put the Kronecker representation into a more favorable form before solvers take over.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Artalejo, J.R.: Accessible bibliography on retrial queues. Math. Comput. Model. 30, 1–6 (1999)

    Article  Google Scholar 

  2. Artalejo, J.R.: Accessible bibliography on retrial queues: Progress in 2000–2009. Math. Comput. Model. 51, 1071–1081 (2010)

    Article  MathSciNet  Google Scholar 

  3. Artalejo, J.R., Gómez-Corral, A.: Modelling communication systems with phase type service and retrial times. IEEE Commun. Lett. 11, 955–957 (2007)

    Article  Google Scholar 

  4. Artalejo, J.R., Gómez-Corral, A.: Retrial Queueing Systems: A Computational Approach. Springer, Berlin (2008)

    Book  Google Scholar 

  5. Asmussen, S.: Applied Probability and Queues. 2nd ed., Springer, New York (2003)

    MATH  Google Scholar 

  6. Baumann, H., Dayar, T., Orhan, M.C., Sandmann, W.: On the numerical solution of Kronecker-based infinite level-dependent QBD processes. Technical Report BU-CE-1206, Department of Computer Engineering, Bilkent University, Ankara (2012)

    Google Scholar 

  7. Baumann, H., Dayar, T., Orhan, M.C., Sandmann, W.: On the numerical solution of Kronecker-based infinite level-dependent QBD processes. Perform. Eval. 70, 663–681 (2013)

    Article  Google Scholar 

  8. Bell, S.L., Williams, R.J.: Dynamic scheduling of a parallel server system in heavy traffic with complete resource pooling: asymptotic optimality of a threshold policy. Ann. Appl. Probab. 11, 608–649 (2001)

    Article  MathSciNet  Google Scholar 

  9. Benoit, A., Brenner, L., Fernandes, P., Plateau, B.: Aggregation of stochastic automata networks with replicas. Linear Algebr. Appl. 386 111–136 (2004)

    Article  MathSciNet  Google Scholar 

  10. Benoit, A., Fernandes, P., Plateau, B., Stewart, W.J.: On the benefits of using functional transitions and Kronecker algebra. Perform. Eval. 58 367–390 (2004)

    Article  Google Scholar 

  11. Berman, A., Plemmons, R.J.: Nonnegative Matrices in the Mathematical Sciences. SIAM, Philadelphia (1994)

    Book  Google Scholar 

  12. Bharucha-Reid, A.T.: Elements of the Theory of Markov Processes and Their Applications. McGraw-Hill, New York (1960)

    MATH  Google Scholar 

  13. Bobbio, A., Horváth, A., Telek, M.: The scale factor: a new degree of freedom in phase-type approximation. Perform. Eval. 56, 121–144 (2004)

    Article  Google Scholar 

  14. Buchholz, P.: A class of hierarchical queueing networks and their analysis. Queueing Syst. 15, 59–80 (1994)

    Article  MathSciNet  Google Scholar 

  15. Buchholz, P.: Exact and ordinary lumpability in finite Markov chains. J. Appl. Probab. 31, 59–75 (1994)

    Article  MathSciNet  Google Scholar 

  16. Buchholz, P.: Hierarchical Markovian models: symmetries and reduction. Perform. Eval. 22, 93–110 (1995)

    Article  Google Scholar 

  17. Buchholz, P.: Exact performance equivalence: An equivalence relation for stochastic automata. Theor. Comput. Sci. 215, 263–287 (1999)

    Article  MathSciNet  Google Scholar 

  18. Buchholz, P.: Efficient computation of equivalent and reduced representations for stochastic automata. Comput. Syst. Sci. & Eng. 15, 93–103 (2000)

    MATH  Google Scholar 

  19. Buchholz, P., Dayar, T.: Block SOR for Kronecker structured Markovian representations. Linear Algebr. Appl. 386, 83–109 (2004)

    Article  Google Scholar 

  20. Buchholz, P., Dayar, T.: Block SOR preconditioned projection methods for Kronecker structured Markovian representations. SIAM J. Sci. Comput. 26, 1289–1313 (2005)

    Article  MathSciNet  Google Scholar 

  21. Buchholz, P., Kriege, J., Felko, I.: Input Modeling with Phase-Type Distributions and Markov Models: Theory and Applications. Springer, Cham (2014)

    Book  Google Scholar 

  22. Chakravarthy, S.R.: (2013). Analysis of MAP/PH/c retrial queue with phase type retrials - simulation approach. In: Dudin, A., Klimenok, V., Tsarenkov, G., Dudin, S. (eds.) Modern Probabilistic Methods for Analysis of Telecommunication Networks, Communications in Computer and Information Science, vol 356, pp. 37–49. Springer, Berlin (2013)

    Google Scholar 

  23. Choi, B.D., Chang, Y., Kim, B.: MAP1,MAP2/M/c retrial queue with guard channels and its application to cellular networks. TOP 7, 231–248 (1999)

    Article  MathSciNet  Google Scholar 

  24. Davis, T.A.: Direct Methods for Sparse Linear Systems. SIAM, Philadelphia (2006)

    Book  Google Scholar 

  25. Davis, T.A., Gilbert, J.R., Larimore, S.I., Ng, E.G.: A column approximate minimum degree ordering algorithm. ACM Trans. Math. Softw. 30, 353–376 (2004)

    Article  MathSciNet  Google Scholar 

  26. Davis, T.A., Gilbert, J.R., Larimore, S.I., Ng, E.G.: Algorithm 836: COLAMD, a column approximate minimum degree ordering algorithm. ACM Trans. Math. Softw. 30, 377–380 (2004)

    Article  MathSciNet  Google Scholar 

  27. Dayar, T.: State space orderings for Gauss–Seidel in Markov chains revisited. SIAM J. Sci. Comput. 19, 148–154 (1998)

    Article  MathSciNet  Google Scholar 

  28. Dayar, T.: Effects of reordering and lumping in the analysis of discrete-time SANs. In: Gardy, D., Mokkadem, A. (eds.) Mathematics and Computer Science: Algorithms, Trees, Combinatorics and Probabilities, pp. 209–220. Birkhauser, Basel (2000)

    Chapter  Google Scholar 

  29. Dayar, T.: On moments of discrete phase-type distributions. Lecture Notes in Computer Science, vol 3670, pp. 51–63. Springer, Heidelberg (2005)

    Google Scholar 

  30. Dayar, T.: Analyzing Markov chains based on Kronecker products. In: Langville, A.N., Stewart, W.J. (eds.) MAM 2006: Markov Anniversary Meeting, pp. 279–300. Boson Books, Raleigh (2006)

    Google Scholar 

  31. Dayar, T., Akar, N.: Computing moments of first passage times to a subset of states in Markov chains. SIAM J. Matrix Anal. Appl. 27, 396–412 (2005)

    Article  MathSciNet  Google Scholar 

  32. Dayar, T., Hermanns, H., Spieler, D., Wolf, V.: Bounding the equilibrium distribution of Markov population models. Numer. Linear Algebr. Appl. 18, 931–946 (2011)

    Article  MathSciNet  Google Scholar 

  33. Dayar, T., Orhan, M.C.: Kronecker-based infinite level-dependent QBDs. J. Appl. Probab. 49, 1166–1187 (2012)

    Article  MathSciNet  Google Scholar 

  34. Dayar, T., Orhan, M.C.: On vector–Kronecker product multiplication with rectangular factors. SIAM J. Sci. Comput. 37, S526–S543 (2015)

    Article  MathSciNet  Google Scholar 

  35. Dayar, T., Orhan, M.C.: Cartesian product partitioning of multi-dimensional reachable state spaces. Probab. Eng. Inf. Sci. 30, 413–430 (2016)

    Article  MathSciNet  Google Scholar 

  36. Dayar, T., Orhan, M.C.: Steady-state analysis of a multiclass MAP/PH/c queue with acyclic PH retrials. J. Appl. Probab. 53, 1098–1110 (2016)

    Article  MathSciNet  Google Scholar 

  37. Dayar, T., Sandmann, W., Spieler, D., Wolf, V.: Infinite level-dependent QBDs and matrix analytic solutions for stochastic chemical kinetics. Adv. Appl. Probab. 43, 1005–1026 (2011)

    Article  MathSciNet  Google Scholar 

  38. Dayar, T., Stewart, W.J.: Quasi lumpability, lower-bounding coupling matrices, and nearly completely decomposable Markov chains. SIAM J. Matrix Anal. Appl. 18, 482–498 (1997)

    Article  MathSciNet  Google Scholar 

  39. Dayar, T., Stewart, W.J.: Comparison of partitioning techniques for two-level iterative solvers on large, sparse Markov chains. SIAM J. Sci. Comput. 21, 1691–1705 (2000)

    Article  MathSciNet  Google Scholar 

  40. Demmel, J.W.: Applied Numerical Linear Algebra. SIAM, Philadelphia (1997)

    Book  Google Scholar 

  41. Deuflhard, P., Huisinga, W., Jahnke, T., Wulkow, M.: Adaptive discrete Galerkin methods applied to the chemical master equation. SIAM J. Sci. Comput. 30, 2990–3011 (2008)

    Article  MathSciNet  Google Scholar 

  42. Duff, I.S., Erisman, A.M., Reid, J.K.: Direct Methods for Sparse Matrices. Clarendon, Oxford (1986)

    MATH  Google Scholar 

  43. Falin, G.I., Templeton, J.G.C.: Retrial queues. Chapman and Hall, London (1977)

    MATH  Google Scholar 

  44. Fayolle, G., Malyshev, V.A., Menshikov, M.V.: Topics in the Constructive Theory of Countable Markov Chains. Cambridge University, Cambridge (1995)

    Book  Google Scholar 

  45. Fernandes, P., Plateau, B., Stewart, W.J.: Efficient descriptor–vector multiplications in stochastic automata networks. J. ACM 45, 381–414 (1998)

    Article  MathSciNet  Google Scholar 

  46. Fernandes, P., Plateau, B., Stewart, W.J.: Optimizing tensor product computations in stochastic automata networks. RAIRO Oper. Res. 32, 325–351 (1998)

    Article  MathSciNet  Google Scholar 

  47. Gardner, T.S., Cantor, C.R., Collins, J.J.: Construction of a genetic toggle switch in Escherichia coli. Nature 403, 339–342 (2000)

    Article  Google Scholar 

  48. Gilbert, J.R.: Predicting structure in sparse matrix computations. SIAM J. Matrix Anal. Appl. 15, 62–79 (1994)

    Article  MathSciNet  Google Scholar 

  49. Gillespie, D.T.: Exact stochastic simulation of coupled chemical reactions. J. Phys. Chem. 81, 2340–2361 (1977)

    Article  Google Scholar 

  50. Glynn, P.W., Zeevi, A: Bounding stationary expectations of Markov processes. In: Markov Processes and Related Topics: A Festschrift for Thomas G. Kurtz, IMS Collections, vol 4, pp. 195–214. Institute of Mathematical Statistics, Beachwood (2008)

    MATH  Google Scholar 

  51. Golub, G.H., Van Loan, C.F.: Matrix Computations. 4th ed., Johns Hopkins University, Baltimore (2012)

    MATH  Google Scholar 

  52. Gómez-Corral, A.: A bibliographical guide to the analysis of retrial queues through matrix analytic techniques. Ann. Oper. Res. 141, 163–191 (2006)

    Article  MathSciNet  Google Scholar 

  53. Gurvich, I., Armony, M., Mandelbaum, A.: Service-level differentiation in call centers with fully flexible servers. Manage. Sci. 54, 279–294 (2008)

    Article  Google Scholar 

  54. Gurvich, I., Whitt, W.: Service-level differentiation in many-server service systems: A solution based on fixed-queue-ratio routing. Oper. Res. 29, 567–588 (2007)

    Google Scholar 

  55. Gusak, O., Dayar, T.: Iterative aggregation–disaggregation versus block Gauss–Seidel on continuous-time stochastic automata networks with unfavorable partitionings. In: Obaidat, M.S., Davoli, F. (eds.) Proceedings of the 2001 International Symposium on Performance Evaluation of Computer and Telecommunication Systems, pp. 617–623. Orlando (2001)

    Google Scholar 

  56. Gusak, O., Dayar, T., Fourneau, J.-M.: Lumpable continuous-time stochastic automata networks. Eur. J. Oper. Res. 148, 436–451 (2003)

    Article  MathSciNet  Google Scholar 

  57. Gusak, O., Dayar, T., Fourneau, J.-M.: Iterative disaggregation for a class of lumpable discrete-time stochastic automata networks. Perform Eval. 53, 43–69 (2003)

    Article  Google Scholar 

  58. Henzinger, T.A., Jobstmann, B,. Wolf, V.: Formalisms for specifying Markovian population models. In: Bournez, O., Potapov, I. (eds.) Proceedings of the 3rd International Workshop on Reachability Problems, Lecture Notes in Computer Science, vol 5797, pp. 3–23. Springer, Berlin (2009)

    Google Scholar 

  59. Jahnke, T., Huisinga, W.: A dynamical low-rank approach to the chemical master equation. B. Math. Biol. 70, 2283–2302 (2008)

    Article  MathSciNet  Google Scholar 

  60. Kemeny, J.G., Snell, J.L.: Finite Markov Chains. Springer, New York (1983)

    MATH  Google Scholar 

  61. Kendall, D.G.: Stochastic processes occurring in the theory of queues and their analysis by the method of imbedded Markov chains. Ann. Math. Statist. 24, 338–354 (1953)

    Article  MathSciNet  Google Scholar 

  62. Kim, C.S., Mushko, V., Dudin, A.: Computation of the steady state distribution for multi-server retrial queues with phase type service process. Ann. Oper. Res. 201, 307–323 (2012)

    Article  MathSciNet  Google Scholar 

  63. Kim, J., Kim, B.: A survey of retrial queueing systems. Ann. Oper. Res. 247, 3–36 (2016)

    Article  MathSciNet  Google Scholar 

  64. Kumar, M.S., Sohraby, K., Kiseon, K.: (2013). Delay analysis of orderly reattempts in retrial queueing system with phase type retrial time. IEEE Commun. Lett. 17, 822–825 (2013)

    Article  Google Scholar 

  65. Kurtz, T.G.: The relationship between stochastic and deterministic models for chemical reactions. J. Chem. Phys. 57, 2976–2978 (1972)

    Article  Google Scholar 

  66. Lee, T.L., Li, T.Y., Tsai, C.H.: HOM4PS-2.0: A software package for solving polynomial systems by the polyhedral homotopy continuation method. Comput. 83, 109–133 (2008)

    Article  MathSciNet  Google Scholar 

  67. Lipshtat, A., Loinger, A., Balaban, N.Q., Biham, O.: Genetic toggle switch without cooperative binding. Phys. Rev. Lett. 96, 188101 (2006)

    Article  Google Scholar 

  68. Loinger, A., Biham, O.: Stochastic simulations of the repressilator circuit. Phys. Rev. E 76, 051917 (2007)

    Article  Google Scholar 

  69. Loinger, A., Lipshtat, A., Balaban, N.Q., Biham, O.: Stochastic simulations of genetic switch systems. Phys. Rev. E 75, 021904 (2007)

    Article  Google Scholar 

  70. Mateescu, M., Wolf, V., Didier, F., Henzinger, T.A.: Fast adaptive uniformisation of the chemical master equation. IET Syst. Biol. 4, 441–452 (2010)

    Article  Google Scholar 

  71. McQuarrie, D.A.: Stochastic approach to chemical kinetics. J. Appl. Probab. 4, 413–478 (1967)

    Article  MathSciNet  Google Scholar 

  72. Meyer, C.D.: Matrix Analysis and Applied Linear Algebra. SIAM, Philadelphia (2000)

    Book  Google Scholar 

  73. Migallón, V., Penadés, J., Syzld, D.B.: Block two-stage methods for singular systems and Markov chains. Numer. Linear Algebr. Appl. 3, 413–426 (1996)

    Article  MathSciNet  Google Scholar 

  74. Netlib. A collection of mathematical software, papers, and databases. http://www.netlib.org (2017). Accessed May 27, 2018

    Google Scholar 

  75. Neuts, M.F. (1979). A versatile Markovian point process. J. Appl. Probab. 16, 764–779 (1979)

    Article  MathSciNet  Google Scholar 

  76. Neuts, M.F.: Matrix-Geometric Solutions in Stochastic Models: An Algorithhmic Approach. Johns Hopkins University, Baltimore (1981)

    Google Scholar 

  77. Oppenheim, I., Shuler, K.E., Weiss, G.H.: Stochastic and deterministic formulation of chemical rate equations. J. Chem. Phys. 50, 460–466 (1969)

    Article  Google Scholar 

  78. Orhan, M.C.: Kronecker-based Infinite Level-Dependent QBDs: Matrix Analytic Solution versus Simulation. MS Thesis, Department of Computer Engineering, Bilkent University, Ankara (2011)

    Google Scholar 

  79. Paige, R., Tarjan, R.E.: Three partition refinement algorithms. SIAM J. Comput. 16, 973–989 (1987)

    Article  MathSciNet  Google Scholar 

  80. Phung-Duc, T., Kawanishi, K.: Performance analysis of call centers with abandonment, retrial and after-call work. Perform. Eval. 80, 43–62 (2014)

    Article  Google Scholar 

  81. Ramaswami, V., Lucantoni, D.M.: Algorithm for the multi-server queue with phase-type service. Stoch. Model. 1, 393–417 (1985)

    Article  Google Scholar 

  82. Sakurai, H., Phung-Duc, T.: Two-way communication retrial queues with multiple types of outgoing calls. TOP 23, 466–492 (2015)

    Article  MathSciNet  Google Scholar 

  83. Sandmann, W., Wolf, V.: Computational probability for systems biology. In: Fisher, J. (ed.), Formal Methods in Systems Biology, Lecture Notes in Computer Science vol 5054, pp.33–47. Springer, Berlin (2008)

    Google Scholar 

  84. Singer, K.: Application of the theory of stochastic processes to the study of irreproducible chemical reactions and nucleation processes. J. Roy. Statist. Soc. Ser. B 15, 92–106 (1953)

    MATH  Google Scholar 

  85. Sjöberg, P.L., Lötstedt, P., Elf, J.: Fokker–Planck approximation of the master equation in molecular biology, Comput. Vis. Sci. 12, 37–50 (2009)

    Article  MathSciNet  Google Scholar 

  86. Staff, P.J.: (1970). A stochastic development of the reversible Michaelis–Menten mechanism. J. Theor. Biol. 27, 221–232 (1970)

    Article  MathSciNet  Google Scholar 

  87. Stepanov, S.N.: Markov models with retrials: The calculation of stationary performance measures based on concept of truncation. Math. Comput. Model. 30, 207–228 (1999)

    Article  MathSciNet  Google Scholar 

  88. Stewart, G.W.: Matrix Algorithms, Vol I: Basic Decompositions. SIAM, Philadelphia (1998)

    Book  Google Scholar 

  89. Stewart, G.W.: Matrix Algorithms, Vol II: Eigensystems. SIAM, Philadelphia (2002)

    Google Scholar 

  90. Stewart, W.J.: Introduction to the Numerical Solution of Markov Chains. Princeton University, Princeton (1994)

    MATH  Google Scholar 

  91. Thattai, M., van Oudenaarden, A.: Intrinsic noise in gene regulatory networks. Proc. Natl. Acad. Sci. 98, 8614–8619 (2001)

    Article  Google Scholar 

  92. Tweedie, R.L.: Sufficient conditions for regularity, recurrence and ergodicity of Markov processes. Math. Proc. Camb. Philos. Soc. 78, 125–136 (1975)

    Article  MathSciNet  Google Scholar 

  93. Uysal, E., Dayar, T.: Iterative methods based on splittings for stochastic automata networks. Eur. J. Oper. Res. 110, 166–186 (1998)

    Article  Google Scholar 

  94. van Kampen, N.G.: Stochastic Processes in Physics and Chemistry. Elsevier, Amsterdam (1992)

    MATH  Google Scholar 

  95. Wolf, V.: Modelling of biochemical reactions by stochastic automata networks. Electron. Notes Theor. Comput. Sci. 171, 197–208 (2007)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Engineering, Bilkent University, Ankara, Turkey

    Tuǧrul Dayar

Authors
  1. Tuǧrul Dayar
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Dayar, T. (2018). Preprocessing. In: Kronecker Modeling and Analysis of Multidimensional Markovian Systems. Springer Series in Operations Research and Financial Engineering. Springer, Cham. https://doi.org/10.1007/978-3-319-97129-2_4

Download citation

Publish with us

Policies and ethics

Search

Navigation