Algorithm for distributed super-node election
Zhenwei Yu · Computer Engineering and Applications Journal · 2011
In super-node-based distributed systems,if super-node failures or temporarily leaves,it is hoped that the most capa- ble node could be elected as new super-node in self-organization way.This paper presents distributed super-node election algo- rithm.It firstly constructs bottom spanning tree through process of flooding,and then leaf nodes pass messages along this tree. Information about nodes and edges is contained in the messages,which are used by root node to construct minimum span- ning tree(MST).At last,root node selects the most capable node as new super-node and broadcasts election results along MST.The algorithm performance is analyzed and compared from aspects of communication complexity and time complexity.