Title :
Making Peer-to-Peer Anonymous Routing Resilient to Failures
Author :
Zhu, Yingwu ; Hu, Yiming
Author_Institution :
Dept. of CSSE, Seattle Univ., WA
Abstract :
One hurdle to using peer-to-peer networks as anonymizing networks is churn. Node churn makes anonymous paths fragile and short-lived: failures of a relay node disrupt the path, resulting in message loss and communication failures. To make anonymous routing resilient to node failures, we take two steps: (1) we use a simple yet powerful idea based on message redundancy by erasure coding and path redundancy to mask node failures; (2) we base mix choices of a path on node lifetime prediction and choose stable nodes as relay nodes, thereby prolonging single path durability. We present an allocation of erasure-coded message segments among multiple paths that provides a guideline on how to maximize routing resilience upon different node availabilities in real-world systems. Via detailed simulations, we compare routing resilience of our approach and existing anonymity protocols, showing that our approach greatly improves routing resilience while consuming modest bandwidth.
Keywords :
bandwidth allocation; peer-to-peer computing; routing protocols; telecommunication network reliability; anonymity protocol; bandwidth allocation; communication failure; message loss; peer-to-peer anonymous routing; Bandwidth; Guidelines; Multicast protocols; Peer to peer computing; Power system relaying; Relays; Resilience; Routing protocols; Telecommunication traffic; Traffic control;
Conference_Titel :
Parallel and Distributed Processing Symposium, 2007. IPDPS 2007. IEEE International
Conference_Location :
Long Beach, CA
Print_ISBN :
1-4244-0910-1
Electronic_ISBN :
1-4244-0910-1
DOI :
10.1109/IPDPS.2007.370283