Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Wide-area cooperative storage with CFS
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Chord: a scalable peer-to-peer lookup protocol for internet applications
IEEE/ACM Transactions on Networking (TON)
Security Considerations for Peer-to-Peer Distributed Hash Tables
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Incrementally improving lookup latency in distributed hash table systems
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
The impact of DHT routing geometry on resilience and proximity
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
RChord: An Enhanced Chord System Resilient to Routing Attacks
ICCNMC '03 Proceedings of the 2003 International Conference on Computer Networks and Mobile Computing
Exploiting Routing Redundancy via Structured Peer-to-Peer Overlays
ICNP '03 Proceedings of the 11th IEEE International Conference on Network Protocols
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Vulnerabilities and Security Threats in Structured Overlay Networks: A Quantitative Analysis
ACSAC '04 Proceedings of the 20th Annual Computer Security Applications Conference
Secure routing for structured peer-to-peer overlay networks
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
Low traffic overlay networks with large routing tables
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Degree-Optimal Deterministic Routing for P2P Systems
ISCC '05 Proceedings of the 10th IEEE Symposium on Computers and Communications
A Novel Methodology for Constructing Secure Multipath Overlays
IEEE Internet Computing
Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience
IEEE/ACM Transactions on Networking (TON)
Analytical Study on Improving DHT Lookup Performance under Churn
P2P '06 Proceedings of the Sixth IEEE International Conference on Peer-to-Peer Computing
Minimizing churn in distributed systems
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
A Bidirectional Query Chord System Based on Latency-Sensitivity
GCC '06 Proceedings of the Fifth International Conference on Grid and Cooperative Computing
ATEC '04 Proceedings of the annual conference on USENIX Annual Technical Conference
Bandwidth-efficient management of DHT routing tables
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
Non-transitive connectivity and DHTs
WORLDS'05 Proceedings of the 2nd conference on Real, Large Distributed Systems - Volume 2
Optimizing the finger tables in Chord-like DHTs
Concurrency and Computation: Practice & Experience - Hot Topics in Peer-to-Peer Systems (HoTP2P2006)
Enhanced Chord-Based Routing Protocol Using Neighbors' Neighbors Links
AINAW '08 Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops
Building a Low-latency, Proximity-aware DHT-Based P2P Network
KSE '09 Proceedings of the 2009 International Conference on Knowledge and Systems Engineering
HPSR'09 Proceedings of the 15th international conference on High Performance Switching and Routing
Making chord robust to byzantine attacks
ESA'05 Proceedings of the 13th annual European conference on Algorithms
ESORICS'05 Proceedings of the 10th European conference on Research in Computer Security
| Hi-index | 0.00 |
Distributed Hash Tables (DHTs) provide a useful key-to-value lookup service for many Internet applications. However, without additional mechanisms DHTs are vulnerable to attacks. In particular, previous research showed that Chord is not well resistant to malicious nodes that joined the DHT. We introduce the cyclic routing algorithm as an extension of Chord (CR-Chord). Using simulations we compare the lookup availability of Chord and CR-Chord. The results suggest that CR-Chord improves the lookup availability on the average by 1.4 times. When the number of malicious nodes is small, such as 5%, CR-Chord has almost twice lower lookup failure rate.