| 局域网中动态二次选举算法 |
| |
| 引用本文： | 邢华卫,潘成胜,李宏超. 局域网中动态二次选举算法[J]. 沈阳理工大学学报, 2004, 23(1): 40-42 |
| |
| 作者姓名： | 邢华卫 潘成胜 李宏超 |
| |
| 作者单位： | 沈阳工业学院,通信与网络研究所,辽宁,沈阳,110168 |
| |
| 摘 要： | 提出了一种局域网中如何快速有效地选举出性能最佳的节点替代出现故障的专用设备的方法：二次选举法，结合了集中式算法与分布式算法的优点，避免了二者的缺陷，成功地解决了局域网中集中式管理的不稳定性，提高了系统的健壮性．
|
| 关 键 词： | 局域网 动态二次选举算法 分布式算法 集中式算法 健壮性 集中式管理 |
| 文章编号： | 1003-1251(2004)01-0040-03 |
| 修稿时间： | 2003-11-11 |
Dynamic Election Twice Algorithm in LAN |
| |
| XINH Hua-wei,PAN Cheng-sheng,LI Hong-chao. Dynamic Election Twice Algorithm in LAN[J]. Transactions of Shenyang Ligong University, 2004, 23(1): 40-42 |
| |
| Authors: | XINH Hua-wei PAN Cheng-sheng LI Hong-chao |
| |
| Abstract: | The paper presents a method of how to elect the node of best performance in LAN promptly and effectively to replace the work of the special device which can not work normally: election twice. It does without the drawbacks of both centralized algorithm and distributed algorithm and combines the advantages of them both. So it solves the instability of centralizing management in LAN successfully and improves the robustness of the system. |
| |
| Keywords: | centralized management centralized algorithm distributed algorithm elected algorithm robustness |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
