{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T23:12:26Z","timestamp":1780441946511,"version":"3.54.1"},"reference-count":40,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"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":[[2004,1]]},"DOI":"10.1016\/s1389-1286(03)00322-0","type":"journal-article","created":{"date-parts":[[2003,7,7]],"date-time":"2003-07-07T13:47:57Z","timestamp":1057585677000},"page":"43-61","source":"Crossref","is-referenced-by-count":11,"title":["An efficient QoS routing algorithm for quorumcast communication"],"prefix":"10.1016","volume":"44","author":[{"given":"Bin","family":"Wang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jennifer C.","family":"Hou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/S1389-1286(03)00322-0_BIB1","doi-asserted-by":"crossref","first-page":"492","DOI":"10.1109\/32.16608","article-title":"Performance characterization of quorum-consensus algorithms for replicated data","volume":"15","author":"Ahamad","year":"1989","journal-title":"IEEE Trans. Software Eng."},{"key":"10.1016\/S1389-1286(03)00322-0_BIB2","doi-asserted-by":"crossref","unstructured":"M.H. Ammar, Probabilistic multicast: Generalizing the multicast paradigm to improve scalability, in: Proceedings of IEEE INFOCOM\u201994, Toronto, Ontario, Canada, June 1994, pp. 848\u2013855","DOI":"10.1109\/INFCOM.1994.337653"},{"key":"10.1016\/S1389-1286(03)00322-0_BIB3","unstructured":"F. Bauer, Multicast routing in point-to-point networks under constraints, Ph.D. dissertation, University of California, Santa Cruz, 1996"},{"issue":"3","key":"10.1016\/S1389-1286(03)00322-0_BIB4","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 J. Selected Areas Commun."},{"key":"10.1016\/S1389-1286(03)00322-0_BIB5","doi-asserted-by":"crossref","unstructured":"S. Bhattacharjee, M.H. Ammar, E.W. Zegura, Z. Fei, Application-layer anycasting, in: Proceedings of IEEE INFOCOM\u201997, Kobe, Japan, vol. 3, April 1997, pp. 1388\u20131396","DOI":"10.1109\/INFCOM.1997.631176"},{"key":"10.1016\/S1389-1286(03)00322-0_BIB6","doi-asserted-by":"crossref","unstructured":"A. Chakrabarti, G. Manimaran, A case for scalable multicast tree migration, in: Proceedings of IEEE Globecom\u201901, San Antonio, TX, vol. 3, November 2001, pp. 2026\u20132030","DOI":"10.1109\/GLOCOM.2001.965928"},{"key":"10.1016\/S1389-1286(03)00322-0_BIB7","doi-asserted-by":"crossref","unstructured":"A. Chakrabarti, A. Striegel, G. Manimaran, A case for tree evolution in QoS multicasting, in: Proceedings of IEEE\/IFIP IWQoS, Miami Beach, FL, May 2002, pp. 116\u2013125","DOI":"10.1109\/IWQoS.2002.1006580"},{"key":"10.1016\/S1389-1286(03)00322-0_BIB8","unstructured":"S.Y. Cheung, A. Kumar, Efficient quorumcast routing algorithm, in: Proceedings of IEEE INFOCOM\u201994, Toronto, Ontario, Canada, June 1994, pp. 840\u2013847"},{"key":"10.1016\/S1389-1286(03)00322-0_BIB9","series-title":"Introduction to Algorithms","author":"Cormen","year":"1997"},{"key":"10.1016\/S1389-1286(03)00322-0_BIB10","doi-asserted-by":"crossref","unstructured":"C. Dovrolis, P. Ramanathan, D. Moore, What do packet dispersion techniques measure? in: Proceedings of IEEE INFOCOM\u201901, Anchorage, AK, vol. 2, April 2001, pp. 905\u2013914","DOI":"10.1109\/INFCOM.2001.916282"},{"key":"10.1016\/S1389-1286(03)00322-0_BIB11","doi-asserted-by":"crossref","unstructured":"Z. Fei, S. Bhattacharjee, E.W. Zegura, M.H. Ammar, A novel server selection technique for improving the response time of a replicated service, in: Proceedings of IEEE INFOCOM\u201998, San Francisco, CA, vol. 2, March\/April 1998, pp. 783\u2013791","DOI":"10.1109\/INFCOM.1998.665101"},{"key":"10.1016\/S1389-1286(03)00322-0_BIB12","doi-asserted-by":"crossref","unstructured":"A. Goel, K.G. Ramakrishnan, D. Kataria, D. Logothetis, Efficient computation of delay-sensitive routes from one source to all destinations, in: Proceedings of IEEE INFOCOM\u201901, Anchorage, AK, vol. 2, April 2001, pp. 854\u2013858","DOI":"10.1109\/INFCOM.2001.916276"},{"key":"10.1016\/S1389-1286(03)00322-0_BIB13","unstructured":"I. Goldberg, Institute for the advanced study of information warfare. http:\/\/www.psycom.net\/iwar.1.html, 2001"},{"key":"10.1016\/S1389-1286(03)00322-0_BIB14","unstructured":"B.K. Haberman, G. Rouskas, Cost, delay, and delay variation conscious multicast routing, Technical Report TR-97-03, North Carolina State University, 1997"},{"key":"10.1016\/S1389-1286(03)00322-0_BIB15","doi-asserted-by":"crossref","unstructured":"S. Hong, H. Lee, B.H. Park, An efficient multicast routing algorithm for delay-sensitive applications with dynamic memberships, in: Proceedings of IEEE INFOCOM\u201998, San Francisco, CA, vol. 3, March\/April 1998, pp. 1433\u20131440","DOI":"10.1109\/INFCOM.1998.662961"},{"issue":"1","key":"10.1016\/S1389-1286(03)00322-0_BIB16","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(03)00322-0_BIB17","unstructured":"Internet2 multicast working group, Multicast WG homepage, http:\/\/multicast.internet2.edu\/index.html"},{"issue":"3","key":"10.1016\/S1389-1286(03)00322-0_BIB18","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 Trans. Network."},{"key":"10.1016\/S1389-1286(03)00322-0_BIB19","doi-asserted-by":"crossref","unstructured":"K. Lai, M. Baker, Measuring bandwidth, in: Proceedings of IEEE INFOCOM\u201999, New York, vol. 1, March 1999, pp. 235\u2013245","DOI":"10.1109\/INFCOM.1999.749288"},{"key":"10.1016\/S1389-1286(03)00322-0_BIB20","doi-asserted-by":"crossref","unstructured":"K. Lai, M. Baker, Measuring link bandwidths using a deterministic model of packet delay, in: Proceedings of the ACM SIGCOMM 2000 Conference, Stockholm, Sweden, August 2000","DOI":"10.1145\/347059.347557"},{"key":"10.1016\/S1389-1286(03)00322-0_BIB21","unstructured":"K. Lai, M. Baker, Nettimer: A tool for measuring bottleneck link bandwidth, in: Proceedings of the 3rd USENIX Symposium on Internet Technologies and Systems, San Francisco, CA, March 2001"},{"key":"10.1016\/S1389-1286(03)00322-0_BIB22","doi-asserted-by":"crossref","unstructured":"G. Malkin, RIP version 2: carrying additional information, RFC 1723, 1994","DOI":"10.17487\/rfc1723"},{"issue":"2","key":"10.1016\/S1389-1286(03)00322-0_BIB23","doi-asserted-by":"crossref","DOI":"10.1109\/JCN.2000.6596737","article-title":"QDMR: An efficient qos dependent multicast routing algorithm","volume":"2","author":"Matta","year":"2000","journal-title":"J. Commun. Networks"},{"key":"10.1016\/S1389-1286(03)00322-0_BIB24","doi-asserted-by":"crossref","unstructured":"A. Myers, P. Dinda, H. Zhang, Performance characteristics of mirror servers on the Internet, in: Proceedings of IEEE INFOCOM\u201999, New York, vol. 1, March 1999, pp. 304\u2013312","DOI":"10.1109\/INFCOM.1999.749296"},{"key":"10.1016\/S1389-1286(03)00322-0_BIB25","doi-asserted-by":"crossref","unstructured":"P. Narvaez, K. Siu, H. Tzeng, New dynamic SPT algorithm based on a ball-and-string model, in: Proceedings of IEEE INFOCOM\u201999, New York, vol. 2, March 1999, pp. 973\u2013981","DOI":"10.1109\/INFCOM.1999.751488"},{"issue":"4","key":"10.1016\/S1389-1286(03)00322-0_BIB26","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1109\/90.720901","article-title":"An iterative algorithm for delay-constrained minimal-cost multicasting","volume":"6","author":"Parsa","year":"1998","journal-title":"IEEE\/ACM Trans. Network."},{"key":"10.1016\/S1389-1286(03)00322-0_BIB27","unstructured":"T. Pusateri, Distance vector multicast routing protocol, draft-ietf-idmr-dvmrp-v3-09.txt, 1999"},{"key":"10.1016\/S1389-1286(03)00322-0_BIB28","doi-asserted-by":"crossref","unstructured":"S. Raman, S. McCanne, A model, analysis, and protocol framework for soft state-based communication, in: Proceedings of ACM SIGCOMM\u201999, Cambridge, MA, September 1999","DOI":"10.1145\/316188.316202"},{"issue":"3","key":"10.1016\/S1389-1286(03)00322-0_BIB29","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1109\/49.564133","article-title":"Multicast routing with end-to-end delay and delay variation constraints","volume":"15","author":"Rouskas","year":"1997","journal-title":"IEEE J. Selected Areas Commun."},{"key":"10.1016\/S1389-1286(03)00322-0_BIB30","doi-asserted-by":"crossref","unstructured":"H.F. Salama, Multicast routing for real-time communication on high speed networks, Ph.D. dissertation, North Carolina State University, Raleigh, 1996","DOI":"10.1007\/978-0-387-34949-7_3"},{"issue":"4","key":"10.1016\/S1389-1286(03)00322-0_BIB31","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":"Sriram","year":"1999","journal-title":"IEEE\/ACM Trans. Network."},{"key":"10.1016\/S1389-1286(03)00322-0_BIB32","first-page":"573","article-title":"An approximate solution for the steiner problem in graphs","volume":"24","author":"Takahashi","year":"1980","journal-title":"Math. Japonica"},{"key":"10.1016\/S1389-1286(03)00322-0_BIB33","unstructured":"H.-Y. Tyan, C.-J. Hou, Javasim: A component-based compositional network simulation environment, in: Western Simulation Multiconference\u2013\u2013Communication Networks and Distributed Systems Modeling and Simulation, January 2001"},{"key":"10.1016\/S1389-1286(03)00322-0_BIB34","unstructured":"H.-Y. Tyan, C.-J. Hou, Design, realization, and evaluation of a component-based, compositional network simulation environment, in: 2002 SCS Western Multiconference on Computer Simulation\u2013\u2013Communication Networks and Distributed Systems Modeling and Simulation Conference, January 2002"},{"issue":"1","key":"10.1016\/S1389-1286(03)00322-0_BIB35","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1109\/65.819168","article-title":"Multicast routing and its QoS extension: Problems, algorithms, and protocols","volume":"14","author":"Wang","year":"2000","journal-title":"IEEE Network"},{"key":"10.1016\/S1389-1286(03)00322-0_BIB36","doi-asserted-by":"crossref","unstructured":"J. Wang, A survey of Web caching schemes for the Internet, ACM SIGCOMM Computer Communication Review, vol. 29(5), 1999","DOI":"10.1145\/505696.505701"},{"key":"10.1016\/S1389-1286(03)00322-0_BIB37","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. Selected Areas Commun."},{"key":"10.1016\/S1389-1286(03)00322-0_BIB38","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"},{"issue":"4","key":"10.1016\/S1389-1286(03)00322-0_BIB39","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1109\/90.865074","article-title":"Application-layer anycasting: a server selection architecture and use in a replicated Web service","volume":"8","author":"Zegura","year":"2000","journal-title":"IEEE\/ACM Trans. Network."},{"key":"10.1016\/S1389-1286(03)00322-0_BIB40","unstructured":"Q. Zhu, M. Parsa, J. Garcia-Luna-Aceves, A source-based algorithm for delay-constrained minimal-cost multicasting, in: Proceedings of IEEE INFOCOM\u201995, Boston, MA, vol. 1, 1995, pp. 377\u2013385"}],"container-title":["Computer Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1389128603003220?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1389128603003220?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,13]],"date-time":"2024-12-13T04:32:46Z","timestamp":1734064366000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1389128603003220"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,1]]},"references-count":40,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2004,1]]}},"alternative-id":["S1389128603003220"],"URL":"https:\/\/doi.org\/10.1016\/s1389-1286(03)00322-0","relation":{},"ISSN":["1389-1286"],"issn-type":[{"value":"1389-1286","type":"print"}],"subject":[],"published":{"date-parts":[[2004,1]]}}}