{"id":"https://openalex.org/W2151511290","doi":"https://doi.org/10.1109/icc.2003.1203894","title":"Multi-constrained routing based on simulated annealing","display_name":"Multi-constrained routing based on simulated annealing","publication_year":2004,"publication_date":"2004-03-30","ids":{"openalex":"https://openalex.org/W2151511290","doi":"https://doi.org/10.1109/icc.2003.1203894","mag":"2151511290"},"language":"en","primary_location":{"id":"doi:10.1109/icc.2003.1203894","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2003.1203894","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE International Conference on Communications, 2003. ICC '03.","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5031796746","display_name":"Yong Cui","orcid":"https://orcid.org/0000-0003-0330-1637"},"institutions":[{"id":"https://openalex.org/I99065089","display_name":"Tsinghua University","ror":"https://ror.org/03cve4549","country_code":"CN","type":"education","lineage":["https://openalex.org/I99065089"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Yong Cui","raw_affiliation_strings":["Department of Computer Science, Tsinghua University, Beijing, China"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Tsinghua University, Beijing, China","institution_ids":["https://openalex.org/I99065089"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101591535","display_name":"Xu Ke","orcid":"https://orcid.org/0000-0002-3277-3521"},"institutions":[{"id":"https://openalex.org/I99065089","display_name":"Tsinghua University","ror":"https://ror.org/03cve4549","country_code":"CN","type":"education","lineage":["https://openalex.org/I99065089"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Ke Xu","raw_affiliation_strings":["Department of Computer Science, Tsinghua University, Beijing, China"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Tsinghua University, Beijing, China","institution_ids":["https://openalex.org/I99065089"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101470525","display_name":"Jianping Wu","orcid":"https://orcid.org/0000-0002-9363-3848"},"institutions":[{"id":"https://openalex.org/I99065089","display_name":"Tsinghua University","ror":"https://ror.org/03cve4549","country_code":"CN","type":"education","lineage":["https://openalex.org/I99065089"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jianping Wu","raw_affiliation_strings":["Department of Computer Science, Tsinghua University, Beijing, China"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Tsinghua University, Beijing, China","institution_ids":["https://openalex.org/I99065089"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5080579346","display_name":"Zhongchao Yu","orcid":null},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Zhongchao Yu","raw_affiliation_strings":["Department of Computer Science, University of Maryland, College Park, MD, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101011285","display_name":"Youjian Zhao","orcid":null},"institutions":[{"id":"https://openalex.org/I99065089","display_name":"Tsinghua University","ror":"https://ror.org/03cve4549","country_code":"CN","type":"education","lineage":["https://openalex.org/I99065089"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Youjian Zhao","raw_affiliation_strings":["Department of Computer Science, Tsinghua University, Beijing, China"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Tsinghua University, Beijing, China","institution_ids":["https://openalex.org/I99065089"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5031796746"],"corresponding_institution_ids":["https://openalex.org/I99065089"],"apc_list":null,"apc_paid":null,"fwci":2.7398,"has_fulltext":false,"cited_by_count":25,"citation_normalized_percentile":{"value":0.91838218,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"3","issue":null,"first_page":"1718","last_page":"1722"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10714","display_name":"Software-Defined Networks and 5G","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.8904669284820557},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.7967755794525146},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7007872462272644},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6412665843963623},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.620810866355896},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.567301869392395},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4963400959968567},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.46206435561180115},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4398171305656433},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4199961721897125},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2041986584663391},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18928125500679016},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.17136064171791077},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.14086610078811646},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09656161069869995}],"concepts":[{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.8904669284820557},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.7967755794525146},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7007872462272644},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6412665843963623},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.620810866355896},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.567301869392395},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4963400959968567},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.46206435561180115},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4398171305656433},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4199961721897125},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2041986584663391},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18928125500679016},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.17136064171791077},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.14086610078811646},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09656161069869995},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/icc.2003.1203894","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2003.1203894","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE International Conference on Communications, 2003. ICC '03.","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.717.345","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.717.345","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.4over6.edu.cn/cuiyong/lunwen/Multi-constrained%20routing%20based%20on%20simulated%20annealing.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.8999999761581421,"id":"https://metadata.un.org/sdg/7","display_name":"Affordable and clean energy"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W2011039300","https://openalex.org/W2024060531","https://openalex.org/W2056760934","https://openalex.org/W2096774592","https://openalex.org/W2112029283","https://openalex.org/W2112169033","https://openalex.org/W2114480880","https://openalex.org/W2142735084","https://openalex.org/W2148837283","https://openalex.org/W2169528473","https://openalex.org/W2368654567","https://openalex.org/W6610072603","https://openalex.org/W6674847561"],"related_works":["https://openalex.org/W3209137076","https://openalex.org/W4223969905","https://openalex.org/W2374560440","https://openalex.org/W1490490684","https://openalex.org/W4221129498","https://openalex.org/W2887026015","https://openalex.org/W2361442013","https://openalex.org/W2373384475","https://openalex.org/W4310124294","https://openalex.org/W143403600"],"abstract_inverted_index":{"Multi-constrained":[0],"quality-of-service":[1],"routing":[2],"(QoSR)":[3],"is":[4,20,128,132,144],"to":[5,45,56,68,91],"find":[6,69],"a":[7,22,37,52,62,70],"feasible":[8,71],"path":[9,72],"that":[10,96,136],"satisfies":[11],"multiple":[12,58],"constraints":[13,111],"simultaneously,":[14],"as":[15],"an":[16],"NPC":[17],"problem,":[18],"which":[19,131],"also":[21],"big":[23],"challenge":[24],"for":[25],"the":[26,84,107,122,138,145],"upcoming":[27],"next-generation":[28],"networks.":[29],"In":[30],"this":[31],"paper,":[32],"we":[33,88],"propose":[34],"SA/spl":[35,97,126],"I.bar/MCP,":[36],"novel":[38],"heuristic":[39],"algorithm,":[40,141],"by":[41,73],"applying":[42],"simulated":[43,74,79],"annealing":[44,80],"Dijkstra's":[46,140],"algorithm.":[47],"This":[48],"algorithm":[49,81],"first":[50],"uses":[51],"nonlinear":[53],"energy":[54],"function":[55],"translate":[57],"QoS":[59,110,118,148],"weights":[60],"into":[61],"single":[63],"metric":[64],"and":[65,82,106],"then":[66],"seeks":[67],"annealing.":[75],"The":[76],"paper":[77],"outlines":[78],"analyzes":[83],"problems":[85],"met":[86],"when":[87,116],"apply":[89],"it":[90],"QoSR.":[92],"Extensive":[93],"simulations":[94],"demonstrate":[95],"I.bar/MCP":[98,127],"has":[99],"good":[100],"scalability":[101],"regarding":[102],"both":[103],"network":[104],"size":[105],"number":[108,146],"of":[109,125,137,147],"with":[112],"high":[113],"performance.":[114],"Furthermore,":[115],"most":[117],"requests":[119],"are":[120],"feasible,":[121],"running":[123],"time":[124],"about":[129],"O(k(m+nlogn)),":[130],"only":[133],"k":[134,143],"times":[135],"traditional":[139],"where":[142],"constraints.":[149]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}