Tradeoffs between stretch factor and load balancing ratio in routing on growth restricted graphs

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn 23, Issue , 2004, Pages 189-196

  Gao, Jie ^a   Zhang, Li ^b  

^a Stanford University   (United States)

^b HEWLETT PACKARD LABORATORIES   (United States)

Author keywords

Growth restricted graphs; Load balancing; Routing; Wireless networks

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; PROBLEM SOLVING; THEOREM PROVING; TREES (MATHEMATICS);

GROWTH RESTRICTED GRAPHS; LOAD BALANCING; TRANSMISSION DELAY;

WIRELESS TELECOMMUNICATION SYSTEMS;

EID: 10444282000     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1011767.1011795     Document Type: Conference Paper

References (27)

1. M. Andrews, D. Bhatia, T. Leighton, F. Makedon, C. H. Norton, and L. Zhang. Improved algorithms for routing on two-dimensional grids. Unpublished.
2. R. K. Anupam Gupta and J. R. Lee. Bounded geometries, fractals, and low-distortion embeddings. In Proc. 44th Symposium on Foundations of Computer Science (FOCS '03), pages 534-543, 2003.
3. J. Aspnes, Y. Azar, A. Fiat, S. Plotkin, and O. Waarts. Online machine scheduling with applications to load balancing and virtual circuit routing. In Proc. 25th ACM Symposium on Theory of Computing, pages 623-631, 1993.
4. B. Awerbuch, Y. Azar, and S. A. Plotkin. Throughput-competitive on-line routing. In IEEE Symposium on Foundations of Computer Science, pages 32-40, 1993.
5. Y. Azar. On-line load balancing. In A. Fiat and G. Woeginger, editors, On-line Algorithms: The State of the Art, pages 178-195. LNCS 1442, Springer, 1998.
6. H. Badr and S. Podar. An optimal shortest-path routing policy for network computers with regular mesh-connected topologies. IEEE Transactions on Computers, 38(10): 1362-1371, 1989.
7. Y. Bartal and S. Leonardi. On-line routing in all-optical networks. Theoretical Computer Science, 221(1-2): 19-39, 1999.
8. A. Borodin and R. El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, 1998.
9. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. MIT Press, 1994.
10. D. Eppstein. Spanning trees and spanners. In J.-R. Sack and J. Urrutia, editors, Handbook of Computational Geometry. North-Holland, 2000.
11. J. Gao, L. Guibas, J. Hershberger, L. Zhang, and A. Zhu. Discrete mobile centers. Discrete and Computational Geometry, 30(1):45-63, 2003.
12. J. Gao, L. J. Guibas, J. Hershberger, L. Zhang, and A. Zhu. Geometric spanner for routing in mobile networks. In Proc. 2nd ACM Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc 01'), pages 45-55, 2001.
13. J. Gao and L. Zhang. Load balanced short path routing in wireless networks. In Proc. IEEE INFOCOM'04, 2004.
14. A. Goldsmith and S. Wicker, editors. Special Issue: Energy-aware ad hoc wireless networks, volume 9. IEEE Wireless Comm., Auguest 2002.
15. C. E. Jones, K. M. Sivalingam, P. Agrawal, and J.-C. Chen. A survey of energy efficient network protocols for wireless networks. Wireless Networks, 7(4):343-358, 2001.
16. D. Karger and M. Ruhl. Find nearest neighbors in growth-restricted metrics. In Proc. ACM Symposium on Theory of Computing, pages 741-750, 2002.
17. R. Krauthgamer and J. R. Lee. The intrinsic dimensionality of graphs. In Proceedings of the 35th ACM symposium on Theory of computing, pages 438-447. ACM Press, 2003.
18. F. T. Leighton, B. M. Maggs, and S. B. Rao. Packet routing and job-shop scheduling in O(congestion+dilation) steps. Combinatorica, 14:167-186, 1994.
19. T. Leighton. Methods for message routing in parallel machines. Theoretical Computer Science, 128(1-2):31-62, 1994.
20. X.-Y. Li, G. Calinescu, and P.-J. Wan. Distributed construction of planar spanner and routing for ad hoc networks. In IEEE INFOCOM, pages 1268 - 1277, 2002.
21. C. Mead and L. Conway. Introduction to VLSI systems. Addison-Wesley, 1980.
22. F. Meyer auf de Heide, C. Schindelhauer, K. Volbert, and M. Grünewald. Energy, congestion and dilation in radio networks. In Proceedings of the 14th ACM symposium on Parallel algorithms and architectures, pages 230-237. ACM Press, 2002.
23. E. Ng and H. Zhang. Predicting Internet network distance with coordinates-based approaches. In Proc. IEEE INFO-COM, pages 170-179, 2002.
24. C. G. Plaxton, R. Rajaraman, and A. W. Richa. Accessing nearby copies of replicated objects in a distributed environment. In Proc. ACM Symposium on Parallel Algorithms and Architectures, pages 311-320, 1997.
25. P. Raghavan. Probabilistic construction of deterministic algorithms: approximating packing integer programs. J. Comp. and System Sciences, pages 130-143, 1988.
26. P. Raghavan and C. D. Thompson. Provably good routing in graphs: regular arrays. In Proceedings of the 17th annual ACM Symposium on Theory of Computing, pages 79-87, 1985.
27. T.-H. Yeh, C.-M. Kuo, C.-L. Lei, and H.-C. Yen. Competitive source routing on tori and meshes. In ISAAC: 8th International Symposium on Algorithms and Computation, pages 82-91, 1997.