TY - GEN
T1 - A semi-structured overlay network for large-scale peer-to-peer systems
AU - Kimura, Kousaku
AU - Amamiya, Satoshi
AU - Mine, Tsunenori
AU - Amamiya, Makoto
PY - 2012/9/3
Y1 - 2012/9/3
N2 - Peer-to-peer (P2P) communication and computing frameworks are important for constructing robust large-scale distributed systems. Overlay network systems use distributed hash-table (DHT) to provide scalable and efficient node search capabilities. However, the DHT-based method has a problem for the maintenance cost of dynamically changing large-scale-network, in which nodes are frequently joining and leaving. This paper proposes a novel technique of P2P communication path management. The proposed technique devises a robust semi-structured overlay network called Ordered Tree with Tuft (OTT for short). OTT provides not only efficient node searching, but also low-cost self-maintenance capabilities for the dynamically changing network. In this method, joining and leaving of a node are managed in O(1) with high probability. Furthermore, the proposed OTT-based technique can find and construct a path shorter than that on the normal ordered tree, by setting up bypass links between remote nodes on OTT.
AB - Peer-to-peer (P2P) communication and computing frameworks are important for constructing robust large-scale distributed systems. Overlay network systems use distributed hash-table (DHT) to provide scalable and efficient node search capabilities. However, the DHT-based method has a problem for the maintenance cost of dynamically changing large-scale-network, in which nodes are frequently joining and leaving. This paper proposes a novel technique of P2P communication path management. The proposed technique devises a robust semi-structured overlay network called Ordered Tree with Tuft (OTT for short). OTT provides not only efficient node searching, but also low-cost self-maintenance capabilities for the dynamically changing network. In this method, joining and leaving of a node are managed in O(1) with high probability. Furthermore, the proposed OTT-based technique can find and construct a path shorter than that on the normal ordered tree, by setting up bypass links between remote nodes on OTT.
UR - http://www.scopus.com/inward/record.url?scp=84865513809&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84865513809&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-31809-2_8
DO - 10.1007/978-3-642-31809-2_8
M3 - Conference contribution
AN - SCOPUS:84865513809
SN - 9783642318085
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 83
EP - 94
BT - Agents and Peer-to-Peer Computing - 8th International Workshop, AP2PC 2009, Revised Selected Papers
T2 - 8th International Workshop on Agents and Peer-to-Peer Computing, AP2PC 2009
Y2 - 11 May 2009 through 11 May 2009
ER -