{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,28]],"date-time":"2025-02-28T05:10:41Z","timestamp":1740719441425,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540287001"},{"type":"electronic","value":"9783540319252"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11549468_67","type":"book-chapter","created":{"date-parts":[[2010,10,25]],"date-time":"2010-10-25T17:18:34Z","timestamp":1288027114000},"page":"595-605","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Dynamic Distributed Algorithm for Multicast Path Setup"],"prefix":"10.1007","author":[{"given":"Luca","family":"Gatani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giuseppe","family":"Lo Re","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Salvatore","family":"Gaglio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"67_CR1","volume-title":"Minimal Networks: The Steiner Problem and Its Generalizations","author":"A.O. Ivanov","year":"1994","unstructured":"Ivanov, A.O., Tuzhilin, A.A.: Minimal Networks: The Steiner Problem and Its Generalizations. CRC Press, Cleveland (1994)"},{"key":"67_CR2","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R.M. Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, Thatcher (eds.) Complexity of Computer Computations, pp. 85\u2013103. Plenum Prest, New York (1972)"},{"key":"67_CR3","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1002\/net.3230170203","volume":"17","author":"P. Winter","year":"1987","unstructured":"Winter, P.: Steiner problem in networks: A survey. Networks\u00a017, 129\u2013167 (1987)","journal-title":"Networks"},{"key":"67_CR4","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1002\/net.3230220105","volume":"22","author":"F. Hwang","year":"1992","unstructured":"Hwang, F., Richards, D.: Steiner tree problems. Networks\u00a022, 55\u201389 (1992)","journal-title":"Networks"},{"key":"67_CR5","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1109\/90.532865","volume":"4","author":"S. Ramanathan","year":"1996","unstructured":"Ramanathan, S.: Multicast tree generation in networks with asymmetric links. IEEE\/ACM Transactions on Networking\u00a04, 558\u2013568 (1996)","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"67_CR6","unstructured":"Kompella, V., Pasquale, J., Polyzos, G.: Two distributed algorithms for the constrained Steiner tree problem. In: Proc. Comput. Commun. and Netw., San Diego, CA (1993)"},{"key":"67_CR7","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0020-0255(93)90127-8","volume":"74","author":"G. Chen","year":"1993","unstructured":"Chen, G., Houle, M., Kuo, M.: The Steiner problem in distributed computing systems. Information Sciences\u00a074, 73\u201396 (1993)","journal-title":"Information Sciences"},{"key":"67_CR8","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1109\/90.490746","volume":"4","author":"F. Bauer","year":"1996","unstructured":"Bauer, F., Varma, A.: Distributed algorithms for multicast path setup in data networks. IEEE\/ACM Transactions on Networking\u00a04, 181\u2013191 (1996)","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"67_CR9","unstructured":"Singh, G., Vellanki, K.: A distributed protocol for constructing multicast tree. In: Proc. IEEE Int\u2019l Conf. on Principles of Distributed Systems, pp. 41\u201348 (1998)"},{"key":"67_CR10","doi-asserted-by":"publisher","first-page":"1149","DOI":"10.1016\/S0305-0548(00)00029-0","volume":"28","author":"R. Novak","year":"2001","unstructured":"Novak, R., Rugelj, J., Kandus, G.: A note on distributed multicast routing in point-to-point networks. Computers & Operations Research\u00a028, 1149\u20131164 (2001)","journal-title":"Computers & Operations Research"},{"key":"67_CR11","doi-asserted-by":"crossref","unstructured":"Bauer, F., Varma, A.: Distributed algorithms for multicast path setup in data networks. In: Proc. IEEE GLOBECOM, Singapore (1995)","DOI":"10.1109\/90.490746"},{"key":"67_CR12","unstructured":"Kadirire, J., Knight, G.: Comparison of dynamic multicast routing algorithms for wide-area packet switched networks. In: Proc. IEEE INFOCOM, Boston, MA (1995)"},{"key":"67_CR13","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1137\/0404033","volume":"4","author":"M. Imase","year":"1991","unstructured":"Imase, M., Waxman, B.: Steiner tree problems. SIAM J. Discrete Math.\u00a04, 369\u2013384 (1991)","journal-title":"SIAM J. Discrete Math."},{"key":"67_CR14","doi-asserted-by":"crossref","unstructured":"Gatani, L., Lo Re, G.: Urso, A.: Distributed algorithms for multicast tree construction. In: Proc. IEEE ISCCSP 2004, Hammamet, Tunisia (2004)","DOI":"10.1109\/ISCCSP.2004.1296303"},{"key":"67_CR15","first-page":"269","volume":"60","author":"J. Plesnik","year":"1991","unstructured":"Plesnik, J.: Worst-case relative performances of heuristics for the Steiner problem in graphs. Acta Mathematica Universitatis Comenianae\u00a060, 269\u2013284 (1991)","journal-title":"Acta Mathematica Universitatis Comenianae"},{"key":"67_CR16","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1002\/net.3230160305","volume":"16","author":"V.J. Rayward-Smith","year":"1986","unstructured":"Rayward-Smith, V.J., Clare, A.: On finding Steiner vertices. Networks\u00a016, 283\u2013294 (1986)","journal-title":"Networks"},{"key":"67_CR17","unstructured":"Di Fatta, G., Lo Re, G.: Efficient tree construction for the multicast problem. In: Proc. IEEE ITS 1998, Sao Paolo, Brazil (1998)"},{"key":"67_CR18","unstructured":"Fall, K., Varadhan, K.: The ns Manual (2003), http:\/\/www.isi.edu\/nsnam\/ns\/doc\/index.html"},{"key":"67_CR19","unstructured":"Medin, A., Lakhina, A., Matta, I., Byers, J.: BRITE Universal Topology Generation from a User\u2019s Perspective (2001), http:\/\/www.cs.bu.edu\/brite\/usermanual\/BritePaper.html"},{"key":"67_CR20","doi-asserted-by":"crossref","unstructured":"Govindan, R., Tangmunarunkit, H.: Heuristics for Internet map discovery. In: Proc. IEEE INFOCOM 2000, Tel Aviv, Israel, pp. 1371\u20131380 (2000)","DOI":"10.1109\/INFCOM.2000.832534"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2005 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11549468_67","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,27]],"date-time":"2025-02-27T05:20:43Z","timestamp":1740633643000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11549468_67"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540287001","9783540319252"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/11549468_67","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}