Scalable routing easy as PIE: A practical isometric embedding protocol

Proceedings - International Conference on Network Protocols, ICNP

Volumn , Issue , 2011, Pages 49-58

  Herzen, Julien ^a   Westphal, Cedric ^b   Thiran, Patrick ^a  

^a EPFL   (Switzerland)

^b DOCOMO Innovations Inc   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DELIVERY RATIO; GREEDY ROUTING; ISOMETRIC EMBEDDINGS; LOCAL COMMUNICATIONS; PACKET DELIVERY; POLYLOGARITHMIC; ROUTING SCALABILITY; ROUTING SCHEME; SCALABLE ROUTING; SHORT-PATH; SHORTEST PATH; STANDARD ALGORITHMS; STATE-OF-THE-ART ALGORITHMS; TOPOLOGICAL CHANGES; VIRTUAL COORDINATES;

ALGORITHMS; INTERNET; ROUTING PROTOCOLS; SCALABILITY;

INTERNET PROTOCOLS;

EID: 84055181430     PISSN: 10921648     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICNP.2011.6089081     Document Type: Conference Paper

References (41)

1. D. Meyer, L. Zhang, and K. Fall, "Report from the iab workshop on routing and addressing," http://tools.ietf.org/html/draft-iab-raws-report- 01.html, Feb. 2007.
2. C. Gavoille and M. Gengler, "Space-efficiency for routing schemes of stretch factor three," Journal of Parallel and Distributed Computing, vol. 61, pp. 61-679, 1997.
3. S. Milgram, "The small world problem," Psychology Today, vol. 2, pp. 60-67, 1967.
4. R. Pastor-Satorras and A. Vespignani, Evolution and Structure of the Internet: A Statistical Physics Approach. New York, NY, USA: Cambridge University Press, 2004.
5. C. Papadimitriou and D. Ratajczak, "On a conjecture related to geometric routing," Theoretical Computer Science, vol. 244, no. 1, 2005.
6. 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.
7. F. Dabek, R. Cox, F. Kaashoek, and R. Morris, "Vivaldi: a decentralized network coordinate system," SIGCOMM Comput. Commun. Rev., vol. 34, no. 4, pp. 15-26, 2004. (Pubitemid 40954866)
8. F. Kuhn, R. Wattenhofer, Y. Zhang, and A. Zollinger, "Geometric ad-hoc routing: of theory and practice," in PODC '03, 2003, pp. 63-72.
9. 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.
10. S. Subramanian, S. Shakkottai, and P. Gupta, "On optimal geographic routing in wireless networks with holes and non-uniform traffic," in Proceedings of Infocom, 2008.
11. P. Indyk and J. Matousek, "Low-distortion embeddings of finite metric spaces," in in Handbook of Discrete and Computational Geometry. CRC Press, 2004, pp. 177-196.
12. P. Maymounkov, "Greedy embeddings, trees and Euclidian vs. Lobachevsky geometry," Technical Report, available at http://pdos.csail. mit.edu/ petar/pubs.html, 2006.
13. A. Moitra and T. Leighton, "Some results on greedy embeddings in metric spaces," Foundations of Computer Science, Annual IEEE Symposium on, vol. 0, pp. 337-346, 2008.
14. R. Kleinberg, "Geographic routing using hyperbolic space," in Proceedings of Infocom, 2007.
15. A. Cvetkovski and M. Crovella, "Hyperbolic embedding and routing for dynamic graphs," in Proceedings of Infocom 2009, April 2009.
16. M. B. Fragkiskos Papadopoulos, Dmitri Krioukov and A. Vahdat, "Greedy forwarding in dynamic scale-free networks embedded in hyperbolic metric spaces," in Proceedings of Infocom, 2010.
17. M. Boguñá, F. Papadopoulos, and D. Krioukov, "Sustaining the Internet with hyperbolic mapping," Nature Communications, vol. 1, no. 6, pp. 1-8, September 2010.
18. C. Westphal and G. Pei, "Scalable routing via greedy embedding," in Proceedings of Infocom Mini-Conference, April 2009.
19. A. Gupta, A. Kumar, and R. Rastogi, "Traveling with a pez dispenser (or, routing issues in mpls)," SIAM J. Comput., vol. 34, no. 2, 2005.
20. R. Flury, S. Pemmaraju, and R. Wattenhofer, "Greedy routing with bounded stretch," in Proc. of Infocom, April 2009.
21. D. Krioukov, kc claffy, K. Fall, and A. Brady, "On compact routing for the Internet," SIGCOMM Comp. Comm. Rev., vol. 37, no. 3, 2007.
22. M. Thorup and U. Zwick, "Compact routing schemes," in ACM Symposium on Parallel Algorithms and Architectures, 2001, pp. 1-10.
23. Y. Mao, F. Wang, L. Qiu, S. Lam, and J. Smith, "S4: Small state and small stretch routing protocol for large wireless sensor networks," in Proceedings of the 4th USENIX NSDI 2007, April 2007.
24. A. Singla, P. B. Godfrey, K. Fall, G. Iannaccone, and S. Ratnasamy, "Scalable routing on flat names," in Proceedings of Co-NEXT, 2010.
25. W. Chen, C. Sommer, S.-H. Teng, and Y. Wang, "Compact routing in power-law graphs," in Proceedings of DISC'09, 2009, pp. 379-391.
26. A. Brady and L. Cowen, "Compact routing on power-law graphs with additive stretch," in ALENEX, 2006.
27. M. Caesar, M. Castro, E. Nightingale, G. O'Shea, and A. Rowstron, "Virtual Ring Routing: Network routing inspired by DHTs," in Proc. of ACM SIGCOMM'06, 2006, pp. 351-362.
28. M. Ghaffari, B. Hariri, and S. Shirmohammadi, "On the necessity of using Delaunay triangulation substrate in greedy routing based networks,"IEEE Communications Letters, vol. 14, no. 3, pp. 266-268, March 2010.
29. S. Lee, Z.-L. Zhang, S. Sahu, and D. Saha, "On suitability of Euclidean embedding for host-based network coordinate systems," Networking, IEEE/ACM Transactions on, vol. 18, no. 1, pp. 27-40, 2010.
30. N. Linial, E. London, and Y. Rabinovich, "The geometry of graphs and some of its algorithmic applications," Combinatorica, vol. 15, pp. 577-591, 1994.
31. R. Perlman, "An algorithm for distributed computation of a spanning tree in an extended LAN," ACM SIGCOMM Computer Communication Review, vol. 15, no. 4, pp. 44-53, 1985. (Pubitemid 16557703)
32. M. Faloutsos, P. Faloutsos, and C. Faloutsos, "On power-law relationships of the internet topology," in Proceedings of SIGCOMM '99. New York, NY, USA: ACM, 1999, pp. 251-262.
33. P. Mahadevan, D. Krioukov, M. Fomenkov, X. Dimitropoulos, k. c. claffy, and A. Vahdat, "The internet as-level topology: three data sources and one definitive metric," SIGCOMM Comp. Comm. Rev., 2006.
34. F. Chung and L. Lu, "The average distances in random graphs with given expected degrees," Internet Mathematics, vol. 1, pp. 15 879-15 882, 2002.
35. L. Li, D. Alderson, J. C. Doyle, and W. Willinger, "Towards a theory of scale-free graphs: Definition, properties, and implications," Internet Mathematics, vol. 2, p. 4, 2005.
36. F. Chung and L. Lu, "The diameter of random sparse graphs," in Advances in Applied Math, pp. 257-279.
37. Y. Shavitt and E. Shir, "Dimes: let the internet measure itself," SIGCOMM Comput. Commun. Rev., vol. 35, pp. 71-74, October 2005. (Pubitemid 46323482)
38. T. Bu and D. F. Towsley, "On distinguishing between internet power law topology generators," in Proc. of Infocom, 2002.
39. A.-L. Barabasi and R. Albert, "Emergence of scaling in random networks,"Science, vol. 286, no. 5439, pp. 509-512, 1999.
40. G. Bianconi and A.-L. Barabási, "Competition and multiscaling in evolving networks," Europhysics Letters, vol. 54, no. 4, p. 436, 2001.
41. J. Winick and S. Jamin, "Inet-3.0: Internet topology generator," Tech. Rep., 2002.