{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T14:04:25Z","timestamp":1761401065845},"reference-count":16,"publisher":"Elsevier BV","issue":"12","license":[{"start":{"date-parts":[[1997,11,1]],"date-time":"1997-11-01T00:00:00Z","timestamp":878342400000},"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":[[1997,11]]},"DOI":"10.1016\/s0140-3664(97)00095-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T12:08:03Z","timestamp":1027598883000},"page":"1098-1106","source":"Crossref","is-referenced-by-count":21,"title":["A real-time multicast routing algorithm for multimedia applications"],"prefix":"10.1016","volume":"20","author":[{"given":"Xiaohua","family":"Jia","sequence":"first","affiliation":[]},{"given":"Niki","family":"Pissinou","sequence":"additional","affiliation":[]},{"given":"Kia","family":"Makki","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0140-3664(97)00095-9_BIB1","series-title":"IEEE INFOCOM'93","first-page":"98","article-title":"Scoglio, Routing multipoint connections using virtual paths in an ATM network","author":"Ammar","year":"1993"},{"key":"10.1016\/S0140-3664(97)00095-9_BIB2","series-title":"Proc. IEEE 18th Conf. on Local Computer Networks","first-page":"327","article-title":"A load balancing multicast tree approach for group-based multimedia applications","author":"Ahn","year":"1993"},{"key":"10.1016\/S0140-3664(97)00095-9_BIB3","series-title":"Computers and Intractability: A Guide to the Theory of NPcompleteness","author":"Johnson","year":"1979"},{"key":"10.1016\/S0140-3664(97)00095-9_BIB4","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1109\/TCOM.1983.1095818","article-title":"Routing to multiple destinations in computer networks","volume":"31","author":"Bharath-Kumar","year":"1983","journal-title":"IEEE Trans. Commun."},{"key":"10.1016\/S0140-3664(97)00095-9_BIB5","series-title":"Introduction to Algorithms","author":"Cormen","year":"1992"},{"key":"10.1016\/S0140-3664(97)00095-9_BIB6","article-title":"A calculus for Network Delay and a Note on Topologies of Interconnection Networks","author":"Cruz","year":"1987"},{"key":"10.1016\/S0140-3664(97)00095-9_BIB7","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1109\/49.53013","article-title":"A scheme for real-time channel establishment in wide-area networks","volume":"8","author":"Ferrari","year":"1990","journal-title":"IEEE J. Selected Areas Commun."},{"key":"10.1016\/S0140-3664(97)00095-9_BIB8","doi-asserted-by":"crossref","DOI":"10.1137\/0116001","article-title":"Steiner minimal tree","volume":"16","author":"Gilbert","year":"1968","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/S0140-3664(97)00095-9_BIB9","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1109\/71.388042","article-title":"A total ordering multicast protocol using propagation trees","volume":"6","author":"Jia","year":"1995","journal-title":"IEEE Trans. Parallel Distributed Sytems"},{"key":"10.1016\/S0140-3664(97)00095-9_BIB10","series-title":"Proc. IEEE 11th Intl. Conf. on Distributed Computing Systems","first-page":"300","article-title":"Real-time Communication in Multi-hop networks","author":"Kandlur","year":"1991"},{"key":"10.1016\/S0140-3664(97)00095-9_BIB11","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(97)00095-9_BIB12","first-page":"135","article-title":"A new approximation algorithm for the Steiner tree problem","volume":"84","author":"Makki","year":"1991"},{"key":"10.1016\/S0140-3664(97)00095-9_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":"Commun. ACM"},{"issue":"6","key":"10.1016\/S0140-3664(97)00095-9_BIB14","first-page":"86","article-title":"An analysis of several heuristics for the traveling salesman problem","volume":"3","author":"Rosenkrantz","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0140-3664(97)00095-9_BIB15","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 J. Selected Areas Commun."},{"key":"10.1016\/S0140-3664(97)00095-9_BIB16","series-title":"IEEE INFOCOM'93","first-page":"980","article-title":"Performance evaluation of multipoint routing algorithms","author":"Waxman","year":"1993"}],"container-title":["Computer Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0140366497000959?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0140366497000959?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T01:28:01Z","timestamp":1556674081000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0140366497000959"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,11]]},"references-count":16,"journal-issue":{"issue":"12","published-print":{"date-parts":[[1997,11]]}},"alternative-id":["S0140366497000959"],"URL":"https:\/\/doi.org\/10.1016\/s0140-3664(97)00095-9","relation":{},"ISSN":["0140-3664"],"issn-type":[{"value":"0140-3664","type":"print"}],"subject":[],"published":{"date-parts":[[1997,11]]}}}