{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T08:27:46Z","timestamp":1742632066713,"version":"3.30.1"},"reference-count":44,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"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 Networks"],"published-print":{"date-parts":[[2000,1]]},"DOI":"10.1016\/s1389-1286(99)00123-1","type":"journal-article","created":{"date-parts":[[2003,3,25]],"date-time":"2003-03-25T22:25:53Z","timestamp":1048631153000},"page":"35-60","source":"Crossref","is-referenced-by-count":5,"title":["A flexible multicast routing protocol for group communication"],"prefix":"10.1016","volume":"32","author":[{"given":"Sudhir","family":"Aggarwal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sanjoy","family":"Paul","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Massey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniela","family":"Caldararu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1389-1286(99)00123-1_BIB1","unstructured":"S. Aggarwal, S. Paul, A flexible protocol architecture for multi-party conferencing, in: Proceedings of the ICCCN\u201996, October 1996, pp. 81\u201391"},{"key":"10.1016\/S1389-1286(99)00123-1_BIB2","unstructured":"S. Aggarwal, S. Paul, D. Massey, D. Calderaru, A flexible protocol architecture for multi-party conferencing: from design to implementation, Technical Memorandum, Lucent Technologies, April 1998"},{"key":"10.1016\/S1389-1286(99)00123-1_BIB3","doi-asserted-by":"crossref","unstructured":"S. Aggarwal, A. Raghav, DUALCAST: a scheme for reliable multicasting, in: Proceedings of the ICNP\u201994, October 1994, pp. 15\u201321","DOI":"10.1109\/ICNP.1994.344381"},{"key":"10.1016\/S1389-1286(99)00123-1_BIB4","doi-asserted-by":"crossref","unstructured":"T. Billhartz, J.B. Cain, E. Farrey-Goudreau, D. Fieg, S.G. Batsell, Performance and resource cost comparisons for the CBT and the PIM multicast routing protocols, IEEE Journal on Selected Areas in Communications 15 (3) (1997) 304\u2013315","DOI":"10.1109\/49.564130"},{"key":"10.1016\/S1389-1286(99)00123-1_BIB5","doi-asserted-by":"crossref","unstructured":"A.J. Ballardie, P.F. Francis, J. Crowcroft, Core based trees, in: Proceedings of the ACM SIGCOMM, 1993","DOI":"10.1145\/166237.166246"},{"key":"10.1016\/S1389-1286(99)00123-1_BIB6","doi-asserted-by":"crossref","unstructured":"K. Bharat-Kumar, J.M. Jaffe, Routing to multiple destinations in computer networks, IEEE Transactions on Communications COM-31 (3) (1983) 343\u2013351","DOI":"10.1109\/TCOM.1983.1095818"},{"key":"10.1016\/S1389-1286(99)00123-1_BIB7","unstructured":"T. Ballardie, R. Perlman, C. Lee, J. Crowcroft, Simple scalable internet multicast, Technical Report, University College, London, April 1999"},{"key":"10.1016\/S1389-1286(99)00123-1_BIB8","doi-asserted-by":"crossref","unstructured":"F. Bauer, A. Varma, ARIES: A rearrangable inexpensive edge-based on-line Steiner algorithm, IEEE Journal on Selected Areas in Communications 15 (3) (1997) 382\u2013397","DOI":"10.1109\/49.564136"},{"key":"10.1016\/S1389-1286(99)00123-1_BIB9","unstructured":"D. Caldararu, Heuristic Steiner trees for networks with large numbers of multicast conferences, M.S. Thesis, Department of Computer Science, SUNY, Binghamton, August 1997"},{"issue":"2","key":"10.1016\/S1389-1286(99)00123-1_BIB10","doi-asserted-by":"crossref","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":"Journal of High-Speed Networks"},{"key":"10.1016\/S1389-1286(99)00123-1_BIB11","doi-asserted-by":"crossref","unstructured":"S. Deering, Host Extensions for IP multicasting, RFC 1112, May 1988","DOI":"10.17487\/rfc1054"},{"key":"10.1016\/S1389-1286(99)00123-1_BIB12","doi-asserted-by":"crossref","unstructured":"S. Deering, D. Estrin, D. Farinacci, V. Jacobson, C. Liu, L. Wei, An architecture for wide-area multicast routing, in: Proceedings of the ACM SIGCOMM, August 1994, pp. 126\u2013135","DOI":"10.1145\/190314.190326"},{"key":"10.1016\/S1389-1286(99)00123-1_BIB13","doi-asserted-by":"crossref","unstructured":"S. Deering, D. Cheriton, Multicast routing in datagram internetworks and extended LANs, ACM Transactions on Computer Systems (May 1990) 85\u2013111","DOI":"10.1145\/78952.78953"},{"key":"10.1016\/S1389-1286(99)00123-1_BIB14","doi-asserted-by":"crossref","unstructured":"M. Doar, I. Leslie, How bad is naive multicasting, in: Proceedings of the IEEE INFOCOM, 1993, pp. 82\u201389","DOI":"10.1109\/INFCOM.1993.253246"},{"key":"10.1016\/S1389-1286(99)00123-1_BIB15","doi-asserted-by":"crossref","unstructured":"H. Eriksson, Mbone: the multicast backbone, Communications of the ACM (August 1994) 54\u201360","DOI":"10.1145\/179606.179627"},{"key":"10.1016\/S1389-1286(99)00123-1_BIB16","doi-asserted-by":"crossref","unstructured":"L.G. de R. Guedes, M.D. Yacoub, Overlapping cell area in different fading conditions, in: Proceedings of the 1995 IEEE 45th Vehicular Technology Conference, July 1995, pp. 380\u2013383","DOI":"10.1109\/VETEC.1995.504893"},{"key":"10.1016\/S1389-1286(99)00123-1_BIB17","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1002\/net.3230010203","article-title":"Steiner's problem in graphs and its applications","volume":"1","author":"Hakimi","year":"1971","journal-title":"Networks"},{"key":"10.1016\/S1389-1286(99)00123-1_BIB18","doi-asserted-by":"crossref","unstructured":"H. Holbrook, D. Cheriton, IP multicast channels: EXPRESS support for large-scale single-source applications, in: Proceedings of the ACM SIGCOMM, August 1999, pp. 65\u201378","DOI":"10.1145\/316188.316207"},{"key":"10.1016\/S1389-1286(99)00123-1_BIB19","doi-asserted-by":"crossref","unstructured":"Y. Huang, C. Kintala, Software implemented fault tolerance: technologies and experience, in: Proceedings of the 23rd International Symposium on Fault Tolerant Computing (FTCS-23), June 1993, pp. 2\u20139","DOI":"10.1109\/FTCS.1993.627302"},{"key":"10.1016\/S1389-1286(99)00123-1_BIB20","unstructured":"Y. Huang, C. Kintala, Software fault tolerance in application layer, in: M. Lyu (Ed.), Software Fault Tolerance, Wiley, New York, 1995, Ch. 10"},{"key":"10.1016\/S1389-1286(99)00123-1_BIB21","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1002\/net.3230220105","article-title":"Steiner tree problems","volume":"22","author":"Hwang","year":"1992","journal-title":"Networks"},{"key":"10.1016\/S1389-1286(99)00123-1_BIB22","doi-asserted-by":"crossref","unstructured":"M. Imase, B.M. Waxman, Dynamic Steiner tree problem, SIAM Journal of Discrete Math 4 (3) (1991) 369\u2013384","DOI":"10.1137\/0404033"},{"key":"10.1016\/S1389-1286(99)00123-1_BIB23","unstructured":"V. Jacobson. Multimedia conferencing on the internet, Tutorial 4, ACM SIG-COMM 94, August 1994"},{"key":"10.1016\/S1389-1286(99)00123-1_BIB24","doi-asserted-by":"crossref","unstructured":"R.M. Karp, Reducibility among combinatorial problems, in: R.E. Miller, J.W. Thatcher (Eds.), Complexity of Computer Computations, Plenum, New York, 1972","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"10.1016\/S1389-1286(99)00123-1_BIB25","doi-asserted-by":"crossref","unstructured":"J. Kadirire, G. Knight, Comparison of dynamic multicast routing algorithms for wide-area packet-switched (ATM) networks. in: Proceedings of the IEEE INFOCOM, 1995, pp. 212\u2013219","DOI":"10.1109\/INFCOM.1995.515879"},{"key":"10.1016\/S1389-1286(99)00123-1_BIB26","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 Informatica"},{"key":"10.1016\/S1389-1286(99)00123-1_BIB27","doi-asserted-by":"crossref","unstructured":"V.P. Kompella, J.C. Pasquale, G.C. Polyzos, Multicasting for multimedia applications. in: Proceedings of the IEEE INFOCOM, 1992, pp. 2078\u20132085","DOI":"10.1109\/INFCOM.1992.263480"},{"issue":"3","key":"10.1016\/S1389-1286(99)00123-1_BIB28","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1109\/90.234851","article-title":"Multicast routing for multimedia communication","volume":"1","author":"Kompella","year":"1993","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"10.1016\/S1389-1286(99)00123-1_BIB29","doi-asserted-by":"crossref","unstructured":"S. Kumar, P. Radoslavov, D. Thaler, C. Alaettinoglu, D. Estrin, M. Handley. The MASC\/BGMP architecture for inter-domain multicast routing, in: Proceedings of the ACM SIGCOMM, August 1998, pp. 93\u2013104","DOI":"10.1145\/285237.285264"},{"key":"10.1016\/S1389-1286(99)00123-1_BIB30","doi-asserted-by":"crossref","unstructured":"J.J. Garcia-Luna-Aceves, J. Behrens, Distributed, scalable routing based on vectors of link states, IEEE Journal on Selected Areas in Communications 13 (8) (1995) 1383\u20131395","DOI":"10.1109\/49.464710"},{"key":"10.1016\/S1389-1286(99)00123-1_BIB31","first-page":"149","article-title":"An even faster approximation algorithm for the Steiner tree problem in graphs","volume":"59","author":"Lou","year":"1987","journal-title":"Congressus Numerantium"},{"issue":"8","key":"10.1016\/S1389-1286(99)00123-1_BIB32","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1145\/179606.179654","article-title":"Multicast routing extensions for OSPF","volume":"37","author":"Moy","year":"1994","journal-title":"Comm. ACM"},{"key":"10.1016\/S1389-1286(99)00123-1_BIB33","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/BF01193338","article-title":"Efficient solutions to multicast routing in communications networks","volume":"1","author":"Makki","year":"1996","journal-title":"Mobile Networks and Applications"},{"key":"10.1016\/S1389-1286(99)00123-1_BIB34","doi-asserted-by":"crossref","unstructured":"C. Perkins, IP Mobility Support', RFC-2002","DOI":"10.17487\/rfc3344"},{"key":"10.1016\/S1389-1286(99)00123-1_BIB35","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1080\/0020739830140103","article-title":"The computation of nearly minimal Steiner trees in graphs","volume":"14","author":"Rayward-Smith","year":"1983","journal-title":"International Journal of Mathematics and Educational Science and Technology"},{"key":"10.1016\/S1389-1286(99)00123-1_BIB36","unstructured":"RTP: A Transport Protocol for Real-Time Applications,\u201d Internet Draft, March 1995, \u3008draft-ietf-avc-svc-rtp-07.txt\u3009, October, 1995"},{"key":"10.1016\/S1389-1286(99)00123-1_BIB37","unstructured":"H.F. Salama, D.S. Reeves, I. Viniotis, Comparison of multicast routing algorithms for high-speed networks, IBM Technical Report, September 1994"},{"key":"10.1016\/S1389-1286(99)00123-1_BIB38","first-page":"573","article-title":"An approximate solution for the Steiner problem in graphs","volume":"6","author":"Takahashi","year":"1980","journal-title":"Mathematics Japonica"},{"key":"10.1016\/S1389-1286(99)00123-1_BIB39","unstructured":"D.W. Wall, Mechanisms for broadcast and selective broadcast, Ph.D. Thesis, Stanford University, June 1980"},{"key":"10.1016\/S1389-1286(99)00123-1_BIB40","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"},{"key":"10.1016\/S1389-1286(99)00123-1_BIB41","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1002\/net.3230130206","article-title":"Construction of centered shortest path trees","volume":"13","author":"Wall","year":"1983","journal-title":"Networks"},{"key":"10.1016\/S1389-1286(99)00123-1_BIB42","doi-asserted-by":"crossref","unstructured":"D. Waitzman, C. Partridge, S. Deering, Distance Vector Multicast Routing Protocol, RFC 1075, 1988","DOI":"10.17487\/rfc1075"},{"key":"10.1016\/S1389-1286(99)00123-1_BIB43","doi-asserted-by":"crossref","unstructured":"B.M. Waxman, Routing of multipoint connections, IEEE Journal on Selected Areas in Communication, 6\u20139 December 1988, 1617\u20131622","DOI":"10.1109\/49.12889"},{"key":"10.1016\/S1389-1286(99)00123-1_BIB44","unstructured":"L. Wei, D. Estrin, A comparison of multicast trees and algorithms, CS Department Technical Report, University of Southern California, September 1993"}],"container-title":["Computer Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1389128699001231?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1389128699001231?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,4]],"date-time":"2024-12-04T11:25:47Z","timestamp":1733311547000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1389128699001231"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,1]]},"references-count":44,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2000,1]]}},"alternative-id":["S1389128699001231"],"URL":"https:\/\/doi.org\/10.1016\/s1389-1286(99)00123-1","relation":{},"ISSN":["1389-1286"],"issn-type":[{"type":"print","value":"1389-1286"}],"subject":[],"published":{"date-parts":[[2000,1]]}}}