Designing low cost networks with short routes and low congestion

Proceedings - IEEE INFOCOM

Volumn , Issue , 2006, Pages

  Nguyen, Van ^a   Martel, Charles ^a  

^a University of California Davis   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DESIGNING LOW COST NETWORKS; FRUITFUL APPROACH; GRID GRAPH;

AD HOC NETWORKS; CONGESTION CONTROL (COMMUNICATION); MATHEMATICAL MODELS; OPTIMIZATION; ROUTING ALGORITHMS;

COMPUTER NETWORKS;

EID: 39049100572     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFOCOM.2006.254     Document Type: Conference Paper

References (29)

1. I. Abraham and D. Malkhi, "Compact routing on euclidean metrics," in Proc. of ACM Symp. on Princ, of Dist. Comp. (PODC), 2004.
2. I. Abraham, D. Malkhi, and O. Dobzinski, "Land: Stretch (1+e) localityaware networks for dhts," in Proc. of ACM Symp. on Discrete Algorithms (SODA), 2004.
3. S. Arya, G. Das, D. Mount, J. Salowe, and M. Smid, "Euclidean spanners: short, thin, and lanky," in Proc. of ACM Symp. on Theory of Computing (STOC), 1995.
4. R. Banner and A. Orda, "Multiparth routing algorithms for congestion minimization," in NETWORKING, Waterloo, Canada, 2005, pp. 536-548.
5. H. Chan, A. Gupta, B. Maggs, and S. Zhou, "On hierarchical routing in doubling metrics," in Proc. of ACM Symp. on Discrete Algorithms (SODA), 2005.
6. C. Chang, T. Sung, and L. Hsu, "Edge congestion and topological properties of crossed cubes," IEEE Trans. Parallel Distrib. Syst., vol. 11, no. 1, Jan. 2000.
7. C. Fiduccia and P. Hedrick, "Edge congestion of shortest path systems for all-to-all communication," IEEE Trans. Parallel Distrib. Syst., vol. 8, no. 10, Oct. 1997.
8. J. Gao and L. Zhang, "Tradeoffs between stretch factor and load balancing ratio in routing on growth restrict graphs," in Proc. of ACM Symp. on Princ. of Dist. Comp. (PODC), 2004.
9. A. Gupta, R. Krauthgamer, and J. R. Lee, "Bounded geometries, fractals, and low-distortion embeddings," in IEEE Symp. on Found, of Comp. Sci. (FOCS), 2003, pp. 534-43.
10. P. Gupta and P. Kumar, "The capacity of wireless networks," IEEE Trans. Inform. Theory, vol. 46, no. 2, pp. 388-404, 2000.
11. A. Helmy, "Small worlds in wireless networks," IEEE Commun. Lett., vol. 7, no. 10, pp. 490-492, Oct. 2003.
12. M. Heydemann, J. Meyer, and D. Stotteau, "On forwarding indices of networks," vol. 23, pp. 103-123, 1989.
13. X. Jia, D. Li, and D. Du, "Qos topology control in ad hoc wireless networks," in IEEE INFOCOM, 2004.
14. A. Kamath, O. Palmon, and S. Plotkin, "Fast approximation algorithm for minimum cost multicommodity flow," in Proc. of ACM Symp. on Discrete Algorithms (SODA), 1995.
15. J. Kleinberg, "The small-world phenomenon: An algorithmic perspec-tive," in Proc. of ACM Symp. on Theory of Computing (STOC), 2000.
16. L. Kleinrock and F. Kamoun, "Hierarchical routing for large networks, performance evaluation and optimization," Computer Networks, vol. 1, no. 3, pp. 155-174, Jan. 1977.
17. P. Kolman and C. Scheideler, "Improved bounds for the unsplittable flow problem," in Proc. of ACM Symp. on Discrete Algorithms (SODA), 2002, pp. 184-193.
18. T. Leighton and S. Rao, "An approximate maxflow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms," in IEEE Symp. on Found, of Comp. Sci. (FOCS), 1988, pp. 422-431.
19. D. Loguinov, V. R. A. Kumar, and S. Ganesh, "Graph-theoretic anal-ysis of structured peer-to-peer systems: Routing distances and fault resilience."
20. D. Malkhi, M. Naor, and D. Ratajczak, "Viceroy: A scalable and dynamic emulation of the butterfly," in Proc. of ACM Symp. on Princ. of Dist. Comp. (PODC), 2002, pp. 183-192.
21. C. Martel and V. Nguyen, "Analyzing kleinberg's (and other) smallworld models," in Proc. of ACM Symp. on Princ. of Dist. Comp. (PODC), 2004.
22. E. Ng and H. Zhang, "Predicting internet network distance with coordinates-based approaches," in Proc. of ACM Symp. on Parallel Algo. and Arch. (SPAA), 2002.
23. V. Nguyen and C. Martel, "Analyzing and characterizing small-world graphs," in Proc. of ACM Symp. on Discrete Algorithms (SODA), 2005.
24. _. (2005) Designing networks for low weight, small routing diameter and low congestion. [Online], Available: http://wwwesif.cs.ucdavis.edu/ nguyenvk//
25. A. Reznik, S. R. Kulkarni, and S. Verdu, "A small world approach to heterogeneous networks," Communications in Information and Systems, vol. 3, no. 4, pp. 325-348, 2004.
26. Z. Sen, "An optimal broadcasting schema for multidimensional mesh structures," in Proc. of ACM Symp. on Applied Computing, 2003.
27. F. Shahrokhi and D. W. Matula, "The maximum concurrent flow problem," Journal of the ACM (JACM), vol. 37, no. 2, pp. 318-334, 1990.
28. R. Srikant, "Models and methods for analyzing internet congestion control algorithms," in Advances in Communication Control Networks, ser. Lecture Notes in Control and Information Sciences (LCNCIS), C. Abdallah, J. Chiasson, and S. Tarbouriech, Eds. New York: Springer-Verlag, 2004.
29. J. Xu, A. Kumar, and X. Yu, "On the fundamental tradeoffs between routing table size and network diameter in peer-to-peer networks," IEEE J. Select. Areas Commun., vol. 22, no. 1, pp. 151-163, Jan. 2004.