{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T16:04:54Z","timestamp":1764173094190},"reference-count":49,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[2001,7,1]],"date-time":"2001-07-01T00:00:00Z","timestamp":993945600000},"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":[[2001,7]]},"DOI":"10.1016\/s1389-1286(00)00209-7","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T14:29:16Z","timestamp":1034605756000},"page":"251-268","source":"Crossref","is-referenced-by-count":59,"title":["A randomized algorithm for finding a path subject to multiple QoS requirements"],"prefix":"10.1016","volume":"36","author":[{"given":"Turgay","family":"Korkmaz","sequence":"first","affiliation":[]},{"given":"Marwan","family":"Krunz","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1389-1286(00)00209-7_BIB1","series-title":"Network Flows: Theory, Algorithms, and Applications","author":"Ahuja","year":"1993"},{"key":"10.1016\/S1389-1286(00)00209-7_BIB2","series-title":"ATM Internetworking","author":"Alles","year":"1995"},{"key":"10.1016\/S1389-1286(00)00209-7_BIB3","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1002\/net.3230130212","article-title":"Shortest chain subject to side constraints","volume":"13","author":"Aneja","year":"1983","journal-title":"Networks"},{"key":"10.1016\/S1389-1286(00)00209-7_BIB4","doi-asserted-by":"crossref","unstructured":"G. Apostolopoulos, R. Guerin, S. Kamat, S.K. Tripathi, Quality-of-service-based routing: a performance perspective, in: Proceedings of the ACM SIGCOMM '98 Conference, Vancouver, British Columbia, Canada, August\u2013September 1998, pp. 17\u201328","DOI":"10.1145\/285237.285251"},{"key":"10.1016\/S1389-1286(00)00209-7_BIB5","unstructured":"D. Blokh, G. Gutin, An approximation algorithm for combinatorial optimization problems with two parameters, IMADA Preprint PP-1995-14, May 1995, http:\/\/www.imada.ou.dk\/Research\/Preprints\/Abstracts\/1995\/14.html"},{"issue":"6","key":"10.1016\/S1389-1286(00)00209-7_BIB6","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1109\/35.587723","article-title":"Modeling internet topology","volume":"35","author":"Calvert","year":"1997","journal-title":"IEEE Communications Magazine"},{"key":"10.1016\/S1389-1286(00)00209-7_BIB7","unstructured":"S. Chen, K. Nahrstedt, On finding multi-constrained paths, Technical Report UIUCDCS-R-97-2026, Department of Computer Science, University of Illinois at Urbana-Champaign, August 1997"},{"key":"10.1016\/S1389-1286(00)00209-7_BIB8","unstructured":"S. Chen and K. Nahrstedt, On finding multi-constrained paths, in: Proceedings of the ICC '98 Conference, IEEE, New York, 1998, pp. 874 \u2013879"},{"issue":"6","key":"10.1016\/S1389-1286(00)00209-7_BIB9","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1109\/65.752646","article-title":"An overview of quality-of-service routing for the next generation high-speed networks: problems and solutions","volume":"12","author":"Chen","year":"1998","journal-title":"IEEE Network"},{"key":"10.1016\/S1389-1286(00)00209-7_BIB10","unstructured":"D.E. Comer, Internetworking with TCP\/IP, vol. I, third ed., Prentice-Hall, Englewood Cliffs, NJ, 1995"},{"key":"10.1016\/S1389-1286(00)00209-7_BIB11","unstructured":"T.H. Cormen, C.E. Leiserson, R.L. Rivest, Introduction to Algorithms, 16th ed., MIT Press and McGraw-Hill, Cambridge and New York, 1996"},{"key":"10.1016\/S1389-1286(00)00209-7_BIB12","doi-asserted-by":"crossref","unstructured":"E. Crawley, et al., A framework for QoS-based routing in the Internet, Internet draft, IETF, draft-ietf-qosr-framework-06.txt, 10 July 1998","DOI":"10.17487\/rfc2386"},{"key":"10.1016\/S1389-1286(00)00209-7_BIB13","doi-asserted-by":"crossref","unstructured":"H. De Neve, P. Van Mieghem, A multiple quality-of-service routing algorithm for PNNI, in: Proceedings of the ATM Workshop, IEEE, New York, May 1998, pp. 324\u2013328","DOI":"10.1109\/ATM.1998.675192"},{"key":"10.1016\/S1389-1286(00)00209-7_BIB14","doi-asserted-by":"crossref","unstructured":"D. Eppstein, Finding the k shortest paths, in: Proceedings of the 35th Annual Symposium on Foundations of Computer Science, IEEE, New York, November 1994, pp. 154\u2013165","DOI":"10.1109\/SFCS.1994.365697"},{"key":"10.1016\/S1389-1286(00)00209-7_BIB15","doi-asserted-by":"crossref","unstructured":"F. Ergun, R. Sinha, L. Zhang, QoS routing with performance-dependent costs, in: Proceedings of the INFOCOM 2000 Conference, vol. 1, IEEE, New York, 2000, pp. 137\u2013146","DOI":"10.1109\/INFCOM.2000.832182"},{"key":"10.1016\/S1389-1286(00)00209-7_BIB16","doi-asserted-by":"crossref","unstructured":"B. Fortz, M. Thorup, Internet traffic engineering by optimizing OSPF weights, in: Proceedings of the INFOCOM 2000 Conference, vol. 2, IEEE, New York, 2000","DOI":"10.1109\/INFCOM.2000.832225"},{"key":"10.1016\/S1389-1286(00)00209-7_BIB17","unstructured":"M.R. Garey, D.S. Johnson, Computers and Intractability, A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979"},{"issue":"3","key":"10.1016\/S1389-1286(00)00209-7_BIB18","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1109\/90.779203","article-title":"QoS routing in networks with inaccurate information: theory and algorithms","volume":"7","author":"Guerin","year":"1999","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"10.1016\/S1389-1286(00)00209-7_BIB19","doi-asserted-by":"crossref","unstructured":"R. Guerin, A. Orda, Networks with advance reservations: the routing perspective, in: Proceedings of the INFOCOM 2000 Conference, vol. 1, IEEE, New York, 2000, pp. 118\u2013127","DOI":"10.1109\/INFCOM.2000.832180"},{"key":"10.1016\/S1389-1286(00)00209-7_BIB20","unstructured":"L. Guo, I. Matta, Search space reduction in QoS routing, in: Proceedings of the 19th IEEE International Conference on Distributed Computing Systems, IEEE, New York, May 1999, pp. 142\u2013149"},{"key":"10.1016\/S1389-1286(00)00209-7_BIB21","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1002\/net.3230100403","article-title":"A dual algorithm for the constrained shortest path problem","volume":"10","author":"Handler","year":"1980","journal-title":"Networks"},{"issue":"1","key":"10.1016\/S1389-1286(00)00209-7_BIB22","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1287\/moor.17.1.36","article-title":"Approximation schemes for the restricted shortest path problem","volume":"17","author":"Hassin","year":"1992","journal-title":"Mathematics of Operations Research"},{"key":"10.1016\/S1389-1286(00)00209-7_BIB23","series-title":"Routing in the Internet","author":"Huitema","year":"1995"},{"key":"10.1016\/S1389-1286(00)00209-7_BIB24","doi-asserted-by":"crossref","unstructured":"K. Ishida, K. Amano, N. Kannari, A delay-constrained least-cost path routing protocol and the synthesis method, in: Proceedings of the Fifth International Conference on Real-Time Computing Systems and Applications, IEEE, New York, October 1998, pp. 58\u201365","DOI":"10.1109\/RTCSA.1998.726352"},{"issue":"8","key":"10.1016\/S1389-1286(00)00209-7_BIB25","first-page":"999","article-title":"ATM routing algorithms with multiple QOS requirements for multimedia internetworking","volume":"E79-B","author":"Iwata","year":"1996","journal-title":"IEICE Transactions and Communications"},{"key":"10.1016\/S1389-1286(00)00209-7_BIB26","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"},{"key":"10.1016\/S1389-1286(00)00209-7_BIB27","doi-asserted-by":"crossref","unstructured":"M. Kodialam, T.V. Lakshman, Dynamic routing of bandwidth guaranteed tunnels with restoration, in: Proceedings of the INFOCOM 2000 Conference, vol. 2, IEEE, New York, 2000, pp. 902\u2013911","DOI":"10.1109\/INFCOM.2000.832265"},{"key":"10.1016\/S1389-1286(00)00209-7_BIB28","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1109\/65.397043","article-title":"Routing subject to quality-of-service constraints in integrated communication networks","author":"Lee","year":"1995","journal-title":"IEEE Network"},{"key":"10.1016\/S1389-1286(00)00209-7_BIB29","doi-asserted-by":"crossref","unstructured":"D.H. Lorenz, A. Orda, D. Raz, Y. Shavitt, Efficient QoS partition and routing of unicast and multicast, in: IWQoS 2000, June 2000, pp. 75\u201383","DOI":"10.1109\/IWQOS.2000.847940"},{"key":"10.1016\/S1389-1286(00)00209-7_BIB30","doi-asserted-by":"crossref","unstructured":"L. Lovasz, Randomized algorithms in combinatorial optimization, in: Combinatorial Optimization, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 20, American Mathematical Society, 1995, pp. 153\u2013179","DOI":"10.1090\/dimacs\/020\/03"},{"key":"10.1016\/S1389-1286(00)00209-7_BIB31","unstructured":"Q. Ma, P. Steenkiste, On path selection for traffic with bandwidth guarantees, in: Proceedings of the IEEE International Conference on Network Protocols (ICNP '97), 1997, pp. 191\u2013202"},{"key":"10.1016\/S1389-1286(00)00209-7_BIB32","unstructured":"Q. Ma, P. Steenkiste, Routing traffic with quality-of-service guarantees in integrated services networks, in: Proceedings of NOSSDAV '98, July 1998"},{"key":"10.1016\/S1389-1286(00)00209-7_BIB33","series-title":"Randomized Algorithms","author":"Motwani","year":"1995"},{"issue":"3","key":"10.1016\/S1389-1286(00)00209-7_BIB34","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1109\/90.779205","article-title":"Routing with end-to-end QoS guarantees in broadband networks","volume":"7","author":"Orda","year":"1999","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"10.1016\/S1389-1286(00)00209-7_BIB35","doi-asserted-by":"crossref","unstructured":"A. Orda, A. Sprintson, QoS routing: the precomputation perspective, in: Proceedings of the INFOCOM 2000 Conference, vol. 1, IEEE, New York, 2000, pp. 128\u2013136","DOI":"10.1109\/INFCOM.2000.832181"},{"issue":"8","key":"10.1016\/S1389-1286(00)00209-7_BIB36","first-page":"605","article-title":"Network path caching: issues, algorithms and a simulation study","volume":"20","author":"Peyravian","year":"1997","journal-title":"Performance Evaluation"},{"key":"10.1016\/S1389-1286(00)00209-7_BIB37","doi-asserted-by":"crossref","unstructured":"C.A. Phillips, The network inhibition problem, in: Proceedings of the 25th Annual ACM Symposium on the Theory of Computing (STOC), May 1993, pp. 776\u2013785","DOI":"10.1145\/167088.167286"},{"key":"10.1016\/S1389-1286(00)00209-7_BIB38","doi-asserted-by":"crossref","unstructured":"C. Pornavalai, G. Chakraborty, N. Shiratori, QoS-based routing algorithm in integrated services packet networks, in: Proceedings of ICNP '97, IEEE, New York, 1997, pp. 167\u2013174","DOI":"10.1109\/ICNP.1997.643711"},{"key":"10.1016\/S1389-1286(00)00209-7_BIB39","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 INFOCOM '97 Conference, vol. 1, IEEE, New York, 7\u201311 April 1997, pp. 84\u201391","DOI":"10.1109\/INFCOM.1997.635117"},{"issue":"1\u20134","key":"10.1016\/S1389-1286(00)00209-7_BIB40","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/BF02216932","article-title":"Solving k-shortest and constrained shortest path problems efficiently","volume":"20","author":"Skiscim","year":"1989","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S1389-1286(00)00209-7_BIB41","doi-asserted-by":"crossref","unstructured":"N. Taft-Plotkin, B. Bellur, R. Ogier, Quality-of-service routing using maximally disjoint paths, in: The Seventh International Workshop on Quality-of-Service (IWQoS '99), IEEE, London, England, May\/June 1999, pp. 119\u2013128","DOI":"10.1109\/IWQOS.1999.766485"},{"issue":"7","key":"10.1016\/S1389-1286(00)00209-7_BIB42","doi-asserted-by":"crossref","first-page":"1235","DOI":"10.1109\/49.536365","article-title":"QoS-based routing of multimedia streams in computer networks","volume":"14","author":"Vogel","year":"1996","journal-title":"IEEE Journal on Selected Areas in Communications"},{"issue":"3","key":"10.1016\/S1389-1286(00)00209-7_BIB43","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/S0020-0190(98)00206-3","article-title":"On the complexity of quality-of-service routing","volume":"69","author":"Wang","year":"1999","journal-title":"Information Processing Letters"},{"key":"10.1016\/S1389-1286(00)00209-7_BIB44","doi-asserted-by":"crossref","unstructured":"Z. Wang, J. Crowcroft, Bandwidth-delay-based routing algorithms, in: Proceedings of the GLOBECOM '95 Conference, vol. 3, IEEE, New York, November 1995, pp. 2129\u20132133","DOI":"10.1109\/GLOCOM.1995.502780"},{"issue":"7","key":"10.1016\/S1389-1286(00)00209-7_BIB45","doi-asserted-by":"crossref","first-page":"1228","DOI":"10.1109\/49.536364","article-title":"Quality-of-service routing for supporting multimedia applications","volume":"14","author":"Wang","year":"1996","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"10.1016\/S1389-1286(00)00209-7_BIB46","doi-asserted-by":"crossref","first-page":"1617","DOI":"10.1109\/49.12889","article-title":"Routing of multipoint connections","volume":"69","author":"Waxman","year":"1988","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"10.1016\/S1389-1286(00)00209-7_BIB47","unstructured":"R. Widyono, The design and evaluation of routing algorithms for real-time channels, Technical Report TR-94-024, University of California at Berkeley & International Computer Science Institute, June 1994"},{"issue":"2","key":"10.1016\/S1389-1286(00)00209-7_BIB48","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1109\/65.768484","article-title":"Internet QoS: a big picture","volume":"13","author":"Xiao","year":"1999","journal-title":"IEEE Network"},{"key":"10.1016\/S1389-1286(00)00209-7_BIB49","unstructured":"J. Zhou, A new distributed routing algorithm for supporting delay-sensitive applications, in: Proceedings of ICCT '98, IEEE, New York, 22\u201324 October 1998, pp. S37\u201306 (1\u20137)"}],"container-title":["Computer Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1389128600002097?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1389128600002097?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,28]],"date-time":"2020-01-28T18:26:25Z","timestamp":1580235985000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1389128600002097"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,7]]},"references-count":49,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2001,7]]}},"alternative-id":["S1389128600002097"],"URL":"https:\/\/doi.org\/10.1016\/s1389-1286(00)00209-7","relation":{},"ISSN":["1389-1286"],"issn-type":[{"value":"1389-1286","type":"print"}],"subject":[],"published":{"date-parts":[[2001,7]]}}}