{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T09:24:15Z","timestamp":1771665855428,"version":"3.50.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2006,7,3]],"date-time":"2006-07-03T00:00:00Z","timestamp":1151884800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Wireless Netw"],"published-print":{"date-parts":[[2007,6]]},"DOI":"10.1007\/s11276-006-7528-8","type":"journal-article","created":{"date-parts":[[2006,7,6]],"date-time":"2006-07-06T02:07:02Z","timestamp":1152151622000},"page":"323-334","source":"Crossref","is-referenced-by-count":12,"title":["Finding multi-constrained feasible paths by using depth-first search"],"prefix":"10.1007","volume":"13","author":[{"given":"Zhenjiang","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. J.","family":"Garcia-Luna-Aceves","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,7,3]]},"reference":[{"key":"7528_CR1","unstructured":"H. Badis and K. Agha, Quality of Service for Ad-hoc Optimized Link State Routing Protocol (QOLSR), IETF Internet Draft, draft-badis-manet-qolsr-01.txt, April 2005."},{"key":"7528_CR2","doi-asserted-by":"crossref","unstructured":"S. Chen and K. Nahrstedt, Distributed Quality-of-Service Routing in Ad-Hoc Networks. IEEE Journal on Selected Areas in Communications, Vol. 17, No. 8. (August 1999).","DOI":"10.1109\/49.780354"},{"key":"7528_CR3","unstructured":"S. Chen and K. Nahrstedt, On Finding Multi-constrained Paths. In Proceedings of IEEE International Conference of Communications (ICC'98), pp. 874\u2013879. Springer-Verlag, June, 1998."},{"key":"7528_CR4","doi-asserted-by":"crossref","unstructured":"T. Clausen and P. Jacquet, Optimized Link State Routing Protocol, IETF RFC 3626 (Experimental), October. 2003.","DOI":"10.17487\/rfc3626"},{"key":"7528_CR5","unstructured":"T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, Second Edition. McGraw-Hill Companies, 2003."},{"key":"7528_CR6","doi-asserted-by":"crossref","unstructured":"J.J. Garcia-Luna-Aceves and Marcelo Spohn. Transmission-Efficient Routing in Wireless Networks Using Link-State Information. Mob. Netw. Appl., Vol. 6, No. 3 (2001) pp. 223\u2013238.","DOI":"10.1023\/A:1011422615346"},{"key":"7528_CR7","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1002\/net.3230140109","volume":"14","author":"J. M. Jaffe","year":"1984","unstructured":"J. M. Jaffe, Algorithms for Finding Paths with Multiple Constraints. IEEE Networks, 14:95\u2013116, 1984.","journal-title":"IEEE Networks"},{"key":"7528_CR8","doi-asserted-by":"crossref","unstructured":"A. Juttner, B. Szviatovszki, I. Mecs, and Z. Rajko, Lagrange Relaxation Based Method for the QoS Routing Problem. In Proceedings of IEEE INFOCOM, 2001.","DOI":"10.1109\/INFCOM.2001.916277"},{"key":"7528_CR9","doi-asserted-by":"crossref","unstructured":"T. Korkmaz, M. Krunz, and S. Tragoudas, An Efficient Algorithm for Finding a Path Subject to Two Additive Constraints. In Proceedings of the ACM SIGMETRICS, pp. 318\u2013327, 2000.","DOI":"10.1145\/339331.339427"},{"key":"7528_CR10","doi-asserted-by":"crossref","unstructured":"F. A. Kuipers and P. V. Mieghem, The Impact of Correlated Link Weights on Qos Routing. In Proceedings of IEEE INFOCOM, 2003.","DOI":"10.1109\/INFCOM.2003.1208978"},{"key":"7528_CR11","unstructured":"X. Lin and N.B. Shroff, An Optimization Based Approach for QoS Routing in High-Bandwidth Networks. In Proceedings of IEEE INFOCOM, 2004."},{"key":"7528_CR12","doi-asserted-by":"crossref","unstructured":"Q. Ma and P. Steenkiste, Quality-of-Service Routing for Traffic with Performance Guarantees. In Proceedings of the IFIP Fifth International Workshop on Quality of Service, pp. 115\u2013126, May, 1997.","DOI":"10.1007\/978-0-387-35170-4_12"},{"issue":"5","key":"7528_CR13","doi-asserted-by":"crossref","first-page":"851","DOI":"10.1109\/TNET.2004.836112","volume":"12","author":"P. V. Mieghem","year":"2004","unstructured":"P. V. Mieghem and F. A. Kuipers, Concepts of Exact Qos Routing Algorithms. IEEE\/ACM Trans. Netw., Vol. 12, No. 5 (2004) pp. 851\u2013864.","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"7528_CR14","doi-asserted-by":"crossref","first-page":"667","DOI":"10.1016\/S0140-3664(99)00225-X","volume":"23","author":"H. D. Neve","year":"2000","unstructured":"H. D. Neve and P. V. Mieghem, TAMCRA: A Tunable Accuracy Multiple Constraints Routing Algorithm. Computer Communications, Vol. 23 (2000) pp. 667\u2013679.","journal-title":"Computer Communications"},{"key":"7528_CR15","doi-asserted-by":"crossref","unstructured":"C. Perkins, E. Royer, and S. Das, Quality of Service in Ad-hoc On-demand Distance Vector Routing, IETF Internet Draft (work in progress), draft-perkins-manet-aodvqos-00.txt, July 2000.","DOI":"10.1109\/MCSA.1999.749281"},{"key":"7528_CR16","doi-asserted-by":"crossref","unstructured":"C. Perkins, E. Royer, and S. Das, Ad Hoc On Demand Distance Vector (AODV) Routing, IETF RFC 3561 (Experimental). July 2003.","DOI":"10.17487\/rfc3561"},{"key":"7528_CR17","doi-asserted-by":"crossref","unstructured":"H. Rangarajan and J.J. Garcia-Luna-Aceves, Using Labeled Paths for Loop-free On-demand Routing in Ad Hoc Networks. In Proceedings of the 5th ACM International Symposium on Mobile ad hoc Networking and Computing (MobiHoc'04), pp. 43\u201354, Roppongi Hills, Tokyo, Japan, 2004. ACM Press.","DOI":"10.1145\/989459.989466"},{"key":"7528_CR18","doi-asserted-by":"crossref","unstructured":"B. Smith and J.J. Garcia-Luna-Aceves, Efficient Policy-Based Routing without Virtual Circuits. In Proceedings of the First International Conference on Quality of Service in Heterogeneous Wired\/Wireless Networks (QSHINE'04), Dallas, Texas, October, 2004.","DOI":"10.1109\/QSHINE.2004.21"},{"issue":"7","key":"7528_CR19","doi-asserted-by":"crossref","first-page":"1228","DOI":"10.1109\/49.536364","volume":"14","author":"Z. Wang","year":"1996","unstructured":"Z. Wang and J. Crowcroft, Quality-of-Sservice Routing for Supporting Multimedia Applications. IEEE Journal of Selected Areas in Communications, Vol. 14, No. 7 (1996) pp. 1228\u20131234.","journal-title":"IEEE Journal of Selected Areas in Communications"},{"issue":"2","key":"7528_CR20","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1109\/90.993305","volume":"10","author":"X. Yuan","year":"2002","unstructured":"X. Yuan, Heuristic Algorithms for Multiconstrained Quality-of-Service Routing. IEEE\/ACM Trans. Netw., Vol. 10, No. 2 (2002) 244\u2013256.","journal-title":"IEEE\/ACM Trans. Netw."}],"container-title":["Wireless Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11276-006-7528-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11276-006-7528-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11276-006-7528-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,7]],"date-time":"2023-05-07T23:29:30Z","timestamp":1683502170000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11276-006-7528-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,7,3]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2007,6]]}},"alternative-id":["7528"],"URL":"https:\/\/doi.org\/10.1007\/s11276-006-7528-8","relation":{},"ISSN":["1022-0038","1572-8196"],"issn-type":[{"value":"1022-0038","type":"print"},{"value":"1572-8196","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,7,3]]}}}