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.

• Type: Journal
• Year: 2012
• Where: INFOCOM
• Authors: Andrej Cvetkovski, Mark Crovella
• Keywords: Communications, Geometric Properties, Greedy Packet, INFOCOM 2012, Source Destination Pair