Analysis of an active maintenance algorithm for an O(1)-Hop overlay

Citation

Buford J, Brown A & Kolberg M (2007) Analysis of an active maintenance algorithm for an O(1)-Hop overlay. In: GLOBECOM '07 - IEEE Global Telecommunications Conference 2007. GLOBECOM '07. IEEE Global Telecommunications Conference, 2007, Washington, DC, USA, 26.11.2007-30.11.2007. Piscataway, NJ: IEEE, pp. 81-86. http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=4410933&abstractAccess=no&userType=inst

Abstract
One-hop overlays offer significant latency reduction compared to multi-hop overlays, but at a cost of increased maintenance traffic and routing table size. Recently the EDRA maintenance algorithm has been proposed and shown analytically to give low maintenance traffic compared to other active maintenance one-hop overlays. We identify issues with EDRA which lead to incorrect event detection and propagation. We define EDRA* fixing these issues and show through simulation EDRA* is stable, and compare the performance of EDRA* with the opportunistic maintenance mechanism of EpiChord.

Keywords
overlay network; overlay maintenance; peer-to-peer; EDRA