{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T05:54:55Z","timestamp":1648619695607},"reference-count":19,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"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 Networks"],"published-print":{"date-parts":[[1999,1]]},"DOI":"10.1016\/s0169-7552(98)00234-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T22:57:10Z","timestamp":1027637830000},"page":"101-110","source":"Crossref","is-referenced-by-count":7,"title":["A distributed multicast routing protocol for real-time multicast applications"],"prefix":"10.1016","volume":"31","author":[{"given":"Xiaohua","family":"Jia","sequence":"first","affiliation":[]},{"given":"Yanchun","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Niki","family":"Pissinou","sequence":"additional","affiliation":[]},{"given":"Kia","family":"Makki","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/S0169-7552(98)00234-7_BIB1","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1109\/90.490746","article-title":"Distributed algorithms for multicast path set up in data networks","volume":"4","author":"Bauer","year":"1996","journal-title":"IEEE\/ACM Trans. Networking"},{"key":"10.1016\/S0169-7552(98)00234-7_BIB2","unstructured":"R.E. Bellman, Dynamic Programming, Princeton Univ. Press, Princeton, 1957."},{"key":"10.1016\/S0169-7552(98)00234-7_BIB3","doi-asserted-by":"crossref","unstructured":"K. Bharath-Kumar, J.M. Jaffe, Routing to multiple destinations in computer networks, IEEE Trans. Commun. COM-31 (March 1983) 343\u2013351.","DOI":"10.1109\/TCOM.1983.1095818"},{"issue":"1, 2","key":"10.1016\/S0169-7552(98)00234-7_BIB4","first-page":"73","article-title":"The Steiner problem in distributed computing systems","volume":"74","author":"Chen","year":"1993","journal-title":"Information Sciences"},{"key":"10.1016\/S0169-7552(98)00234-7_BIB5","unstructured":"C.C. Chou, K.G. Shin, A distributed table-driven route selection scheme for establishing real-time video channels, in: Proc. IEEE Int. Conf. of Dist. Comp. Sys, June 1995, pp. 52\u201359."},{"key":"10.1016\/S0169-7552(98)00234-7_BIB6","unstructured":"T.H. Cormen, C.E. Leiserson, R.L. Rivest, Introduction to Algorithms, MIT Press, Cambridge, MA, 1992."},{"issue":"3","key":"10.1016\/S0169-7552(98)00234-7_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 in Communications"},{"key":"10.1016\/S0169-7552(98)00234-7_BIB8","unstructured":"V. Fioriu, D. Towsley, Call admission and resource reservation for multicast sessions, Technical Report 95-17, Univ. of Massachusetts, 1995, ftp:\/\/ftp.cs.umass.edu\/pub\/techrept\/techreport\/1995\/UM-CS-1995-017.ps."},{"key":"10.1016\/S0169-7552(98)00234-7_BIB9","doi-asserted-by":"crossref","unstructured":"J. Ford, D.R. Fulkerson, Flows in Networks, Princeton Univ. Press, Princeton, 1962.","DOI":"10.1515\/9781400875184"},{"issue":"1","key":"10.1016\/S0169-7552(98)00234-7_BIB10","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1145\/357195.357200","article-title":"A distributed algorithm for minimum-weight spanning trees","volume":"5","author":"Gallarger","year":"1983","journal-title":"ACM Trans. Programming Languages and Systems"},{"key":"10.1016\/S0169-7552(98)00234-7_BIB11","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\/S0169-7552(98)00234-7_BIB12","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\/S0169-7552(98)00234-7_BIB13","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\/S0169-7552(98)00234-7_BIB14","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"},{"issue":"2","key":"10.1016\/S0169-7552(98)00234-7_BIB15","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":"J. Network and Systems Management"},{"issue":"8","key":"10.1016\/S0169-7552(98)00234-7_BIB16","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":"Communications of the ACM"},{"issue":"9","key":"10.1016\/S0169-7552(98)00234-7_BIB17","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 in Communications"},{"key":"10.1016\/S0169-7552(98)00234-7_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"},{"key":"10.1016\/S0169-7552(98)00234-7_BIB19","doi-asserted-by":"crossref","unstructured":"P. Winter, J.M. Smith, Path-distance heuristics for the steiner problem in undirected networks, Algorithmica (1992) 309\u2013327.","DOI":"10.1007\/BF01758765"}],"container-title":["Computer Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0169755298002347?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0169755298002347?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T01:08:19Z","timestamp":1580864899000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0169755298002347"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,1]]},"references-count":19,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1999,1]]}},"alternative-id":["S0169755298002347"],"URL":"https:\/\/doi.org\/10.1016\/s0169-7552(98)00234-7","relation":{},"ISSN":["1389-1286"],"issn-type":[{"value":"1389-1286","type":"print"}],"subject":[],"published":{"date-parts":[[1999,1]]}}}