{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T15:53:08Z","timestamp":1743090788106,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319222639"},{"type":"electronic","value":"9783319222646"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-22264-6_17","type":"book-chapter","created":{"date-parts":[[2015,8,21]],"date-time":"2015-08-21T10:33:29Z","timestamp":1440153209000},"page":"263-278","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Perfect Sampling for Multiclass Closed Queueing Networks"],"prefix":"10.1007","author":[{"given":"Anne","family":"Bouillard","sequence":"first","affiliation":[]},{"given":"Ana","family":"Bu\u0161i\u0107","sequence":"additional","affiliation":[]},{"given":"Christelle","family":"Rovetta","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,8,22]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-69033-9","volume-title":"Stochastic simulation: algorithms and analysis","author":"S Asmussen","year":"2007","unstructured":"Asmussen, S., Glynn, P.W.: Stochastic simulation: algorithms and analysis. Springer, New York (2007)"},{"key":"17_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/978-3-642-02742-0_11","volume-title":"Network Performance Engineering","author":"S Balsamo","year":"2011","unstructured":"Balsamo, S.: Queueing networks with blocking: analysis, solution algorithms and properties. In: Kouvatsos, D.D. (ed.) Next Generation Internet: Performance Evaluation and Applications. LNCS, vol. 5233, pp. 233\u2013257. Springer, Heidelberg (2011)"},{"key":"17_CR3","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. Assoc. Comput. Mach. 22, 248\u2013260 (1975)","journal-title":"J. Assoc. Comput. Mach."},{"issue":"3","key":"17_CR4","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0166-5316(94)00028-X","volume":"24","author":"B Baynat","year":"1996","unstructured":"Baynat, B., Dallery, Y.: A product-form approximation method for general closed queueing networks with several classes of customers. Perform. Eval. 24(3), 165\u2013188 (1996)","journal-title":"Perform. Eval."},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Bouillard, A., Busic, A., Rovetta, C.: Perfect sampling for multiclass closed queueing networks. hal-01159962. June 2015","DOI":"10.1007\/978-3-319-22264-6_17"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Bouillard, A., Bu\u0161i\u0107, A., Rovetta, C.: Clones: closed queueing networks exact sampling. In: 8th International Conference on Performance Evaluation Methodologies and Tools, VALUETOOLS 2014, ICST (2014)","DOI":"10.4108\/icst.valuetools.2014.258178"},{"key":"17_CR7","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1016\/j.peva.2014.07.010","volume":"79","author":"A Bouillard","year":"2014","unstructured":"Bouillard, A., Bu\u0161i\u0107, A., Rovetta, C.: Perfect sampling for closed queueing networks. Perform. Eval. 79, 146\u2013159 (2014)","journal-title":"Perform. Eval."},{"issue":"2","key":"17_CR8","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1287\/moor.1110.0533","volume":"37","author":"A Bu\u0161i\u0107","year":"2012","unstructured":"Bu\u0161i\u0107, A., Vliegen, I., Scheller-Wolf, A.: Comparing Markov chains: aggregation and precedence relations applied to sets of states, with applications to assemble-to-order systems. Math. Oper. Res. 37(2), 259\u2013287 (2012)","journal-title":"Math. Oper. Res."},{"key":"17_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/978-3-642-30782-9_10","volume-title":"Analytical and Stochastic Modeling Techniques and Applications","author":"A Bu\u0161i\u0107","year":"2012","unstructured":"Bu\u0161i\u0107, A., Gaujal, B., Perronnin, F.: Perfect sampling of networks with finite and infinite capacity queues. In: Al-Begain, K., Fiems, D., Vincent, J.-M. (eds.) ASMTA 2012. LNCS, vol. 7314, pp. 136\u2013149. Springer, Heidelberg (2012)"},{"issue":"6","key":"17_CR10","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/j.peva.2012.01.003","volume":"69","author":"A Bu\u0161i\u0107","year":"2012","unstructured":"Bu\u0161i\u0107, A., Gaujal, B., Pin, F.: Perfect sampling of Markov chains with piecewise homogeneous events. Perform. Eval. 69(6), 247\u2013266 (2012)","journal-title":"Perform. Eval."},{"issue":"2","key":"17_CR11","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1287\/opre.15.2.254","volume":"15","author":"W Gordon","year":"1967","unstructured":"Gordon, W., Newel, G.: Closed queueing systems with exponential servers. Oper. Res. 15(2), 254\u2013265 (1967)","journal-title":"Oper. Res."},{"issue":"2","key":"17_CR12","doi-asserted-by":"publisher","first-page":"734","DOI":"10.1214\/105051604000000080","volume":"14","author":"M Huber","year":"2004","unstructured":"Huber, M.: Perfect sampling using bounding chains. Ann. Appl. Probab. 14(2), 734\u2013753 (2004)","journal-title":"Ann. Appl. Probab."},{"issue":"3","key":"17_CR13","doi-asserted-by":"publisher","first-page":"844","DOI":"10.1239\/aap\/1013540247","volume":"32","author":"W Kendall","year":"2000","unstructured":"Kendall, W., M\u00f8ller, J.: Perfect simulation using dominating processes on ordered spaces, with application to locally stable point processes. Adv. Appl. Probab. 32(3), 844\u2013865 (2000)","journal-title":"Adv. Appl. Probab."},{"issue":"1","key":"17_CR14","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/s10479-008-0317-2","volume":"162","author":"S Kijima","year":"2008","unstructured":"Kijima, S., Matsui, T.: Randomized approximation scheme and perfect sampler for closed Jackson networks with multiple servers. Ann. Oper. Res. 162(1), 35\u201355 (2008)","journal-title":"Ann. Oper. Res."},{"key":"17_CR15","volume-title":"Markov Chains and Mixing Times","author":"D Levin","year":"2009","unstructured":"Levin, D., Peres, Y., Wilmer, E.: Markov Chains and Mixing Times. American Mathematical Society, New York (2009)"},{"issue":"5","key":"17_CR16","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. Softw. Eng. 5(5), 530\u2013538 (1979)","journal-title":"IEEE Trans. Softw. Eng."},{"issue":"1\u20132","key":"17_CR17","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1002\/(SICI)1098-2418(199608\/09)9:1\/2<223::AID-RSA14>3.0.CO;2-O","volume":"9","author":"JG Propp","year":"1996","unstructured":"Propp, J.G., Wilson, D.B.: Exact sampling with coupled Markov chains and applications to statistical mechanics. Random Struct. Algorithms 9(1\u20132), 223\u2013252 (1996)","journal-title":"Random Struct. Algorithms"},{"key":"17_CR18","doi-asserted-by":"publisher","first-page":"1777","DOI":"10.1016\/j.cor.2013.01.014","volume":"40","author":"K Satyam","year":"2013","unstructured":"Satyam, K., Krishnamurthy, A., Kamath, M.: Solving general multi-class closed queuing networks using parametric decomposition. Comput. Oper. Res. 40, 1777\u20131789 (2013)","journal-title":"Comput. Oper. Res."},{"key":"17_CR19","doi-asserted-by":"crossref","unstructured":"Sigman, K.: Exact simulation of the stationary distribution of the FIFO M\/G\/c queue: the general case for $$\\rho <c$$. Queueing Sys. 70(1), 37\u201343 (2012)","DOI":"10.1007\/s11134-011-9266-6"},{"key":"17_CR20","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1023\/A:1018978823209","volume":"79","author":"NM van Dijk","year":"1998","unstructured":"van Dijk, N.M.: Bounds and error bounds for queueing networks. Ann. Oper. Res. 79, 295\u2013319 (1998)","journal-title":"Ann. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Quantitative Evaluation of Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-22264-6_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T06:17:19Z","timestamp":1676960239000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-22264-6_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319222639","9783319222646"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-22264-6_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"22 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}