{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,18]],"date-time":"2023-10-18T08:12:45Z","timestamp":1697616765991},"reference-count":23,"publisher":"Elsevier BV","issue":"10","license":[{"start":{"date-parts":[[2003,6,1]],"date-time":"2003-06-01T00:00:00Z","timestamp":1054425600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computer Communications"],"published-print":{"date-parts":[[2003,6]]},"DOI":"10.1016\/s0140-3664(02)00239-6","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:54:49Z","timestamp":1052783689000},"page":"1105-1128","source":"Crossref","is-referenced-by-count":7,"title":["Distributed multicast tree generation with dynamic group membership"],"prefix":"10.1016","volume":"26","author":[{"given":"Frank","family":"Adelstein","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"suffix":"III","given":"Golden G","family":"Richard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Loren","family":"Schwiebert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0140-3664(02)00239-6_BIB3","doi-asserted-by":"crossref","first-page":"787","DOI":"10.1109\/ICCCN.1998.998844","article-title":"Bessie: portable generation of network descriptions for simulation","author":"Adelstein","year":"1998","journal-title":"Proceedings of the Seventh International Conference on Computer Communications and Networks (IC3N'98)"},{"key":"10.1016\/S0140-3664(02)00239-6_BIB4","doi-asserted-by":"crossref","unstructured":"A. Ballardie, Core Based Trees (CBT version 2) Multicast Routing Protocol Specification, RFC 2189, September 1997.","DOI":"10.17487\/rfc2189"},{"key":"10.1016\/S0140-3664(02)00239-6_BIB5","doi-asserted-by":"crossref","unstructured":"A. Ballardie, Core Based Trees (CBT) Multicast Routing Architecture, RFC 2201, September 1997.","DOI":"10.17487\/rfc2201"},{"key":"10.1016\/S0140-3664(02)00239-6_BIB6","doi-asserted-by":"crossref","unstructured":"A. Ballardie, B. Cain, Z. Zhang, Core Based Trees (CBT version 3) Multicast Routing Protocol Specification, Internet Draft draft-ietf-idmr-cbt-spec-v3-01, August 1998.","DOI":"10.17487\/rfc2201"},{"issue":"3","key":"10.1016\/S0140-3664(02)00239-6_BIB7","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1109\/49.564136","article-title":"ARIES: a rearrangeable inexpensive edge-based on-line Steiner algorithm","volume":"15","author":"Bauer","year":"1997","journal-title":"IEEE Journal on Selected Areas in Communications"},{"issue":"2","key":"10.1016\/S0140-3664(02)00239-6_BIB8","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1109\/90.490746","article-title":"Distributed algorithms for multicast path setup in data networks","volume":"4","author":"Bauer","year":"1996","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"10.1016\/S0140-3664(02)00239-6_BIB9","doi-asserted-by":"crossref","DOI":"10.1109\/ICOIN.2001.905519","article-title":"Distributed routing for dynamic multicasting with advance resource reservation information","volume":"February","author":"Chakraborty","year":"2001","journal-title":"Proceedings of the 15th International Conference on Information Networking (ICOIN'01)"},{"issue":"3","key":"10.1016\/S0140-3664(02)00239-6_BIB10","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1109\/49.564128","article-title":"Multipoint communication: a survey of protocols, functions, and mechanisms","volume":"15","author":"Diot","year":"1997","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"10.1016\/S0140-3664(02)00239-6_BIB11","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1109\/INFCOM.1993.253246","article-title":"How bad is na\u0131\u0308ve multicast routing?","volume":"March","author":"Doar","year":"1993","journal-title":"IEEE INFOCOM"},{"key":"10.1016\/S0140-3664(02)00239-6_BIB12","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"issue":"1","key":"10.1016\/S0140-3664(02)00239-6_BIB13","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1016\/S0140-3664(96)01169-3","article-title":"Delay constrained distributed multicast routing algorithm","volume":"20","author":"Im","year":"1997","journal-title":"Computer Communications"},{"key":"10.1016\/S0140-3664(02)00239-6_BIB14","unstructured":"S.G. Kim, Y.-M. Choi, S.T. Kim, Y.S. Kim, A dynamic multicast tree for loosely coupled conference, International Multimedia Conference, Poster Paper, November 1999, Available online at http:\/\/www.kom.e-technik.tu-darmstadt.de\/acmmm99\/ep\/kimsanggil\/."},{"issue":"2","key":"10.1016\/S0140-3664(02)00239-6_BIB16","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1016\/S0140-3664(98)00236-9","article-title":"A comparison of the internet multicast routing protocols","volume":"22","author":"Lin","year":"1999","journal-title":"Computer Communications"},{"key":"10.1016\/S0140-3664(02)00239-6_BIB17","unstructured":"T. Pusateri, Distance Vector Multicast Routing Protocol, Internet Draft draft-ietf-dvmrp-v3-09, September 1999."},{"issue":"4","key":"10.1016\/S0140-3664(02)00239-6_BIB18","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1109\/90.793020","article-title":"A rearrangeable algorithm for the construction of delay-constrained dynamic multicast trees","volume":"7","author":"Raghavan","year":"1999","journal-title":"IEEE\/ACM Transactions on Networking"},{"issue":"11","key":"10.1016\/S0140-3664(02)00239-6_BIB19","first-page":"1654","article-title":"A dynamic application-oriented multicast routing for virtual-path based ATM networks","volume":"E80-B","author":"Ryu","year":"1997","journal-title":"IEICE Transactions on Communications"},{"key":"10.1016\/S0140-3664(02)00239-6_BIB20","first-page":"387","article-title":"CSIM: a C-based, process-oriented simulation language","author":"Schwetman","year":"1986","journal-title":"Proceedings of the 1986 Winter Simulation Conference"},{"issue":"9","key":"10.1016\/S0140-3664(02)00239-6_BIB21","doi-asserted-by":"crossref","first-page":"816","DOI":"10.1016\/S0140-3664(00)00159-6","article-title":"Improved fault recovery in core based trees","volume":"23","author":"Schwiebert","year":"2000","journal-title":"Computer Communications"},{"key":"10.1016\/S0140-3664(02)00239-6_BIB22","doi-asserted-by":"crossref","first-page":"1352","DOI":"10.1109\/GLOCOM.1995.502623","article-title":"Localized multicast routing","author":"Shaikh","year":"1995","journal-title":"Proceedings of the IEEE GLOBECOMM'95"},{"key":"10.1016\/S0140-3664(02)00239-6_BIB23","unstructured":"M. Tsukada, Y. Takai, Distributed algorithms for dynamic Steiner tree problem. Information Processing Society of Japan SIGNotes Distributed Processing System, No. 095-010, 1999."},{"key":"10.1016\/S0140-3664(02)00239-6_BIB24","doi-asserted-by":"crossref","unstructured":"D. Waitzman, C. Partridge, S. Deering, Distance Vector Multicast Routing Protocol, RFC 1075, November 1988.","DOI":"10.17487\/rfc1075"},{"issue":"9","key":"10.1016\/S0140-3664(02)00239-6_BIB25","doi-asserted-by":"crossref","first-page":"1617","DOI":"10.1109\/49.12889","article-title":"Routing of multipoint connections","volume":"6","author":"Waxman","year":"1988","journal-title":"IEEE Journal on Selected Areas in Communications"},{"issue":"2","key":"10.1016\/S0140-3664(02)00239-6_BIB26","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1002\/net.3230170203","article-title":"Steiner problem in networks: a survey","volume":"17","author":"Winter","year":"1987","journal-title":"Networks"}],"container-title":["Computer Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0140366402002396?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0140366402002396?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,11]],"date-time":"2020-03-11T23:09:18Z","timestamp":1583968158000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0140366402002396"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,6]]},"references-count":23,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2003,6]]}},"alternative-id":["S0140366402002396"],"URL":"https:\/\/doi.org\/10.1016\/s0140-3664(02)00239-6","relation":{},"ISSN":["0140-3664"],"issn-type":[{"value":"0140-3664","type":"print"}],"subject":[],"published":{"date-parts":[[2003,6]]}}}