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 prope...

Full description

Saved in:
Bibliographic Details
Published in2012 Proceedings IEEE INFOCOM Workshops pp. 232 - 237
Main Authors Cvetkovski, A., Crovella, M.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.03.2012
Subjects
Communication networks
Computer science
Correlation
Extraterrestrial measurements
Routing
Topology
Wireless communication
Online AccessGet full text

Cover

More Information
Summary: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.
ISBN:1467310166
9781467310161
DOI:10.1109/INFCOMW.2012.6193497