{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T23:30:28Z","timestamp":1648855828972},"reference-count":12,"publisher":"World Scientific Pub Co Pte Lt","issue":"01n02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Inter. Net."],"published-print":{"date-parts":[[2009,3]]},"abstract":"<jats:p> We consider the problem of load-balanced routing, where a dense network is modelled by a continuous square region, and origin-destination node pairs correspond to pairs of points in that region. The objective is to define a routing policy that assigns a continuous path to each origin-destination pair while minimizing the traffic, or load, passing through any single point. While the average load is minimized by straight-line routing, such a routing policy distributes the load non-uniformly, resulting in higher load near the center of the region. We consider one-turn rectilinear routing policies that divert traffic away from regions of heavier load, resulting in up to a 33% reduction in the maximum load while simultaneously increasing the path lengths by an average of less than 28%. Our policies are simple to implement, being both local and oblivious. We provide a lower bound that shows that no one-turn rectilinear routing policy can reduce the maximum load by more than 39% and we give a polynomial-time procedure for approximating the optimal randomized policy. <\/jats:p>","DOI":"10.1142\/s0219265909002455","type":"journal-article","created":{"date-parts":[[2009,9,1]],"date-time":"2009-09-01T11:33:49Z","timestamp":1251804829000},"page":"93-120","source":"Crossref","is-referenced-by-count":4,"title":["BALANCING TRAFFIC LOAD USING ONE-TURN RECTILINEAR ROUTING"],"prefix":"10.1142","volume":"10","author":[{"given":"STEPHANE","family":"DUROCHER","sequence":"first","affiliation":[{"name":"Department of Computer Science, University of Manitoba, Winnipeg, Manitoba, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"EVANGELOS","family":"KRANAKIS","sequence":"additional","affiliation":[{"name":"School of Computer Science, Carleton University, Ottawa, Ontario, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"DANNY","family":"KRIZANC","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Computer Science, Wesleyan University, Middletown, Connecticut, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"LATA","family":"NARAYANAN","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Concordia University, Montr\u00e9al, Qu\u00e9bec, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2012,4,30]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2006.06.010"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1012319418150"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1987.1057290"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.2307\/2687522"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1109\/18.825799"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(89)90022-X"},{"key":"rf13","first-page":"680","volume":"6","author":"Hyyti\u00e4 E.","journal-title":"IEEE Transactions on Mobile Computing"},{"key":"rf15","first-page":"1","volume":"2007","author":"Hyyti\u00e4 E.","journal-title":"EURASIP Journal on Wireless Communications and Networking"},{"key":"rf27","doi-asserted-by":"publisher","DOI":"10.1137\/0406033"},{"key":"rf28","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511617331"},{"key":"rf29","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2002.1018018"},{"key":"rf30","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2007.08.011"}],"container-title":["Journal of Interconnection Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0219265909002455","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T18:04:49Z","timestamp":1565114689000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0219265909002455"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,3]]},"references-count":12,"journal-issue":{"issue":"01n02","published-online":{"date-parts":[[2012,4,30]]},"published-print":{"date-parts":[[2009,3]]}},"alternative-id":["10.1142\/S0219265909002455"],"URL":"https:\/\/doi.org\/10.1142\/s0219265909002455","relation":{},"ISSN":["0219-2659","1793-6713"],"issn-type":[{"value":"0219-2659","type":"print"},{"value":"1793-6713","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,3]]}}}