Strongly connected directed graph synchronization network leader election - the flooding algorithm

2010-02-21  来源:本站原创  分类:Tech  人气:230 

1, directed graph, if all paths between any two nodes if a strongly connected graph


Algorithm requires the process to know the diameter diam map

Each process to maintain a record of the largest UID (originally their own UID). In each round, each process should be all out in their spread to the edge of the largest UID. In diam round, if the maximum value obtained is the process of its own UID, then the process put their own elected leaders, or become non-leader.

This algorithm can be optimized to process only the first time that they send a message when the max-uid. Not have to send round