Subscribe
Issue No.02 - February (2009 vol.20)
pp: 171-179
Jie Gao , Stony Brook University, Stony Brook
Li Zhang , Microsoft Research Silicon Valley, Mountain View
ABSTRACT
An unweighted graph has density \rho and growth rate k if the number of nodes in every ball with radius r is bounded by \rho r^{k}. 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(\rho^{1/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.
INDEX TERMS
Routing, load balancing, wireless networks, growth-restricted graphs.
CITATION
Jie Gao, Li Zhang, "Trade-Offs between Stretch Factor and Load-Balancing Ratio in Routing on Growth-Restricted Graphs", IEEE Transactions on Parallel & Distributed Systems, vol.20, no. 2, pp. 171-179, February 2009, doi:10.1109/TPDS.2008.75
REFERENCES
 [1] I. Abraham, C. Gavoille, A.V. Goldberg, and D. Malkhi, “Routing in Networks with Low Doubling Dimension,” Proc. 26th IEEE Int'l Conf. Distributed Computing Systems (ICDCS '06), p. 75, 2006. [2] I. Abraham and D. Malkhi, “Name Independent Routing for Growth Bounded Networks,” Proc. 17th ACM Symp. Parallelism in Algorithms and Architectures (SPAA '05), pp. 49-55, 2005. [3] M. Andrews, D. Bhatia, T. Leighton, F. Makedon, C.H. Norton, and L. Zhang, “Improved Algorithms for Routing on Two-Dimensional Grids,” unpublished manuscript. [4] J. Aspnes, Y. Azar, A. Fiat, S. Plotkin, and O. Waarts, “On-Line Machine Scheduling with Applications to Load Balancing and Virtual Circuit Routing,” Proc. 25th Ann. ACM Symp. Theory of Computing (STOC '93), pp. 623-631, 1993. [5] B. Awerbuch, Y. Azar, and S.A. Plotkin, “Throughput-Competitive On-Line Routing,” Proc. 34th Ann. IEEE Symp. Foundations of Computer Science (FOCS '93), pp. 32-40, 1993. [6] Y. Azar, “On-Line Load Balancing,” On-line Algorithms: The State of the Art, A. Fiat and G. Woeginger, eds., LNCS 1442, pp. 178-195, Springer, 1998. [7] H. Badr and S. Podar, “An Optimal Shortest-Path Routing Policy for Network Computers with Regular Mesh-Connected Topologies,” IEEE Trans. Computers, vol. 38, no. 10, pp. 1362-1371, Oct. 1989. [8] Y. Bartal and S. Leonardi, “On-Line Routing in All-Optical Networks,” Theoretical Computer Science, vol. 221, nos. 1-2, pp. 19-39, 1999. [9] A. Borodin and R. El-Yaniv, Online Computation and Competitive Analysis. Cambridge Univ. Press, 1998. [10] T.H. Cormen, C.E. Leiserson, and R.L. Rivest, Introduction to Algorithms. MIT Press, 1994. [11] E.W. Dijkstra, “A Note on Two Problems in Connexion with Graphs,” Numerische Mathematik, vol. 1, pp. 269-271, 1959. [12] D. Eppstein, “Spanning Trees and Spanners,” Handbook of Computational Geometry, J.-R. Sack and J. Urrutia, eds., North-Holland, 2000. [13] S. Even, A. Itai, and A. Shamir, “On the Complexity of Timetable and Multicommodity Flow Problems,” SIAM J. Computing, vol. 5, pp. 691-703, 1976. [14] J. Gao, L.J. Guibas, J. Hershberger, L. Zhang, and A. Zhu, “Geometric Spanners for Routing in Mobile Networks,” IEEE J.Selected Areas in Comm., special issue on Wireless Ad Hoc Networks, vol. 23, no. 1, pp. 174-185, 2005. [15] J. Gao and L. Zhang, “Load Balanced Short Path Routing in Wireless Networks,” IEEE Trans. Parallel and Distributed Systems, special issue on Localized Comm., vol. 17, no. 4, pp. 377-388, Apr. 2006. [16] “Special Issue: Energy-Aware Ad Hoc Wireless Networks,” IEEE Wireless Comm., A. Goldsmith and S. Wicker, eds., vol. 9, Aug. 2002. [17] A. Gupta, R. Krauthgamer, and J.R. Lee, “Bounded Geometries, Fractals, and Low-Distortion Embeddings,” Proc. 44th Ann. IEEE Symp. Foundations of Computer Science (FOCS '03), pp. 534-543, 2003. [18] K. Hildrum, R. Krauthgamer, and J. Kubiatowicz, “Object Location in Realistic Networks,” Proc. 16th ACM Symp. Parallelism in Algorithms and Architectures (SPAA '04), pp. 25-35, 2004. [19] C.E. Jones, K.M. Sivalingam, P. Agrawal, and J.-C. Chen, “A Survey of Energy Efficient Network Protocols for Wireless Networks,” Wireless Networks, vol. 7, no. 4, pp. 343-358, 2001. [20] D. Karger and M. Ruhl, “Find Nearest Neighbors in Growth-Restricted Metrics,” Proc. 34th ACM Symp. Theory of Computing (STOC '02), pp. 741-750, 2002. [21] J. Kleinberg, “Approximation Algorithms for Disjoint Paths Problems,” PhD dissertation, Dept. of EECS, MIT, 1996. [22] G. Konjevod, A.W. Richa, and D. Xia, “Optimal-Stretch Name-Independent Compact Routing in Doubling Metrics,” Proc. 25th Ann. ACM Symp. Principles of Distributed Computing (PODC '06), pp. 198-207, 2006. [23] G. Konjevod, A.W. Richa, D. Xia, and H. Yu, “Compact Routing with Slack in Low Doubling Dimension,” Proc. 26th Ann. ACM Symp. Principles of Distributed Computing (PODC '07), pp. 71-80, 2007. [24] G. Konjevod, A.W. Richa, D. Xia, and H. Yu, “Optimal Scale-Free Compact Routing Schemes in Networks of Low Doubling Dimension,” Proc. 18th Ann. ACM-SIAM Symp. Discrete Algorithms (SODA '07), pp. 939-948, 2007. [25] F. Kuhn and A. Zollinger, “Ad-Hoc Networks Beyond Unit Disk Graphs,” Proc. Joint Workshop Foundations of Mobile Computing, pp. 69-78, 2003. [26] F.T. Leighton, B.M. Maggs, and S.B. Rao, “Packet Routing and Job-Shop Scheduling in O(congestion$+$ dilation) Steps,” Combinatorica, vol. 14, pp. 167-186, 1994. [27] T. Leighton, “Methods for Message Routing in Parallel Machines,” Theoretical Computer Science, vol. 128, nos. 1-2, pp. 31-62, 1994. [28] X.-Y. Li, G. Calinescu, and P.-J. Wan, “Distributed Construction of Planar Spanner and Routing for Ad Hoc Networks,” Proc. IEEE INFOCOM '02, pp. 1268-1277, 2002. [29] N. Linial, E. London, and Y. Rabinovich, “The Geometry of Graphs and Some of Its Algorithmic Applications,” Combinatorica, vol. 15, pp. 215-245, 1995. [30] C. Mead and L. Conway, Introduction to VLSI Systems. Addison-Wesley, 1980. [31] F. Meyer auf de Heide, C. Schindelhauer, K. Volbert, and M. Grünewald, “Energy, Congestion and Dilation in Radio Networks,” Proc. 14th ACM Symp. Parallelism in Algorithms and Architectures (SPAA '02), pp. 230-237, 2002. [32] E. Ng and H. Zhang, “Predicting Internet Network Distance with Coordinates-Based Approaches,” Proc. IEEE INFOCOM '02, pp. 170-179, 2002. [33] C.G. Plaxton, R. Rajaraman, and A.W. Richa, “Accessing Nearby Copies of Replicated Objects in a Distributed Environment,” Proc. Ninth ACM Symp. Parallelism in Algorithms and Architectures (SPAA '97), pp. 311-320, 1997. [34] P. Raghavan, “Probabilistic Construction of Deterministic Algorithms: Approximating Packing Integer Programs,” J. Computer and System Sciences, pp. 130-143, 1988. [35] P. Raghavan and C.D. Thompson, “Provably Good Routing in Graphs: Regular Arrays,” Proc. 17th Ann. ACM Symp. Theory of Computing (STOC '85), pp. 79-87, 1985. [36] T.-H. Yeh, C.-M. Kuo, C.-L. Lei, and H.-C. Yen, “Competitive Source Routing on Tori and Meshes,” Proc. Int'l Symp. Algorithms and Computation (ISAAC '97), pp. 82-91, 1997.