On the choice of a spanning tree for greedy embedding of network graphs
- 89 Downloads
Greedy embedding is a graph embedding that makes the simple greedy geometric packet forwarding successful for every source-destination pair. It is desirable that graph embeddings also yield low hop overhead (stretch) of the greedy paths over the corresponding shortest paths. In this paper we study how topological and geometric properties of embedded graphs influence the hop stretch. Based on the obtained insights, we design embedding heuristics that yield minimal hop stretch greedy embeddings and verify their effectiveness on models of synthetic graphs. Finally, we verify the effectiveness of our heuristics on instances of several classes of large, real-world network graphs.
Keywordsgreedy routing shortest path hyperbolic geometry network graph AS graph hop stretch
Unable to display preview. Download preview PDF.
- J. W. Anderson, Hyperbolic Geometry, 2nd ed. London: Springer, 2007.Google Scholar
- A. Cvetkovski and M. Crovella, “Hyperbolic embedding and routing for dynamic graphs,” in Proc. IEEE Infocom 2009, pp. 1647–1655.Google Scholar
- A. Cvetkovski and M. Crovella, “Low-stretch greedy embedding heuristics,” in 4th Int. Workshop Network Science for Communication Networks (NetSciCom’12), 2012, pp. 232–237. Orlando, USA.Google Scholar
- G. G. Finn, “Routing and addressing problems in large metropolitan-scale internetworks,” Technical Report ISI/RR-87-180, University of Southern California, Information Sciences Institute, 1987.Google Scholar
- S. Giordano, I. Stojmenovic, and L. Blazevic, “Position based routing algorithms for ad hoc networks: A taxonomy,” in Ad Hoc Wireless Networking, X. Chen, X. Huang, and D. Du, Eds. Boston: Kluwer, 2003, pp. 103–136.Google Scholar
- R. Kleinberg, “Geographic routing using hyperbolic space,” in Proc. IEEE Infocom 2007, pp. 1902–1909.Google Scholar
- B. Klimt and Y. Yang, “Introducing the Enron corpus,” presented at the 1st Conf. Email and Anti-Spam (CEAS), Mountain View, CA, USA, 2004.Google Scholar
- B. Leong, “New techniques for geographic routing,” Ph.D. thesis, Massachusetts Institute of Technology, Cambridge, USA, 2006.Google Scholar
- J. Leskovec, J. Kleinberg, and C. Faloutsos, “Graph evolution: Densification and shrinking diameters,” ACM Trans. Knowl. Discov. Data, vol. 1, no. 1, Article no. 2, Mar. 2007.Google Scholar
- P. Maymounkov, “Greedy embeddings, trees, and Euclidean vs. Lobachevsky geometry,” [online]. Available: http://pdos.csail.mit.edu/~petar/papers/maymounkov-greedy-prelim.pdf