Heuristic Methods for Delay Constrained Least Cost Routing Using$k$-Shortest-Paths
The delay constrained least cost (DCLC) problem is to find the least cost path in a graph subject to a delay constraint. First formulated in the context of routing in computer networks, the DCLC model also applies to problems of path planning and other decision problems. DCLC isNP-complete. Many heu...
Saved in:
Published in | IEEE transactions on automatic control Vol. 51; no. 4; pp. 707 - 712 |
---|---|
Main Authors | , |
Format | Journal Article |
Language | English |
Published |
New York, NY
Institute of Electrical and Electronics Engineers
01.04.2006
|
Subjects | |
Online Access | Get full text |
ISSN | 0018-9286 |
DOI | 10.1109/TAC.2006.872827 |
Cover
Abstract | The delay constrained least cost (DCLC) problem is to find the least cost path in a graph subject to a delay constraint. First formulated in the context of routing in computer networks, the DCLC model also applies to problems of path planning and other decision problems. DCLC isNP-complete. Many heuristic methods have been proposed for it. This note presents two new methods based on thek-shortest-path(k SP)approach. These heuristic methods - one centralized, the other distributed - are both polynomial. In numerical experiments the proposed algorithms almost always find the optimal paths. |
---|---|
AbstractList | The delay constrained least cost (DCLC) problem is to find the least cost path in a graph subject to a delay constraint. First formulated in the context of routing in computer networks, the DCLC model also applies to problems of path planning and other decision problems. DCLC isNP-complete. Many heuristic methods have been proposed for it. This note presents two new methods based on thek-shortest-path(k SP)approach. These heuristic methods - one centralized, the other distributed - are both polynomial. In numerical experiments the proposed algorithms almost always find the optimal paths. |
Author | Varaiya, P. Jia, Z. |
Author_xml | – sequence: 1 givenname: Z. surname: Jia fullname: Jia, Z. – sequence: 2 givenname: P. surname: Varaiya fullname: Varaiya, P. |
BackLink | http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=17683905$$DView record in Pascal Francis |
BookMark | eNp1kDtPwzAUhT0UiRaYWTMUtrR-JLEzVuFRpCJQaWfL2A41pHaxnaH_HletGJBYztW9Oudc6RuBgXVWA3CN4AQhWE9Xs2aCIawmjGKG6QAMIUQsrzGrzsEohM-0VkWBhmA51703IRqZPeu4cSpkrfPZne7EPmucDdELY7XKFlqEmC5Jlq6Pxn5k65B0_DXO3zbORx1i_iriJlyCs1Z0QV-d5gVYP9yvmnm-eHl8amaLXBKIYy40oYxqSYkuMZaCVAV7L6SAUBGCWNm2SiGkBFGwRRWtVV1jzWqNEEYQMkUuwO2xd-fdd5_e860JUnedsNr1gWNWwwJSlow3J6MIUnStF1aawHfebIXfc0QrRmpYJl959EnvQvC65dJEEY2zBwgdR5Af6PJElx_o8iPdlJv-yf1W_5P4AfMgfx4 |
CODEN | IETAA9 |
CitedBy_id | crossref_primary_10_1109_JSYST_2019_2894689 crossref_primary_10_1016_j_comnet_2022_109015 crossref_primary_10_1109_TC_2013_136 crossref_primary_10_1002_net_21552 crossref_primary_10_1007_s10732_009_9109_3 crossref_primary_10_1016_j_comcom_2013_05_003 crossref_primary_10_1155_2014_271280 crossref_primary_10_1016_j_cie_2024_110193 crossref_primary_10_1109_COMST_2016_2633579 crossref_primary_10_1109_TCC_2018_2789446 crossref_primary_10_1109_ACCESS_2018_2808411 crossref_primary_10_1016_j_eswa_2013_07_054 crossref_primary_10_1109_TII_2016_2592481 crossref_primary_10_1016_j_cor_2022_106053 |
Cites_doi | 10.1109/ATM.1998.675192 10.1007/3-540-48318-7_4 10.1109/CDC.2003.1272513 10.1016/S1389-1286(01)00222-5 10.1109/49.12889 10.1109/INFCOM.1997.635117 10.1137/S0097539795290477 10.1109/infcom.2001.916275 10.1109/INFCOM.2001.916277 10.1109/90.650138 10.1109/49.536364 10.1109/65.397043 10.1002/net.3230140109 |
ContentType | Journal Article |
Copyright | 2006 INIST-CNRS |
Copyright_xml | – notice: 2006 INIST-CNRS |
DBID | AAYXX CITATION IQODW 8FD H8D L7M |
DOI | 10.1109/TAC.2006.872827 |
DatabaseName | CrossRef Pascal-Francis Technology Research Database Aerospace Database Advanced Technologies Database with Aerospace |
DatabaseTitle | CrossRef Technology Research Database Aerospace Database Advanced Technologies Database with Aerospace |
DatabaseTitleList | Technology Research Database |
DeliveryMethod | fulltext_linktorsrc |
Discipline | Engineering Applied Sciences |
EndPage | 712 |
ExternalDocumentID | 17683905 10_1109_TAC_2006_872827 |
GroupedDBID | -~X .DC 0R~ 29I 3EH 4.4 5GY 5VS 6IK 97E AAJGR AASAJ AAWTH AAYXX ABAZT ABQJQ ABVLG ACGFO ACGFS ACIWK ACNCT AENEX AETIX AGQYO AGSQL AHBIQ AI. AIBXA AKJIK AKQYR ALLEH ALMA_UNASSIGNED_HOLDINGS ASUFR ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CITATION CS3 DU5 EBS EJD F5P HZ~ H~9 IAAWW IBMZZ ICLAB IDIHD IFIPE IFJZH IPLJI JAVBF LAI M43 MS~ O9- OCL P2P RIA RIE RNS TAE TN5 VH1 VJK ~02 AARMG IQODW RIG 8FD H8D L7M |
ID | FETCH-LOGICAL-c302t-ae3787ec73e522ca3648b4ca00d33185ffdd11da3d0f1679d992e89e1121008d3 |
ISSN | 0018-9286 |
IngestDate | Sat Sep 27 22:11:45 EDT 2025 Mon Jul 21 09:16:12 EDT 2025 Thu Apr 24 23:00:45 EDT 2025 Wed Oct 01 06:33:33 EDT 2025 |
IsPeerReviewed | true |
IsScholarly | true |
Issue | 4 |
Keywords | Graph path Multicriteria analysis Decision making Multiobjective programming Shortest path Routing Path planning Distributed system Modeling Delay multicriteria optimization Computer network Optimal trajectory Heuristic method NP complete problem QoS routing Optimal path Combinatorics Service quality Numerical algorithm |
Language | English |
License | https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html CC BY 4.0 |
LinkModel | OpenURL |
MergedId | FETCHMERGED-LOGICAL-c302t-ae3787ec73e522ca3648b4ca00d33185ffdd11da3d0f1679d992e89e1121008d3 |
Notes | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
PQID | 28904078 |
PQPubID | 23500 |
PageCount | 6 |
ParticipantIDs | proquest_miscellaneous_28904078 pascalfrancis_primary_17683905 crossref_citationtrail_10_1109_TAC_2006_872827 crossref_primary_10_1109_TAC_2006_872827 |
ProviderPackageCode | CITATION AAYXX |
PublicationCentury | 2000 |
PublicationDate | 2006-04-01 |
PublicationDateYYYYMMDD | 2006-04-01 |
PublicationDate_xml | – month: 04 year: 2006 text: 2006-04-01 day: 01 |
PublicationDecade | 2000 |
PublicationPlace | New York, NY |
PublicationPlace_xml | – name: New York, NY |
PublicationTitle | IEEE transactions on automatic control |
PublicationYear | 2006 |
Publisher | Institute of Electrical and Electronics Engineers |
Publisher_xml | – name: Institute of Electrical and Electronics Engineers |
References | Pornavalai (ref5) 1998 ref13 Liu (ref15) 2001; 2 ref12 Jia (ref16) 2004 ref14 ref11 ref10 ref2 ref17 ref18 ref8 ref7 ref9 ref4 ref6 Garey (ref1) 1979 Widyono (ref3) 1994 |
References_xml | – ident: ref10 doi: 10.1109/ATM.1998.675192 – ident: ref13 doi: 10.1007/3-540-48318-7_4 – ident: ref2 doi: 10.1109/CDC.2003.1272513 – year: 1998 ident: ref5 article-title: Routing with multiple QoS requirements for supporting multimedia applications publication-title: J. High Speed Netw. – volume-title: Computers and Intractability: A Guide to the Theory of NP-Completeness year: 1979 ident: ref1 – ident: ref11 doi: 10.1016/S1389-1286(01)00222-5 – ident: ref17 doi: 10.1109/49.12889 – ident: ref6 doi: 10.1109/INFCOM.1997.635117 – ident: ref12 doi: 10.1137/S0097539795290477 – ident: ref14 doi: 10.1109/infcom.2001.916275 – ident: ref8 doi: 10.1109/INFCOM.2001.916277 – volume-title: On constrained optimal path problems and applications year: 2004 ident: ref16 – ident: ref18 doi: 10.1109/90.650138 – ident: ref9 doi: 10.1109/49.536364 – volume-title: The design and evaluation of routing algorithms for real-time channels year: 1994 ident: ref3 – ident: ref4 doi: 10.1109/65.397043 – ident: ref7 doi: 10.1002/net.3230140109 – volume: 2 start-page: 743 year: 2001 ident: ref15 article-title: $A^{\ast}Prune$: An algorithm for finding K shortest paths subject to multiple constraints publication-title: Proc. IEEE INFOCOM |
SSID | ssj0016441 |
Score | 1.9540735 |
Snippet | The delay constrained least cost (DCLC) problem is to find the least cost path in a graph subject to a delay constraint. First formulated in the context of... |
SourceID | proquest pascalfrancis crossref |
SourceType | Aggregation Database Index Database Enrichment Source |
StartPage | 707 |
SubjectTerms | Applied sciences Computer science; control theory; systems Computer systems and distributed systems. User interface Control theory. Systems Exact sciences and technology Software |
Title | Heuristic Methods for Delay Constrained Least Cost Routing Using$k$-Shortest-Paths |
URI | https://www.proquest.com/docview/28904078 |
Volume | 51 |
hasFullText | 1 |
inHoldings | 1 |
isFullTextHit | |
isPrint | |
journalDatabaseRights | – providerCode: PRVIEE databaseName: IEEE Electronic Library (IEL) issn: 0018-9286 databaseCode: RIE dateStart: 19630101 customDbUrl: isFulltext: true dateEnd: 99991231 titleUrlDefault: https://ieeexplore.ieee.org/ omitProxy: false ssIdentifier: ssj0016441 providerName: IEEE |
link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1baxQxFA5aX5QiXulqW_OwgiCzJplkLo-lKItYKbqV4suQSTIIlt3izj60v77nJJnZ6dZC9SUMYSZzOd-cnORcPkLGzmbM8FoBeGuZSJPDP1fjjpgCxHDVWGYw3_noazY9kZ9P1emaY9Nnl7T1xFz-Na_kf6QKfSBXzJL9B8n2g0IHHIN8oQUJQ3snGU_dKhRafn_kiaB9bQVQIWf6wjNxev4HsCi_IEEP9ECDEUC4O-BDBd4KCcpQJt9_Ycjtsk2OwR5cDu1VXAsijUTHKe6dC3rVLkKl1xjo3ofhhMjbn5Ou44eGJ7jwnceTzQ2GPi4lKk0OOlHEitVRaSo-AIccaMA8kNjGyTQPMdI39bQvczo7OAzuoCKHlV--npI6N_zGTNXHD_qVCysrGAB5NLMqDHCfPBB5lomQxtc7k9DkCxNyeI9Y4QkG-LDxBNeMk-1zvYT_pAkEJzfmam-AzJ6Qx3HlQA8CDJ6Se27-jDwa1JN8Tr71gKAREBQAQT0g6AAQ1AOCIiBoBAT1gBj_Hm-A4QU5-fRxdjhNImlGYlIm2kS7FHSwM3nqwLQ2Os1kUUujGbMpZso3jbWcW51a1qALzpalcEXpOFaSY4VNX5Kt-WLudgi1hVICBgKjz0luC61LUNiibBRvbCn0iEy6r1WZWFEe3-OsukU-I_Kuv-A8FFO5_dT9a59_fT6sj9OSqRF508mjAo2Ibi49d4vVskLXOXqnX939bq_JwzXyd8lW-2fl9sDYbOt9D6UroeZ6EQ |
linkProvider | IEEE |
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=Heuristic+Methods+for+Delay+Constrained+Least+Cost+Routing+Using%24k%24-Shortest-Paths&rft.jtitle=IEEE+transactions+on+automatic+control&rft.au=Jia%2C+Z.&rft.au=Varaiya%2C+P.&rft.date=2006-04-01&rft.issn=0018-9286&rft.volume=51&rft.issue=4&rft.spage=707&rft.epage=712&rft_id=info:doi/10.1109%2FTAC.2006.872827&rft.externalDBID=n%2Fa&rft.externalDocID=10_1109_TAC_2006_872827 |
thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0018-9286&client=summon |
thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0018-9286&client=summon |
thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0018-9286&client=summon |