Provably good routing in graphs: regular arrays
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Probabilistic construction of deterministic algorithms: approximating packing integer programs
Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
An Optimal Shortest-Path Routing Policy for Network Computers with Regular Mesh-Connected Topologies
IEEE Transactions on Computers
Introduction to algorithms
On-line load balancing with applications to machine scheduling and virtual circuit routing
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Methods for message routing in parallel machines
Theoretical Computer Science - Special issue on dependable parallel computing
Accessing nearby copies of replicated objects in a distributed environment
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
Online computation and competitive analysis
Online computation and competitive analysis
On-line routing in all-optical networks
Theoretical Computer Science
A Survey of Energy Efficient Network Protocols for Wireless Networks
Wireless Networks
Geometric spanner for routing in mobile networks
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Finding nearest neighbors in growth-restricted metrics
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Energy, congestion and dilation in radio networks
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Introduction to VLSI Systems
Competitive Source Routing on Tori and Meshes
ISAAC '97 Proceedings of the 8th International Symposium on Algorithms and Computation
Developments from a June 1996 seminar on Online algorithms: the state of the art
The intrinsic dimensionality of graphs
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Bounded Geometries, Fractals, and Low-Distortion Embeddings
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Guest editorial: energy-aware ad hoc wireless networks
IEEE Wireless Communications
Optimal Oblivious Path Selection on the Mesh
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Analyzing and characterizing small-world graphs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Oblivious routing on geometric networks
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Load balancing routing with bounded stretch
EURASIP Journal on Wireless Communications and Networking - Special issue on wireless network algorithms, systems, and applications
Covering space for in-network sensor data storage
Proceedings of the 9th ACM/IEEE International Conference on Information Processing in Sensor Networks
Balancing traffic load using one-turn rectilinear routing
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
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
Hi-index | 0.00 |
A graph has growth rate k if the number of nodes in any subgraph with diameter r is bounded by O(rk). The communication graphs of wireless networks and peer-to-peer networks often have small growth rate. In this paper we study the tradeoff between two quality measures for routing in growth restricted graphs. The two measures we consider are the stretch factor, which measures the lengths of the routing paths, and the load balancing ratio, which measures how evenly the traffic is distributed. We show that if the routing algorithm is required to use paths with stretch factor c, then its load balancing ratio is bounded by O((n/c)1-1/k), where k is the graph's growth rate. We illustrate our results by focusing on the unit disk graph for modeling wireless networks in which two nodes have direct communication if their distance is under certain threshold. We show that if the maximum density of the nodes is bounded by ρ, there exists routing scheme such that the stretch factor of routing paths is at most c, and the maximum load on the nodes is at most O(min(√ρn/c, n/c)) times the optimum. In addition, the bound on the load balancing ratio is tight in the worst case. As a special case, when the density is bounded by a constant, the shortest path routing has a load balancing ratio of O(√n). The result extends to k-dimensional unit ball graphs and graphs with growth rate k. We also discuss algorithmic issues for load balanced short path routing and for load balanced routing in spanner graphs.