{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T19:54:24Z","timestamp":1648583664902},"reference-count":19,"publisher":"Elsevier BV","issue":"5-6","license":[{"start":{"date-parts":[[2001,3,1]],"date-time":"2001-03-01T00:00:00Z","timestamp":983404800000},"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":[[2001,3]]},"DOI":"10.1016\/s0140-3664(00)00298-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T21:58:30Z","timestamp":1027634310000},"page":"496-511","source":"Crossref","is-referenced-by-count":2,"title":["An efficient and easily deployable QoS-based routing scheme for online Internet multicasting"],"prefix":"10.1016","volume":"24","author":[{"given":"T.","family":"Alrabiah","sequence":"first","affiliation":[]},{"given":"T.F.","family":"Znati","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0140-3664(00)00298-X_BIB1","doi-asserted-by":"crossref","unstructured":"T. Alrabiah, T. Znati, A simulation framework for the analysis of multicast tree algorithms, in: The 30th Annual Simulation Symposium, vol. 30, 1997, pp. 196\u2013205.","DOI":"10.1109\/SIMSYM.1997.586560"},{"key":"10.1016\/S0140-3664(00)00298-X_BIB2","doi-asserted-by":"crossref","unstructured":"T. Alrabiah, T. Znati, Low-cost, bounded-delay multicast routing for QoS-based networks, in: The Seventh International Conference on Computer Communications and Networks, 1998, pp. 304\u2013311.","DOI":"10.1109\/ICCCN.1998.739931"},{"issue":"4","key":"10.1016\/S0140-3664(00)00298-X_BIB3","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1145\/167954.166246","article-title":"Core-based trees (CBT) an architecture for scalable inter-domain multicast routing","volume":"23","author":"Ballardie","year":"1993","journal-title":"Computer Communication Review"},{"issue":"3","key":"10.1016\/S0140-3664(00)00298-X_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 Journal on Selected Areas in Communications"},{"key":"10.1016\/S0140-3664(00)00298-X_BIB5","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","article-title":"on two problems in connection with graphs","volume":"1","author":"Dijkstra","year":"1959","journal-title":"Numeriskche Mathematik"},{"key":"10.1016\/S0140-3664(00)00298-X_BIB6","doi-asserted-by":"crossref","unstructured":"M. Doar, I. Leshe, How bad is naive multicast routing, in: Proceedings of IEEE INFOCOM, San Francisco, CA, April 1993, pp. 82\u201393.","DOI":"10.1109\/INFCOM.1993.253246"},{"key":"10.1016\/S0140-3664(00)00298-X_BIB7","doi-asserted-by":"crossref","unstructured":"D. Estrin, D. Farinacci, A. Helmy, D. Thaler, S. Deering, M. Handley, V. Jacobson, C. Liu, P. Sharma, L. Wei, Protocol independent multicast-sparse mode (PIM-SM): protocol specification, Internet RFC 2117, http:\/\/ds.internic.net\/rfc\/rfc2117.txt, June 1997.","DOI":"10.17487\/rfc2117"},{"key":"10.1016\/S0140-3664(00)00298-X_BIB8","unstructured":"S.-P. Hong, H. Lee, B.H. Park, An efficient multicast routing algorithm for delay-sensitive applications with dynamic membership, in: INFOCOM'98, 1998, pp. 1433\u20131440."},{"issue":"3","key":"10.1016\/S0140-3664(00)00298-X_BIB9","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 Journal of Discrete Mathematics"},{"issue":"3","key":"10.1016\/S0140-3664(00)00298-X_BIB10","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1145\/193285.193296","article-title":"Minimizing packet copies in multicast routing by exploiting geographic spread","volume":"24","author":"Kadirire","year":"1994","journal-title":"SIGCOMM Communication Review"},{"key":"10.1016\/S0140-3664(00)00298-X_BIB11","doi-asserted-by":"crossref","unstructured":"J. Kadirire, G. Knight, Comparison of dynamic multicast routing algorithms for wide-area packet switched (asynchronous transfer mode) networks, in: IEEE INFOCOM, Boston, vol. 19, 1995, pp. 212\u2013218.","DOI":"10.1109\/INFCOM.1995.515879"},{"issue":"3","key":"10.1016\/S0140-3664(00)00298-X_BIB12","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"},{"issue":"8","key":"10.1016\/S0140-3664(00)00298-X_BIB13","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":"Communications of the ACM"},{"key":"10.1016\/S0140-3664(00)00298-X_BIB14","unstructured":"T. Pusateri, Distance vector multicast routing protocol, Internet Draft, February 1997."},{"key":"10.1016\/S0140-3664(00)00298-X_BIB15","unstructured":"Q. Sun, H. Langendoerfer, Efficient multicast routing for delay sensitive applications, in: Proceedings of the Second Workshop on Protocols Multimedia Systems (PROMS'95), April 1995, pp. 452\u2013458."},{"issue":"9","key":"10.1016\/S0140-3664(00)00298-X_BIB16","doi-asserted-by":"crossref","first-page":"1611","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"},{"key":"10.1016\/S0140-3664(00)00298-X_BIB17","doi-asserted-by":"crossref","unstructured":"B.M. Waxman, Performance evaluation of multipoint routing algorithms, in: IEEE INFOCOM, 1993, pp. 980\u2013986.","DOI":"10.1109\/INFCOM.1993.253268"},{"key":"10.1016\/S0140-3664(00)00298-X_BIB18","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/BF01758765","article-title":"Path-distance heuristics for the steiner problem in undirected networks","volume":"7","author":"Winter","year":"1992","journal-title":"Algorithmica"},{"key":"10.1016\/S0140-3664(00)00298-X_BIB19","unstructured":"Q. Zhu, M. Parsa, J. Garcia-Luna-Aceves, A source-based algorithm for delay-constrained minimum-cost multicasting, in: Proceedings of the IEEE INFOCOM'95, 1995, pp. 377\u2013385."}],"container-title":["Computer Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S014036640000298X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S014036640000298X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,28]],"date-time":"2020-01-28T18:55:29Z","timestamp":1580237729000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S014036640000298X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,3]]},"references-count":19,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[2001,3]]}},"alternative-id":["S014036640000298X"],"URL":"https:\/\/doi.org\/10.1016\/s0140-3664(00)00298-x","relation":{},"ISSN":["0140-3664"],"issn-type":[{"value":"0140-3664","type":"print"}],"subject":[],"published":{"date-parts":[[2001,3]]}}}