A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf
.
Low-stretch greedy embedding heuristics
2012
2012 Proceedings IEEE INFOCOM Workshops
Greedy embedding is a graph embedding that makes the simple greedy packet forwarding scheme successful for every source-destination pair. It is desirable that graph embeddings also yield low hop stretch of the greedy over the 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 construct embedding heuristics that yield minimal hop stretch greedy embeddings.
doi:10.1109/infcomw.2012.6193497
dblp:conf/infocom/CvetkovskiC12
fatcat:a4vsg6drpzc2bndhra3bcbb7fm