A PROTOCOL FOR MAKING AN AGREEMENT IN A PEER-TO-PEER (P2P) SOCIETY
Ailixier Aikebaier, Valbona Barolli, Tomoya Enokido, Makoto Takizawa · Journal of Interconnection Networks · 2008
There are many discussions on agreement protocols of multiple peer processes (peers) where every peer just aims at agreeing on one value out of values shown by the peers. In meetings of human societies, agreement procedures are so flexible that persons can change their opinions and can use not only all-condition where every person agrees on one value but also various types of agreement conditions like majority-condition. In this paper, we discuss a flexible agreement protocol of multiple peers by taking into account human behaviors in social agreement procedures. Each peer first takes a value v1 and notifies the other peers of the value v1. A peer pi in turn receives values from other peers. Unless a set of the values from all the peers satisfy the agreement condition, the peer pi can take another value v2. In order to model the social human behavior, in our previous work we discussed E - and P -precedent relations [Formula: see text] and [Formula: see text] on values of a peer pi. The relations [Formula: see text] and [Formula: see text] show that a peer pi can take a value v2 after taking a value v1 and prefers v1 to v2, respectively. If a peer autonomously takes values based on its precedent relations, the peers might not make an agreement even if there exists a satisfiable set of previous values. We discuss what previous values the peer can take again. In this paper, we try to find a satisfiable set of previous values in a history of values which the peers have so far taken, in addition for each peer to taking a new value at each round.