To search, Click
below search items.
|
|
All
Published Papers Search Service
|
Title
|
An Autonomic Distributed Algorithm for Forming Balanced Binary Trees of Nodes in a Structured P2P System in a Multicast-enabled Environment
|
Author
|
Takashi Yamanoue, Kentaro Oda, Koichi Shimozono
|
Citation |
Vol. 11 No. 10 pp. 57-63
|
Abstract
|
This paper describes an autonomic distributed algorithm which can be used to structure a group of nodes connected by TCP into a balanced binary tree, and an experimental structured P2P system which adopts this algorithm. This algorithm can be applied when nodes can be connected directly each other by TCP/IP, and IP multicast-able. When N nodes join group simultaneously, it takes O((log N)2) time for all nodes to become members of the group, provided some conditions are satisfied. When a node in the group fails, the tree will be rebalanced by restarting the algorithm at the children of the failed node.
|
Keywords
|
peer to peer, overlay network, autonomic, distributed algorithm, binary tree
|
URL
|
http://paper.ijcsns.org/07_book/201110/20111008.pdf
|
|