Fan Hangyu, Wang Huandong, Li Yong
Department of Electronic Engineering, Tsinghua University, Beijing 100084, China.
Sensors (Basel). 2018 Jan 23;18(2):320. doi: 10.3390/s18020320.
Decentralized clustering of modern information technology is widely adopted in various fields these years. One of the main reason is the features of high availability and the failure-tolerance which can prevent the entire system form broking down by a failure of a single point. Recently, toolkits such as Akka are used by the public commonly to easily build such kind of cluster. However, clusters of such kind that use Gossip as their membership managing protocol and use link failure detecting mechanism to detect link failures cannot deal with the scenario that a node stochastically drops packets and corrupts the member status of the cluster. In this paper, we formulate the problem to be evaluating the link quality and finding a max clique (NP-Complete) in the connectivity graph. We then proposed an algorithm that consists of two models driven by data from application layer to respectively solving these two problems. Through simulations with statistical data and a real-world product, we demonstrate that our algorithm has a good performance.
近年来，现代信息技术的去中心化集群在各个领域得到了广泛应用。主要原因之一是其具有高可用性和容错特性，能够防止整个系统因单点故障而崩溃。最近，诸如Akka之类的工具包被公众广泛使用，以便轻松构建此类集群。然而，这种使用八卦协议进行成员管理并使用链路故障检测机制来检测链路故障的集群，无法处理节点随机丢弃数据包并破坏集群成员状态的情况。在本文中，我们将问题表述为评估链路质量并在连通性图中找到最大团（NP完全问题）。然后，我们提出了一种算法，该算法由两个由应用层数据驱动的模型组成，分别用于解决这两个问题。通过使用统计数据和实际产品进行模拟，我们证明了我们的算法具有良好的性能。
