{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T20:08:42Z","timestamp":1779134922700,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":67,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540671930","type":"print"},{"value":"9783540465065","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-46506-5_16","type":"book-chapter","created":{"date-parts":[[2007,8,28]],"date-time":"2007-08-28T11:09:00Z","timestamp":1188299340000},"page":"377-401","source":"Crossref","is-referenced-by-count":18,"title":["Product Form Queueing Networks"],"prefix":"10.1007","author":[{"given":"Simonetta","family":"Balsamo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,11,9]]},"reference":[{"issue":"1","key":"16_CR1","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1109\/TC.1987.5009458","volume":"C-36","author":"I. F. Akyildiz","year":"1987","unstructured":"I. F. Akyildiz. Exact product form solution for queueing networks with blocking. IEEE Trans. on Computer, C-36(1):122\u2013125, 1987.","journal-title":"IEEE Trans. on Computer"},{"key":"16_CR2","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1023\/A:1018947410914","volume":"79","author":"S. Balsamo","year":"1998","unstructured":"S. Balsamo and M. C. Cl\u00f2. A convolution algorithm for product-form queueing networks with blocking. Annals of Operations Research, 79:97\u2013117, 1998.","journal-title":"Annals of Operations Research"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"S. Balsamo and G. Iazeolla. An extension of Norton theorem for queueing networks. IEEE Trans. on Software Engineering, SE-8, 1982.","DOI":"10.1109\/TSE.1982.235424"},{"issue":"2","key":"16_CR4","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1109\/TSE.1985.232194","volume":"SE-11","author":"S. Balsamo","year":"1985","unstructured":"S. Balsamo and G. Iazeolla. Product-form synthesis of queueing networks. IEEE Trans. on Software Engineering, SE-11(2):194\u2013199, 1985.","journal-title":"IEEE Trans. on Software Engineering"},{"key":"16_CR5","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/BF02023094","volume":"48","author":"S. Balsamo","year":"1994","unstructured":"S. Balsamo and V. De Nitto. A survey of product-form queueing networks with blocking and their equivalences. Annals of Operations Research, 48:31\u201361, 1994.","journal-title":"Annals of Operations Research"},{"issue":"2","key":"16_CR6","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1145\/321879.321887","volume":"22","author":"F. Baskett","year":"1975","unstructured":"F. Baskett, K. M. Chandy, R. R. Muntz, and G. Palacios. Open, closed, and mixed networks of queues with different classes of customers. Journal of the ACM, 22(2):248\u2013260, 1975.","journal-title":"Journal of the ACM"},{"key":"16_CR7","first-page":"6","volume-title":"The hierarchical evaluation tool HIT","author":"H. Beilner","year":"1995","unstructured":"H. Beilner, J. M\u00e4ter, and C. Wysocki. The hierarchical evaluation tool HIT. Report 581\/1995, University of Dortmund, Dortmund, Germany, 6\u20139, 1995."},{"key":"16_CR8","doi-asserted-by":"publisher","first-page":"152","DOI":"10.2307\/1427516","volume":"23","author":"R. Boucherie","year":"1991","unstructured":"R. Boucherie and N. M. van Dijk. Product-form queueing networks with state dependent multiple job transitions. Adv. in Applied Prob., 23:152\u2013187, 1991.","journal-title":"Adv. in Applied Prob."},{"key":"16_CR9","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/S0166-5316(96)00045-4","volume":"29","author":"R. Boucherie","year":"1997","unstructured":"R. Boucherie and N.M. van Dijk. On the arrival theorem for product-form queueing networks with blocking. Performance Evaluation, 29:155\u2013176, 1997.","journal-title":"Performance Evaluation"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"J. Y. Le Boudec. A BCMP extension to multiserver stations with concurrent classes of customers. Proc. Performance\u2019 86 and 1986 ACM Sigmetrics Conf., pages 79\u201381, 1986.","DOI":"10.1145\/317499.317541"},{"key":"16_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0166-5316(88)90009-0","volume":"8","author":"J. Y. Boudec Le","year":"1988","unstructured":"J. Y. Le Boudec. The multibus algorithm. Performance Evaluation, 8:1\u201318, 1988.","journal-title":"Performance Evaluation"},{"key":"16_CR12","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1287\/opre.4.6.699","volume":"4","author":"P. J. Burke","year":"1956","unstructured":"P. J. Burke. The output of a queueing system. Oper. Res., 4:699\u2013704, 1956.","journal-title":"Oper. Res."},{"issue":"9","key":"16_CR13","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1145\/362342.362345","volume":"16","author":"J. P. Buzen","year":"1973","unstructured":"J. P. Buzen. Computational algorithms for closed queueing networks with exponential servers. Comm. of the ACM, 16(9):527\u2013531, 1973.","journal-title":"Comm. of the ACM"},{"issue":"1","key":"16_CR14","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1147\/rd.191.0036","volume":"1","author":"K. M. Chandy","year":"1975","unstructured":"K. M. Chandy, U. Herzog, and L. Woo. 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":"2","key":"16_CR15","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1145\/322003.322009","volume":"24","author":"K. M. Chandy","year":"1977","unstructured":"K. M. Chandy, J. H. Howard, and D. Towsley. Product form and local balance in queueing networks. Journal of the ACM, 24(2):250\u2013263, 1977.","journal-title":"Journal of the ACM"},{"issue":"2","key":"16_CR16","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1145\/322374.322378","volume":"30","author":"K. M. Chandy","year":"1983","unstructured":"K. M. Chandy and A. J. Martin. A characterization of product-form queueing networks. Journal of the ACM, 30(2):286\u2013299, 1983.","journal-title":"Journal of the ACM"},{"key":"16_CR17","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1145\/358396.358403","volume":"25","author":"K. M. Chandy","year":"1982","unstructured":"K. M. Chandy and D. Neuse. Linearizer: a heuristic algorithm for queueing network models of computer systems. Comm. of the ACM, 25:126\u2013134, 1982.","journal-title":"Comm. of the ACM"},{"issue":"10","key":"16_CR18","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1145\/359015.359020","volume":"23","author":"K. M. Chandy","year":"1980","unstructured":"K. M. Chandy and C. H. Sauer. Computational algorithms for product form queueing networks. Comm. of the ACM, 23(10):573\u2013583, 1980.","journal-title":"Comm. of the ACM"},{"issue":"10","key":"16_CR19","first-page":"573","volume":"C-38","author":"A. E. Conway","year":"1989","unstructured":"A. E. Conway, E. de Souza e Silva, and S. S. Lavenberg. Mean value analysis by chain of product-form queueing networks. IEEE Trans. on Computers, C-38(10):573\u2013583, 1989.","journal-title":"IEEE Trans. on Computers"},{"key":"16_CR20","doi-asserted-by":"publisher","first-page":"768","DOI":"10.1145\/6490.6495","volume":"33","author":"A. E. Conway","year":"1986","unstructured":"A. E. Conway and N. D. Georganas. RECAL-a new efficient algorithm for the exact analysis of multiple-chain closed queueing networks. Journal of the ACM, 33:768\u2013791, 1986.","journal-title":"Journal of the ACM"},{"key":"16_CR21","volume-title":"Queueing Networks-Exact Computational Algorithms","author":"A. E. Conway","year":"1989","unstructured":"A. E. Conway and N. D. Georganas. Queueing Networks-Exact Computational Algorithms. MIT Press, Cambridge, Massachusetts, 1989."},{"key":"16_CR22","volume-title":"Decomposability","author":"P. J. Courtois","year":"1977","unstructured":"P. J. Courtois. Decomposability. Academic Press, New York, 1977."},{"key":"16_CR23","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1145\/58562.58563","volume":"36","author":"E. Souza e Silva de","year":"1989","unstructured":"E. de Souza e Silva and S. S. Lavenberg. Calculating the joint queue length distribution in product-form queueing networks. Journal of the ACM, 36:194\u2013207, 1989.","journal-title":"Journal of the ACM"},{"key":"16_CR24","first-page":"319","volume-title":"Stochastic Analysis of Computer and Communication Systems","author":"E. Souza e Silva de","year":"1990","unstructured":"E. de Souza e Silva and R. R. Muntz. Queueing networks: Solutions and applications. In H. Takagy, editor, Stochastic Analysis of Computer and Communication Systems, pages 319\u2013399. Elsevier, North Holland, 1990."},{"key":"16_CR25","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1145\/4904.4992","volume":"33","author":"D.L. Eager","year":"1986","unstructured":"D.L. Eager and K. C. Sevick. Bound hierarchies for multiple-class queueing networks. Journal of the ACM, 33:179\u2013206, 1986.","journal-title":"Journal of the ACM"},{"issue":"3","key":"16_CR26","doi-asserted-by":"publisher","first-page":"656","DOI":"10.2307\/3214499","volume":"28","author":"E. Gelenbe","year":"1991","unstructured":"E. Gelenbe. Product form networks with negative and positive customers. Journal of Applied Prob., 28(3):656\u2013663, 1991.","journal-title":"Journal of Applied Prob"},{"key":"16_CR27","volume-title":"Analysis and Synthesis of Computer Systems","author":"E. Gelenbe","year":"1980","unstructured":"E. Gelenbe and I. Mitrani. Analysis and Synthesis of Computer Systems. Academic Press, New York, 1980."},{"issue":"2","key":"16_CR28","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1287\/opre.15.2.254","volume":"15","author":"W. J. Gordon","year":"1967","unstructured":"W. J. Gordon and G. F. Newell. Cyclic queueing networks with exponential servers. Operations Research, 15(2):254\u2013265, 1967.","journal-title":"Operations Research"},{"key":"16_CR29","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/BF02411466","volume":"6","author":"W. Henderson","year":"1990","unstructured":"W. Henderson and P. Taylor. Product form in networks of queues with batch arrivals and batch services. Queueing Systems, 6:71\u201388, 1990.","journal-title":"Queueing Systems"},{"key":"16_CR30","doi-asserted-by":"publisher","first-page":"409","DOI":"10.2307\/3214876","volume":"28","author":"W. Henderson","year":"1990","unstructured":"W. Henderson and P. Taylor. Some new results on queueing networks with batch movements. J. of Applied Prob., 28:409\u2013421, 1990.","journal-title":"J. of Applied Prob."},{"key":"16_CR31","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1145\/214419.214423","volume":"4","author":"K. P. Hoyme","year":"1986","unstructured":"K. P. Hoyme, S. C. Bruell, P. V. Afshari, and R. Y. Jain. A tree structured mean value analysis algorithm. ACM Trans. on Computer Systems, 4:178\u2013185, 1986.","journal-title":"ACM Trans. on Computer Systems"},{"key":"16_CR32","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0166-5316(87)90054-X","volume":"7","author":"C. T. Hsieh","year":"1987","unstructured":"C. T. Hsieh and S. S. Lam. Two classes of performance bounds for closed queueing networks. Performance Evaluation, 7:3\u201330, 1987.","journal-title":"Performance Evaluation"},{"key":"16_CR33","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0166-5316(89)90037-0","volume":"9","author":"C. T. Hsieh","year":"1989","unstructured":"C. T. Hsieh and S. S. Lam. PAM-a noniterative approximate solution method for closed multichain queueing networks. Performance Evaluation, 9:119\u2013133, 1989.","journal-title":"Performance Evaluation"},{"key":"16_CR34","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1287\/mnsc.10.1.131","volume":"10","author":"J. R. Jackson","year":"1963","unstructured":"J. R. Jackson. Jobshop-like queueing systems. Management Science, 10:131\u2013142, 1963.","journal-title":"Management Science"},{"key":"16_CR35","unstructured":"K. Kant. Introduction to Computer System Performance Evaluation. MacGraw-Hill, 1992."},{"key":"16_CR36","volume-title":"Reversibility and Stochastic Networks","author":"F. P. Kelly","year":"1979","unstructured":"F. P. Kelly. Reversibility and Stochastic Networks. Wiley, New York, 1979."},{"key":"16_CR37","volume-title":"Computer and Communication System Performance Modelling","author":"P. J. B. King","year":"1990","unstructured":"P. J. B. King. Computer and Communication System Performance Modelling. Prentice-Hall, Englewood Cliffs, 1990."},{"key":"16_CR38","volume-title":"Queueing Systems","author":"L. Kleinrock","year":"1975","unstructured":"L. Kleinrock. Queueing Systems, volume 1: Theory. John Wiley, New York, 1975."},{"key":"16_CR39","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1016\/0166-5316(82)90002-5","volume":"2","author":"P. Kritzinger","year":"1982","unstructured":"P. Kritzinger, S. van Wyk, and A. Krezesinski. A generalization of Norton\u2019s theorem for multiclass queueing networks. Performance Evaluation, 2:98\u2013107, 1982.","journal-title":"Performance Evaluation"},{"issue":"4","key":"16_CR40","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1147\/rd.214.0370","volume":"21","author":"S. S. Lam","year":"1977","unstructured":"S. S. Lam. Queueing networks with capacity constraints. IBM Journal of Res. and Dev., 21(4):370\u2013378, 1977.","journal-title":"IBM Journal of Res. and Dev."},{"issue":"2","key":"16_CR41","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1145\/322307.322321","volume":"29","author":"S. S. Lam","year":"1982","unstructured":"S. S. Lam. Dynamic scaling and grow behavior of queueing networks normalization constant. Journal of the ACM, 29(2):492\u2013513, 1982.","journal-title":"Journal of the ACM"},{"issue":"3","key":"16_CR42","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1145\/358061.358075","volume":"26","author":"S. S. Lam","year":"1983","unstructured":"S. S. Lam and Y. L. Lien. A tree convolution algorithm for the solution of queueing networks. Comm. of the ACM, 26(3):203\u2013215, 1983.","journal-title":"Comm. of the ACM"},{"key":"16_CR43","volume-title":"Computer Performance Modeling Handbook","author":"S. S. Lavenberg","year":"1983","unstructured":"S. S. Lavenberg. Computer Performance Modeling Handbook. Academic Press, New York, 1983."},{"key":"16_CR44","doi-asserted-by":"publisher","first-page":"1048","DOI":"10.2307\/3213214","volume":"17","author":"S. S. Lavenberg","year":"1980","unstructured":"S. S. Lavenberg and M. Reiser. Stationary state probabilities at arrival instants for closed queueing networks with multiple types of customers. Journal of Applied Prob., 17:1048\u20131061, 1980.","journal-title":"Journal of Applied Prob"},{"key":"16_CR45","volume-title":"Quantitative System Performance: Computer System Analysis Using Queueing Network Models","author":"E. D. Lazowska","year":"1984","unstructured":"E. D. Lazowska, J. L. Zahorjan, G. S. Graham, and K. C. Sevcick. Quantitative System Performance: Computer System Analysis Using Queueing Network Models. Prentice Hall, Englewood Cliffs, 1984."},{"issue":"5","key":"16_CR46","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1109\/TSE.1979.234214","volume":"5","author":"R. Marie","year":"1979","unstructured":"R. Marie. An approximate analytical method for general queueing networks. IEEE Trans. on Software Eng., 5(5):530\u2013538, 1979.","journal-title":"IEEE Trans. on Software Eng."},{"key":"16_CR47","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1145\/62.322432","volume":"31","author":"J. McKenna","year":"1984","unstructured":"J. McKenna and I. Mitrani. Asymptotic expansions and integral representations of moments of queue lengths in closed Markovian networks. Journal of the ACM, 31:346\u2013360, 1984.","journal-title":"Journal of the ACM"},{"key":"16_CR48","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1145\/5925.5935","volume":"33","author":"D. Mitra","year":"1986","unstructured":"D. Mitra and J. McKenna. Asymptotic expansions for closed Markovian networks with state dependent service rates. Journal of the ACM, 33:568\u2013592, 1986.","journal-title":"Journal of the ACM"},{"issue":"3","key":"16_CR49","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1145\/158439.158906","volume":"25","author":"R. Nelson","year":"1993","unstructured":"R. Nelson. The mathematics of product-form queueing networks. ACM Computing Survey, 25(3):339\u2013369, 1993.","journal-title":"ACM Computing Survey"},{"key":"16_CR50","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1145\/79147.214074","volume":"37","author":"K. R. Pattipati","year":"1990","unstructured":"K. R. Pattipati, M. M. Kostreva, and J. L. Teele. Approximate mean value analysis algorithms for queueing networks: Existence, uniqueness and convergence results. Journal of the ACM, 37:643\u2013673, 1990.","journal-title":"Journal of the ACM"},{"key":"16_CR51","unstructured":"D. Potier. The modelling package QNAP2 and applications to computer networks simulation. In Computer Networks and Simulation. North Holland, 1986."},{"issue":"1","key":"16_CR52","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/0166-5316(81)90040-7","volume":"1","author":"M. Reiser","year":"1981","unstructured":"M. Reiser. Mean value analysis and convolution method for queue-dependent servers in closed queueing networks. Performance Evaluation, 1(1):7\u201318, 1981.","journal-title":"Performance Evaluation"},{"issue":"2","key":"16_CR53","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1145\/322186.322195","volume":"27","author":"M. Reiser","year":"1980","unstructured":"M. Reiser and S. S. Lavenberg. Mean value analysis of closed multichain queueing networks. Journal of the ACM, 27(2):313\u2013320, 1980.","journal-title":"Journal of the ACM"},{"issue":"1","key":"16_CR54","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1145\/357353.357359","volume":"1","author":"C. H. Sauer","year":"1983","unstructured":"C. H. Sauer. Computational algorithms for state-dependent queueing networks. ACM Trans. on Computer Systems, 1(1):67\u201392, 1983.","journal-title":"ACM Trans. on Computer Systems"},{"key":"16_CR55","doi-asserted-by":"publisher","first-page":"85","DOI":"10.2307\/1426720","volume":"10","author":"R. Schassberger","year":"1978","unstructured":"R. Schassberger. The insensitivity of stationary probabilities in networks of queues. Journal of Applied Prob., 10:85\u201393, 1978.","journal-title":"Journal of Applied Prob"},{"key":"16_CR56","unstructured":"P. J. Schweitzer. Approximate analysis of multiclass closed networks of queues. In Proc. of Int. Conference on Stochastic Control and Optimization, pages 25\u201329, Amsterdam, The Netherlands, 1979."},{"issue":"2","key":"16_CR57","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1145\/322248.322257","volume":"28","author":"K. S. Sevcik","year":"1981","unstructured":"K. S. Sevcik and I. Mitrani. The distribution of queueing network states at input and output instants. Journal of the ACM, 28(2):358\u2013371, 1981.","journal-title":"Journal of the ACM"},{"key":"16_CR58","volume-title":"Performance Engineering of Software Systems","author":"C. Smith","year":"1990","unstructured":"C. Smith. Performance Engineering of Software Systems. Addison-Wesley, Reading, MA, US, 1990."},{"issue":"3","key":"16_CR59","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1145\/2402.2995","volume":"30","author":"R. Suri","year":"1983","unstructured":"R. Suri. Robustness of queueing network formulas. Journal of the ACM, 30(3):564\u2013594, 1983.","journal-title":"Journal of the ACM"},{"issue":"2","key":"16_CR60","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1145\/322186.322196","volume":"27","author":"D. Towsley","year":"1980","unstructured":"D. Towsley. Queueing network with state dependent routing. Journal of the ACM, 27(2):323\u2013337, 1980.","journal-title":"Journal of the ACM"},{"key":"16_CR61","volume-title":"Probability and Statistics with Reliability, Queueing and Computer Science Applications","author":"K. S. Trivedi","year":"1982","unstructured":"K. S. Trivedi. Probability and Statistics with Reliability, Queueing and Computer Science Applications. Prentice Hall, Englewood Cliffs, 1982."},{"key":"16_CR62","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/0166-5316(85)90012-4","volume":"5","author":"S. Tucci","year":"1985","unstructured":"S. Tucci and C. H. Sauer. The tree MVA algorithm. Performance Evaluation, 5:187\u2013196, 1985.","journal-title":"Performance Evaluation"},{"key":"16_CR63","unstructured":"N. van Dijk. Queueing networks and product forms. John Wiley, 1993."},{"issue":"2","key":"16_CR64","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1287\/opre.15.2.266","volume":"15","author":"G. F. Newell","year":"1967","unstructured":"G. F. Newell W. J. Gordon. Cyclic queueing networks with restricted length queues. Operations Research, 15(2):266\u2013277, 1967.","journal-title":"Operations Research"},{"key":"16_CR65","unstructured":"J. Walrand. An Introduction to Queueing Networks. Prentice-Hall, 1988."},{"key":"16_CR66","doi-asserted-by":"publisher","first-page":"168","DOI":"10.2307\/3213756","volume":"22","author":"P. Whittle","year":"1985","unstructured":"P. Whittle. Partial balance and insensitivity. J. of Applied Prob., 22:168\u2013175, 1985.","journal-title":"J. of Applied Prob."},{"key":"16_CR67","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1145\/358396.358447","volume":"25","author":"J. L. Zahorjan","year":"1981","unstructured":"J. L. Zahorjan, K. C. Sevcik, D. L. Eager, and B. Galler. Balanced job bound analysis of queueing networks. Comm. of the ACM, 25:134\u2013141, 1981.","journal-title":"Comm. of the ACM"}],"container-title":["Lecture Notes in Computer Science","Performance Evaluation: Origins and Directions"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46506-5_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T13:12:17Z","timestamp":1556802737000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46506-5_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540671930","9783540465065"],"references-count":67,"URL":"https:\/\/doi.org\/10.1007\/3-540-46506-5_16","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2000]]}}}