{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T23:59:45Z","timestamp":1649116785841},"reference-count":20,"publisher":"Elsevier BV","issue":"12","license":[{"start":{"date-parts":[[2003,7,1]],"date-time":"2003-07-01T00:00:00Z","timestamp":1057017600000},"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":[[2003,7]]},"DOI":"10.1016\/s0140-3664(02)00246-3","type":"journal-article","created":{"date-parts":[[2003,6,9]],"date-time":"2003-06-09T20:41:29Z","timestamp":1055191289000},"page":"1274-1287","source":"Crossref","is-referenced-by-count":0,"title":["Exploiting the temporal dimension in QoS-aware multicast routing"],"prefix":"10.1016","volume":"26","author":[{"given":"C.J.","family":"Tseng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.H.","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0140-3664(02)00246-3_BIB1","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1145\/251007.251008","article-title":"Building shared tree using a one-to-many joining mechanism","volume":"January","author":"Carlberg","year":"1997","journal-title":"ACM Comput. Commun. Rev."},{"key":"10.1016\/S0140-3664(02)00246-3_BIB2","article-title":"QoSMIC: quality of service sensitive multicast internet protocol","volume":"September","author":"Faloutsos","year":"1998","journal-title":"Proc. ACM SIGCOMM, Vancouver, British Columbia"},{"issue":"18","key":"10.1016\/S0140-3664(02)00246-3_BIB3","article-title":"Distributed quality-of-service routing in ad-hoc networks","volume":"17","author":"Chen","year":"1999","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"10.1016\/S0140-3664(02)00246-3_BIB4","first-page":"1594","article-title":"A QoS-aware multicast routing protocol","author":"Chen","year":"2000","journal-title":"Proc. IEEE INFOCOM"},{"key":"10.1016\/S0140-3664(02)00246-3_BIB5","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1145\/316194.316225","article-title":"Load-sensitive routing of long-lived IP flows","author":"Shaikh","year":"1999","journal-title":"Proc. ACM SIGCOMM"},{"key":"10.1016\/S0140-3664(02)00246-3_BIB6","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1145\/285243.285251","article-title":"Quality of service based routing: a performance perspective","author":"Apostolopoulos","year":"1998","journal-title":"Proc. ACM SIGCOMM, Vancouver, BC, Canada"},{"key":"10.1016\/S0140-3664(02)00246-3_BIB7","first-page":"62","article-title":"Receiver-initiated multicasting with multiple QoS constraints","volume":"1","author":"Fei","year":"2000","journal-title":"Proc. IEEE INFOCOM, Tel Aviv, Israel"},{"key":"10.1016\/S0140-3664(02)00246-3_BIB8","first-page":"318","article-title":"An efficient algorithm for finding a path subject to two additive constraints","author":"Korkmaz","year":"2000","journal-title":"Comput. Commun. J."},{"key":"10.1016\/S0140-3664(02)00246-3_BIB9","article-title":"A*prune: an algorithm for finding k shortest paths subject to multiple constraints","volume":"April","author":"Liu","year":"2001","journal-title":"Proc. IEEE INFOCOM, Anchorage, Alaska, USA"},{"issue":"3","key":"10.1016\/S0140-3664(02)00246-3_BIB10","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 J. Disc. Math."},{"key":"10.1016\/S0140-3664(02)00246-3_BIB11","doi-asserted-by":"crossref","first-page":"980","DOI":"10.1109\/INFCOM.1993.253268","article-title":"Performance evaluation of multipoint routing algorithms","author":"Waxman","year":"1993","journal-title":"Proc. IEEE INFOCOM"},{"issue":"3","key":"10.1016\/S0140-3664(02)00246-3_BIB12","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. Sel. Areas Commun."},{"key":"10.1016\/S0140-3664(02)00246-3_BIB13","doi-asserted-by":"crossref","first-page":"667","DOI":"10.1016\/S0140-3664(99)00009-2","article-title":"Analysis of the performance of dynamic multicast routing algorithms","volume":"22","author":"Cho","year":"1999","journal-title":"Comput. Commun. J."},{"issue":"8","key":"10.1016\/S0140-3664(02)00246-3_BIB14","doi-asserted-by":"crossref","first-page":"605","DOI":"10.1016\/S0140-3664(97)00062-5","article-title":"Network path caching: issues, algorithms, and a simulation study","volume":"20","author":"Peyravian","year":"1997","journal-title":"Comput. Commun. J."},{"issue":"2","key":"10.1016\/S0140-3664(02)00246-3_BIB15","article-title":"On reducing the processing cost of on-demand QoS path computation","volume":"7","author":"Apostolopoulos","year":"1998","journal-title":"J. High Speed Network."},{"key":"10.1016\/S0140-3664(02)00246-3_BIB16","doi-asserted-by":"crossref","unstructured":"H. Salama, Multicast routing for real-time communication on high-speed networks, PhD Thesis, U. of North Carolina State, 1996.","DOI":"10.1007\/978-0-387-34949-7_3"},{"key":"10.1016\/S0140-3664(02)00246-3_BIB17","article-title":"Modeling Internet topology","volume":"June","author":"Calvert","year":"1997","journal-title":"IEEE Commun. Mag."},{"issue":"6","key":"10.1016\/S0140-3664(02)00246-3_BIB18","doi-asserted-by":"crossref","first-page":"770","DOI":"10.1109\/90.650138","article-title":"A quantitative comparison of graph-based models for Internet topology","volume":"5","author":"Zegura","year":"1997","journal-title":"IEEE Trans. Network."},{"key":"10.1016\/S0140-3664(02)00246-3_BIB19","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1109\/35.587716","article-title":"Multicast group behavior in the Internet's multicast backbone (MBone)","volume":"35","author":"Almeroth","year":"1997","journal-title":"IEEE Commun."},{"key":"10.1016\/S0140-3664(02)00246-3_BIB20","unstructured":"VINT project, Network simulator ns-2, http:\/\/www.isi.edu\/nsnam\/vint\/."}],"container-title":["Computer Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0140366402002463?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0140366402002463?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,21]],"date-time":"2020-03-21T03:00:31Z","timestamp":1584759631000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0140366402002463"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,7]]},"references-count":20,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2003,7]]}},"alternative-id":["S0140366402002463"],"URL":"https:\/\/doi.org\/10.1016\/s0140-3664(02)00246-3","relation":{},"ISSN":["0140-3664"],"issn-type":[{"value":"0140-3664","type":"print"}],"subject":[],"published":{"date-parts":[[2003,7]]}}}