Balancing traffic load using one-turn rectilinear routing

Authors:
Stephane Durocher;Evangelos Kranakis;Danny Krizanc;Lata Narayanan
Affiliations:
School of Computer Science, University of Waterloo, Waterloo, Ontario, Canada;School of Computer Science, Carleton University, Ottawa, Ontario, Canada;Department of Mathematics and Computer Science, Wesleyan University, Middletown, Connecticut;Department of Computer Science, Concordia University, Montréal, Québec, Canada
Venue:
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Year:
2008

Citing 12
Cited 3

The forwarding index of communication networks

IEEE Transactions on Information Theory
On forwarding indices of networks

Discrete Applied Mathematics
Capacity of Ad Hoc wireless networks

Proceedings of the 7th annual international conference on Mobile computing and networking
Routing with guaranteed delivery in ad hoc wireless networks

Wireless Networks
Energy, congestion and dilation in radio networks

Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks

INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Tradeoffs between stretch factor and load balancing ratio in routing on growth restricted graphs

Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Oblivious routing on geometric networks

Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Spatial Node Distribution of the Random Waypoint Mobility Model with Applications

IEEE Transactions on Mobile Computing
Balancing traffic load in wireless networks with curveball routing

Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
The capacity of wireless networks

IEEE Transactions on Information Theory
Position-based routing in ad hoc networks

IEEE Communications Magazine

Continuum equilibria and global optimization for routing in dense static ad hoc networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
On average and maximum load of greedy routing in wireless ad hoc networks

WONS'10 Proceedings of the 7th international conference on Wireless on-demand network systems and services
Centrality-based power control for hot-spot mitigation in multi-hop wireless networks

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of load-balanced routing, where a dense network is modelled by a continuous square region and origin and destination nodes 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 nonuniformly, 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.