{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T06:29:19Z","timestamp":1760596159029},"reference-count":15,"publisher":"Elsevier BV","issue":"7","license":[{"start":{"date-parts":[[2004,6,1]],"date-time":"2004-06-01T00:00:00Z","timestamp":1086048000000},"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":["Computers & Operations Research"],"published-print":{"date-parts":[[2004,6]]},"DOI":"10.1016\/s0305-0548(03)00068-6","type":"journal-article","created":{"date-parts":[[2003,6,2]],"date-time":"2003-06-02T23:15:45Z","timestamp":1054595745000},"page":"1115-1133","source":"Crossref","is-referenced-by-count":11,"title":["Multiple multicast tree allocation in IP network"],"prefix":"10.1016","volume":"31","author":[{"given":"Chae Y.","family":"Lee","sequence":"first","affiliation":[]},{"given":"Hee K.","family":"Cho","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/S0305-0548(03)00068-6_BIB1","doi-asserted-by":"crossref","first-page":"149","DOI":"10.4218\/etrij.98.0198.0203","article-title":"Specification of communication services for multimedia cooperative applications based on the reference model of ODP","volume":"20","author":"Yi","year":"1998","journal-title":"ETRI Journal"},{"key":"10.1016\/S0305-0548(03)00068-6_BIB2","doi-asserted-by":"crossref","unstructured":"Waitzman D, Deering S, Partridge C. Distance Vector Multicast Routing Protocol. RFC 1075, 1988.","DOI":"10.17487\/rfc1075"},{"key":"10.1016\/S0305-0548(03)00068-6_BIB3","doi-asserted-by":"crossref","unstructured":"Deering S, Waitsman D, Partridge C, Estrin D, Farinacci D, Jacobson V, Helmy A, Meyer D, Wei L. Protocol Independent Multicast Version 2 Dense Mode Specification. draft-ietf-pim-v2-dm-01.txt, 1998.","DOI":"10.17487\/rfc2362"},{"issue":"8","key":"10.1016\/S0305-0548(03)00068-6_BIB4","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1145\/179606.179654","article-title":"Multicast routing extensions for OSPF","volume":"37","author":"May","year":"1994","journal-title":"Commun ACM"},{"key":"10.1016\/S0305-0548(03)00068-6_BIB5","doi-asserted-by":"crossref","unstructured":"Ballardie T, Francis P, Crowcroft J. Core based trees (CBT)\u2014an architecture for scalable inter-domain multicast routing. Proceedings of ACM SIGCOMM \u201993, 1993. San Francisco, USA, p. 85\u201395.","DOI":"10.1145\/166237.166246"},{"key":"10.1016\/S0305-0548(03)00068-6_BIB6","doi-asserted-by":"crossref","unstructured":"Estrin D, Deering S, Farinacc D, Jacobson V, Liu C, Wei L, Helmy A, Thaler D, Handley M. Protocol Independent Multicast\u2014Sparse Mode (PIM SM): Protocol Specification. RFC 2362, 1998.","DOI":"10.17487\/rfc2362"},{"issue":"3","key":"10.1016\/S0305-0548(03)00068-6_BIB7","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1109\/4236.845393","article-title":"Small group multicast: a new solution for multicasting in the internet","volume":"4","author":"Boivie","year":"2000","journal-title":"IEEE Internet Computing"},{"key":"10.1016\/S0305-0548(03)00068-6_BIB8","unstructured":"Meyer D, Fenner B. Multicast Source Discovery Protocol (MSDP). draft-ietf-msdp-spec-10.txt, 2001."},{"issue":"4","key":"10.1016\/S0305-0548(03)00068-6_BIB9","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1109\/4234.917107","article-title":"Multicast delivery based on unicast and subnet multicast","volume":"5","author":"Park","year":"2001","journal-title":"IEEE Communications Letter"},{"key":"10.1016\/S0305-0548(03)00068-6_BIB10","doi-asserted-by":"crossref","unstructured":"Noronha C, Tobagi F. Optimum routing of multicast streams. IEEE INFOCOM, 1994. Toronto, Canada, p. 865\u201373.","DOI":"10.1109\/INFCOM.1994.337651"},{"issue":"3","key":"10.1016\/S0305-0548(03)00068-6_BIB11","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1109\/90.851977","article-title":"The multicast packing problem","volume":"8","author":"Chen","year":"2000","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"10.1016\/S0305-0548(03)00068-6_BIB12","doi-asserted-by":"crossref","first-page":"905","DOI":"10.1016\/S0305-0548(00)00092-7","article-title":"Heuristic algorithms for packing of multiple-group multicasting","volume":"29","author":"Wang","year":"2002","journal-title":"Computers & Operation Research"},{"key":"10.1016\/S0305-0548(03)00068-6_BIB13","series-title":"IP multicasting","author":"Kosiur","year":"1998"},{"key":"10.1016\/S0305-0548(03)00068-6_BIB14","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF00288961","article-title":"A fast algorithm for Steiner tree","volume":"15","author":"Kou","year":"1981","journal-title":"Acta Informatica"},{"key":"10.1016\/S0305-0548(03)00068-6_BIB15","unstructured":"CPLEX 7.0, CPLEX Optimization Inc., 2002."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054803000686?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054803000686?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,20]],"date-time":"2020-03-20T16:40:14Z","timestamp":1584722414000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054803000686"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,6]]},"references-count":15,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2004,6]]}},"alternative-id":["S0305054803000686"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(03)00068-6","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2004,6]]}}}