Trade-Offs between Stretch Factor and Load-Balancing Ratio in Routing on Growth-Restricted Graphs

An unweighted graph has density rho and growth rate k if the number of nodes in every ball with radius r is bounded by rhork. The communication graphs of wireless networks and peer-to-peer networks often have constant bounded density and small growth rate. In this paper, we study the trade-off 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 the evenness of the traffic distribution. 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(rho1/k(n/c)1-1/k), and the bound is tight in the worst case. We show the application and extension of the trade-off to the wireless network routing and VLSI layout design. We also present a load-balanced routing algorithm with the stretch factor constraint in an online setting, in which the routing requests come one by one.

[1]  Leonidas J. Guibas,et al.  Geometric spanners for routing in mobile networks , 2005 .

[2]  Ittai Abraham,et al.  Name independent routing for growth bounded networks , 2005, SPAA '05.

[3]  Aravind Srinivasan,et al.  A Constant-Factor Approximation Algorithm for Packet Routing and Balancing Local vs. Global Criteria , 2000, SIAM J. Comput..

[4]  Stephen B. Wicker,et al.  Guest editorial: energy-aware ad hoc wireless networks , 2002 .

[5]  Andrew V. Goldberg,et al.  Routing in Networks with Low Doubling Dimension , 2006, 26th IEEE International Conference on Distributed Computing Systems (ICDCS'06).

[6]  Andréa W. Richa,et al.  Optimal scale-free compact routing schemes in networks of low doubling dimension , 2007, SODA '07.

[7]  Stefano Leonardi,et al.  On-Line Routing in All-Optical Networks , 1997, Theor. Comput. Sci..

[8]  Xiang-Yang Li,et al.  Distributed construction of a planar spanner and routing for ad hoc wireless networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[9]  Hai Yu,et al.  Compact routing with slack in low doubling dimension , 2007, PODC '07.

[10]  Allan Borodin,et al.  Online computation and competitive analysis , 1998 .

[11]  Robert Krauthgamer,et al.  The intrinsic dimensionality of graphs , 2003, STOC '03.

[12]  Bruce M. Maggs,et al.  Packet routing and job-shop scheduling inO(congestion+dilation) steps , 1994, Comb..

[13]  Friedhelm Meyer auf der Heide,et al.  Energy, congestion and dilation in radio networks , 2002, SPAA '02.

[14]  Jon M. Kleinberg,et al.  Approximation algorithms for disjoint paths problems , 1996 .

[15]  Lynn Conway,et al.  Introduction to VLSI systems , 1978 .

[16]  Chin-Laung Lei,et al.  Competitive Source Routing on Tori and Meshes , 1997, ISAAC.

[17]  Rajmohan Rajaraman,et al.  Accessing Nearby Copies of Replicated Objects in a Distributed Environment , 1997, SPAA '97.

[18]  Alon Itai,et al.  On the Complexity of Timetable and Multicommodity Flow Problems , 1976, SIAM J. Comput..

[19]  Prabhakar Raghavan,et al.  Provably good routing in graphs: regular arrays , 1985, STOC '85.

[20]  Hussein G. Badr,et al.  An Optimal Shortest-Path Routing Policy for Network Computers with Regular Mesh-Connected Topologies , 1989, IEEE Trans. Computers.

[21]  Leonidas J. Guibas,et al.  Discrete mobile centers , 2001, SCG '01.

[22]  Amos Fiat,et al.  On-line load balancing with applications to machine scheduling and virtual circuit routing , 1993, STOC.

[23]  Prabhakar Raghavan,et al.  Probabilistic construction of deterministic algorithms: Approximating packing integer programs , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[24]  Charles J. Colbourn,et al.  Unit disk graphs , 1991, Discret. Math..

[25]  Robert Krauthgamer,et al.  Bounded geometries, fractals, and low-distortion embeddings , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[26]  Frank Thomson Leighton,et al.  Methods for message routing in parallel machines , 1992, STOC '92.

[27]  David R. Karger,et al.  Finding nearest neighbors in growth-restricted metrics , 2002, STOC '02.

[28]  Dinesh Bhatia,et al.  Improved Algorithms for Routing on Two-Dimensional Grids , 1992, WG.

[29]  Andréa W. Richa,et al.  Optimal-stretch name-independent compact routing in doubling metrics , 2006, PODC '06.

[30]  Jie Gao,et al.  Load-balanced short-path routing in wireless networks , 2006, IEEE Transactions on Parallel and Distributed Systems.

[31]  Robert Krauthgamer,et al.  Object location in realistic networks , 2004, SPAA '04.

[32]  Yossi Azar.  On-line Load Balancing , 1996, Online Algorithms.

[33]  Yossi Azar,et al.  Throughput-competitive on-line routing , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[34]  L.J. Guibas,et al.  Geometric spanners for routing in mobile networks , 2001, IEEE Journal on Selected Areas in Communications.

[35]  Krishna M. Sivalingam,et al.  A Survey of Energy Efficient Network Protocols for Wireless Networks , 2001, Wirel. Networks.

[36]  David Eppstein,et al.  Spanning Trees and Spanners , 2000, Handbook of Computational Geometry.

[37]  Hui Zhang,et al.  Predicting Internet network distance with coordinates-based approaches , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[38]  Fabian Kuhn,et al.  Ad-hoc networks beyond unit disk graphs , 2003, DIALM-POMC '03.

[39]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.