摘要： 分布式算法中的欺负算法在选举协调者的过程中由于传输了大量信包而导致性能降低。该文在分析原有算法及其数学模型的基础上，提出一种优化算法并建立了相应的数学模型，对2种算法进行比较可以得出，优化算法在避免了选举失败或选举错误的基础上有效降低了选举过程中信包的传输数量，提高了通信性能，避免了网络延迟和网络拥塞。
关键词:
分布式算法,
选举算法,
欺负算法,
协调者,
确认消息
Abstract: As a result of transmitting larges numbers of messages in bully algorithm of distributed algorithm, the performance of the communication is degraded. This paper analyzes the defection of Bully algorithm and proposes an optimal algorithm based on it. Comparing the two algorithms, the new algorithm can improve communications performance, avoid network delay and network congestion.
Key words:
distributed algorithm,
election algorithm,
bully algorithm,
coordinator,
acknowledgement
中图分类号:
吴 宁;马义忠. 基于欺负算法的优化算法[J]. 计算机工程, 2008, 34(19): 118-120.
WU Ning; MA Yi-zhong. Optimal Algorithm Based on Bully Algorithm[J]. Computer Engineering, 2008, 34(19): 118-120.