Summary
Asia-Pacific Conference on Communications
2015
Session Number:16-AM2-E
Session:
Number:16-AM2-E-2
Testaments for Resilient Structured Overlay Networks
Kimihiro Mizutani, Takeru Inoue, Toru Mano, Osamu Akashi, Satoshi Matsuura, Kazutoshi Fujikawa,
pp.514-518
Publication Date:2015/10/14
Online ISSN:2188-5079
DOI:10.34385/proc.28.16-AM2-E-2
Summary:
The routing efficiency of structured overlay networks depends on the consistency of pointers between nodes. This consistency can, however, break temporarily when some overlay nodes fail, since it takes time to repair the broken pointers in a distributed manner. Conventional solutions utilize “backpointers” to quickly know the failure among the pointing nodes, which allows them to fix the pointers in a short time. Overlay nodes are, however, required to maintain backpointers for every pointing node which incurs significant consistency check and memory overheads. This paper proposes a novel light-weight protocol; an overlay node gives a “testament” containing its acquaintances (backpointers) only to its successor (i.e., clockwise closest node), and other nodes are freed from maintaining it. Our carefully-designed protocol guarantees that all acquaintances are registered with the testament even in the presence of churn, and the successor notifies the acquaintances for the deceased. Even if the successor passes away and the testament is lost, the successor of the successor can identify the acquaintances at a high success ratio. Simulations show that our protocol greatly reduces the mean time to repair (MTTR) and memory overheads while messaging cost increases.