Skip to main content
Journal Article

F-Chord: Improved uniform routing on Chord (extended abstract)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2004) 3104 89-98
DOI: 10.1007/978-3-540-27796-5_9
14Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

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. © Springer-Verlag Berlin Heidelberg 2004.

Cite

CITATION STYLE

APA

Cordasco, G., Gargano, L., Hammar, M., Negro, A., & Scarano, V. (2004). F-Chord: Improved uniform routing on Chord (extended abstract). Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3104, 89–98. https://doi.org/10.1007/978-3-540-27796-5_9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free