Scalable Routing Via Greedy Embedding

Abstract—We investigate the construction of greedy embeddings in polylogarithmic dimensional Euclidian spaces in order to achieve scalable routing through geographic routing. We propose a practical algorithm which uses random projection to achieve greedy forwarding on a space of dimension O(log(n)) where nodes have coordinates of size O(log(n)), thus achieving greedy forwarding using a route table at each node of polylogarithmic size with respect to the number of nodes. We further improve this algorithm by using a quasi-greedy algorithm which ensures greedy forwarding works along a path-wise construction, allowing us to further reduce the dimension of the embedding. The proposed algorithm, denoted GLoVE-U, is fully distributed and practical to implement. We evaluate the performance using extensive simulations and show that our greedy forwarding algorithm delivers low path stretch and scales properly.

• Type: Conference
• Year: 2009
• Where: INFOCOM
• Authors: Cédric Westphal, Guanhong Pei
• Keywords: Algorithm, Communications, Greedy Forwarding, Greedy Forwarding Algorithm, INFOCOM 2009