{"id":"https://openalex.org/W2100899479","doi":"https://doi.org/10.1109/icccn.2005.1523811","title":"A simple method for balancing network utilization and quality of routing","display_name":"A simple method for balancing network utilization and quality of routing","publication_year":2006,"publication_date":"2006-10-11","ids":{"openalex":"https://openalex.org/W2100899479","doi":"https://doi.org/10.1109/icccn.2005.1523811","mag":"2100899479"},"language":"en","primary_location":{"id":"doi:10.1109/icccn.2005.1523811","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icccn.2005.1523811","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","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/A5100674062","display_name":"Yuxi Li","orcid":"https://orcid.org/0009-0006-0812-5133"},"institutions":[{"id":"https://openalex.org/I154425047","display_name":"University of Alberta","ror":"https://ror.org/0160cpw27","country_code":"CA","type":"education","lineage":["https://openalex.org/I154425047"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Yuxi Li","raw_affiliation_strings":["Department of Computing Science, University of Alberta, Edmonton, AB, Canada","Dept. of Comput. Sci., Alberta Univ., Edmonton, Alta., Canada"],"affiliations":[{"raw_affiliation_string":"Department of Computing Science, University of Alberta, Edmonton, AB, Canada","institution_ids":["https://openalex.org/I154425047"]},{"raw_affiliation_string":"Dept. of Comput. Sci., Alberta Univ., Edmonton, Alta., Canada","institution_ids":["https://openalex.org/I154425047"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5053810473","display_name":"Janelle Harms","orcid":"https://orcid.org/0000-0003-0769-5709"},"institutions":[{"id":"https://openalex.org/I154425047","display_name":"University of Alberta","ror":"https://ror.org/0160cpw27","country_code":"CA","type":"education","lineage":["https://openalex.org/I154425047"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"J. Harms","raw_affiliation_strings":["Department of Computing Science, University of Alberta, Edmonton, AB, Canada","Dept. of Comput. Sci., Alberta Univ., Edmonton, Alta., Canada"],"affiliations":[{"raw_affiliation_string":"Department of Computing Science, University of Alberta, Edmonton, AB, Canada","institution_ids":["https://openalex.org/I154425047"]},{"raw_affiliation_string":"Dept. of Comput. Sci., Alberta Univ., Edmonton, Alta., Canada","institution_ids":["https://openalex.org/I154425047"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5077149145","display_name":"Robert C. Holte","orcid":null},"institutions":[{"id":"https://openalex.org/I154425047","display_name":"University of Alberta","ror":"https://ror.org/0160cpw27","country_code":"CA","type":"education","lineage":["https://openalex.org/I154425047"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"R. Holte","raw_affiliation_strings":["Department of Computing Science, University of Alberta, Edmonton, AB, Canada","Dept. of Comput. Sci., Alberta Univ., Edmonton, Alta., Canada"],"affiliations":[{"raw_affiliation_string":"Department of Computing Science, University of Alberta, Edmonton, AB, Canada","institution_ids":["https://openalex.org/I154425047"]},{"raw_affiliation_string":"Dept. of Comput. Sci., Alberta Univ., Edmonton, Alta., Canada","institution_ids":["https://openalex.org/I154425047"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5100674062"],"corresponding_institution_ids":["https://openalex.org/I154425047"],"apc_list":null,"apc_paid":null,"fwci":2.0223,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.86640732,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"3031","issue":null,"first_page":"71","last_page":"76"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9918000102043152,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9918000102043152,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10948","display_name":"Advanced Combinatorial Mathematics","score":0.9894000291824341,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9861000180244446,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/computer-science","display_name":"Computer science","score":0.7259758114814758},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.6433402299880981},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.6146578788757324},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5848522186279297},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5664384961128235},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5361312627792358},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5344321727752686},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.4851013422012329},{"id":"https://openalex.org/keywords/variation","display_name":"Variation (astronomy)","score":0.43595266342163086},{"id":"https://openalex.org/keywords/path-length","display_name":"Path length","score":0.4169473350048065},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.22122561931610107},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2195771336555481},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.19721999764442444},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.15335452556610107}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7259758114814758},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.6433402299880981},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.6146578788757324},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5848522186279297},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5664384961128235},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5361312627792358},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5344321727752686},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.4851013422012329},{"id":"https://openalex.org/C2778334786","wikidata":"https://www.wikidata.org/wiki/Q1586270","display_name":"Variation (astronomy)","level":2,"score":0.43595266342163086},{"id":"https://openalex.org/C129045301","wikidata":"https://www.wikidata.org/wiki/Q7144654","display_name":"Path length","level":2,"score":0.4169473350048065},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.22122561931610107},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2195771336555481},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.19721999764442444},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.15335452556610107},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C44870925","wikidata":"https://www.wikidata.org/wiki/Q37547","display_name":"Astrophysics","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/icccn.2005.1523811","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icccn.2005.1523811","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.72.3794","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.72.3794","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.ualberta.ca/~holte/Publications/icccn05_penalty.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1651117873","https://openalex.org/W1970701242","https://openalex.org/W1971443646","https://openalex.org/W1971529969","https://openalex.org/W1977545325","https://openalex.org/W1978615025","https://openalex.org/W2047553334","https://openalex.org/W2096655151","https://openalex.org/W2104254326","https://openalex.org/W2106007310","https://openalex.org/W2136558412","https://openalex.org/W2139054829","https://openalex.org/W2140409200","https://openalex.org/W2145818650","https://openalex.org/W2162311977","https://openalex.org/W2177058407","https://openalex.org/W2613173048","https://openalex.org/W3006630476","https://openalex.org/W4213060235","https://openalex.org/W4243471705","https://openalex.org/W4285719527","https://openalex.org/W6636807470","https://openalex.org/W6662263619"],"related_works":["https://openalex.org/W2108305519","https://openalex.org/W2347665962","https://openalex.org/W2138640781","https://openalex.org/W3035942111","https://openalex.org/W2162880363","https://openalex.org/W2351097701","https://openalex.org/W1971663816","https://openalex.org/W2555559350","https://openalex.org/W2001312276","https://openalex.org/W4237143639"],"abstract_inverted_index":{"Applegate":[0],"and":[1,44,60,71,106,146],"Cohen":[2],"(2003)":[3],"computational":[4],"complexity":[5],"design":[6],"demand":[7],"oblivious":[8,14,29,88,104,111],"routing":[9,30,151],"schemes":[10],"that":[11,160],"achieve":[12,139],"low":[13],"ratio":[15,105],"with":[16,31,39,50],"no":[17],"or":[18,157],"approximate":[19],"knowledge":[20],"of":[21,28,42,63,87,101,110,123,150,171],"traffic":[22,131],"demands.":[23],"We":[24,78],"investigate":[25],"the":[26,40,53,57,61,69,72,85,98,103,108,116,121,125,134,141,148,165],"quality":[27,86,109,149],"respect":[32],"to":[33,83,120,152,164],"path":[34,45,64],"dispersion,":[35],"which":[36,47],"is":[37,48],"concerned":[38,49],"number":[41],"paths;":[43],"variation,":[46],"how":[51],"far":[52],"paths":[54,59,159,167],"are":[55,74,161],"from":[56],"shortest":[58,166],"variation":[62,73],"lengths.":[65],"The":[66,90],"results":[67],"show":[68],"dispersion":[70],"high":[75],"in":[76],"general.":[77],"propose":[79],"a":[80,94,130],"penalty":[81,91,118,135],"method":[82,92,119],"improve":[84,147],"routing.":[89,112],"strikes":[93],"good":[95],"balance":[96],"between":[97,168],"conflicting":[99],"objectives":[100],"minimizing":[102,124],"optimizing":[107],"Moreover,":[113],"we":[114,137],"apply":[115],"simple":[117],"problem":[122],"maximum":[126,143],"link":[127,144],"utilization":[128],"given":[129],"matrix.":[132],"With":[133],"method,":[136],"can":[138],"almost":[140,153],"same":[142],"utilization,":[145],"perfect,":[154],"i.e.":[155],"one":[156],"two":[158],"very":[162],"close":[163],"each":[169],"pair":[170],"nodes.":[172]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}