A Distributed Coordination Protocol for Multiple Peer Processes
A Distributed Coordination Protocol for Multiple Peer Processes
复制标题
多对等进程的分布式协调协议
DOI：
10.1109/cisis.2008.114
复制
发表时间：
2008
期刊：
影响因子：
--
通讯作者：
M. Takizawa
中科院分区：
文献类型：
--
作者：
A. Aikebaier;T. Enokido;M. Takizawa
在本文中，我们讨论了一个完全分布式的非结构化的P2P系统，没有集中式协调。每个进程通过与组中的其他进程进行通信，对协议值进行决策，以实现某些目标。每个进程首先取域Di中的值v，域Di是可能值的集合，并将值v通知其他进程。除非一组值满足一致性条件，否则过程可以采用与传统共识协议不同的其他值v1。在人类社会中，人们在一个协议程序中改变他们的意见。讨论值的优先关系类型，以显示在取值v1之后取哪个值。一个存在的优先关系（v1 r^v2）表明一个进程pi在取v1之后可以取v2。此外，值以优先关系（rarrP）排序。过程pi的历史是pi所取的值的序列。某些值可能不会被多次使用。每个值都以历史记录中出现的最大次数为特征。如果进程pi在前一轮选择值时发现了一些错误，则该进程希望回滚到前一轮。一个进程在一轮中接受一个检查点。进程pi可以回滚到最近执行的检查点。在本文中，我们讨论了协调协议中的检查点机制。基于先例关系和检查点，每个过程在可从当前值v改变的值中取最优选的值v1。
In this paper, we discuss a fully distributed unstructured P2P system where there is no centralized coordinator. Each process makes by itself a decision on an agreement value to realize some objectives by communicating with other processes in a group. Each process first takes a value v in a domain Di which is a collection of possible values and notifies the other processes of the value v. A process in turn receives values from other processes. Unless a set of the values satisfy an agreement condition, a process can take an other value v1, differently from the traditional consensus protocols. In human societies, people change their opinions in an agreement procedure. Types of precedent relations on values are discussed to show which value to be taken after a value v1 is taken. An existentially precedent relation (v1 rarr V2) shows a process pi can take a value v2 after taking v1. In addition, values are ordered in the preferentially precedent relation (rarrP). A history of a process pi is a sequence of values which pi has taken. Some value may not be taken multiple times. Each value is characterized in terms of the maximum number of occurrences in a history. If a process pi finds some mistake on selecting a value at a previous round, the process would like to roll back to the previous round. A process takes a checkpoint at a round. The process pi can roll back to the checkpoint most recently taken. In this paper, we discuss the checkpoint mechanism in the coordination protocol. Based on the precedent relations and checkpoints, each process takes the most preferable value v1 in the values which are changeable from current value v.