{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T14:05:21Z","timestamp":1761401121831},"reference-count":19,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"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":[[2003,1]]},"DOI":"10.1016\/s1389-1286(02)00344-4","type":"journal-article","created":{"date-parts":[[2003,1,17]],"date-time":"2003-01-17T12:34:03Z","timestamp":1042806843000},"page":"73-88","source":"Crossref","is-referenced-by-count":24,"title":["Search space reduction in QoS routing"],"prefix":"10.1016","volume":"41","author":[{"given":"Liang","family":"Guo","sequence":"first","affiliation":[]},{"given":"Ibrahim","family":"Matta","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"doi-asserted-by":"crossref","unstructured":"S. Blake, D. Black, M. Carlson, E. Davies, Z. Wang, W. Weiss, An Architecture for Differentiated Services, RFC 2475, December 1998","key":"10.1016\/S1389-1286(02)00344-4_BIB1","DOI":"10.17487\/rfc2475"},{"unstructured":"S. Chen, K. Nahrstedt, On finding multi-constrained paths, in: Proceedings of the ICC\u201998, Atlanta, GA, 1998","key":"10.1016\/S1389-1286(02)00344-4_BIB2"},{"unstructured":"E.I. Chong, S. Maddila, S. Morley, On finding single-source single-destination k shortest paths, in: Proceedings of the International Conference on Computing and Information (ICCI)\u201995, Ontario, Canada, July 1995, pp. 40\u201347","key":"10.1016\/S1389-1286(02)00344-4_BIB3"},{"year":"1990","author":"Cormen","series-title":"Introduction to Algorithms","key":"10.1016\/S1389-1286(02)00344-4_BIB4"},{"unstructured":"Internet Traffic Engineering, IETF Working Group. Available from <ftp:\/\/ftpext.eng.us.uu.net\/tewg>","key":"10.1016\/S1389-1286(02)00344-4_BIB5"},{"year":"1979","author":"Garey","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","key":"10.1016\/S1389-1286(02)00344-4_BIB6"},{"doi-asserted-by":"crossref","unstructured":"R. Guerin, A. Orda, QoS-based routing in networks with inaccurate information: theory and algorithms, in: Proceedings of the IEEE INFOCOM\u201997, 1997","key":"10.1016\/S1389-1286(02)00344-4_BIB7","DOI":"10.1109\/INFCOM.1997.635116"},{"key":"10.1016\/S1389-1286(02)00344-4_BIB8","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1002\/net.3230100403","article-title":"A problem dual algorithm for the constrained shortest path","volume":"10","author":"Handler","year":"1980","journal-title":"Networks"},{"unstructured":"S.P. Hong, H. Lee, B.H. Park, An efficient multicast routing algorithm for delay-sensitive applications with dynamic membership, in: Proceedings of the INFOCOM\u201998, San Francisco, CA, March 1998","key":"10.1016\/S1389-1286(02)00344-4_BIB9"},{"key":"10.1016\/S1389-1286(02)00344-4_BIB10","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1002\/net.3230140109","article-title":"Algorithms for finding paths with multiple constraints","volume":"14","author":"Jaffe","year":"1984","journal-title":"Networks"},{"doi-asserted-by":"crossref","unstructured":"D.H. Lorenz, A. Orda, QoS routing in networks with uncertain parameters, in: Proceedings of the IEEE INFOCOM\u201998, San Francisco, CA, March 1998","key":"10.1016\/S1389-1286(02)00344-4_BIB11","DOI":"10.1109\/INFCOM.1998.659631"},{"doi-asserted-by":"crossref","unstructured":"Q. Ma, P. Steenkiste, Quality-of-service routing for traffic with performance guarantees, in: Proceedings of the IFIP Fifth International Workshop on Quality of Service, Columbia University, New York, May 1997, pp. 115\u2013126","key":"10.1016\/S1389-1286(02)00344-4_BIB12","DOI":"10.1007\/978-0-387-35170-4_12"},{"doi-asserted-by":"crossref","unstructured":"H. De Neve, P. Van Mieghem, A multiple quality of service routing algorithm for PNNI, in: Proceedings of the IEEE ATM\u201998 Workshop, Fairfax, VA, May 1998, pp. 306\u2013314","key":"10.1016\/S1389-1286(02)00344-4_BIB13","DOI":"10.1109\/ATM.1998.675192"},{"doi-asserted-by":"crossref","unstructured":"H.F. Salama, D.S. Reeves, Y. Viniotis, A distributed algorithm for delay-constrained unicast routing, in: Proceedings of the IEEE INFOCOM\u201997, Japan, April 1997","key":"10.1016\/S1389-1286(02)00344-4_BIB14","DOI":"10.1109\/INFCOM.1997.635117"},{"key":"10.1016\/S1389-1286(02)00344-4_BIB15","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1109\/49.564132","article-title":"Evaluation of multicast routing algorithms for real-time communication on high-speed networks","volume":"15","author":"Salama","year":"1997","journal-title":"IEEE J. Select. Areas Commun."},{"unstructured":"Q. Sun, H. Langendorfer, A new distributed routing algorithm with end-to-end delay guarantee, in: Proceedings of the IFIP Fifth International Workshop on Quality of Service, Columbia University, New York, May 1997","key":"10.1016\/S1389-1286(02)00344-4_BIB16"},{"issue":"7","key":"10.1016\/S1389-1286(02)00344-4_BIB17","first-page":"1188","article-title":"Quality-of-service routing for supporting multimedia applications","volume":"14","author":"Wang","year":"1996","journal-title":"IEEE J. Select. Areas Commun."},{"key":"10.1016\/S1389-1286(02)00344-4_BIB18","doi-asserted-by":"crossref","first-page":"1617","DOI":"10.1109\/49.12889","article-title":"Routing of multipoint connections","author":"Waxman","year":"1988","journal-title":"IEEE J. Select. Areas Commun."},{"unstructured":"R. Widyono, The design and evaluation of routing algorithms for real-time channels, technical report ICSI TR-94-024, International Computer Science Institute, UC Berkeley, June 1994","key":"10.1016\/S1389-1286(02)00344-4_BIB19"}],"container-title":["Computer Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1389128602003444?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1389128602003444?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T10:58:48Z","timestamp":1554807528000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1389128602003444"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,1]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,1]]}},"alternative-id":["S1389128602003444"],"URL":"https:\/\/doi.org\/10.1016\/s1389-1286(02)00344-4","relation":{},"ISSN":["1389-1286"],"issn-type":[{"type":"print","value":"1389-1286"}],"subject":[],"published":{"date-parts":[[2003,1]]}}}