Abstract
We investigate an approach for routing in p2p networks called neighbor-of-neighbor greedy. We show that this approach may reduce significantly the number of hops used, when routing in skip graphs and small worlds. Furthermore we show that a simple variation of Chord is degree optimal. Our algorithm is implemented on top of the conventional greedy algorithms, thus it maintains the good properties of greedy routing. Implementing it may only improve the performance of the system.
Research supported in part by the RAND/APX grant from the EU Program IST
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aspnes, J., Diamadi, Z., Shah, G.: Fault-tolerant routing in peer-topeer systems. In: Proceedings of the twenty-first symposium on Principles of distributed computing (PODC), pp. 223–232 (2002)
Aspnes, J., Shah, G.: Skip graphs. In: Fourteenth ACM SIAM Symposium on Discrete Algorithms (SODA), pp. 384–393 (2003)
Coppersmith, D., Gamarnik, D., Sviridenko, M.: The diameter of a long-range percolation graph. Random Structures and Algorithms 21(1), 1–13 (2002)
Fraigniaud, P., Gauron, P.: The content-addressable network d2b. Technical Report LRI 1349, Univ. Paris-Sud (2003)
Ganesan, P., Manku, G.S.: Optimal routing in chord. In: Fifteenth ACM SIAM Symposium on Discrete Algorithms, SODA (2004)
Harvey, N., Dunagan, J., Jones, M.B., Saroiu, S., Theimer, M., Wolman, A.: Skipnet: A scalable overlay network with practical locality properties. In: 4th USENIX Symposium on Internet Technologies and Systems, USITS (2003)
Harvey, N., Ian Munro, J.: Deterministic skipnet. In: Twenty Second Annual ACM Syposium on Priciples of Distributed Computing (PODC), pp. 152–153 (2003)
Kaashoek, F., Karger, D.R.: Koorde: A simple degree-optimal distributed hash table. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol. 2735, Springer, Heidelberg (2003)
Kleinberg, J.: The Small-World phenomenon: An algorithmic perspective. In: Proceedings of the 32nd ACM Symposium on Theory of Computing, STOC (2000)
Manku, G.S., Bawa, M., Raghavan, P.: Symphony: Distributed hashing in a small world. In: 4th USENIX Symposium on Internet Technologies and Systems, USITS (2003)
Manku, G.S., Naor, M., Wieder, U.: Know thy neighbor’s neighbor: the power of lookahead in randomized p2p networks. In: STOC (2004)
Minsky, Y., Trachtenberg, A.: Practical set reconciliation. Technical Report 2002-03, Boston University (2002)
Naor, M., Wieder, U.: Novel architectures for p2p applications: the continuous-discrete approach. In: Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures SPAA, pp. 50–59 (2003)
Rowstron, A., Druschel, P.: Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, pp. 329–350. Springer, Heidelberg (2001)
Stoica, I., Morris, R., Karger, D., Kaashoek, F., Balakrishnan, F.D.H.: Chord: A scalable Peer-To-Peer lookup service for internet applications. Technical Report TR-819, MIT LCS (2001)
Zhao, B.Y., Kubiatowicz, J.D., Joseph, A.D.: Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Technical Report UCB/CSD-01-1141, UC Berkeley (April 2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Naor, M., Wieder, U. (2005). Know Thy Neighbor’s Neighbor: Better Routing for Skip-Graphs and Small Worlds. In: Voelker, G.M., Shenker, S. (eds) Peer-to-Peer Systems III. IPTPS 2004. Lecture Notes in Computer Science, vol 3279. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30183-7_26
Download citation
DOI: https://doi.org/10.1007/978-3-540-30183-7_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24252-9
Online ISBN: 978-3-540-30183-7
eBook Packages: Computer ScienceComputer Science (R0)