{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,31]],"date-time":"2025-07-31T00:22:00Z","timestamp":1753921320102},"reference-count":23,"publisher":"Elsevier BV","issue":"18","license":[{"start":{"date-parts":[[1998,12,1]],"date-time":"1998-12-01T00:00:00Z","timestamp":912470400000},"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":[[1998,12]]},"DOI":"10.1016\/s0140-3664(98)00208-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T19:03:07Z","timestamp":1027623787000},"page":"1693-1706","source":"Crossref","is-referenced-by-count":27,"title":["Algorithms for delay-constrained low-cost multicast tree construction"],"prefix":"10.1016","volume":"21","author":[{"given":"R","family":"Sriram","sequence":"first","affiliation":[]},{"given":"G","family":"Manimaran","sequence":"additional","affiliation":[]},{"given":"C.Siva Ram","family":"Murthy","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/S0140-3664(98)00208-4_BIB1","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":"Comp. Commun. Rev."},{"issue":"2","key":"10.1016\/S0140-3664(98)00208-4_BIB2","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1109\/90.490746","article-title":"Distributed algorithms for multicast path setup in data networks","volume":"4","author":"Bauer","year":"1996","journal-title":"IEEE\/ACM Trans. Networking"},{"issue":"3","key":"10.1016\/S0140-3664(98)00208-4_BIB3","first-page":"382","article-title":"ARIES: a rearrangeable inexpensive edge-based on-line Steiner algorithm","volume":"15","author":"Bauer","year":"1997","journal-title":"IEEE JSAC"},{"key":"10.1016\/S0140-3664(98)00208-4_BIB4","doi-asserted-by":"crossref","unstructured":"C.H. Chow, On multicast path finding algorithms, in: Proc. IEEE INFOCOMM '91, IEEE Communications Society, Bal Harbour, FL, 1991, pp. 1274-1283.","DOI":"10.1109\/INFCOM.1991.147651"},{"issue":"2","key":"10.1016\/S0140-3664(98)00208-4_BIB5","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1109\/90.490743","article-title":"The PIM architecture for wide-area multicast routing","volume":"4","author":"Deering","year":"1996","journal-title":"IEEE\/ACM Trans. Networking"},{"issue":"2","key":"10.1016\/S0140-3664(98)00208-4_BIB6","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. Syst."},{"issue":"3","key":"10.1016\/S0140-3664(98)00208-4_BIB7","first-page":"277","article-title":"Multipoint communications: a survey of protocols, functions and mechanisms","volume":"15","author":"Diot","year":"1997","journal-title":"IEEE JSAC"},{"issue":"12","key":"10.1016\/S0140-3664(98)00208-4_BIB8","doi-asserted-by":"crossref","first-page":"1040","DOI":"10.1145\/359657.359665","article-title":"Reverse path forwarding of broadcast packets","volume":"21","author":"Dalal","year":"1978","journal-title":"Commun. ACM"},{"key":"10.1016\/S0140-3664(98)00208-4_BIB9","unstructured":"M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness, Freeman, San Francisco, CA, 1979."},{"key":"10.1016\/S0140-3664(98)00208-4_BIB10","doi-asserted-by":"crossref","unstructured":"H.F. Salama, D.S.Reeves, Y. Viniotis, A distributed algorithm for delay-constrained unicast routing, in: Proc. IEEE INFOCOMM, IEEE Communications Society, Kobe, Japan, 1997.","DOI":"10.1109\/INFCOM.1997.635117"},{"key":"10.1016\/S0140-3664(98)00208-4_BIB11","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"},{"issue":"3","key":"10.1016\/S0140-3664(98)00208-4_BIB12","first-page":"343","article-title":"Routing to multiple destinations in computer networks","volume":"31","author":"Kadaba","year":"1993","journal-title":"IEEE Trans. Commun."},{"issue":"3","key":"10.1016\/S0140-3664(98)00208-4_BIB13","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. Networking"},{"key":"10.1016\/S0140-3664(98)00208-4_BIB14","unstructured":"V. Kompella, J.C. Pasquale, G.C. Polyzos, Two distributed algorithms for the constrained Steiner tree problem, in: Proc. Comp. Comm. Networks, San Diego, CA, June 1993, pp. 343-349."},{"key":"10.1016\/S0140-3664(98)00208-4_BIB15","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"},{"issue":"3","key":"10.1016\/S0140-3664(98)00208-4_BIB16","first-page":"357","article-title":"Maxemchuck, Video distribution on multicast networks","volume":"15","author":"Nicholas","year":"1997","journal-title":"IEEE JSAC"},{"key":"10.1016\/S0140-3664(98)00208-4_BIB17","doi-asserted-by":"crossref","first-page":"1655","DOI":"10.1016\/S0140-3664(98)00194-7","article-title":"Preferred link based delay-constrained least cost routing in wide area networks","volume":"21","author":"Sriram","year":"1998","journal-title":"Comp. Commun."},{"issue":"2","key":"10.1016\/S0140-3664(98)00208-4_BIB18","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\/S0140-3664(98)00208-4_BIB19","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1109\/90.532865","article-title":"Multicast tree generation in networks with asymmetric links","volume":"4","author":"Ramanathan","year":"1996","journal-title":"IEEE\/ACM Trans. Networking"},{"issue":"3","key":"10.1016\/S0140-3664(98)00208-4_BIB20","first-page":"346","article-title":"Multicast routing with end-to-end delay and delay variation constraints","volume":"15","author":"Rouskas","year":"1997","journal-title":"IEEE JSAC"},{"issue":"3","key":"10.1016\/S0140-3664(98)00208-4_BIB21","first-page":"373","article-title":"Destination driven routing for low-cost multicast","volume":"15","author":"Shaikh","year":"1997","journal-title":"IEEE JSAC"},{"issue":"1","key":"10.1016\/S0140-3664(98)00208-4_BIB22","first-page":"15","article-title":"An approximate solution for the Steiner problem in graphs","volume":"141","author":"Takashami","year":"1983","journal-title":"Int. J. Math. Educ. Sci. Technol."},{"key":"10.1016\/S0140-3664(98)00208-4_BIB23","first-page":"1617","article-title":"Routing of multipoint connections","volume":"6","author":"Waxman","year":"1988","journal-title":"IEEE JSAC"}],"container-title":["Computer Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0140366498002084?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0140366498002084?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T03:20:53Z","timestamp":1555989653000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0140366498002084"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,12]]},"references-count":23,"journal-issue":{"issue":"18","published-print":{"date-parts":[[1998,12]]}},"alternative-id":["S0140366498002084"],"URL":"https:\/\/doi.org\/10.1016\/s0140-3664(98)00208-4","relation":{},"ISSN":["0140-3664"],"issn-type":[{"value":"0140-3664","type":"print"}],"subject":[],"published":{"date-parts":[[1998,12]]}}}