Analysis of an Active Maintenance Algorithm for an O(1)-Hop Overlay

Author

Buford, John ; Brown, Alan ; Kolberg, Mario

Author_Institution

Avaya Labs Res., Lincroft

fYear

2007

fDate

26-30 Nov. 2007

Firstpage

81

Lastpage

86

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

peer-to-peer computing; telecommunication network routing; telecommunication traffic; EDRA active maintenance algorithm; latency reduction; one-hop overlay; peer-to-peer network; routing table; traffic maintenance; Algorithm design and analysis; Bandwidth; Costs; Delay; Event detection; Multicast protocols; Peer to peer computing; Routing; Telecommunication traffic; Traffic control;

fLanguage

English

Publisher

ieee

Conference_Titel

Global Telecommunications Conference, 2007. GLOBECOM '07. IEEE

Conference_Location

Washington, DC

Print_ISBN

978-1-4244-1042-2

Electronic_ISBN

978-1-4244-1043-9

Type

conf

DOI

10.1109/GLOCOM.2007.23

Filename

4410933