{"id":"https://openalex.org/W2069471802","doi":"https://doi.org/10.1142/s0219265909002455","title":"BALANCING TRAFFIC LOAD USING ONE-TURN RECTILINEAR ROUTING","display_name":"BALANCING TRAFFIC LOAD USING ONE-TURN RECTILINEAR ROUTING","publication_year":2009,"publication_date":"2009-03-01","ids":{"openalex":"https://openalex.org/W2069471802","doi":"https://doi.org/10.1142/s0219265909002455","mag":"2069471802"},"language":"en","primary_location":{"id":"doi:10.1142/s0219265909002455","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0219265909002455","pdf_url":null,"source":{"id":"https://openalex.org/S63112013","display_name":"Journal of Interconnection Networks","issn_l":"0219-2659","issn":["0219-2659","1793-6713"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Interconnection Networks","raw_type":"journal-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/A5068826527","display_name":"St\u00e9phane Durocher","orcid":"https://orcid.org/0000-0002-6589-3538"},"institutions":[{"id":"https://openalex.org/I46247651","display_name":"University of Manitoba","ror":"https://ror.org/02gfys938","country_code":"CA","type":"education","lineage":["https://openalex.org/I46247651"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"STEPHANE DUROCHER","raw_affiliation_strings":["Department of Computer Science, University of Manitoba, Winnipeg, Manitoba, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Manitoba, Winnipeg, Manitoba, Canada","institution_ids":["https://openalex.org/I46247651"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5003125546","display_name":"Evangelos Kranakis","orcid":"https://orcid.org/0000-0002-8959-4428"},"institutions":[{"id":"https://openalex.org/I67031392","display_name":"Carleton University","ror":"https://ror.org/02qtvee93","country_code":"CA","type":"education","lineage":["https://openalex.org/I67031392"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"EVANGELOS KRANAKIS","raw_affiliation_strings":["School of Computer Science, Carleton University, Ottawa, Ontario, Canada","[School of Computer Science, Carleton University, Ottawa, Ontario, Canada]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science, Carleton University, Ottawa, Ontario, Canada","institution_ids":["https://openalex.org/I67031392"]},{"raw_affiliation_string":"[School of Computer Science, Carleton University, Ottawa, Ontario, Canada]","institution_ids":["https://openalex.org/I67031392"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5058262792","display_name":"Danny Kriz\u0327anc","orcid":"https://orcid.org/0000-0002-0941-4010"},"institutions":[{"id":"https://openalex.org/I100538780","display_name":"Wesleyan University","ror":"https://ror.org/05h7xva58","country_code":"US","type":"education","lineage":["https://openalex.org/I100538780"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"DANNY KRIZANC","raw_affiliation_strings":["Department of Mathematics and Computer Science, Wesleyan University, Middletown, Connecticut, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Wesleyan University, Middletown, Connecticut, USA","institution_ids":["https://openalex.org/I100538780"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5067542317","display_name":"Lata Narayanan","orcid":"https://orcid.org/0000-0002-3875-0371"},"institutions":[{"id":"https://openalex.org/I60158472","display_name":"Concordia University","ror":"https://ror.org/0420zvk78","country_code":"CA","type":"education","lineage":["https://openalex.org/I60158472"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"LATA NARAYANAN","raw_affiliation_strings":["Department of Computer Science, Concordia University, Montr\u00e9al, Qu\u00e9bec, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Concordia University, Montr\u00e9al, Qu\u00e9bec, Canada","institution_ids":["https://openalex.org/I60158472"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.4249,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.82915258,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"10","issue":"01n02","first_page":"93","last_page":"120"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","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/T10246","display_name":"Mobile Ad Hoc Networks","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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9991999864578247,"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/T11158","display_name":"Wireless Networks and Protocols","score":0.9988999962806702,"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/computer-science","display_name":"Computer science","score":0.6512335538864136},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.6117045879364014},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.5847170352935791},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.5813081860542297},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5185247659683228},{"id":"https://openalex.org/keywords/load-balancing","display_name":"Load balancing (electrical power)","score":0.4939616322517395},{"id":"https://openalex.org/keywords/path-vector-protocol","display_name":"Path vector protocol","score":0.4605381488800049},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.4100736975669861},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3758293092250824},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.367509663105011},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.3570719361305237},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2684798538684845},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.24750149250030518},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.19605693221092224},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.11089527606964111},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.0929768979549408}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6512335538864136},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.6117045879364014},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.5847170352935791},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.5813081860542297},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5185247659683228},{"id":"https://openalex.org/C138959212","wikidata":"https://www.wikidata.org/wiki/Q1806783","display_name":"Load balancing (electrical power)","level":3,"score":0.4939616322517395},{"id":"https://openalex.org/C128917274","wikidata":"https://www.wikidata.org/wiki/Q1666535","display_name":"Path vector protocol","level":5,"score":0.4605381488800049},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.4100736975669861},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3758293092250824},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.367509663105011},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3570719361305237},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2684798538684845},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.24750149250030518},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.19605693221092224},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.11089527606964111},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.0929768979549408}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0219265909002455","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0219265909002455","pdf_url":null,"source":{"id":"https://openalex.org/S63112013","display_name":"Journal of Interconnection Networks","issn_l":"0219-2659","issn":["0219-2659","1793-6713"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Interconnection Networks","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.4300000071525574,"id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1975667020","https://openalex.org/W1996931690","https://openalex.org/W2086928157","https://openalex.org/W2088001786","https://openalex.org/W2092084750","https://openalex.org/W2137775453","https://openalex.org/W2145885111","https://openalex.org/W2156689181","https://openalex.org/W2163443433","https://openalex.org/W2912156624","https://openalex.org/W4200386182","https://openalex.org/W4237533755","https://openalex.org/W4250474159"],"related_works":["https://openalex.org/W2108305519","https://openalex.org/W1242343826","https://openalex.org/W1971663816","https://openalex.org/W4241849776","https://openalex.org/W2113362813","https://openalex.org/W2182195922","https://openalex.org/W1604456419","https://openalex.org/W2147023937","https://openalex.org/W2076807978","https://openalex.org/W2188009667"],"abstract_inverted_index":{"We":[0,85,135],"consider":[1,86],"the":[2,49,59,72,80,83,108,114,150,165],"problem":[3],"of":[4,25,82,97,120],"load-balanced":[5],"routing,":[6,66],"where":[7],"a":[8,14,35,40,68,104,137,160],"dense":[9],"network":[10],"is":[11,32,62],"modelled":[12],"by":[13,64,117,153],"continuous":[15,41],"square":[16],"region,":[17],"and":[18,133,157],"origin-destination":[19,45],"node":[20],"pairs":[21,24],"correspond":[22],"to":[23,33,43,103,128],"points":[26],"in":[27,76,101,107],"that":[28,38,91,140,142],"region.":[29,84],"The":[30],"objective":[31],"define":[34],"routing":[36,69,89,146],"policy":[37,70,147],"assigns":[39],"path":[42,115],"each":[44],"pair":[46],"while":[47,111],"minimizing":[48],"traffic,":[50],"or":[51],"load,":[52,99],"passing":[53],"through":[54],"any":[55],"single":[56],"point.":[57],"While":[58],"average":[60,119],"load":[61,73,78,110,152],"minimized":[63],"straight-line":[65],"such":[67],"distributes":[71],"non-uniformly,":[74],"resulting":[75,100],"higher":[77],"near":[79],"center":[81],"one-turn":[87,144],"rectilinear":[88,145],"policies":[90,125],"divert":[92],"traffic":[93],"away":[94],"from":[95],"regions":[96],"heavier":[98],"up":[102],"33%":[105],"reduction":[106],"maximum":[109,151],"simultaneously":[112],"increasing":[113],"lengths":[116],"an":[118],"less":[121],"than":[122,155],"28%.":[123],"Our":[124],"are":[126],"simple":[127],"implement,":[129],"being":[130],"both":[131],"local":[132],"oblivious.":[134],"provide":[136],"lower":[138],"bound":[139],"shows":[141],"no":[143],"can":[148],"reduce":[149],"more":[154],"39%":[156],"we":[158],"give":[159],"polynomial-time":[161],"procedure":[162],"for":[163],"approximating":[164],"optimal":[166],"randomized":[167],"policy.":[168]},"counts_by_year":[{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}