Wired Geometric Routing

Routing substrates for overlay networks are an important building block for large distributed applications. Many existing substrates are based on a random identifier space and therefore do not respect node locality when routing data. This can lead to lower performance for locality-sensitive applications, such as web caching, distributed gaming, and resource discovery. This paper examines the problem of building a locality-aware routing substrate on top of a locality-based coordinate system, where the distance between coordinates approximates network latencies. As a starting point we take the scaled θ-routing proposal for geometric routing in a Euclidean space. We address the practical problems of forming routing tables with imperfect node knowledge and churn and examine query performance on non-Euclidean data sets.

[1]  Gregory G. Finn,et al.  Routing and Addressing Problems in Large Metropolitan-Scale Internetworks. ISI Research Report. , 1987 .

[2]  Ivan Stojmenovic,et al.  Routing with Guaranteed Delivery in Ad Hoc Wireless Networks , 1999, DIALM '99.

[3]  Brad Karp,et al.  Greedy Perimeter Stateless Routing for Wireless Networks , 2000 .

[4]  Jon M. Kleinberg,et al.  The small-world phenomenon: an algorithmic perspective , 2000, STOC '00.

[5]  Brad Karp,et al.  GPSR: greedy perimeter stateless routing for wireless networks , 2000, MobiCom '00.

[6]  Paul Francis,et al.  IDMaps: a global internet host distance estimation service , 2001, TNET.

[7]  David Peleg,et al.  Sparse communication networks and efficient routing in the plane , 2001, Distributed Computing.

[8]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[9]  S. Gribble,et al.  King: estimating latency between arbitrary internet end hosts , 2002, CCRV.

[10]  Hui Zhang,et al.  Predicting Internet network distance with coordinates-based approaches , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[11]  Marcel Waldvogel,et al.  Efficient topology-aware overlay network , 2003, CCRV.

[12]  Mark Crovella,et al.  Virtual landmarks for the internet , 2003, IMC '03.

[13]  Jon Crowcroft,et al.  Lighthouses for Scalable Distributed Location , 2003, IPTPS.

[14]  Ittai Abraham,et al.  Compact routing on euclidian metrics , 2004, PODC '04.

[15]  Moni Naor,et al.  Know Thy Neighbor's Neighbor: Better Routing for Skip-Graphs and Small Worlds , 2004, IPTPS.

[16]  Yuval Shavitt,et al.  Big-bang simulation for embedding network distances in Euclidean space , 2004, IEEE/ACM Transactions on Networking.

[17]  Robert Tappan Morris,et al.  Vivaldi: a decentralized network coordinate system , 2004, SIGCOMM '04.

[18]  Emin Gün Sirer,et al.  Meridian: a lightweight network location service without virtual coordinates , 2005, SIGCOMM '05.

[19]  Jon Crowcroft,et al.  On the accuracy of embeddings for internet coordinate systems , 2005, IMC '05.

[20]  Robert Tappan Morris,et al.  Geographic Routing Without Planarization , 2006, NSDI.

[21]  Sonia Fahmy,et al.  Impact of the Inaccuracy of Distance Prediction Algorithms on Internet Applications - an Analytical and Comparative Study , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[22]  Margo I. Seltzer,et al.  Stable and Accurate Network Coordinates , 2006, 26th IEEE International Conference on Distributed Computing Systems (ICDCS'06).

[23]  Margo I. Seltzer,et al.  Network Coordinates in the Wild , 2007, NSDI.