Living Will for Resilient Structured Overlay Networks

Kimihiro MIZUTANI  Takeru INOUE  Toru MANO  Osamu AKASHI  Satoshi MATSUURA  Kazutoshi FUJIKAWA  

Publication
IEICE TRANSACTIONS on Communications   Vol.E99-B   No.4   pp.830-840
Publication Date: 2016/04/01
Online ISSN: 1745-1345
DOI: 10.1587/transcom.2015ADP0011
Type of Manuscript: Special Section PAPER (Special Section on Autonomous Decentralized Systems Technologies and Applications for Next-Generation Social Infrastructure)
Category: 
Keyword: 
fault tolerance,  churn,  structured overlay network,  peer to peer,  

Full Text: PDF(2.9MB)>>
Buy this Article




Summary: 
The routing efficiency of structured overlay networks depends on the consistency of pointers between nodes, where a pointer maps a node identifier to the corresponding address. 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 discover any failure among the pointing nodes, which allow them to fix the pointers in a short time. Overlay nodes are, however, required to maintain backpointers for every pointing node, which incurs significant memory and consistency check overhead. This paper proposes a novel light-weight protocol; an overlay node gives a “living will” containing its acquaintances (backpointers) only to its successor, thus other nodes are freed from the need to maintain it. Our carefully-designed protocol guarantees that all acquaintances are registered via the living will, even in the presence of churn, and the successor notifies the acquaintances for the deceased. Even if the successor passes away and the living will is lost, the successor to the successor can identify the acquaintances with a high success ratio. Simulations show that our protocol greatly reduces memory overhead as well as the detection time for node failure with the cost being a slight increase in messaging load.