TY - GEN
T1 - An implementation and its evaluation of a framework for managing states of nodes among structured overlay networks
AU - Mizutani, Kimihiro
AU - Matsuura, Satoshi
AU - Doi, Shinichi
AU - Fujikawa, Kazutoshi
AU - Sunahara, Hideki
PY - 2010
Y1 - 2010
N2 - Structured overlay networks are widely used as platforms for distributed systems. However, in a high churn situation, it is highly costly to maintain the structure and service availability of an overlay network because there is a limitation in churn handling. Several cooperation mechanisms among overlay networks are proposed to improve service availability of overlay networks in a high-churn situation. Several cooperation mechanisms are proposed among overlay networks. The cooperation mechanisms can group structured overlay networks to simplify routing functions. However, the existing mechanisms do not consider managing churn information among overlay networks. In this paper, we propose a new framework that can share states of the nodes and spread churn information to neighbor nodes among different overlay networks. Using our framework, we are able to maintain each overlay network effectively and improve the reachability of messages under churn. We evaluate our framework with Chord, Kademlia, and Pastry. Our framework improves the detection time of churn by about 30% and decreases the stabilization messages by about 30-40%. We discuss combinatorial effects of the sharing state of the nodes among different overlay networks.
AB - Structured overlay networks are widely used as platforms for distributed systems. However, in a high churn situation, it is highly costly to maintain the structure and service availability of an overlay network because there is a limitation in churn handling. Several cooperation mechanisms among overlay networks are proposed to improve service availability of overlay networks in a high-churn situation. Several cooperation mechanisms are proposed among overlay networks. The cooperation mechanisms can group structured overlay networks to simplify routing functions. However, the existing mechanisms do not consider managing churn information among overlay networks. In this paper, we propose a new framework that can share states of the nodes and spread churn information to neighbor nodes among different overlay networks. Using our framework, we are able to maintain each overlay network effectively and improve the reachability of messages under churn. We evaluate our framework with Chord, Kademlia, and Pastry. Our framework improves the detection time of churn by about 30% and decreases the stabilization messages by about 30-40%. We discuss combinatorial effects of the sharing state of the nodes among different overlay networks.
KW - Churn handling management
KW - Multiple overlay networks
KW - Peer to peer networks
UR - http://www.scopus.com/inward/record.url?scp=77953079142&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=77953079142&partnerID=8YFLogxK
U2 - 10.1109/ICNS.2010.46
DO - 10.1109/ICNS.2010.46
M3 - Conference contribution
AN - SCOPUS:77953079142
SN - 9780769539690
T3 - 6th International Conference on Networking and Services, ICNS 2010, Includes LMPCNA 2010; INTENSIVE 2010
SP - 282
EP - 287
BT - 6th International Conference on Networking and Services, ICNS 2010, Includes LMPCNA 2010; INTENSIVE 2010
T2 - 6th International Conference on Networking and Services, ICNS 2010, Includes LMPCNA 2010; INTENSIVE 2010
Y2 - 7 March 2010 through 13 March 2010
ER -