摘要
针对以管理域为单元的集中式通信方案,提出了利用通信子树进行周期终止探测的算法。通过向各安全节点分配连续的、唯一的节点标识,并将标识嵌入到消息中,该算法可以利用求和公式实现通信终止判定。该算法简单而有效,算法复杂度达到最优。
In distributed environment, periodical communication is effietive to exchange information of secure nodes. According to the centralized communication mode between administrative domains, an algorithm based on message-passing trees was developed to detect the period termination. On the message-passing trees, a continuously and unique identifier was allocated to every secure node, and these IDs were embedded into messages when nodes sending information. And then by comparing the sum of receiving messages' ID with the standard value, the root nodes that are also called starter nodes can determine whether or not once communication is terminated. The algorithm is simple and effective, and achieves the lowest complexity.
出处
《计算机应用》
CSCD
北大核心
2006年第2期265-266,278,共3页
journal of Computer Applications
基金
黑龙江省自然科学基金资助项目(F2004-06)
关键词
周期终止探测
节点标识
启动节点
period termination detection
node's ID
starter node