Consistency Based Approach for Agreement Achievement among Peers
Consistency Based Approach for Agreement Achievement among Peers
复制标题
同行之间达成一致的基于一致性的方法
DOI：
10.1109/nbis.2009.84
复制
发表时间：
2009
期刊：
影响因子：
--
通讯作者：
M. Takizawa
中科院分区：
文献类型：
--
作者：
A. Aikebaier;T. Enokido;M. Takizawa
在各种类型的点对点（P2P）应用中，节点必须高效、灵活地就一种观点达成一致，以便节点可以根据其他节点改变自己的观点。我们讨论完全非结构化 P2P 网络中多个对等点的灵活协议协议。为了有效地达成协议，我们讨论了一种新颖的方法，即每个对等点在每一轮中向其他对等点发送一组可能的值。通过考虑多值交换方案，我们可以减少协议过程的开销，从而提高协议的效率。每个节点自主地采取前向、后向、挖掘和观察协调策略之一来有效地达成一致。在前向和后向策略中，一个节点分别向其他节点显示新值并返回到上一轮。在挖掘过程中，节点发现一个先前值的元组，名为“cut”，它满足协议条件。在观察一中，对等方不会采用新值。一些策略的组合，例如挖掘其中一个和其他不一致。我们讨论同行如何合作以在每一轮中采取一致的策略。
In various types of peer-to-peer (P2P) applications, peers have to so efficiently and flexibly make an agreement on one opinion that the peers can change their opinions according to the others. We discuss a flexible agreement protocol of multiple peers in a fully unstructured P2P network. In order to efficiently make an agreement, we discuss a novel approach that each peer sends a package of possible values to the other peers at each round. By taking into account the multi-value exchange scheme, we can reduce the overhead of agreement procedure, therefore increase the efficiency of the protocol. Each peer autonomously takes one of the forward, backward, mining, and observation coordination strategies to efficiently make an agreement. In the forward and backward strategies, a peer shows a new value to the other peers and backs to a previous round, respectively. In the mining one, a peer finds a tuple of previous values named a cut which satisfies the agreement condition. In the observation one, a peer does not take a new value. Some combinations of strategies, e.g. mining one and the others are inconsistent. We discuss how peers cooperate to take consistent strategies at each round.