Abstract
We propose a family of novel schemes based on Chord retaining all positive aspects that made Chord a popular topology for routing in P2P networks. The schemes, based on the Fibonacci number system, allow to improve on the maximum/average number of hops for lookups and the routing table size per node.
Work partially supported by EU RTN project ARACNE and by Italian FIRB project WebMinds.
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
Druschel, P., Rowstron, A.: Pastry: Scalable, distribute object location and routing for large-scale peer-to-peer systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, p. 329. Springer, Heidelberg (2001)
Du, D.-Z., Hwang, F.K.: Combinatorial Group testing and its applications. World Scientific, Singapore (2000)
Kapoor, S., Reingold, E.M.: Optimum Lopsided Binary Trees. Journal of ACM 36(3), 573–590 (1989)
Kaashoek, M.F., Krager, D.R.: Koorde: A simple degree-optimal distributed hash table. In: IPTPS (2003)
Ganesan, P., Manku, G.S.: Optimal Routing in Chord. In: Proc. of SODA (2004) (to appear)
Graham, R., Patashnik, O., Knuth, D.E.: Concrete Mathematics. Addison-Wesley, Reading (1994)
Kumar, A., Merugu, S., Xu, J., Yu, X.: Ulysses, A Robust, Low-Diameter, Low- Latency Peer-to-peer Network. In: The Proc. of IEEE Inter. Conf. on Network Protocols (ICNP 2003), Atlanta (November 2003) (to appear)
Manku, G.S., Naor, M., Wieder, U.: Know thy Neighbor’s Neighbor: The Power of Lookahead in Randomized P2P Networks. In: Proc. of STOC (2004) (to appear)
D. Malkhi, M. Naor, Ratajczak, V.: A Scalable and Dynamic Emulation of the Butterfly. in Proceedings of the 21st ACM Symposium on Principles of Distributed Computing (PODC 2002), Aug. 2002.
Naor, M., Wieder, U.: A Simple Fault Tolerant Distributed Hash Table. In: IPTPS (February 2003)
Naor, M., Wieder, U.: Novel architectures for p2p applications: the ontinousdiscrete approach. In: Proc. of 15th ACM Symp. on Parallel Algorithms and Architectures, SPAA (2003)
Naor, M., Wieder, U.: Know thy Neighbor’s Neighbor: Better Routing for Skip- Graphs and Small Worlds. In: Voelker, G.M., Shenker, S. (eds.) IPTPS 2004. LNCS, vol. 3279, pp. 269–277. Springer, Heidelberg (2005)
Ratnasamy, S., Shenker, S., Stoica, I.: Routing Algorithms for DHTs: Some Open Questions. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, p. 45. Springer, Heidelberg (2002)
Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content-addressable network. In: Proc. ACM SIGCOMM (August 2001)
Stoica, I., Morris, R., Liben-Nowell, D., Karger, D.R., Kaashoek, M.F., Dabek, F., Balakrishnan, H.: Chord: A Scalable Peer-to-peer Lookup Protocol for Internet Applications. IEEE/ACM Trans. on Networking (2003)
Xu, J.: On the Fundamental Tradeoffs between Routing Table Size and Network Diameter in Peer-to-Peer Networks. In: The Proc. of IEEE INFOCOM (May 2003)
Zhao, B.Y., Kubiatowicz, J., Joseph, A.: Tapestry: An infrastructure for aulttolerant wide-area location and routing. Tech. Rep. UCB/CSD-01-1141, University of California at Berkeley, Computer Science Department (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cordasco, G., Gargano, L., Hammar, M., Negro, A., Scarano, V. (2004). F-Chord: Improved Uniform Routing on Chord. In: Královic̆, R., Sýkora, O. (eds) Structural Information and Communication Complexity. SIROCCO 2004. Lecture Notes in Computer Science, vol 3104. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27796-5_9
Download citation
DOI: https://doi.org/10.1007/978-3-540-27796-5_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22230-9
Online ISBN: 978-3-540-27796-5
eBook Packages: Springer Book Archive