Bibliography

Citing LINE

If you use LINE for a research paper, please cite the following article:

Solution-method references

References used by the solution-method tables. The entries are generated from the user manual bibliography.

  1. D. F. Anderson. A modified next reaction method for simulating chemical systems with time dependent propensities and delays. The Journal of chemical physics, 127(21), 2007.
  2. J. Anselmi and P. Cremonesi. On the property of product-form queueing networks with load-dependent stations. Performance Evaluation, 65(11–12):858–874, 2008.
  3. S. Asmussen and J. R. Møller. Calculation of the steady state waiting time distribution in GI/PH/c and MAP/PH/c queues. Queueing Systems, 37(1):9–29, 2001.
  4. S. Balsamo, A. Marin, and I. Stojic. Computation of the normalising constant for product-form models of distributed systems with synchronisation. Future Generation Computer Systems, 111:475–490, 2020.
  5. C. Bandi, D. Bertsimas, and N. Youssef. Robust queueing theory. Operations Research, 63(3):676–700, 2015.
  6. Y. Bard. Some extensions to multiclass queueing network analysis. In Proc. of the 3rd Int’l Symp. on Model. and Performance Evaluation of Comp. Syst., pages 51–62, 1979.
  7. O. Barndorff-Nielsen and D.R. Cox. Edgeworth and saddle-point approximations with statistical applications. Journal of the Royal Statistical Society. Series B, 41(3):279–312, 1979.
  8. M. Bertoli, G. Casale, and G. Serazzi. The JMT simulator for performance evaluation of non-product-form queueing networks. In Proc. of the 40th Annual Simulation Symposium (ANSS), pages 3–10, 2007.
  9. A. L. Bertozzi and J. McKenna. Multidimensional residues, generating functions, and their application to queueing networks. SIAM Review, 35(2):239–268, 1993.
  10. D. Bertsimas, D. Gamarnik, and J. N. Tsitsiklis. Performance of multiclass markovian queueing networks via piecewise linear lyapunov functions. The Annals of Applied Probability, 11(4):1384–1428, 2001.
  11. D. Bertsimas, I. Ch. Paschalidis, and J. N. Tsitsiklis. Optimization of multiclass queueing networks: Polyhedral and nonlinear characterizations of achievable performance. The Annals of Applied Probability, 4(1):43–75, 1994.
  12. Alexander Birman and Yaakov Kogan. Asymptotic evaluation of closed queueing networks with many stations. Communications in Statistics. Stochastic Models, 8(3):543–563, 1992.
  13. G. Bolch, S. Greiner, H. de Meer, and K. S. Trivedi. Queueing Networks and Markov Chains. Wiley, 2006.
  14. S. C. Bruell, G. Balbo, and P. V. Afshari. Mean value analysis of mixed, multiple class BCMP networks with load dependent service stations. Performance Evaluation, 4:241–260, 1984.
  15. J. P. Buzen. Computational algorithms for closed queueing networks with exponential servers. Communications of the ACM, 16(9):527–531, 1973.
  16. G. Casale. CoMoM: Efficient class-oriented evaluation of multiclass performance models. IEEE Trans. Software Engineering, 35(2):162–177, 2009.
  17. G. Casale. Accelerating performance inference over closed systems by asymptotic methods. In Proc. of ACM SIGMETRICS. ACM Press, 2017.
  18. G. Casale, V. De Nitto Personé, and E. Smirni. QRF: An optimization-based framework for evaluating complex stochastic networks. ACM Transactions on Modeling and Computer Simulation, 26(3):15:1–15:24, 2016.
  19. G. Casale and P. G. Harrison. AutoCAT: Automated product-form solution of stochastic models. In Matrix-Analytic Methods in Stochastic Models, volume 27 of Springer Proceedings in Mathematics & Statistics, pages 57–85. Springer, 2013.
  20. G. Casale, P.G. Harrison, and O.W. Hong. Facilitating load-dependent queueing analysis through factorization. Perform. Eval., 2021.
  21. G. Casale, Richard R. Muntz, and Giuseppe Serazzi. Geometric bounds: A noniterative analysis technique for closed queueing networks. IEEE Trans. Computers, 57(6):780–794, 2008.
  22. G. Casale, J. F. Pérez, and W. Wang. QD-AMVA: Evaluating systems with queue-dependent service requirements. In Proceedings of IFIP PERFORMANCE, 2015.
  23. G. Casale and E. Smirni. MAP-AMVA: Approximate mean value analysis of bursty systems. In Proceedings of the IEEE/IFIP International Conference on Dependable Systems and Networks (DSN), pages 409–418, 2009.
  24. K. M. Chandy, U. Herzog, and L. Woo. Parametric analysis of queuing networks. IBM Journal of Research and Development, 19(1):36–42, 1975.
  25. K. M. Chandy and M. S. Lakshmi. An approximation technique for queueing networks with preemptive priority queues. Technical report, Department of Computer Sciences, University of Texas at Austin, 1983.
  26. K. M. Chandy and D. Neuse. Linearizer: A heuristic algorithm for queuing network models of computing systems. Commun. ACM, 25(2):126–134, 1982.
  27. W. Chen and C. A. O’Cinneide. Towards a polynomial-time randomized algorithm for closed product-form networks. ACM Transactions on Modeling and Computer Simulation, 8(3):227–253, 1998.
  28. G. L. Choudhury, K. K. Leung, and W. Whitt. Calculating normalization constants of closed queuing networks by numerically inverting their generating functions. J. ACM, 42(5):935–970, 1995.
  29. W.-M. Chow. Approximations for large scale closed queueing networks. Performance Evaluation, 3(1):1–12, 1983.
  30. C. Comte and J.-P. Dorsman. Pass-and-swap queues. Queueing Systems, 98(3):275–331, 2021.
  31. A. E. Conway. Fast approximate solution of queueing networks with multi-server chain-dependent FCFS queues. In R. Puigjaner and D. Potier, editors, Modeling Techniques and Tools for Computer Performance Evaluation, pages 385–396. Springer US, Boston, MA, 1989.
  32. A. E. Conway, E. de Souza e Silva, and S. S. Lavenberg. Mean value analysis by chain of product form queueing networks. IEEE Transactions on Computers, 38(3):432–442, 1989.
  33. A. E. Conway and N. D. Georganas. recal - A new efficient algorithm for the exact analysis of multiple-chain closed queueing networks. J. ACM, 33(4):768–791, 1986.
  34. Y. Dallery and R. Suri. Approximate disaggregation and performance bounds for queueing networks with multiple-server stations. In Proc. ACM SIGMETRICS, pages 111–128, 1986.
  35. H.E. Daniels. Saddlepoint approximations in statistics. The Annals of Mathematical Statistics, 25(4):631–650, 1954.
  36. Peter J. Denning and Jeffrey P. Buzen. The operational analysis of queueing network models. ACM Computing Surveys, 10(3):225–261, September 1978.
  37. E. de Souza e Silva, S. S. Lavenberg, and R. R. Muntz. A clustering approximation technique for queueing network models with a large number of chains. IEEE Trans. Computers, C-35(5):419–430, 1986.
  38. E. de Souza e Silva and R. R. Muntz. Approximate solutions for a class of non-product form queueing network models. Performance Evaluation, 7(3):221–242, August 1987.
  39. E. de Souza e Silva and R. R. Muntz. A note on the computational cost of the linearizer algorithm for queueing networks. IEEE Trans. Computers, 39(6):840–842, 1990.
  40. L. W. Dowdy, B. M. Carlson, A. T. Krantz, and S. K. Tripathi. Single-class bounds of multi-class queuing networks. Journal of the ACM, 39(1):188–213, 1992.
  41. L. W. Dowdy, D. L. Eager, K. D. Gordon, and L. V. Saxton. Throughput concavity and response time convexity. Information Processing Letters, 19(4):209–212, 1984.
  42. D. L. Eager. Bounding Algorithms for Queueing Network Models of Computer Systems. Tech. rept. csrg-156, University of Toronto, Toronto, Ontario, Canada, 1984.
  43. D. L. Eager and K. C. Sevcik. Performance bound hierarchies for queueing networks. ACM Transactions on Computer Systems, 1(2):99–115, 1983.
  44. S. G. Eick, W. A. Massey, and W. Whitt. The physics of the Mt/G/infinity queue. Operations Research, 41(4):731–742, 1993.
  45. M. Fidler and A. Rizk. A guide to the stochastic network calculus. IEEE Communications Surveys and Tutorials, 17(1):92–105, 2015.
  46. R. G. Franks. Performance Analysis of Distributed Server Systems. PhD thesis, Department of Systems and Computer Engineering, Carleton University, Ottawa, Ontario, Canada, December 1999.
  47. N. Gast. Expected values estimated via mean-field approximation are 1/n-accurate. Proceedings of the ACM on Measurement and Analysis of Computing Systems, 1(1):17:1–17:26, 2017.
  48. N. Gast and B. Van Houdt. Transient and steady-state regime of a family of list-based cache replacement algorithms. Queueing Syst, 83(3-4):293–328, 2016.
  49. Alexander I. Gerasimov. On normalizing constants in multiclass queueing networks. Operations Research, 43(4):704–711, 1995.
  50. D. T. Gillespie. Exact stochastic simulation of coupled chemical reactions. J. Phys. Chem., 81(25):2340–2361, 1977.
  51. M. C. Guenther, A. Stefanek, and J. T. Bradley. Moment closures for performance models with highly non-linear rates. In Computer Performance Engineering (EPEW/UKPEW 2012), volume 7587 of Lecture Notes in Computer Science, pages 32–47. Springer, 2013.
  52. E. Hairer and G. Wanner. Solving Ordinary Differential Equations II: Stiff and Differential-Algebraic Problems, volume 14 of Springer Series in Computational Mathematics. Springer, 2nd edition, 1996.
  53. A. Harel, S. Namn, and J. Sturm. Simple bounds for closed queueing networks. Queueing Systems, 31(1-2):125–135, 1999.
  54. G. Horváth and M. Telek. Sojourn times in fluid queues with independent and dependent input and output processes. Performance Evaluation, 79:160–181, 2014.
  55. G. Horváth and M. Telek. Butools 2: A rich toolbox for markovian performance evaluation. In Proc. of VALUETOOLS, pages 137–142, ICST, Brussels, Belgium, Belgium, 2017. ICST (Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering).
  56. C. H. Hsieh and S. Lam. Two classes of performance bounds for closed queueing networks. Performance Evaluation, 7(1):3–30, 1987.
  57. C. T. Hsieh and S. S. Lam. PAM - a noniterative approximate solution method for closed multichain queueing networks. ACM SIGMETRICS Performance Evaluation Review, 16(1):261–269, 1988.
  58. K. Kant. MVA approximations for SJN scheduling. Performance Evaluation, 15(1):41–61, 1992.
  59. J. S. Kaufman. Blocking in a shared resource environment. IEEE Transactions on Communications, 29(10):1474–1481, 1981.
  60. F. P. Kelly. Loss networks. Annals of Applied Probability, 1(3):319–378, 1991.
  61. T. Kerola. The composite bound method for computing throughput bounds in multiple class environments. Performance Evaluation, 6(1):1–9, 1986.
  62. S. Kijima and T. Matsui. Approximate/perfect samplers for closed Jackson networks. In Proceedings of the Winter Simulation Conference, pages 862–868, 2005.
  63. C. Knessl and C. Tier. Asymptotic expansions for large closed queueing networks with multiple job classes. IEEE Trans. Computers, 41(4):480–488, 1992.
  64. Y. M. Ko and J. Pender. Diffusion limits for the (MAPt/Pht/∞)n queueing network. Operations Research Letters, 45(3):248–253, 2017.
  65. D.D. Kouvatsos. Entropy maximisation and queueing network models. Annals of Operations Research, 48:63–126, 1994.
  66. A. E. Krzesinski. Multiclass queueing networks with state-dependent routing. Performance Evaluation, 7(2):125–143, 1987.
  67. Z. Li and G. Casale. Matrix network analyzer: A new decomposition algorithm for phase-type queueing networks (work in progress paper). In Companion of the 15th ACM/SPEC International Conference on Performance Engineering, ICPE ’24 Companion, page 34–39, New York, NY, USA, 2024. Association for Computing Machinery.
  68. Q. Liu and D. A. Pierce. A note on Gauss-Hermite quadrature. Biometrika, 81(3):624–629, 1994.
  69. Y. Liu and W. Whitt. Algorithms for time-varying networks of many-server fluid queues. INFORMS Journal on Computing, 26(1):59–73, 2014.
  70. Y. Liu, W. Whitt, and Y. Yu. Approximations for heavily-loaded G/GI/n+GI queues. Naval Research Logistics, 63(3):187–217, 2016.
  71. Zhen Liu. Performance analysis of stochastic timed Petri nets using linear programming approach. IEEE Transactions on Software Engineering, 24(11):1014–1030, 1998.
  72. S. Majumdar and C. M. Woodside. Robust bounds and throughput guarantees for closed multiclass queueing networks. Performance Evaluation, 32(2):101–136, 1998.
  73. D. Manjunath and Biplab Sikdar. Integral expressions for the numerical evaluation of product form expressions over irregular multidimensional integer spaces. Manuscript, Indian Institute of Technology Bombay and Rensselaer Polytechnic Institute.
  74. Raymond Marie. Methodes iteratives de resolution de modeles mathematiques de systemes informatiques. RAIRO Informatique, 12(2):107–122, 1978.
  75. A. Marin and S. R. Bulò. A general algorithm to compute the steady-state solution of product-form cooperating Markov chains. In 2009 IEEE International Symposium on Modeling, Analysis & Simulation of Computer and Telecommunication Systems, London, UK, pages 1–10, 2009. doi: 10.1109/MASCOT.2009.5366744.
  76. Andrea Marin, Samuele Rota Bulò, and Simonetta Balsamo. A numerical algorithm for the decomposition of cooperating structured Markov processes. In Proc. of the 20th IEEE MASCOTS, pages 401–410. IEEE, 2012.
  77. W. A. Massey and W. Whitt. An analysis of the modified offered load approximation for the nonstationary Erlang loss model. Annals of Applied Probability, 4(4):1145–1160, 1994.
  78. J. McKenna and D. Mitra. Integral representations and asymptotic expansions for closed markovian queueing networks: Normal usage. Bell Syst. Tech. J., 61(5):661–683, May 1982.
  79. J. McKenna and D. Mitra. Asymptotic expansions and integral representations of moments of queue lengths in closed markovian networks. J. ACM, 31(2):346–360, April 1984.
  80. A. S. Miner and G. Ciardo. Efficient reachability set generation and storage using decision diagrams. In Proc. of ICATPN, LNCS 1639, pages 6–25, 1999.
  81. D. Mitra and J. McKenna. Asymptotic expansions for closed markovian networks with state-dependent service rates. J. ACM, 33(3):568–592, July 1986.
  82. J. A. Morrison. Asymptotic analysis of a large closed queueing network with discriminatory processor sharing. Queueing Systems, 9(1-2):191–214, 1991.
  83. R. R. Muntz and J. W. Wong. Asymptotic properties of closed queueing network models. In Proceedings of the 8th Princeton Conference on Information Sciences and Systems, Department of Electrical Engineering and Computer Science, Princeton University, Princeton, NJ, pages 348–352, 1974.
  84. D. Neuse and K. M. Chandy. SCAT: A heuristic algorithm for queueing network models of computing systems. ACM SIGMETRICS Perform. Eval. Rev., 10(3):59–79, 1981.
  85. M. F. Neuts. Matrix-geometric solutions in stochastic models: an algorithmic approach. Johns Hopkins University Press, 1981.
  86. J. F. Pérez and G. Casale. Line: Evaluating software applications in unreliable environments. IEEE Trans. Reliability, 66(3):837–853, Sept 2017.
  87. Tuan Phung-Duc, Hiroyuki Masuyama, Shoji Kasahara, and Yutaka Takahashi. A simple algorithm for the rate matrices of level-dependent qbd processes. In Proc. of QTNA, pages 46–52. ACM, 2010.
  88. M. Reiser. Mean-value analysis and convolution method for queue-dependent servers in closed queueing networks. Performance Evaluation, 1(1):7–18, 1981.
  89. M. Reiser and H. Kobayashi. Queueing networks with multiple closed chains: Theory and computational algorithms. IBM J. Res. Dev., 19(3):283–294, 1975.
  90. M. Reiser and S. Lavenberg. Mean-value analysis of closed multichain queuing networks. J. ACM, 27:313–322, 1980.
  91. A. Riska and E. Smirni. MAMSolver: A matrix analytic methods tool. In Proc. of the 12th Int. Conf. on Modelling Techniques and Tools (TOOLS), volume 2324 of LNCS, pages 205–211, 2002.
  92. A. Riska and E. Smirni. ETAQA solutions for infinite Markov processes with repetitive structure. INFORMS Journal on Computing, 19(2):215–228, 2007.
  93. T. G. Robertazzi. Computer Networks and Systems. Springer, 2000.
  94. J. W. Roberts. A service system with heterogeneous user requirements. In Performance of Data Communications Systems and Their Applications, pages 423–431. North-Holland, 1981.
  95. J. A. Rolia. Predicting the Performance of Software Systems. PhD thesis, University of Toronto, Toronto, Ontario, Canada, January 1992. Computer Systems Research Institute, Technical Report CSRI-260.
  96. J. A. Rolia and K. C. Sevcik. The method of layers. IEEE Trans. Software Engineering, 21(8):689–700, August 1995.
  97. Keith W. Ross and Jie Wang. Monte carlo summation applied to product-form loss networks. Probability in the Engineering and Informational Sciences, 6(3):323–348, 1992.
  98. J. Ruuskanen, T. Berner, K.-E. Årzén, and A. Cervin. Improving the mean-field fluid model of processor sharing queueing networks for dynamic performance models in cloud computing. Perform. Evaluation, 151:102231, 2021.
  99. R. Schmidt. An approximate MVA algorithm for exponential, class-dependent multiple servers. Performance Evaluation, 29(4):245–254, 1997.
  100. P. J. Schweitzer, G. Serazzi, and M. Broglia. A queue-shift approximation technique for product-form queueing networks. In Computer Performance Evaluation (Tools’98), volume 1469 of Lecture Notes in Computer Science, pages 267–279. Springer, 1998.
  101. Matthew Sheldon, Daphne Tuncer, and Giuliano Casale. TBI: Transient hierarchical modeling of large-scale vehicle sharing systems. IEEE Transactions on Intelligent Transportation Systems, 2025. In submission.
  102. V. Srinivasan. Successively improving bounds on performance measures for single class product form queueing networks. IEEE Transactions on Computers, C-34(11):1076–1082, 1985.
  103. R. Suri, S. K. Sahu, and M. Vernon. Approximate mean value analysis for closed queuing networks with multiple-server stations. In Proc. of the Industrial Engineering Research Conference, pages 1–6, 2007.
  104. H. Tahilramani, D. Manjunath, and S.K. Bose. Approximate analysis of open network of ge/ge/m/n queues with transfer blocking. Proc. of the 7th Int. Symp. on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS), pages 164–171, 1999.
  105. Y. C. Tay and R. Suri. Error bounds for performance prediction in queuing networks. ACM Transactions on Computer Systems, 3(4):227–254, 1985.
  106. M. J. Wainwright, T. S. Jaakkola, and A. S. Willsky. A new class of upper bounds on the log partition function. IEEE Transactions on Information Theory, 51(7):2313–2335, 2005.
  107. H. Wang and K. C. Sevcik. Experiments with improved approximate mean value analysis algorithms. Perform. Eval., 39(1-4):189–206, 2000.
  108. W. Wang, G. Casale, and C. A. Sutton. A bayesian approach to parameter inference in queueing networks. ACM Trans. Model. Comput. Simul., 27(1):2:1–2:26, 2016.
  109. W. Whitt. The queueing network analyzer. Bell System Technical Journal, 62(9):2779–2815, 1983.
  110. W. Whitt. Fluid models for multiserver queues with abandonments. Operations Research, 54(1):37–54, 2006.
  111. W. Whitt and W. You. A robust queueing network analyzer based on indices of dispersion. Naval Research Logistics, 69(1):36–50, 2022.
  112. John Zahorjan, Kenneth C. Sevcik, Derek L. Eager, and Bruce Galler. Balanced job bound analysis of queueing networks. Communications of the ACM, 25(2):134–141, 1982.
  113. J. Zahorjan, D. L. Eager, and H. M. Sweillam. Accuracy, speed, and convergence of approximate mean value analysis. Perform. Eval., 8(4):255–270, 1988.
  114. S. Zhou. A New Approximation for Multiserver Waiting Time, for Layered Queueing Systems. M.A.Sc. thesis, Department of Systems and Computer Engineering, Carleton University, Ottawa, Ontario, Canada, 2021. doi: 10.22215/etd/2021-14846.
  115. S. Zhou and M. Woodside. A multiserver approximation for cloud scaling analysis. In Companion of the 2022 ACM/SPEC International Conference on Performance Engineering (ICPE '22), pages 129–136. ACM, 2022. doi: 10.1145/3491204.3527472.

← Back to Home