Randomized algorithms
Chord: a scalable peer-to-peer lookup protocol for internet applications
IEEE/ACM Transactions on Networking (TON)
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Secure routing for structured peer-to-peer overlay networks
ACM SIGOPS Operating Systems Review - OSDI '02: Proceedings of the 5th symposium on Operating systems design and implementation
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
A Novel Methodology for Constructing Secure Multipath Overlays
IEEE Internet Computing
The Effect of Replica Placement on Routing Robustness in Distributed Hash Tables
P2P '06 Proceedings of the Sixth IEEE International Conference on Peer-to-Peer Computing
Robust random number generation for peer-to-peer systems
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
DHT routing using social links
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
Exploring the Feasibility of Reputation Models for Improving P2P Routing under Churn
Euro-Par '09 Proceedings of the 15th International Euro-Par Conference on Parallel Processing
Secure routing strategies in DHT-based systems
Globe'10 Proceedings of the Third international conference on Data management in grid and peer-to-peer systems
Sophia: A local trust system to secure key-based routing in non-deterministic DHTs
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
The provisioning of techniques for secure message forwarding over Distributed Hash Tables has been a research concern for a long time. Several techniques have been developed and evaluated, but typically each based on the increase of redundancy as a defense against data forwarding attacks. Although the security vigor of these solutions, they have left the scalability aspect largely unaddressed, as the weak peers may not support the congestion caused by the increase on redundancy. In this article, we take the opposite tack and discuss why improving the quality of delivery paths can achieve a resilience comparable to redundant routing. To prove our intuition, we confront the two strategies and develop a representative algorithm of each category. Further, we validate our work using two other existing protocols that increase redundancy (more independent paths) to fortify routing. Our results reveal that improving the quality of paths can be as effective as increasing redundancy but with minimum overhead.