Sciweavers

Share
INFOCOM
2012
IEEE

Low-stretch greedy embedding heuristics

8 years 1 months ago
Low-stretch greedy embedding heuristics
—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.
Andrej Cvetkovski, Mark Crovella
Added 28 Sep 2012
Updated 28 Sep 2012
Type Journal
Year 2012
Where INFOCOM
Authors Andrej Cvetkovski, Mark Crovella
Comments (0)
books