{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:55:23Z","timestamp":1725512123103},"publisher-location":"Berlin, Heidelberg","reference-count":79,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540724827"},{"type":"electronic","value":"9783540725220"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72522-0_2","type":"book-chapter","created":{"date-parts":[[2007,6,5]],"date-time":"2007-06-05T19:02:12Z","timestamp":1181070132000},"page":"34-82","source":"Crossref","is-referenced-by-count":13,"title":["Queueing Networks"],"prefix":"10.1007","author":[{"given":"Simonetta","family":"Balsamo","sequence":"first","affiliation":[]},{"given":"Andrea","family":"Marin","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1145\/800047.801685","volume-title":"Proc. of the Computer Network Performance Symposium","author":"P.V. Afshari","year":"1982","unstructured":"Afshari, P.V., Bruell, S.C., Kain, R.Y.: Modeling a new technique for accessing shared buses. In: Proc. of the Computer Network Performance Symposium, College Park, Maryland, United States, pp. 4\u201313. ACM Press, New York (1982), doi:10.1145\/800047.801685"},{"issue":"1","key":"2_CR2","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1109\/TC.1987.5009458","volume":"36","author":"I.F. Akyildiz","year":"1987","unstructured":"Akyildiz, I.F.: Exact product form solution for queueing networks with blocking. IEEE Trans. on Computer\u00a036(1), 122\u2013125 (1987)","journal-title":"IEEE Trans. on Computer"},{"issue":"2","key":"2_CR3","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0166-5316(88)90015-6","volume":"8","author":"I.F. Akyildiz","year":"1988","unstructured":"Akyildiz, I.F., Bolch, G.: Mean value analysis approximation for multiple server queueing networks. Perform. Eval.\u00a08(2), 77\u201391 (1988)","journal-title":"Perform. Eval."},{"key":"2_CR4","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1145\/65950.65957","volume":"36","author":"F. Baccelli","year":"1989","unstructured":"Baccelli, F., Massey, W., Towsley, D.: Acyclic fork-join queueing networks. Journal of the ACM\u00a036, 615\u2013642 (1989)","journal-title":"Journal of the ACM"},{"key":"2_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3345-7","volume-title":"Analysis of Queueing Networks with Blocking","author":"S. Balsamo","year":"2001","unstructured":"Balsamo, S., De Nitto Person\u00e9, V., Onvural, R.: Analysis of Queueing Networks with Blocking. Kluwer Academic Publishers, Dordrecht (2001)"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Balsamo, S., Iazeolla, G.: An extension of Norton\u2019s theorem for queueing networks. IEEE Trans. on Software Eng.\u00a08 (1982)","DOI":"10.1109\/TSE.1982.235424"},{"issue":"2","key":"2_CR7","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1109\/TSE.1985.232194","volume":"11","author":"S. Balsamo","year":"1985","unstructured":"Balsamo, S., Iazeolla, G.: Product-form synthesis of queueing networks. IEEE Trans. on Software Eng.\u00a011(2), 194\u2013199 (1985)","journal-title":"IEEE Trans. on Software Eng."},{"key":"2_CR8","first-page":"51","volume-title":"Proc. of the Third Int. Symp. on Modelling and Performance Evaluation of Computer Systems","author":"Y. Bard","year":"1979","unstructured":"Bard, Y.: Some extensions to multiclass queueing network analysis. In: Proc. of the Third Int. Symp. on Modelling and Performance Evaluation of Computer Systems, Amsterdam, NL, pp. 51\u201362. North-Holland, Amsterdam (1979)"},{"issue":"2","key":"2_CR9","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1145\/321879.321887","volume":"22","author":"F. Baskett","year":"1975","unstructured":"Baskett, F., Chandy, K.M., Muntz, R.R., Palacios, F.G.: Open, closed, and mixed networks of queues with different classes of customers. J. ACM\u00a022(2), 248\u2013260 (1975), doi:10.1145\/321879.321887","journal-title":"J. ACM"},{"key":"2_CR10","doi-asserted-by":"crossref","DOI":"10.1002\/0471200581","volume-title":"Queueing networks and Markov chains","author":"G. Bolch","year":"1998","unstructured":"Bolch, G., Greiner, S., de Meer, H., Trivedi, K.S.: Queueing networks and Markov chains. John Wiley, Chichester (1998)"},{"key":"2_CR11","doi-asserted-by":"publisher","first-page":"152","DOI":"10.2307\/1427516","volume":"23","author":"R. Boucherie","year":"1991","unstructured":"Boucherie, R., van Dijk, N.M.: Product-form queueing networks with state dependent multiple job transitions. Advances in Applied Prob.\u00a023, 152\u2013187 (1991)","journal-title":"Advances in Applied Prob."},{"key":"2_CR12","series-title":"The Computer Science Library","volume-title":"Computational Algorithms for Closed Queueing Networks","author":"S.C. Bruell","year":"1980","unstructured":"Bruell, S.C., Balbo, G.: Computational Algorithms for Closed Queueing Networks. The Computer Science Library. Elsevier, New York (1980)"},{"issue":"9","key":"2_CR13","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1145\/362342.362345","volume":"16","author":"J.P. Buzen","year":"1973","unstructured":"Buzen, J.P.: Computational algorithms for closed queueing networks with exponential servers. Commun. ACM\u00a016(9), 527\u2013531 (1973), doi:10.1145\/362342.362345","journal-title":"Commun. ACM"},{"key":"2_CR14","series-title":"Lecture Notes in Computer Science","volume-title":"Performance Evaluation of Complex Systems: Techniques and Tools","year":"2002","unstructured":"Calzarossa, M.C., Tucci, S. (eds.): Performance 2002. LNCS, vol.\u00a02459. Springer, Heidelberg (2002)"},{"issue":"1","key":"2_CR15","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1147\/rd.191.0036","volume":"1","author":"K.M. Chandy","year":"1975","unstructured":"Chandy, K.M., Herzog, U., Woo, L.: Parametric analysis of queueing networks. IBM Journal of Res. and Dev.\u00a01(1), 36\u201342 (1975)","journal-title":"IBM Journal of Res. and Dev."},{"key":"2_CR16","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1147\/rd.191.0043","volume":"19","author":"K.M. Chandy","year":"1975","unstructured":"Chandy, K.M., Hergox, U., Woo, L.: Approximate analysis of general queueing networks. IBM Journal of Res. and Dev.\u00a019, 43\u201349 (1975)","journal-title":"IBM Journal of Res. and Dev."},{"issue":"2","key":"2_CR17","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1145\/322003.322009","volume":"24","author":"K.M. Chandy","year":"1977","unstructured":"Chandy, K.M., John, H., Howard, J., Towsley, D.F.: Product form and local balance in queueing networks. J. ACM\u00a024(2), 250\u2013263 (1977)","journal-title":"J. ACM"},{"issue":"2","key":"2_CR18","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1145\/322374.322378","volume":"30","author":"K.M. Chandy","year":"1983","unstructured":"Chandy, K.M., Martin, A.J.: A characterization of product-form queuing networks. J. ACM\u00a030(2), 286\u2013299 (1983), doi:10.1145\/322374.322378","journal-title":"J. ACM"},{"issue":"2","key":"2_CR19","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1145\/358396.358403","volume":"25","author":"K.M. Chandy","year":"1982","unstructured":"Chandy, K.M., Neuse, D.: Linearizer: a heuristic algorithm for queueing network models of computing systems. Commun. ACM\u00a025(2), 126\u2013134 (1982), doi:10.1145\/358396.358403","journal-title":"Commun. ACM"},{"issue":"10","key":"2_CR20","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1145\/359015.359020","volume":"23","author":"K.M. Chandy","year":"1980","unstructured":"Chandy, K.M., Sauer, C.H.: Computational algorithms for product form queueing networks. Commun. ACM\u00a023(10), 573\u2013583 (1980), doi:10.1145\/359015.359020","journal-title":"Commun. ACM"},{"key":"2_CR21","volume-title":"The single server queue","author":"J.W. Cohen","year":"1969","unstructured":"Cohen, J.W.: The single server queue. Wiley-Interscience, Chichester (1969)"},{"issue":"3","key":"2_CR22","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1109\/12.21129","volume":"38","author":"A.E. Conway","year":"1989","unstructured":"Conway, A.E., de Souza e Silva, E., Lavenberg, S.S.: Mean Value Analysis by chain of product form queueing networks. IEEE Trans. Comput.\u00a038(3), 432\u2013442 (1989), doi:10.1109\/12.21129","journal-title":"IEEE Trans. Comput."},{"issue":"4","key":"2_CR23","doi-asserted-by":"publisher","first-page":"768","DOI":"10.1145\/6490.6495","volume":"33","author":"A.E. Conway","year":"1986","unstructured":"Conway, A.E., Georganas, N.D.: Recal - a new efficient algorithm for the exact analysis of multiple-chain closed queuing networks. J. ACM\u00a033(4), 768\u2013791 (1986), doi:10.1145\/6490.6495","journal-title":"J. ACM"},{"key":"2_CR24","volume-title":"Queueing Networks - Exact Computational Algorithms: A unified Theory Based on Decomposition and Aggregation","author":"A.E. Conway","year":"1989","unstructured":"Conway, A.E., Georganas, N.D.: Queueing Networks - Exact Computational Algorithms: A unified Theory Based on Decomposition and Aggregation. The MIT Press, Cambridge (1989)"},{"key":"2_CR25","volume-title":"Decomposability","author":"P.J. Courtois","year":"1977","unstructured":"Courtois, P.J.: Decomposability. Academic Press, New York (1977)"},{"issue":"1","key":"2_CR26","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1145\/58562.58563","volume":"36","author":"E. Souza e Silva de","year":"1989","unstructured":"de Souza e Silva, E., Lavenberg, S.S.: Calculating joint queue-length distributions in product-form queuing networks. J. ACM\u00a036(1), 194\u2013207 (1989), doi:10.1145\/58562.58563","journal-title":"J. ACM"},{"key":"2_CR27","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1109\/MASCOT.1994.284452","volume-title":"MASCOTS \u201994: Proc. of the Second International Workshop on Modeling, Analysis, and Simulation On Computer and Telecommunication Systems","author":"J.-M. Fourneau","year":"1994","unstructured":"Fourneau, J.-M., Gelenbe, E., Suros, R.: G-networks with multiple class negative and positive customers. In: MASCOTS \u201994: Proc. of the Second International Workshop on Modeling, Analysis, and Simulation On Computer and Telecommunication Systems, Washington, DC, USA, pp. 30\u201334. IEEE Computer Society Press, Los Alamitos (1994)"},{"key":"2_CR28","doi-asserted-by":"crossref","unstructured":"Fourneau, J.-M., Verchere, D.: G-networks with triggered batch state-dependent movement. In: Proc. MASCOTS, pp. 33\u201337 (1995), \n                  \n                    citeseer.ist.psu.edu\/fourneau94gnetworks.html","DOI":"10.1109\/MASCOT.1995.378713"},{"issue":"3","key":"2_CR29","doi-asserted-by":"publisher","first-page":"656","DOI":"10.2307\/3214499","volume":"28","author":"E. Gelenbe","year":"1991","unstructured":"Gelenbe, E.: Product form networks with negative and positive customers. Journal of Applied Prob.\u00a028(3), 656\u2013663 (1991)","journal-title":"Journal of Applied Prob."},{"issue":"5","key":"2_CR30","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/BF02033314","volume":"48","author":"E. Gelenbe","year":"1994","unstructured":"Gelenbe, E.: G-networks: a unifying model for neural and queueing networks. Annals of Operations Research\u00a048(5), 433\u2013461 (1994)","journal-title":"Annals of Operations Research"},{"issue":"1-4","key":"2_CR31","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/S0166-5316(02)00127-X","volume":"49","author":"E. Gelenbe","year":"2002","unstructured":"Gelenbe, E., Fourneau, J.-M.: G-networks with resets. Perform. Eval.\u00a049(1-4), 179\u2013191 (2002)","journal-title":"Perform. Eval."},{"key":"2_CR32","volume-title":"Analysis and Synthesis of Computer Systems","author":"E. Gelenbe","year":"1980","unstructured":"Gelenbe, E., Mitrani, I.: Analysis and Synthesis of Computer Systems. Academic Press, New York (1980)"},{"issue":"2","key":"2_CR33","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1287\/opre.15.2.254","volume":"15","author":"W.J. Gordon","year":"1967","unstructured":"Gordon, W.J., Newell, G.F.: Cyclic queueing networks with exponential servers. Operations Research\u00a015(2), 254\u2013265 (1967)","journal-title":"Operations Research"},{"issue":"2","key":"2_CR34","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1287\/opre.15.2.266","volume":"15","author":"W.J. Gordon","year":"1967","unstructured":"Gordon, W.J., Newell, G.F.: Cyclic queueing networks with restricted length queues. Operations Research\u00a015(2), 266\u2013277 (1967)","journal-title":"Operations Research"},{"key":"2_CR35","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/BF02411466","volume":"6","author":"W. Henderson","year":"1990","unstructured":"Henderson, W., Taylor, P.: Product form in networks of queues with batch arrivals and batch services. Queueing Systems\u00a06, 71\u201388 (1990)","journal-title":"Queueing Systems"},{"key":"2_CR36","doi-asserted-by":"publisher","first-page":"409","DOI":"10.2307\/3214876","volume":"28","author":"W. Henderson","year":"1990","unstructured":"Henderson, W., Taylor, P.: Some new results on queueing networks with batch movements. Journal of Applied Prob.\u00a028, 409\u2013421 (1990)","journal-title":"Journal of Applied Prob."},{"issue":"2","key":"2_CR37","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1145\/214419.214423","volume":"4","author":"K.P. Hoyme","year":"1986","unstructured":"Hoyme, K.P., Bruell, S.C., Afshari, P.V., Kain, R.Y.: A tree-structured Mean Value Analysis algorithm. ACM Trans. Comput. Syst.\u00a04(2), 178\u2013185 (1986), doi:10.1145\/214419.214423","journal-title":"ACM Trans. Comput. Syst."},{"key":"2_CR38","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1287\/mnsc.10.1.131","volume":"10","author":"J.R. Jackson","year":"1963","unstructured":"Jackson, J.R.: Jobshop-like queueing systems. Management Science\u00a010, 131\u2013142 (1963)","journal-title":"Management Science"},{"key":"2_CR39","volume-title":"Introduction to Computer System Performance Evaluation","author":"K. Kant","year":"1992","unstructured":"Kant, K.: Introduction to Computer System Performance Evaluation. McGraw-Hill, New York (1992)"},{"key":"2_CR40","volume-title":"Reversibility and stochastic networks","author":"F. Kelly","year":"1979","unstructured":"Kelly, F.: Reversibility and stochastic networks. Wiley, New York (1979)"},{"key":"2_CR41","volume-title":"Finite Markov Chains","author":"J.G. Kemeny","year":"1960","unstructured":"Kemeny, J.G., Snell, J.L.: Finite Markov Chains. D. Van Nostrand Company, inc., New York (1960)"},{"key":"2_CR42","volume-title":"Queueing Systems, vol.\u00a01: Theory","author":"L. Kleinrock","year":"1975","unstructured":"Kleinrock, L.: Queueing Systems, vol.\u00a01: Theory. John Wiley and Sons, Chichester (1975)"},{"key":"2_CR43","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1016\/0166-5316(82)90002-5","volume":"2","author":"P. Kritzinger","year":"1982","unstructured":"Kritzinger, P., van Wyk, S., Krezesinski, A.: A generalization of Norton\u2019s theorem for multiclass queueing networks. Performance Evaluation\u00a02, 98\u2013107 (1982)","journal-title":"Performance Evaluation"},{"issue":"4","key":"2_CR44","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1147\/rd.214.0370","volume":"21","author":"S.S. Lam","year":"1977","unstructured":"Lam, S.S.: Queueing networks with capacity constraints. IBM Journal of Res. and Dev.\u00a021(4), 370\u2013378 (1977)","journal-title":"IBM Journal of Res. and Dev."},{"issue":"2","key":"2_CR45","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1145\/322307.322321","volume":"29","author":"S.S. Lam","year":"1982","unstructured":"Lam, S.S.: Dynamic scaling and growth behavior of queuing network normalization constants. J. ACM\u00a029(2), 492\u2013513 (1982), doi:10.1145\/322307.322321","journal-title":"J. ACM"},{"issue":"3","key":"2_CR46","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1145\/358061.358075","volume":"26","author":"S.S. Lam","year":"1983","unstructured":"Lam, S.S., Lien, Y.L.: A tree-convolution algorithm for the solution of queueing networks. Commun. ACM\u00a026(3), 203\u2013215 (1983), doi:10.1145\/358061.358075","journal-title":"Commun. ACM"},{"key":"2_CR47","doi-asserted-by":"publisher","first-page":"1048","DOI":"10.2307\/3213214","volume":"17","author":"S. Lavenberg","year":"1980","unstructured":"Lavenberg, S., Reiser, M.: Stationary state probabilities at arrival instants for closed queueing networks with multiple types of customers. Journal of Applied Prob.\u00a017, 1048\u20131061 (1980)","journal-title":"Journal of Applied Prob."},{"key":"2_CR48","volume-title":"Computer Performance Modeling Handbook","author":"S.S. Lavenberg","year":"1983","unstructured":"Lavenberg, S.S.: Computer Performance Modeling Handbook. Academic Press, New York (1983)"},{"key":"2_CR49","volume-title":"Quantitative system performance: computer system analysis using queueing network models","author":"E.D. Lazowska","year":"1984","unstructured":"Lazowska, E.D., Zahorjan, J.L., Graham, G.S., Sevcick, K.C.: Quantitative system performance: computer system analysis using queueing network models. Prentice Hall, Englewood Cliffs (1984)"},{"key":"2_CR50","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1145\/317499.317541","volume-title":"SIGMETRICS \u201986\/PERFORMANCE \u201986: Proc. of the 1986 ACM SIGMETRICS Int. Conf. on Computer performance modelling, measurement and evaluation","author":"J.-Y. Boudec Le","year":"1986","unstructured":"Le Boudec, J.-Y.: A BCMP extension to multiserver stations with concurrent classes of customers. In: SIGMETRICS \u201986\/PERFORMANCE \u201986: Proc. of the 1986 ACM SIGMETRICS Int. Conf. on Computer performance modelling, measurement and evaluation, Raleigh, North Carolina, United States, pp. 78\u201391. ACM Press, New York (1986), doi:10.1145\/317499.317541"},{"issue":"5","key":"2_CR51","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1109\/TSE.1979.234214","volume":"5","author":"R. Marie","year":"1979","unstructured":"Marie, R.: An approximate analytical method for general queueing networks. IEEE Trans. on Software Eng.\u00a05(5), 530\u2013538 (1979)","journal-title":"IEEE Trans. on Software Eng."},{"key":"2_CR52","volume-title":"Capacity Planning for Web Performance. Metrics, Models, & Methods","author":"D.A. Menasc\u00e8","year":"1998","unstructured":"Menasc\u00e8, D.A., Almeida, V.A.F.: Capacity Planning for Web Performance. Metrics, Models, & Methods. Prentice-Hall, Englewood Cliffs (1998)"},{"key":"2_CR53","unstructured":"Muntz, R.: Network of queues. Tech. Rep. Notes for Engineering 226 C., University of Los Angeles, Department of Computer Science (1972)"},{"key":"2_CR54","unstructured":"Muntz, R., Wong, J.: Efficient computational procedures for closed queueing network models. In: Proc. 7th Hawaii Int. Conf. on System Science, Hawaii, January 1974, pp. 33\u201336 (1974)"},{"key":"2_CR55","unstructured":"Muntz, R.R.: Poisson departure processes and queueing networks. Tech. Rep. IBM Research Report RC4145, Yorktown Heights, New York (1972)"},{"issue":"3","key":"2_CR56","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1145\/158439.158906","volume":"25","author":"R. Nelson","year":"1993","unstructured":"Nelson, R.: The mathematics of product-form queueing networks. ACM Computing Survey\u00a025(3), 339\u2013369 (1993)","journal-title":"ACM Computing Survey"},{"key":"2_CR57","first-page":"59","volume-title":"Proc. of ACM SIGMETRICS Conf. on measurement and modeling of computer systems","author":"D. Neuse","year":"1981","unstructured":"Neuse, D., Chandy, K.: SCAT: A heuristic algorithm for queueing network models of computing systems. In: Proc. of ACM SIGMETRICS Conf. on measurement and modeling of computer systems, Las Vegas, Nevada, United States, pp. 59\u201379. ACM Press, New York (1981), doi:10.1145\/800189.805476"},{"key":"2_CR58","unstructured":"Neuts, M.F.: Matrix Geometric Solutions in Stochastic Models. John Hopkins, Baltimore (1981)"},{"issue":"4","key":"2_CR59","doi-asserted-by":"publisher","first-page":"779","DOI":"10.1145\/322154.322166","volume":"26","author":"A.S. Noetzel","year":"1979","unstructured":"Noetzel, A.S.: A generalized queueing discipline for product form network solutions. J. ACM\u00a026(4), 779\u2013793 (1979), doi:10.1145\/322154.322166","journal-title":"J. ACM"},{"issue":"3","key":"2_CR60","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1145\/79147.214074","volume":"37","author":"K.R. Pattipati","year":"1990","unstructured":"Pattipati, K.R., Kostreva, M.M., Teele, J.L.: Approximate mean value analysis algorithms for queuing networks: existence, uniqueness, and convergence results. J. ACM\u00a037(3), 643\u2013673 (1990), doi:10.1145\/79147.214074","journal-title":"J. ACM"},{"issue":"9","key":"2_CR61","doi-asserted-by":"publisher","first-page":"776","DOI":"10.1109\/32.464543","volume":"21","author":"D.C. Petriu","year":"1995","unstructured":"Petriu, D.C., Neilson, J.E., Woodside, C.M., Majumdar, S.: Software bottlenecking in client-server systems and rendezvous networks. IEEE Trans. on Software Eng.\u00a021(9), 776\u2013782 (1995)","journal-title":"IEEE Trans. on Software Eng."},{"issue":"1","key":"2_CR62","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/0166-5316(81)90040-7","volume":"1","author":"M. Raiser","year":"1981","unstructured":"Raiser, M.: Mean Value Analysis and Convolution method for queue-dependent servers in closed queueing networks. Performance Evaluation\u00a01(1), 7\u201318 (1981)","journal-title":"Performance Evaluation"},{"key":"2_CR63","volume-title":"Current Trends in Programming Methodology","author":"M. Reiser","year":"1978","unstructured":"Reiser, M., Sauer, C.H.: Queueing network models: Methods of solution and their program implementation. In: Chandy, K.M., Yeh, R.T. (eds.) Current Trends in Programming Methodology, Prentice-Hall, Englewood Cliffs (1978)"},{"issue":"2","key":"2_CR64","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1145\/322186.322195","volume":"27","author":"M. Resiser","year":"1980","unstructured":"Resiser, M., Lavenberg, S.S.: Mean Value Analysis of closed multichain queueing network. J. ACM\u00a027(2), 313\u2013320 (1980)","journal-title":"J. ACM"},{"issue":"8","key":"2_CR65","doi-asserted-by":"publisher","first-page":"682","DOI":"10.1109\/32.403785","volume":"21","author":"J.A. Rolia","year":"1995","unstructured":"Rolia, J.A., Sevcick, K.C.: The methods of layers. IEEE Trans. on Software Eng.\u00a021(8), 682\u2013688 (1995)","journal-title":"IEEE Trans. on Software Eng."},{"key":"2_CR66","volume-title":"Performance and Reliability Analysis of Computer Systems - An Example-Based Approach Using the SHARPE Software Package","author":"R. Sahner","year":"1996","unstructured":"Sahner, R., Trivedi, K., Puliafito, A.: Performance and Reliability Analysis of Computer Systems - An Example-Based Approach Using the SHARPE Software Package. Kluwer Academic Publishers, Boston (1996)"},{"issue":"1","key":"2_CR67","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1145\/357353.357359","volume":"1","author":"C.H. Sauer","year":"1983","unstructured":"Sauer, C.H.: Computational algorithms for state-dependent queueing networks. ACM Trans. Comput. Syst.\u00a01(1), 67\u201392 (1983), doi:10.1145\/357353.357359","journal-title":"ACM Trans. Comput. Syst."},{"key":"2_CR68","volume-title":"Computer Systems performance modeling","author":"C.H. Sauer","year":"1981","unstructured":"Sauer, C.H., Chandy, K.M.: Computer Systems performance modeling. Prentice-Hall, Englewood Cliffs (1981)"},{"key":"2_CR69","unstructured":"Schweitzer, P.: Approximate analysis of multiclass closed network of queues. In: Proc. of Int. Conf. on Stochastic Control and Optimization, Amsterdam, NL (1979)"},{"issue":"2","key":"2_CR70","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1145\/322248.322257","volume":"28","author":"K.C. Sevcik","year":"1981","unstructured":"Sevcik, K.C., Mitrani, I.: The distribution of queuing network states at input and output instants. J. ACM\u00a028(2), 358\u2013371 (1981), doi:10.1145\/322248.322257","journal-title":"J. ACM"},{"key":"2_CR71","doi-asserted-by":"publisher","first-page":"85","DOI":"10.2307\/1426720","volume":"10","author":"R. Shassenberger","year":"1978","unstructured":"Shassenberger, R.: The insensitivity of stationary probabilities in networks of queues. Journal of Applied Prob.\u00a010, 85\u201393 (1978)","journal-title":"Journal of Applied Prob."},{"key":"2_CR72","volume-title":"Performance Engineering of Software Systems","author":"C. Smith","year":"1990","unstructured":"Smith, C.: Performance Engineering of Software Systems. Addison-Wesley, Reading (1990)"},{"key":"2_CR73","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1145\/317499.317546","volume-title":"SIGMETRICS \u201986\/PERFORMANCE \u201986: Proc. of 1986 ACM SIGMETRICS Int. Conf. on computer performance modelling, measurement and evaluation","author":"J. Strelen","year":"1986","unstructured":"Strelen, J.: A generalization of Mean Value Analysis to higher moments: moment analysis. In: SIGMETRICS \u201986\/PERFORMANCE \u201986: Proc. of 1986 ACM SIGMETRICS Int. Conf. on computer performance modelling, measurement and evaluation, Raleigh, North Carolina, United States, pp. 129\u2013140. ACM Press, New York (1986), doi:10.1145\/317499.317546"},{"issue":"3","key":"2_CR74","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1145\/2402.2995","volume":"30","author":"R. Suri","year":"1983","unstructured":"Suri, R.: Robustness of queuing network formulas. J. ACM\u00a030(3), 564\u2013594 (1983), doi:10.1145\/2402.2995","journal-title":"J. ACM"},{"issue":"2","key":"2_CR75","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1145\/322186.322196","volume":"27","author":"D. Towsley","year":"1980","unstructured":"Towsley, D.: Queuing network models with state-dependent routing. J. ACM\u00a027(2), 323\u2013337 (1980), doi:10.1145\/322186.322196","journal-title":"J. ACM"},{"key":"2_CR76","volume-title":"Probability and statistics with reliability, queuing and computer science applications","author":"K.S. Trivedi","year":"2002","unstructured":"Trivedi, K.S.: Probability and statistics with reliability, queuing and computer science applications, 2nd edn. Wiley-Interscience, Chichester (2002)","edition":"2"},{"issue":"3","key":"2_CR77","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/0166-5316(85)90012-4","volume":"5","author":"S. Tucci","year":"1985","unstructured":"Tucci, S., Sauer, C.: The tree MVA algorithm. Performance Evaluation\u00a05(3), 187\u2013196 (1985)","journal-title":"Performance Evaluation"},{"key":"2_CR78","volume-title":"Queueing networks and product forms","author":"N. Dijk van","year":"1993","unstructured":"van Dijk, N.: Queueing networks and product forms. John Wiley, Chichester (1993)"},{"key":"2_CR79","doi-asserted-by":"publisher","first-page":"168","DOI":"10.2307\/3213756","volume":"22","author":"P. Whittle","year":"1985","unstructured":"Whittle, P.: Partial balance and insensitivity. Journal of Applied Prob.\u00a022, 168\u2013175 (1985)","journal-title":"Journal of Applied Prob."}],"container-title":["Lecture Notes in Computer Science","Formal Methods for Performance Evaluation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72522-0_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:34:20Z","timestamp":1605764060000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72522-0_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540724827","9783540725220"],"references-count":79,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72522-0_2","relation":{},"subject":[]}}