Sciweavers

SASO
2009
IEEE

Self-organized Fault-tolerant Routing in Peer-to-Peer Overlays

14 years 6 months ago
Self-organized Fault-tolerant Routing in Peer-to-Peer Overlays
—In sufficiently large heterogeneous overlays message loss and delays are likely to occur. This has a significant impact on overlay routing, especially on longer paths. The existing solutions to this problem rely on message redundancy to mask the loss and delays. This incurs a significant bandwidth cost. We propose the Forward Feedback Protocol (FFP) which only routes a single copy of the message and detects the message loss and excessive delays while routing. Failures are signalled along the routing paths. Based only on the simple binary signals, each overlay node locally and independently learns to route to avoid failures. The local node interactions lead to the emergence of fast reliable overlay routes. This is a continuous process, the system constantly self-organizes in response to changing delay and loss conditions. We evaluate the protocol in the Internet deployment and in simulation. Our system uses 2-5 times less bandwidth than the existing overlay routing approaches that...
Wojciech Galuba, Karl Aberer, Zoran Despotovic, Wo
Added 21 May 2010
Updated 21 May 2010
Type Conference
Year 2009
Where SASO
Authors Wojciech Galuba, Karl Aberer, Zoran Despotovic, Wolfgang Kellerer
Comments (0)