A randomized algorithm for finding a path subject to multiple QoS requirements
An important aspect of quality-of-service (QoS) provisioning in integrated networks is the ability to find a feasible route that satisfies a set of end-to-end QoS requirements (or constraints) while efficiently using network resources. In general, finding a path subject to multiple additive constrai...
Saved in:
| Published in | Computer networks (Amsterdam, Netherlands : 1999) Vol. 36; no. 2; pp. 251 - 268 |
|---|---|
| Main Authors | , |
| Format | Journal Article |
| Language | English |
| Published |
Amsterdam
Elsevier B.V
01.07.2001
Elsevier Sequoia S.A |
| Subjects | |
| Online Access | Get full text |
| ISSN | 1389-1286 1872-7069 |
| DOI | 10.1016/S1389-1286(00)00209-7 |
Cover
Loading…
| Abstract | An important aspect of quality-of-service (QoS) provisioning in integrated networks is the ability to find a
feasible route that satisfies a set of end-to-end QoS requirements (or constraints) while efficiently using network resources. In general, finding a path subject to multiple
additive constraints (e.g., delay, delay-jitter) is an NP-complete problem. We propose an efficient randomized heuristic algorithm to this problem. Although the algorithm is presented as a centralized one, the idea behind it can also be implemented in a distributed manner. Our algorithm initially computes the cost of the best path from each node to a given destination with respect to individual link weights and their linear combination. In this initialization step, Reverse–Dijkstra's algorithm is used
K+1 times per path request, where
K is the number of additive constraints. The algorithm then randomly traverses the graph, discovering nodes from which there is a good chance of reaching the final destination. This randomized search is a modification of the breadth-first search (BFS). Using extensive simulations, we show that the proposed algorithm provides better performance than existing algorithms under the same order of computational complexity. |
|---|---|
| AbstractList | An important aspect of quality-of-service (QoS) provisioning in integrated networks is the ability to find a
feasible route that satisfies a set of end-to-end QoS requirements (or constraints) while efficiently using network resources. In general, finding a path subject to multiple
additive constraints (e.g., delay, delay-jitter) is an NP-complete problem. We propose an efficient randomized heuristic algorithm to this problem. Although the algorithm is presented as a centralized one, the idea behind it can also be implemented in a distributed manner. Our algorithm initially computes the cost of the best path from each node to a given destination with respect to individual link weights and their linear combination. In this initialization step, Reverse–Dijkstra's algorithm is used
K+1 times per path request, where
K is the number of additive constraints. The algorithm then randomly traverses the graph, discovering nodes from which there is a good chance of reaching the final destination. This randomized search is a modification of the breadth-first search (BFS). Using extensive simulations, we show that the proposed algorithm provides better performance than existing algorithms under the same order of computational complexity. An important aspect of quality-of-service (QoS) provisioning in integrated networks is the ability to find a feasible route that satisfies a set of end-to-end QoS requirements (or constraints) while efficiently using network resources. In general, finding a path subject to multiple additive constraints (e.g., delay, delay-jitter) is an NP-complete problem. We propose an efficient randomized heuristic algorithm to this problem. Although the algorithm is presented as a centralized one, the idea behind it can also be implemented in a distributed manner. Our algorithm initially computes the cost of the best path from each node to a given destination with respect to individual link weights and their linear combination. In this initialization step, Reverse-Dijkstra's algorithm is used K + 1 times per path request, where K is the number of additive constraints. The algorithm then randomly traverses the graph, discovering nodes from which there is a good chance of reaching the final destination. This randomized search is a modification of the breadth-first search (BFS). Using extensive simulations, we show that the proposed algorithm provides better performance than existing algorithms under the same order of computational complexity. copyright 2001 Elsevier Science B.V. Article included in a special issue devoted to the theme: Overlay networks. An important aspect of quality-of-service (QoS) provisioning in integrated networks is the ability to find a feasible route that satisfies a set of end-to-end QoS requirements (or constraints) while efficiently using network resources. In general, finding a path subject to multiple additive constraints, such as delay and delay-jitter, is an NP-complete problem. Proposes an efficient randomized heuristic algorithm to this problem. Although the algorithm is presented as a centralized one, the idea behind it can also be implemented in a distributed manner. The algorithm initially computes the cost of the best path from each node to a given destination with respect to individual link weights and their linear combination. Using extensive simulations, it is shown that the proposed algorithm provides better performance than existing algorithms under the same order of computational complexity. (Original abstract - amended) An important aspect of quality-of-service (QoS) provisioning in integrated networks is the ability to find a feasible route that satisfies a set of end-to-end QoS requirements (or constraints) while efficiently using network resources. In general, finding a path subject to multiple additive constraints (e.g., delay, delay-jitter) is an NP-complete problem. An efficient randomized heuristic algorithm to this problem is proposed. Although the algorithm is presented as a centralized one, the idea behind it can also be implemented in a distributed manner. This algorithm initially computes the cost of the best path from each node to a given destination with respect to individual link weights and their linear combination. Using extensive simulations, it is shown that the proposed algorithm provides better performance than existing algorithms under the same order of computational complexity. |
| Author | Krunz, Marwan Korkmaz, Turgay |
| Author_xml | – sequence: 1 givenname: Turgay surname: Korkmaz fullname: Korkmaz, Turgay email: turgay@ece.arizona.edu – sequence: 2 givenname: Marwan surname: Krunz fullname: Krunz, Marwan email: krunz@ece.arizona.edu |
| BookMark | eNqFkUFrFTEUhQepYFv9CUJwIboYe5NMkgkupBRbhdIi1XXIJHfaPGaS1yQj2F_vtE833bzVPYvvHLjnHDUHMUVsmrcUPlGg8uSG8l63lPXyA8BHAAa6VS-aQ9or1iqQ-mDV_5FXzVEpGwDoOtYfNlenJNvo0xwe0BM73aYc6t1MxpTJGKIP8ZZYsrX1jpRl2KCrpCYyL1MN2wnJj3RDMt4vIeOMsZbXzcvRTgXf_LvHza_zrz_PvrWX1xffz04vW8e1rG2vBu4HvmrLBy7QSwtKU6-7zqOFAeUoRqAd9sx248idU0gl86jAaTpYfty83-Vuc7pfsFQzh-JwmmzEtBQjlADOhNgLMim0Ulyu4Ltn4CYtOa5PGKq1pKKjbIU-7yCXUykZR-NCtTWkWLMNk6FgHhcxT4uYx7oNgHlaxKjVLZ65tznMNv_Z6_uy8-Ha6O-A2RQXMDr0a-2uGp_CnoS_gbmlFA |
| CitedBy_id | crossref_primary_10_1109_TMC_2012_158 crossref_primary_10_1109_MCOM_2002_1106159 crossref_primary_10_1016_j_comcom_2009_05_002 crossref_primary_10_1016_S0140_3664_01_00358_9 crossref_primary_10_1016_j_ijhcs_2011_07_006 crossref_primary_10_1007_s11460_011_0118_2 crossref_primary_10_1109_TC_2006_109 crossref_primary_10_1109_TC_2014_2366762 crossref_primary_10_1016_j_comcom_2006_06_004 crossref_primary_10_1109_MNET_2004_1337731 crossref_primary_10_1109_TC_2011_61 crossref_primary_10_1007_s11277_006_9149_z crossref_primary_10_1109_TC_2006_67 crossref_primary_10_1016_j_comnet_2006_04_006 crossref_primary_10_1016_S0140_3664_02_00055_5 crossref_primary_10_1007_s12243_008_0064_z crossref_primary_10_1109_TMM_2003_811627 crossref_primary_10_3390_electronics8091014 crossref_primary_10_1002_net_20247 crossref_primary_10_1631_jzus_2006_A0156 crossref_primary_10_3390_sym10110600 crossref_primary_10_1016_j_ins_2014_10_001 crossref_primary_10_1109_TNET_2007_900712 crossref_primary_10_1007_s11767_005_0086_x crossref_primary_10_1016_j_comnet_2012_03_011 crossref_primary_10_31908_19098367_3288 crossref_primary_10_1109_TC_2007_1016 crossref_primary_10_1109_TNET_2004_836112 crossref_primary_10_1109_TC_2013_54 crossref_primary_10_1016_j_comcom_2008_06_017 |
| Cites_doi | 10.1109/INFCOM.2000.832182 10.1002/net.3230100403 10.1016/S0020-0190(98)00206-3 10.1145/167088.167286 10.1109/SFCS.1994.365697 10.1109/RTCSA.1998.726352 10.1002/net.3230140109 10.1109/65.768484 10.1109/35.587723 10.1109/49.536364 10.1109/IWQOS.2000.847940 10.1109/65.752646 10.1109/IWQOS.1999.766485 10.1109/ICNP.1997.643711 10.1109/GLOCOM.1995.502780 10.1109/INFCOM.2000.832180 10.17487/rfc2386 10.1002/net.3230130212 10.1007/BF02216932 10.1109/INFCOM.2000.832181 10.1109/ATM.1998.675192 10.1090/dimacs/020/03 10.1109/90.779205 10.1109/90.779203 10.1109/INFCOM.2000.832225 10.1109/65.397043 10.1109/49.536365 10.1145/285237.285251 10.1109/INFCOM.2000.832265 10.1109/INFCOM.1997.635117 10.1109/49.12889 10.1287/moor.17.1.36 |
| ContentType | Journal Article |
| Copyright | 2001 Elsevier Science B.V. Copyright Elsevier Sequoia S.A. Jul 2001 |
| Copyright_xml | – notice: 2001 Elsevier Science B.V. – notice: Copyright Elsevier Sequoia S.A. Jul 2001 |
| DBID | AAYXX CITATION 7SC 8FD E3H F2A JQ2 L7M L~C L~D |
| DOI | 10.1016/S1389-1286(00)00209-7 |
| DatabaseName | CrossRef Computer and Information Systems Abstracts Technology Research Database Library & Information Sciences Abstracts (LISA) Library & Information Science Abstracts (LISA) ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | CrossRef Technology Research Database Computer and Information Systems Abstracts – Academic Library and Information Science Abstracts (LISA) ProQuest Computer Science Collection Computer and Information Systems Abstracts Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Computer and Information Systems Abstracts Library and Information Science Abstracts (LISA) Technology Research Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISSN | 1872-7069 |
| EndPage | 268 |
| ExternalDocumentID | 73212149 10_1016_S1389_1286_00_00209_7 S1389128600002097 |
| Genre | Feature |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 1B1 1~. 1~5 29F 4.4 457 4G. 5GY 5VS 6OB 7-5 71M 77K 8P~ AABNK AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAXUO AAYFN ABBOA ABFNM ABMAC ABTAH ABXDB ABYKQ ACDAQ ACGFS ACNNM ACRLP ACZNC ADBBV ADEZE ADJOM ADTZH AEBSH AECPX AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHJVU AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD AXJTR BJAXD BKOJK BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F0J FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HVGLF HZ~ IHE J1W JJJVA KOM M41 MO0 MS~ N9A O-L O9- OAUVE OZT P-8 P-9 PC. PQQKQ Q38 R2- RIG ROL RPZ RXW SDF SDG SDP SES SEW SPC SPCBC SST SSV SSZ T5K TAE TN5 XFK ZMT ZY4 ~G- AATTM AAXKI AAYWO AAYXX ABJNI ACVFH ADCNI AEIPS AEUPX AFJKZ AFPUW AFXIZ AGCQF AGRNS AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP BNPGV CITATION SSH 7SC 8FD E3H EFKBS F2A JQ2 L7M L~C L~D |
| ID | FETCH-LOGICAL-c396t-87b3db3396a3b35ed6a0791d944dea0be6f5f014e82a4ff3cc7e162de70c91ba3 |
| IEDL.DBID | AIKHN |
| ISSN | 1389-1286 |
| IngestDate | Fri Jul 11 11:30:05 EDT 2025 Fri Jul 11 09:03:12 EDT 2025 Fri Jul 25 05:45:48 EDT 2025 Tue Jul 01 03:28:51 EDT 2025 Thu Apr 24 22:58:53 EDT 2025 Fri Feb 23 02:21:14 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 2 |
| Keywords | QoS-based routing Scalable routing Multi-constrained path selection |
| Language | English |
| License | https://www.elsevier.com/tdm/userlicense/1.0 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c396t-87b3db3396a3b35ed6a0791d944dea0be6f5f014e82a4ff3cc7e162de70c91ba3 |
| Notes | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-2 content type line 23 ObjectType-Article-1 ObjectType-Feature-2 |
| PQID | 199615412 |
| PQPubID | 47119 |
| PageCount | 18 |
| ParticipantIDs | proquest_miscellaneous_57503255 proquest_miscellaneous_26597736 proquest_journals_199615412 crossref_citationtrail_10_1016_S1389_1286_00_00209_7 crossref_primary_10_1016_S1389_1286_00_00209_7 elsevier_sciencedirect_doi_10_1016_S1389_1286_00_00209_7 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | 2001-07-01 |
| PublicationDateYYYYMMDD | 2001-07-01 |
| PublicationDate_xml | – month: 07 year: 2001 text: 2001-07-01 day: 01 |
| PublicationDecade | 2000 |
| PublicationPlace | Amsterdam |
| PublicationPlace_xml | – name: Amsterdam |
| PublicationTitle | Computer networks (Amsterdam, Netherlands : 1999) |
| PublicationYear | 2001 |
| Publisher | Elsevier B.V Elsevier Sequoia S.A |
| Publisher_xml | – name: Elsevier B.V – name: Elsevier Sequoia S.A |
| References | Jaffe (BIB26) 1984; 14 D. Blokh, G. Gutin, An approximation algorithm for combinatorial optimization problems with two parameters, IMADA Preprint PP-1995-14, May 1995 J. Zhou, A new distributed routing algorithm for supporting delay-sensitive applications, in: Proceedings of ICCT '98, IEEE, New York, 22–24 October 1998, pp. S37–06 (1–7) A. Orda, A. Sprintson, QoS routing: the precomputation perspective, in: Proceedings of the INFOCOM 2000 Conference, vol. 1, IEEE, New York, 2000, pp. 128–136 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 shortest paths, in: Proceedings of the 35th Annual Symposium on Foundations of Computer Science, IEEE, New York, November 1994, pp. 154–165 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–83 Wang, Crowcroft (BIB45) 1996; 14 Alles (BIB2) 1995 Handler, Zang (BIB21) 1980; 10 Peyravian, Kshemkalyani (BIB36) 1997; 20 Aneja, Aggarwal, Nair (BIB3) 1983; 13 Huitema (BIB23) 1995 Vogel (BIB42) 1996; 14 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–65 Motwani, Raghavan (BIB33) 1995 Skiscim, Golden (BIB40) 1989; 20 Waxman (BIB46) 1988; 69 Orda (BIB34) 1999; 7 T.H. Cormen, C.E. Leiserson, R.L. Rivest, Introduction to Algorithms, 16th ed., MIT Press and McGraw-Hill, Cambridge and New York, 1996 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–179 M.R. Garey, D.S. Johnson, Computers and Intractability, A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979 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–2133 D. Eppstein, Finding the 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–September 1998, pp. 17–28 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–911 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–146 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–128 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–174 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–785 Q. Ma, P. Steenkiste, Routing traffic with quality-of-service guarantees in integrated services networks, in: Proceedings of NOSSDAV '98, July 1998 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 Ahuja, Magnanti, Orlin (BIB1) 1993 Hassin (BIB22) 1992; 17 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–11 April 1997, pp. 84–91 B. Fortz, M. Thorup, Internet traffic engineering by optimizing OSPF weights, in: Proceedings of the INFOCOM 2000 Conference, vol. 2, IEEE, New York, 2000 Calvert, Doar, Zegura (BIB6) 1997; 35 Wang (BIB43) 1999; 69 Lee, Hluchyi, Humblet (BIB28) 1995 D.E. Comer, Internetworking with TCP/IP, vol. I, third ed., Prentice-Hall, Englewood Cliffs, NJ, 1995 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–202 S. Chen and K. Nahrstedt, On finding multi-constrained paths, in: Proceedings of the ICC '98 Conference, IEEE, New York, 1998, pp. 874 –879 Guerin, Orda (BIB18) 1999; 7 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 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–149 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–127 Iwata (BIB25) 1996; E79-B Chen, Nahrstedt (BIB9) 1998; 12 Xiao, Ni (BIB48) 1999; 13 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–328 10.1016/S1389-1286(00)00209-7_BIB24 Alles (10.1016/S1389-1286(00)00209-7_BIB2) 1995 Handler (10.1016/S1389-1286(00)00209-7_BIB21) 1980; 10 10.1016/S1389-1286(00)00209-7_BIB27 10.1016/S1389-1286(00)00209-7_BIB29 10.1016/S1389-1286(00)00209-7_BIB8 Guerin (10.1016/S1389-1286(00)00209-7_BIB18) 1999; 7 10.1016/S1389-1286(00)00209-7_BIB7 10.1016/S1389-1286(00)00209-7_BIB20 Skiscim (10.1016/S1389-1286(00)00209-7_BIB40) 1989; 20 10.1016/S1389-1286(00)00209-7_BIB4 Jaffe (10.1016/S1389-1286(00)00209-7_BIB26) 1984; 14 10.1016/S1389-1286(00)00209-7_BIB5 Chen (10.1016/S1389-1286(00)00209-7_BIB9) 1998; 12 Vogel (10.1016/S1389-1286(00)00209-7_BIB42) 1996; 14 10.1016/S1389-1286(00)00209-7_BIB13 10.1016/S1389-1286(00)00209-7_BIB14 Hassin (10.1016/S1389-1286(00)00209-7_BIB22) 1992; 17 10.1016/S1389-1286(00)00209-7_BIB15 10.1016/S1389-1286(00)00209-7_BIB16 10.1016/S1389-1286(00)00209-7_BIB17 Ahuja (10.1016/S1389-1286(00)00209-7_BIB1) 1993 10.1016/S1389-1286(00)00209-7_BIB19 Wang (10.1016/S1389-1286(00)00209-7_BIB43) 1999; 69 Wang (10.1016/S1389-1286(00)00209-7_BIB45) 1996; 14 Xiao (10.1016/S1389-1286(00)00209-7_BIB48) 1999; 13 10.1016/S1389-1286(00)00209-7_BIB10 10.1016/S1389-1286(00)00209-7_BIB11 10.1016/S1389-1286(00)00209-7_BIB12 Huitema (10.1016/S1389-1286(00)00209-7_BIB23) 1995 Motwani (10.1016/S1389-1286(00)00209-7_BIB33) 1995 Lee (10.1016/S1389-1286(00)00209-7_BIB28) 1995 10.1016/S1389-1286(00)00209-7_BIB47 10.1016/S1389-1286(00)00209-7_BIB49 10.1016/S1389-1286(00)00209-7_BIB41 10.1016/S1389-1286(00)00209-7_BIB44 Iwata (10.1016/S1389-1286(00)00209-7_BIB25) 1996; E79-B Aneja (10.1016/S1389-1286(00)00209-7_BIB3) 1983; 13 10.1016/S1389-1286(00)00209-7_BIB35 10.1016/S1389-1286(00)00209-7_BIB37 10.1016/S1389-1286(00)00209-7_BIB38 Calvert (10.1016/S1389-1286(00)00209-7_BIB6) 1997; 35 10.1016/S1389-1286(00)00209-7_BIB39 10.1016/S1389-1286(00)00209-7_BIB30 10.1016/S1389-1286(00)00209-7_BIB31 10.1016/S1389-1286(00)00209-7_BIB32 Peyravian (10.1016/S1389-1286(00)00209-7_BIB36) 1997; 20 Orda (10.1016/S1389-1286(00)00209-7_BIB34) 1999; 7 Waxman (10.1016/S1389-1286(00)00209-7_BIB46) 1988; 69 |
| References_xml | – reference: 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–149 – reference: 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 – reference: B. Fortz, M. Thorup, Internet traffic engineering by optimizing OSPF weights, in: Proceedings of the INFOCOM 2000 Conference, vol. 2, IEEE, New York, 2000 – reference: 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–September 1998, pp. 17–28 – reference: D. Eppstein, Finding the – reference: 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–65 – volume: 35 start-page: 160 year: 1997 end-page: 163 ident: BIB6 article-title: Modeling internet topology publication-title: IEEE Communications Magazine – volume: 7 start-page: 365 year: 1999 end-page: 374 ident: BIB34 article-title: Routing with end-to-end QoS guarantees in broadband networks publication-title: IEEE/ACM Transactions on Networking – volume: 13 start-page: 295 year: 1983 end-page: 302 ident: BIB3 article-title: Shortest chain subject to side constraints publication-title: Networks – reference: D.E. Comer, Internetworking with TCP/IP, vol. I, third ed., Prentice-Hall, Englewood Cliffs, NJ, 1995 – volume: E79-B start-page: 999 year: 1996 end-page: 1006 ident: BIB25 article-title: ATM routing algorithms with multiple QOS requirements for multimedia internetworking publication-title: IEICE Transactions and Communications – volume: 14 start-page: 1228 year: 1996 end-page: 1234 ident: BIB45 article-title: Quality-of-service routing for supporting multimedia applications publication-title: IEEE Journal on Selected Areas in Communications – reference: 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 – reference: D. Blokh, G. Gutin, An approximation algorithm for combinatorial optimization problems with two parameters, IMADA Preprint PP-1995-14, May 1995, – reference: 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–2133 – reference: 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–11 April 1997, pp. 84–91 – volume: 12 start-page: 64 year: 1998 end-page: 79 ident: BIB9 article-title: An overview of quality-of-service routing for the next generation high-speed networks: problems and solutions publication-title: IEEE Network – reference: 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–127 – reference: 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–174 – volume: 14 start-page: 1235 year: 1996 end-page: 1244 ident: BIB42 article-title: QoS-based routing of multimedia streams in computer networks publication-title: IEEE Journal on Selected Areas in Communications – reference: 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–911 – reference: J. Zhou, A new distributed routing algorithm for supporting delay-sensitive applications, in: Proceedings of ICCT '98, IEEE, New York, 22–24 October 1998, pp. S37–06 (1–7) – year: 1995 ident: BIB23 publication-title: Routing in the Internet – reference: 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–146 – volume: 17 start-page: 36 year: 1992 end-page: 42 ident: BIB22 article-title: Approximation schemes for the restricted shortest path problem publication-title: Mathematics of Operations Research – volume: 7 start-page: 350 year: 1999 end-page: 364 ident: BIB18 article-title: QoS routing in networks with inaccurate information: theory and algorithms publication-title: IEEE/ACM Transactions on Networking – reference: S. Chen and K. Nahrstedt, On finding multi-constrained paths, in: Proceedings of the ICC '98 Conference, IEEE, New York, 1998, pp. 874 –879 – volume: 69 start-page: 111 year: 1999 end-page: 114 ident: BIB43 article-title: On the complexity of quality-of-service routing publication-title: Information Processing Letters – reference: Q. Ma, P. Steenkiste, Routing traffic with quality-of-service guarantees in integrated services networks, in: Proceedings of NOSSDAV '98, July 1998 – volume: 20 start-page: 249 year: 1989 end-page: 282 ident: BIB40 article-title: Solving publication-title: Annals of Operations Research – reference: 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–128 – year: 1993 ident: BIB1 publication-title: Network Flows: Theory, Algorithms, and Applications – volume: 14 start-page: 95 year: 1984 end-page: 116 ident: BIB26 article-title: Algorithms for finding paths with multiple constraints publication-title: Networks – volume: 13 start-page: 8 year: 1999 end-page: 18 ident: BIB48 article-title: Internet QoS: a big picture publication-title: IEEE Network – reference: 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–785 – start-page: 46 year: 1995 end-page: 55 ident: BIB28 article-title: Routing subject to quality-of-service constraints in integrated communication networks publication-title: IEEE Network – reference: 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–83 – reference: A. Orda, A. Sprintson, QoS routing: the precomputation perspective, in: Proceedings of the INFOCOM 2000 Conference, vol. 1, IEEE, New York, 2000, pp. 128–136 – volume: 69 start-page: 1617 year: 1988 end-page: 1622 ident: BIB46 article-title: Routing of multipoint connections publication-title: IEEE Journal on Selected Areas in Communications – reference: 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–179 – volume: 20 start-page: 605 year: 1997 end-page: 614 ident: BIB36 article-title: Network path caching: issues, algorithms and a simulation study publication-title: Performance Evaluation – year: 1995 ident: BIB33 publication-title: Randomized Algorithms – year: 1995 ident: BIB2 publication-title: ATM Internetworking – reference: shortest paths, in: Proceedings of the 35th Annual Symposium on Foundations of Computer Science, IEEE, New York, November 1994, pp. 154–165 – reference: 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–202 – reference: 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 – volume: 10 start-page: 293 year: 1980 end-page: 310 ident: BIB21 article-title: A dual algorithm for the constrained shortest path problem publication-title: Networks – reference: M.R. Garey, D.S. Johnson, Computers and Intractability, A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979 – reference: T.H. Cormen, C.E. Leiserson, R.L. Rivest, Introduction to Algorithms, 16th ed., MIT Press and McGraw-Hill, Cambridge and New York, 1996 – reference: 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–328 – year: 1995 ident: 10.1016/S1389-1286(00)00209-7_BIB33 – ident: 10.1016/S1389-1286(00)00209-7_BIB32 – ident: 10.1016/S1389-1286(00)00209-7_BIB15 doi: 10.1109/INFCOM.2000.832182 – volume: 10 start-page: 293 year: 1980 ident: 10.1016/S1389-1286(00)00209-7_BIB21 article-title: A dual algorithm for the constrained shortest path problem publication-title: Networks doi: 10.1002/net.3230100403 – volume: 69 start-page: 111 issue: 3 year: 1999 ident: 10.1016/S1389-1286(00)00209-7_BIB43 article-title: On the complexity of quality-of-service routing publication-title: Information Processing Letters doi: 10.1016/S0020-0190(98)00206-3 – year: 1993 ident: 10.1016/S1389-1286(00)00209-7_BIB1 – ident: 10.1016/S1389-1286(00)00209-7_BIB37 doi: 10.1145/167088.167286 – ident: 10.1016/S1389-1286(00)00209-7_BIB17 – ident: 10.1016/S1389-1286(00)00209-7_BIB14 doi: 10.1109/SFCS.1994.365697 – ident: 10.1016/S1389-1286(00)00209-7_BIB24 doi: 10.1109/RTCSA.1998.726352 – volume: 14 start-page: 95 year: 1984 ident: 10.1016/S1389-1286(00)00209-7_BIB26 article-title: Algorithms for finding paths with multiple constraints publication-title: Networks doi: 10.1002/net.3230140109 – volume: 13 start-page: 8 issue: 2 year: 1999 ident: 10.1016/S1389-1286(00)00209-7_BIB48 article-title: Internet QoS: a big picture publication-title: IEEE Network doi: 10.1109/65.768484 – volume: 35 start-page: 160 issue: 6 year: 1997 ident: 10.1016/S1389-1286(00)00209-7_BIB6 article-title: Modeling internet topology publication-title: IEEE Communications Magazine doi: 10.1109/35.587723 – volume: 14 start-page: 1228 issue: 7 year: 1996 ident: 10.1016/S1389-1286(00)00209-7_BIB45 article-title: Quality-of-service routing for supporting multimedia applications publication-title: IEEE Journal on Selected Areas in Communications doi: 10.1109/49.536364 – ident: 10.1016/S1389-1286(00)00209-7_BIB31 – ident: 10.1016/S1389-1286(00)00209-7_BIB29 doi: 10.1109/IWQOS.2000.847940 – volume: 12 start-page: 64 issue: 6 year: 1998 ident: 10.1016/S1389-1286(00)00209-7_BIB9 article-title: An overview of quality-of-service routing for the next generation high-speed networks: problems and solutions publication-title: IEEE Network doi: 10.1109/65.752646 – ident: 10.1016/S1389-1286(00)00209-7_BIB41 doi: 10.1109/IWQOS.1999.766485 – ident: 10.1016/S1389-1286(00)00209-7_BIB38 doi: 10.1109/ICNP.1997.643711 – ident: 10.1016/S1389-1286(00)00209-7_BIB44 doi: 10.1109/GLOCOM.1995.502780 – ident: 10.1016/S1389-1286(00)00209-7_BIB20 – ident: 10.1016/S1389-1286(00)00209-7_BIB7 – ident: 10.1016/S1389-1286(00)00209-7_BIB10 – ident: 10.1016/S1389-1286(00)00209-7_BIB19 doi: 10.1109/INFCOM.2000.832180 – volume: 20 start-page: 605 issue: 8 year: 1997 ident: 10.1016/S1389-1286(00)00209-7_BIB36 article-title: Network path caching: issues, algorithms and a simulation study publication-title: Performance Evaluation – ident: 10.1016/S1389-1286(00)00209-7_BIB49 – ident: 10.1016/S1389-1286(00)00209-7_BIB12 doi: 10.17487/rfc2386 – year: 1995 ident: 10.1016/S1389-1286(00)00209-7_BIB23 – volume: 13 start-page: 295 year: 1983 ident: 10.1016/S1389-1286(00)00209-7_BIB3 article-title: Shortest chain subject to side constraints publication-title: Networks doi: 10.1002/net.3230130212 – volume: 20 start-page: 249 issue: 1–4 year: 1989 ident: 10.1016/S1389-1286(00)00209-7_BIB40 article-title: Solving k-shortest and constrained shortest path problems efficiently publication-title: Annals of Operations Research doi: 10.1007/BF02216932 – ident: 10.1016/S1389-1286(00)00209-7_BIB35 doi: 10.1109/INFCOM.2000.832181 – ident: 10.1016/S1389-1286(00)00209-7_BIB13 doi: 10.1109/ATM.1998.675192 – volume: E79-B start-page: 999 issue: 8 year: 1996 ident: 10.1016/S1389-1286(00)00209-7_BIB25 article-title: ATM routing algorithms with multiple QOS requirements for multimedia internetworking publication-title: IEICE Transactions and Communications – ident: 10.1016/S1389-1286(00)00209-7_BIB30 doi: 10.1090/dimacs/020/03 – volume: 7 start-page: 365 issue: 3 year: 1999 ident: 10.1016/S1389-1286(00)00209-7_BIB34 article-title: Routing with end-to-end QoS guarantees in broadband networks publication-title: IEEE/ACM Transactions on Networking doi: 10.1109/90.779205 – volume: 7 start-page: 350 issue: 3 year: 1999 ident: 10.1016/S1389-1286(00)00209-7_BIB18 article-title: QoS routing in networks with inaccurate information: theory and algorithms publication-title: IEEE/ACM Transactions on Networking doi: 10.1109/90.779203 – ident: 10.1016/S1389-1286(00)00209-7_BIB11 – ident: 10.1016/S1389-1286(00)00209-7_BIB8 – ident: 10.1016/S1389-1286(00)00209-7_BIB16 doi: 10.1109/INFCOM.2000.832225 – year: 1995 ident: 10.1016/S1389-1286(00)00209-7_BIB2 – start-page: 46 year: 1995 ident: 10.1016/S1389-1286(00)00209-7_BIB28 article-title: Routing subject to quality-of-service constraints in integrated communication networks publication-title: IEEE Network doi: 10.1109/65.397043 – volume: 14 start-page: 1235 issue: 7 year: 1996 ident: 10.1016/S1389-1286(00)00209-7_BIB42 article-title: QoS-based routing of multimedia streams in computer networks publication-title: IEEE Journal on Selected Areas in Communications doi: 10.1109/49.536365 – ident: 10.1016/S1389-1286(00)00209-7_BIB4 doi: 10.1145/285237.285251 – ident: 10.1016/S1389-1286(00)00209-7_BIB27 doi: 10.1109/INFCOM.2000.832265 – ident: 10.1016/S1389-1286(00)00209-7_BIB5 – ident: 10.1016/S1389-1286(00)00209-7_BIB39 doi: 10.1109/INFCOM.1997.635117 – volume: 69 start-page: 1617 year: 1988 ident: 10.1016/S1389-1286(00)00209-7_BIB46 article-title: Routing of multipoint connections publication-title: IEEE Journal on Selected Areas in Communications doi: 10.1109/49.12889 – ident: 10.1016/S1389-1286(00)00209-7_BIB47 – volume: 17 start-page: 36 issue: 1 year: 1992 ident: 10.1016/S1389-1286(00)00209-7_BIB22 article-title: Approximation schemes for the restricted shortest path problem publication-title: Mathematics of Operations Research doi: 10.1287/moor.17.1.36 |
| SSID | ssj0004428 |
| Score | 1.8995452 |
| Snippet | An important aspect of quality-of-service (QoS) provisioning in integrated networks is the ability to find a
feasible route that satisfies a set of end-to-end... An important aspect of quality-of-service (QoS) provisioning in integrated networks is the ability to find a feasible route that satisfies a set of end-to-end... Article included in a special issue devoted to the theme: Overlay networks. An important aspect of quality-of-service (QoS) provisioning in integrated networks... |
| SourceID | proquest crossref elsevier |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 251 |
| SubjectTerms | Algorithms Multi-constrained path selection Networks QoS-based routing Quality of service Routing Scalable routing Selection Studies |
| Title | A randomized algorithm for finding a path subject to multiple QoS requirements |
| URI | https://dx.doi.org/10.1016/S1389-1286(00)00209-7 https://www.proquest.com/docview/199615412 https://www.proquest.com/docview/26597736 https://www.proquest.com/docview/57503255 |
| Volume | 36 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnR1NT9sw9ImPCxymfYDoYMwHDuMQ6sSO3RwrBOpWrRIDBDfLTtxSCRJE2wsHfjvvOUlhkxDSTokcP8t5tt-H3xfAAUoB1iaqiDInbSRzTsHKdAGP0quQ2iJXp-Dk3yM1uJS_rtPrFThuY2HIrbKh_TVND9S6aek22OzeT6fd82BiS3qKB3NapldhPRGZwq293v85HIxewiNlKLFK_SMCeAnkqQcJjT84PwzjRPotFvUPsQ4c6PQjfGhER9avZ_cJVnz5GTZfJRT8AqM-Q95TVHfTR18wezupUPe_uWMombJgnS4nzDKqQsxmC0dXMGxesdapkJ1V5-zBk29wuDScbcHl6cnF8SBqKiZEOf75HEmbE4UT-G6FE6kvlOU6i4tMysJb7rwap2NUinwvsXI8FnmufaySwmueZ7GzYhvWyqr0O8C4QGHAptprmeG5jl0utMi478XS4qqLDsgWSSZv0olTVYtbs_QbI9wawq3hlIMUcWt0B46WYPd1Po33AHrtCpi_NoZBmv8e6G67YqY5mTNDXtcoNsZJB74vv-KRIjuJLX21mJlEUVI-od7ukZL1F5Wxr_8_uV3YqN3ZyPN3D9bmDwv_DeWbuduH1aOneL_ZxfQc_rkaPgOnn_Q- |
| linkProvider | Elsevier |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3NT9swFH-Cchg7TLCB1nWADztsh1AnduzmiBCo26ASAiRulp24pRIkiLaXHfjbec9JykBCSNwix7asZ78P-_3eewA_0AqwNlFFlDlpI5lzClamB3i0XoXUFrU6BSefjtTwUv65Sq9W4LCNhSFYZSP7a5kepHXT0m-o2b-bTvvnwcWWDBQP7rRMr8KaRPYl7tx_eMJ5SBkKrFLviLo_hfHUU4TGn5z_CrNE-jUF9UJUB_1zvAGfGsORHdRr24QVX36Gj_-lE_wCowOGmqeobqf_fMHszaTCm__1LUO7lAXfdDlhllENYjZbOHqAYfOKtZBCdlads3tPyODwZDjbgsvjo4vDYdTUS4hykak5CjYnCifw2wonUl8oy3UWF5mUhbfceTVOx3gl8oPEyvFY5Ln2sUoKr3mexc6KbeiUVem_AuMCTQGbaq9lhlwdu1xokXE_iKXFPRddkC2RTN4kE6eaFjdmiRoj2hqireGUgRRpa3QX9pfD7upsGm8NGLQ7YJ4dC4MS_62hvXbHTMOXM0OYazQa46QLe8u_yFDkJbGlrxYzkyhKySfU6z1S8v3iVezb-xe3Bx-GF6cn5uT36G8P1mtgG2GAv0Nnfr_wO2jpzN1uOMmP-4DzXw |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+randomized+algorithm+for+finding+a+path+subject+to+multiple+QoS+requirements&rft.jtitle=Computer+networks+%28Amsterdam%2C+Netherlands+%3A+1999%29&rft.au=Korkmaz%2C+Turgay&rft.au=Krunz%2C+Marwan&rft.date=2001-07-01&rft.issn=1389-1286&rft.volume=36&rft.issue=2-3&rft.spage=251&rft.epage=268&rft_id=info:doi/10.1016%2FS1389-1286%2800%2900209-7&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_S1389_1286_00_00209_7 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1389-1286&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1389-1286&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1389-1286&client=summon |