{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T12:34:16Z","timestamp":1742387656256},"reference-count":10,"publisher":"Elsevier BV","issue":"9","license":[{"start":{"date-parts":[[2000,4,1]],"date-time":"2000-04-01T00:00:00Z","timestamp":954547200000},"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":[[2000,4]]},"DOI":"10.1016\/s0140-3664(00)00165-1","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T02:18:34Z","timestamp":1027649914000},"page":"848-862","source":"Crossref","is-referenced-by-count":28,"title":["Distributed multicast routing, with end-to-end delay and delay variation constraints"],"prefix":"10.1016","volume":"23","author":[{"given":"C.P.","family":"Low","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Y.J.","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0140-3664(00)00165-1_BIB1","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1145\/357195.357200","article-title":"distributed algorithm for minimum-weight spanning trees","volume":"5","author":"Gallager","year":"1983","journal-title":"ACM Transactions on Programming Language System"},{"key":"10.1016\/S0140-3664(00)00165-1_BIB2","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF00288961","article-title":"fast algorithm for Steiner trees","volume":"15","author":"Kou","year":"1981","journal-title":"Acta Informatica"},{"key":"10.1016\/S0140-3664(00)00165-1_BIB3","unstructured":"Sunjoo Wi, Yanghee Choi, A delay constrained distributed multicast routing algorithm, ICCC\u201995, Seoul, August 1995."},{"key":"10.1016\/S0140-3664(00)00165-1_BIB4","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1002\/net.3230140112","article-title":"An algorithm for the Steiner problems in graphs","volume":"14","author":"Beasley","year":"1984","journal-title":"Networks"},{"issue":"3","key":"10.1016\/S0140-3664(00)00165-1_BIB5","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1109\/MS.1985.230701","article-title":"Multicast communication on network computers","volume":"2","author":"Frank","year":"1985","journal-title":"IEEE Software"},{"issue":"2","key":"10.1016\/S0140-3664(00)00165-1_BIB6","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/BF02139130","article-title":"Optimal multicast routing with quality of service constraints","volume":"4","author":"Kompella","year":"1996","journal-title":"Journal of Network and Systems Management"},{"issue":"9","key":"10.1016\/S0140-3664(00)00165-1_BIB7","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 Journal on Selected Areas in Communications"},{"issue":"3","key":"10.1016\/S0140-3664(00)00165-1_BIB8","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 Journal on Selected Areas in Communications"},{"key":"10.1016\/S0140-3664(00)00165-1_BIB9","first-page":"573","article-title":"An approximate solution for the steiner problem in graphs","volume":"6","author":"Takahashi","year":"1980","journal-title":"Mathematica Japonica"},{"key":"10.1016\/S0140-3664(00)00165-1_BIB10","series-title":"Dynamic Programming","author":"Bellman","year":"1957"}],"container-title":["Computer Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0140366400001651?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0140366400001651?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,14]],"date-time":"2019-04-14T20:20:06Z","timestamp":1555273206000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0140366400001651"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,4]]},"references-count":10,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2000,4]]}},"alternative-id":["S0140366400001651"],"URL":"https:\/\/doi.org\/10.1016\/s0140-3664(00)00165-1","relation":{},"ISSN":["0140-3664"],"issn-type":[{"value":"0140-3664","type":"print"}],"subject":[],"published":{"date-parts":[[2000,4]]}}}