{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T14:53:58Z","timestamp":1773240838251,"version":"3.50.1"},"reference-count":22,"publisher":"Elsevier BV","issue":"7","license":[{"start":{"date-parts":[[1999,5,1]],"date-time":"1999-05-01T00:00:00Z","timestamp":925516800000},"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":[[1999,5]]},"DOI":"10.1016\/s0140-3664(99)00009-2","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T08:08:03Z","timestamp":1027584483000},"page":"667-674","source":"Crossref","is-referenced-by-count":10,"title":["Analysis of the performance of dynamic multicast routing algorithms"],"prefix":"10.1016","volume":"22","author":[{"given":"J","family":"Cho","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J","family":"Breen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0140-3664(99)00009-2_BIB1","unstructured":"D.W. Wall, Mechanisms for broadcast and selective broadcast, PhD Thesis, Stanford University, 1980."},{"key":"10.1016\/S0140-3664(99)00009-2_BIB2","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF00288961","article-title":"A fast algorithm for Steiner trees","volume":"15","author":"Kou","year":"1981","journal-title":"Acta Informatic"},{"key":"10.1016\/S0140-3664(99)00009-2_BIB3","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/BF01193338","article-title":"Efficient solutions to multicast routing in communication networks","volume":"1","author":"Makki","year":"1996","journal-title":"Mobile Networks Appl."},{"issue":"9","key":"10.1016\/S0140-3664(99)00009-2_BIB4","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 J. Sel. Areas Comm."},{"key":"10.1016\/S0140-3664(99)00009-2_BIB5","doi-asserted-by":"crossref","first-page":"980","DOI":"10.1109\/INFCOM.1993.253268","article-title":"Performance evaluation of multipoint routing algorithms","volume":"3","author":"Waxman","year":"1993","journal-title":"Infocom"},{"key":"10.1016\/S0140-3664(99)00009-2_BIB6","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1109\/TCOM.1983.1095818","article-title":"Routing to multiple destinations in computer networks","volume":"COM-31","author":"Bharathi-Kumar","year":"1983","journal-title":"IEEE Trans. Comm."},{"key":"10.1016\/S0140-3664(99)00009-2_BIB7","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1145\/167954.166246","article-title":"Core based trees (CBT) an architecture for scalable multicast routing","volume":"13\u201317","author":"Ballardie","year":"1993","journal-title":"Proceedings of ACM SIGCOMM"},{"issue":"2","key":"10.1016\/S0140-3664(99)00009-2_BIB8","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1145\/78952.78953","article-title":"Multicast routing in datagram internetworks and extended LANs","volume":"8","author":"Deering","year":"1990","journal-title":"ACM Trans. Comp. Sys."},{"key":"10.1016\/S0140-3664(99)00009-2_BIB9","unstructured":"S. Deering, D. Estrin, D. Farinacci, V. Jacobson, C. liu, L. Wei, Protocol independent multicast-sparse mode (PIM-SM): protocol specification, Working Draft, IETF Working Draft, 9, 1997."},{"key":"10.1016\/S0140-3664(99)00009-2_BIB10","doi-asserted-by":"crossref","unstructured":"J. Moy, Multicast extension to OSPF (Version 2), IETF Request for Comments (RFC), 1583, 1994.","DOI":"10.17487\/rfc1584"},{"issue":"1","key":"10.1016\/S0140-3664(99)00009-2_BIB11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/trsc.18.1.1","article-title":"Network design and transportation planning: models and algorithms","volume":"18","author":"Magnanti","year":"1984","journal-title":"Transportation Sci."},{"key":"10.1016\/S0140-3664(99)00009-2_BIB12","doi-asserted-by":"crossref","first-page":"141","DOI":"10.3233\/JHS-1997-6205","article-title":"Center selection and migration for wide-area multicast routing","volume":"6","author":"Donahoo","year":"1997","journal-title":"J. High Speed Networks"},{"issue":"3","key":"10.1016\/S0140-3664(99)00009-2_BIB13","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1137\/0404033","article-title":"Dynamic Steiner tree problem","volume":"4","author":"Imase","year":"1991","journal-title":"SIAM J. Discrete Mathematics"},{"issue":"6","key":"10.1016\/S0140-3664(99)00009-2_BIB14","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1137\/0206041","article-title":"An analysis of several heuristics for the travelling salesman problem","volume":"3","author":"Rosenkrantz","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0140-3664(99)00009-2_BIB15","doi-asserted-by":"crossref","unstructured":"M. Doar, L. Leslie, How bad is na\u0131\u0308ve multicast routing? INFOCOM, (1993) 82\u201389.","DOI":"10.1109\/INFCOM.1993.253246"},{"issue":"3","key":"10.1016\/S0140-3664(99)00009-2_BIB16","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1109\/90.234851","article-title":"Multicasting for multimedia communication","volume":"1","author":"Kompella","year":"1993","journal-title":"IEEE\/ACM Trans. Networking"},{"key":"10.1016\/S0140-3664(99)00009-2_BIB17","first-page":"353","article-title":"Multicast routing with end to end delay and delay variation constraints","volume":"2","author":"Rouskas","year":"1996","journal-title":"Infocom"},{"issue":"3","key":"10.1016\/S0140-3664(99)00009-2_BIB18","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1137\/0203015","article-title":"Optimum communication spanning trees","volume":"3","author":"Hu","year":"1974","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0140-3664(99)00009-2_BIB19","unstructured":"J. Cho, J. Breen, Analysis of the performance of dynamic multicast routing algorithms, Technical Report, School of Computer Science and Software Engineering, 1988."},{"key":"10.1016\/S0140-3664(99)00009-2_BIB20","unstructured":"J. Cho, J. Breen, Caroline flood routing technique, Technical Report 96-5, Department of Digital Systems, Monash University, 1996."},{"issue":"3","key":"10.1016\/S0140-3664(99)00009-2_BIB21","first-page":"1418","article-title":"A flood routing method for data networks","volume":"3","author":"Cho","year":"1997","journal-title":"Int. Conf. Infor., Commun. Signal Proce."},{"key":"10.1016\/S0140-3664(99)00009-2_BIB22","unstructured":"R. Harris, Routing in large ATM networks, Masters thesis, Department of Digital Systems, Monash University, 1995."}],"container-title":["Computer Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0140366499000092?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0140366499000092?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T04:39:20Z","timestamp":1578458360000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0140366499000092"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,5]]},"references-count":22,"journal-issue":{"issue":"7","published-print":{"date-parts":[[1999,5]]}},"alternative-id":["S0140366499000092"],"URL":"https:\/\/doi.org\/10.1016\/s0140-3664(99)00009-2","relation":{},"ISSN":["0140-3664"],"issn-type":[{"value":"0140-3664","type":"print"}],"subject":[],"published":{"date-parts":[[1999,5]]}}}