Scalable routing via greedy embedding

Proceedings - IEEE INFOCOM

Volumn , Issue , 2009, Pages 2826-2830

  Westphal, Cedric ^a   Pei, Guanhong ^b  

^a DOCOMO USA LABS   (United States)

^b VIRGINIA POLYTECHNIC INSTITUTE AND STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EUCLIDIAN SPACE; EXTENSIVE SIMULATIONS; GEOGRAPHIC ROUTING; GREEDY ALGORITHMS; GREEDY FORWARDING; POLYLOGARITHMIC; PRACTICAL ALGORITHMS; RANDOM PROJECTIONS; SCALABLE ROUTING;

ROUTING ALGORITHMS;

EID: 70349667695     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2009.5062240     Document Type: Conference Paper

References (21)

1. A. Rao, S. Ratnasamy, C. Papadimitriou, S. Shenker, and I. Stoica, "Geographic routing without location information," in Proceedings of ACM MobiCom, 2003, pp. 96-108.
2. P. Maymounkov, "Greedy embeddings, trees and Euclidian vs. Lobachevsky geometry," Technical Report, available at http://pdos.csail. mit.edu/petar/pubs.html, 2006.
3. R. Kleinberg, "Geographic routing using hyperbolic space," in Proceedings of IEEE Infocom, 2007.
4. C. Papadimitriou and D. Ratajczak, "On a conjecture related to geometric routing," Theoretical Computer Science, vol. 244, no. 1, pp. 3-14, 2005.
5. T. Leighton and A. Moitra, "Some results on greedy embeddings in metric spaces," in private communication, to appear in FOCS'08.
6. B. Leong, B. Liskov, and R. Morris, "Greedy virtual coordinates for geographic routing," in Proceedings of lCNP, October 2007, pp. 71-80.
7. B. Karp and H. T. Kung, "GPSR: greedy perimeter stateless routing for wireless networks," in Proceedings of ACM Mobicom, August 2000, pp. 243-254.
8. B. W. L. Leong, "New techniques for geographic routing," Ph.D. dissertation, MIT, May 2006.
9. Y.-J. Kim, R. Govindan, B. Karp, and S. Shenker, "Geographic routing made practical," in Proceedings of NSDI'05, May 2005.
10. S. Subramanian, S. Shakkottai, and P. Gupta, "On optimal geographic routing in wireless networks with holes and non-uniform traffic," in Proceedings of IEEE Infocom, 2008.
11. S. Durocher, D. Kirkpatrick, and L. Naranayan, "On routing with guaranteed delivery in three-dimensional ad hoc wireless newtorks," in Proceedings of ICDNC, 2008, pp. 546-557.
12. R. Flury and R. Wattenhofer, "Randomized 3D geographic routing," in Proceedings of IEEE Infocom, 2008.
13. D. Krioukov, K. Fall, and X. Yang, "Compact routing on Internet-like graphs," in Proceedings of IEEE INFOCOM'04, March 2004.
14. M. Thorup and U. Zwick, "Compact routing schemes," in ACM Symposium on Parallel Algorithms and Architectures, 2001, pp. 1-10.
15. C. Gavoille and M. Gengler, "Space-efficiency of routing schemes of stretch factor three," Journal of Parallel and Distributed Computing, vol. 61, no. 5, pp. 679-687, 2001.
16. W. Johnson and J. Lindenstrauss, "Extensions of lipschitz maps into a hilbert space," Contemporary Mathematics, vol. 26, pp. 189-206, 1984.
17. D. Achlioptas, "Database-friendly random projections: Johnson-Lindenstrauss with binary coins," Journal of Computer and System Sciences, vol. 66, no. 4, pp. 671-687, June 2003.
18. R. Perlman, "An algorithm for distributed computation of a spanning tree in an extended LAN," ACM SIGCOMM Computer Communication Review, vol. 15, no. 4, p. 4453, 1985.
19. C. Westphal and G. Pei, "Scalable routing via greedy embedding," Technical Report, Docomo Labs USA, August 2008.
20. A.-L. Barabasi and R. Albert, "Emergence of scaling in random networks," Science, vol. 286.
21. B. M. Waxman, "Routing of multipoint connections," IEEE Journal on Selected Areas in Communications, vol. 6, no. 9, pp. 1617-1622, December 1988.