{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T13:39:12Z","timestamp":1773409152437,"version":"3.50.1"},"reference-count":24,"publisher":"Elsevier BV","issue":"8","license":[{"start":{"date-parts":[[2002,5,1]],"date-time":"2002-05-01T00:00:00Z","timestamp":1020211200000},"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":[[2002,5]]},"DOI":"10.1016\/s0140-3664(01)00402-9","type":"journal-article","created":{"date-parts":[[2002,10,10]],"date-time":"2002-10-10T15:00:31Z","timestamp":1034262031000},"page":"802-811","source":"Crossref","is-referenced-by-count":40,"title":["MAMCRA: a constrained-based multicast routing algorithm"],"prefix":"10.1016","volume":"25","author":[{"given":"Fernando","family":"Kuipers","sequence":"first","affiliation":[]},{"given":"Piet","family":"Van Mieghem","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0140-3664(01)00402-9_BIB1","doi-asserted-by":"crossref","unstructured":"P. Van Mieghem, G. Hooghiemstra, R. van der Hofstad, On the efficiency of multicast, scheduled to appear in IEEE Trans. Networking, vol. 9, issue 6, December 2001","DOI":"10.1109\/90.974526"},{"key":"10.1016\/S0140-3664(01)00402-9_BIB2","series-title":"The Steiner Tree Problem","author":"Hwang","year":"1992"},{"key":"10.1016\/S0140-3664(01)00402-9_BIB3","doi-asserted-by":"crossref","unstructured":"H.F Salama, D.S. Reeves, Y. Viniotis, Evaluation of multicast routing algorithms for real-time communication on high-speed networks IEEE JSAC, 15(3), pp. 332\u2013345, April 1997.","DOI":"10.1109\/49.564132"},{"key":"10.1016\/S0140-3664(01)00402-9_BIB4","doi-asserted-by":"crossref","unstructured":"G.N. Rouskas, I. Baldine, Multicast routing with end-to-end delay and delay variation constraints, IEEE JSAC, 15(3), pp. 346\u2013356, April 1997","DOI":"10.1109\/49.564133"},{"key":"10.1016\/S0140-3664(01)00402-9_BIB5","doi-asserted-by":"crossref","unstructured":"P. Van Mieghem, H. De Neve, F.A. Kuipers, Hop-by-hop quality of service routing, Computer Networks, vol. 37\/3-4, pp. 407\u2013423, October 2001.","DOI":"10.1016\/S1389-1286(01)00222-5"},{"key":"10.1016\/S0140-3664(01)00402-9_BIB6","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0377-2217(86)90092-5","article-title":"The shortest path problem with two objective functions","volume":"25","author":"Henig","year":"1985","journal-title":"Eur. J. Opl. Res."},{"key":"10.1016\/S0140-3664(01)00402-9_BIB7","article-title":"Paths in the simple random graph and the Waxman graph","author":"Van Mieghem","year":"2001","journal-title":"PEIS"},{"key":"10.1016\/S0140-3664(01)00402-9_BIB8","series-title":"Computers and Intractability, A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"issue":"7","key":"10.1016\/S0140-3664(01)00402-9_BIB9","first-page":"1188","article-title":"QoS routing for supporting multimedia applications","volume":"14","author":"Wang","year":"1996","journal-title":"IEEE JSAC"},{"key":"10.1016\/S0140-3664(01)00402-9_BIB10","series-title":"Complexity of Computer Communications","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/S0140-3664(01)00402-9_BIB11","first-page":"40","article-title":"On finding single-source single-destination k shortest paths","author":"Chong","year":"1995","journal-title":"J. Comput Inf."},{"key":"10.1016\/S0140-3664(01)00402-9_BIB12","first-page":"2508","article-title":"A lower bound for the end-to-end delay in networks: application to voice over IP","author":"Van Mieghem","year":"1998","journal-title":"IEEE Globecom\u201998, Nov. 8\u201312, Sydney (Australia)"},{"key":"10.1016\/S0140-3664(01)00402-9_BIB13","doi-asserted-by":"crossref","unstructured":"F. Kuipers, P. Van Mieghem, QoS routing average complexity and hopcount in m dimensions, Proceedings of Second COST 263 International Workshop, Qof IS 2001, Coimbra, Portugal, September 24\u201326, 2001, pp. 110\u2013126.","DOI":"10.1007\/3-540-45412-8_9"},{"key":"10.1016\/S0140-3664(01)00402-9_BIB14","series-title":"Matrix Computations","author":"Golub","year":"1983"},{"key":"10.1016\/S0140-3664(01)00402-9_BIB15","series-title":"Real Analysis","author":"Royden","year":"1988"},{"key":"10.1016\/S0140-3664(01)00402-9_BIB16","article-title":"Search space reduction in QoS routing","author":"Guo","year":"1999","journal-title":"Proc. 19th Int. Conf. Distrib. Comput. Syst., Austin, Texas"},{"key":"10.1016\/S0140-3664(01)00402-9_BIB17","doi-asserted-by":"crossref","unstructured":"G. Apostolopoulos, D. Williams, S. Kamat, R. Gu\u00e9rin, A. Orda, T. Przygienda, QoS Routing Mechanisms and OSPF extensions, RFC 2676, August, 1999.","DOI":"10.17487\/rfc2676"},{"key":"10.1016\/S0140-3664(01)00402-9_BIB18","unstructured":"R. Gu\u00e9rin, A. Orda, Computing Shortest Paths for Any Number of Hops, submitted for publication, http:\/\/www.seas.upenn.edu:8080\/~guerin\/, 2000."},{"key":"10.1016\/S0140-3664(01)00402-9_BIB19","series-title":"Introduction to Algorithms","author":"Cormen","year":"2000"},{"key":"10.1016\/S0140-3664(01)00402-9_BIB20","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1145\/251007.251008","article-title":"Building shared trees using a one-to-many joining mechanism","author":"Carlberg","year":"1997","journal-title":"Computer Commun. Rev."},{"key":"10.1016\/S0140-3664(01)00402-9_BIB21","doi-asserted-by":"crossref","DOI":"10.1145\/285237.285276","article-title":"QoSMIC: Quality of Service sensitive Multicast Internet protoCol","author":"Faloutos","year":"1998","journal-title":"SIGCOMM'98"},{"key":"10.1016\/S0140-3664(01)00402-9_BIB22","article-title":"A QoS-aware multicast routing protocol","author":"Chen","year":"2000","journal-title":"INFOCOM 2000"},{"key":"10.1016\/S0140-3664(01)00402-9_BIB23","unstructured":"R. Bovie, N. Feldman, Y. Imai, W. Livens, D. Ooms, O. Paridaens, Explicit Multicast (Xcast) Basic Specifications, 2000, \u3008draft-ooms-xcast-basic-spec-00.txt\u3009."},{"key":"10.1016\/S0140-3664(01)00402-9_BIB24","doi-asserted-by":"crossref","first-page":"667","DOI":"10.1016\/S0140-3664(99)00225-X","article-title":"TAMCRA: A tunable accuracy multiple constraints routing algorithm","volume":"23","author":"De Neve","year":"2000","journal-title":"Comput. Commun."}],"container-title":["Computer Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0140366401004029?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0140366401004029?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T04:53:46Z","timestamp":1556427226000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0140366401004029"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,5]]},"references-count":24,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2002,5]]}},"alternative-id":["S0140366401004029"],"URL":"https:\/\/doi.org\/10.1016\/s0140-3664(01)00402-9","relation":{},"ISSN":["0140-3664"],"issn-type":[{"value":"0140-3664","type":"print"}],"subject":[],"published":{"date-parts":[[2002,5]]}}}