{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T16:33:43Z","timestamp":1743093223518,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319185781"},{"type":"electronic","value":"9783319185798"}],"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-18579-8_2","type":"book-chapter","created":{"date-parts":[[2015,5,22]],"date-time":"2015-05-22T11:59:24Z","timestamp":1432295964000},"page":"15-29","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Use of Flow Equivalent Servers in the Transient Analysis of Product Form Queuing Networks"],"prefix":"10.1007","author":[{"given":"Alessio","family":"Angius","sequence":"first","affiliation":[]},{"given":"Andr\u00e1s","family":"Horv\u00e1th","sequence":"additional","affiliation":[]},{"given":"Sami M.","family":"Halawani","sequence":"additional","affiliation":[]},{"given":"Omar","family":"Barukab","sequence":"additional","affiliation":[]},{"given":"Ab Rahman","family":"Ahmad","sequence":"additional","affiliation":[]},{"given":"Gianfranco","family":"Balbo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,5,22]]},"reference":[{"key":"2_CR1","first-page":"3","volume":"277","author":"A Angius","year":"2011","unstructured":"Angius, A., Horv\u00e1th, A.: Product Form Approximation of Transient Probabilities in Stochastic Reaction Networks. ENTCS 277, 3\u201314 (2011)","journal-title":"ENTCS"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Angius, A., Horv\u00e1th, A.: Approximate transient analysis of queuing networks by decomposition based on time-inhomogeneous markov arrival processes. In: Proc. of 8th International Conference on Performance Evaluation Methodologies and Tools (ValueTools 2014), Bratislava, Slovakia, pp. 1\u20138, (2014)","DOI":"10.4108\/icst.valuetools.2014.258192"},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/978-3-642-39408-9_3","volume-title":"Analytical and Stochastic Modeling Techniques and Applications","author":"A Angius","year":"2013","unstructured":"Angius, A., Horv\u00e1th, A., Wolf, V.: Approximate transient analysis of queuing networks by quasi product forms. In: Dudin, A., De Turck, K. (eds.) ASMTA 2013. LNCS, vol. 7984, pp. 22\u201336. Springer, Heidelberg (2013)"},{"key":"2_CR4","unstructured":"Balbo, G., Bruell, S.C.: Calculation of the moments of the waiting time distribution of FCFS stations in product form queueing networks. Computer Performance, 4(2), June 1983"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Balsamo, S., Iazeolla, G.: An extension of Norton\u2019s theorem for queueing networks. IEEE Trans. on Software Eng., SE-8 (1982)","DOI":"10.1109\/TSE.1982.235424"},{"issue":"2","key":"2_CR6","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 22(2), 248\u2013260 (1975)","journal-title":"J. ACM"},{"key":"2_CR7","doi-asserted-by":"publisher","first-page":"1289","DOI":"10.1016\/j.comnet.2009.02.012","volume":"53","author":"P Bazan","year":"2009","unstructured":"Bazan, P., German, R.: Approximate transient analysis of large stochastic models with WinPEPSY-QNS. Computer Networks 53, 1289\u20131301 (2009)","journal-title":"Computer Networks"},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/BF01439160","volume":"3","author":"RJ Boucherie","year":"1993","unstructured":"Boucherie, R.J., Taylor, P.G.: Transient product form distributions in queueing networks. Discrete Event Dynamics Systems: Theory and Applications 3, 375\u2013396 (1993)","journal-title":"Discrete Event Dynamics Systems: Theory and Applications"},{"key":"2_CR9","volume-title":"Computational Algorithms for Closed Queueing Networks","author":"SC Bruell","year":"1980","unstructured":"Bruell, S.C., Balbo, G.: Computational Algorithms for Closed Queueing Networks. The Computer Science Library, Elsevier North Holland (1980)"},{"issue":"9","key":"2_CR10","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1145\/362342.362345","volume":"16","author":"JP Buzen","year":"1973","unstructured":"Buzen, J.P.: Computational algorithms for closed queueing networks with exponential servers. Commun. ACM 16(9), 527\u2013531 (1973)","journal-title":"Commun. ACM"},{"issue":"1","key":"2_CR11","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1147\/rd.191.0036","volume":"1","author":"KM Chandy","year":"1975","unstructured":"Chandy, K.M., Herzog, U., Woo, L.: Parametric analysis of queueing networks. IBM Journal of Res. and Dev. 1(1), 36\u201342 (1975)","journal-title":"IBM Journal of Res. and Dev."},{"issue":"3","key":"2_CR12","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1145\/356733.356737","volume":"10","author":"KM Chandy","year":"1978","unstructured":"Chandy, K.M., Sauer, C.H.: Approximate methods for analyzing queueing network models of computing systems. ACM Comput. Surv. 10(3), 281\u2013317 (1978)","journal-title":"ACM Comput. Surv."},{"issue":"10","key":"2_CR13","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1145\/359015.359020","volume":"23","author":"KM Chandy","year":"1980","unstructured":"Chandy, K.M., Sauer, C.H.: Computational algorithms for product form queueing networks. Commun. ACM 23(10), 573\u2013583 (1980)","journal-title":"Commun. ACM"},{"issue":"2","key":"2_CR14","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1287\/moor.16.2.408","volume":"16","author":"H Chen","year":"1991","unstructured":"Chen, H., Mandelbaum, A.: Discrete flow networks: Bottleneck analysis and fluid approximations. Mathematics of Operations Research 16(2), 408\u2013446 (1991)","journal-title":"Mathematics of Operations Research"},{"issue":"3","key":"2_CR15","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1145\/356733.356735","volume":"10","author":"PJ Denning","year":"1978","unstructured":"Denning, P.J., Buzen, J.P.: The operational analysis of queueing network models. ACM Comput. Surv. 10(3), 225\u2013261 (1978)","journal-title":"ACM Comput. Surv."},{"issue":"2","key":"2_CR16","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1287\/opre.15.2.266","volume":"15","author":"WJ Gordon","year":"1967","unstructured":"Gordon, W.J., Newell, G.F.: Cyclic queueing networks with restricted length queues. Operations Research 15(2), 266\u2013277 (1967)","journal-title":"Operations Research"},{"key":"2_CR17","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. Perform. Eval. 2, 98\u2013107 (1982). Elsevier","journal-title":"Perform. Eval."},{"key":"2_CR18","volume-title":"Computer Performance Modeling Handbook","author":"SS Lavenberg","year":"1983","unstructured":"Lavenberg, S.S.: Computer Performance Modeling Handbook. Academic Press, New York (1983)"},{"issue":"4","key":"2_CR19","doi-asserted-by":"publisher","first-page":"841","DOI":"10.1239\/jap\/1011994176","volume":"38","author":"TI Matis","year":"2001","unstructured":"Matis, T.I., Feldman, R.M.: Transient analysis of state-dependent queueing networks via cumulant functions. J. of Applied Probability 38(4), 841\u2013859 (2001)","journal-title":"J. of Applied Probability"},{"key":"2_CR20","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/S0167-6377(99)00007-3","volume":"24","author":"W Whitt","year":"1999","unstructured":"Whitt, W.: Decomposition approximations for time-dependent Markovian queueing networks. Operations Research Letters 24, 97\u2013103 (1999)","journal-title":"Operations Research Letters"}],"container-title":["Lecture Notes in Computer Science","Analytical and Stochastic Modelling Techniques and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-18579-8_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,27]],"date-time":"2023-01-27T15:26:35Z","timestamp":1674833195000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-18579-8_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319185781","9783319185798"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-18579-8_2","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 May 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}