首页> 中文期刊>现代电子技术 >增量同步约束条件下的多节点间主节点选举算法

增量同步约束条件下的多节点间主节点选举算法

     

摘要

为了满足在异地分布多中心的数据服务系统中,选取一个节点作为主节点,提供数据写服务,其他节点作为备节点提供读服务,主节点与备节点之间采用增量同步方式同步数据系统运行模式的需要。在此列举了在数据增量同步条件下进行主备选举时,需要遵循约束条件,提出一个基于数据版本作为主要约束条件的主备选举算法。描述了在选举过程中,节点的状态定义,各个状态转换关系,以及在各个状态下需要进行的相关处理。通过实际工程运用,验证了算法满足使用要求,同时总结了目前不足和后续改进要点。%In order to meet the demands of selecting a node as the master node in the multi⁃center data service systems dis⁃tributed in allopatry to provide data writing services,other nodes as backup nodes to provide reading services,and adopting the synchronous data system operating pattern of incremental synchronization mode between the master node and the backup node, the constraint conditions which should be abided when the main and preparation elections are performed under the condition of data incremental synchronization are listed in this paper. The main and preparation election algorithm on the basis of data ver⁃sion as the main constraint is put forward. The state definition of the node,the conversion relation between various states and the related processing in different situations are described. The algorithm was verified in the actual engineering application. The insufficiency and the future improvement points are pointed out in this paper.

著录项

相似文献

  • 中文文献
  • 外文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号