loading...
Resilient P2P Anonymous Routing by Using Redu
Shenyang, China August 01-August 03
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/IWNAS.2006.402006 International Workshop on Networ ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Yingwu Zhu, Seattle University, WA
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 use a simple yet powerful idea based on message redundancy by erasure coding and path redundancy to mask node failures. 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. Our approach allows a tradeoff between routing resilience and bandwidth usage. We show that our approach greatly improves routing resilience while only incurring a moderate bandwidth overhead.
Citation:
Yingwu Zhu, "Resilient P2P Anonymous Routing by Using Redu," iwnas, pp.103-110, 2006 International Workshop on Networking, Architecture, and Storages (IWNAS'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.