A Distributed Coordination Protocol for Multiple Peer Processes

Hum. Cent. Comput. Inf. Sci.

2011

Self Cite

Information systems are being shifted to scalable architectures like Cloud and peerto-peer (P2P) models. In this paper, we consider the P2P model as a fully distributed, scalable system different from centralized coordinated systems in Cloud and Grid systems. A P2P system is composed of peer processes (peers). Here, applications are realized by activities of peers and cooperations among multiple peers. In P2P systems, since there is no centralized coordination, each peer has to obtain information about other peers by itself. In the group cooperation, each group member peer has to be trustworthy so that malicious behavior of a member peer cannot effect overall outcome of the whole group. Here, it is important to consider the trustworthiness of each group member as a base of an agreement procedure in the distributed environment. The goal of a group and the way to archive the goal are decided by the group members. During the agreement procedure, opinions of member peers have to be collected in a group. Malicious and unexpected behaviors of member peers can negatively effect the output of a group. Hence, it is significant to discuss how to compose a group only by including more trustworthy peers. In this paper, by taking advantage of the trustworthiness concept of each peer, we propose a novel approach to composing a trustworthy group in the distributed agreement protocols.

Section: Basic Ideasmentioning

confidence: 99%

Trustworthy Group Making Algorithm in Distributed Systems

Hum. Cent. Comput. Inf. Sci.

2011

Self Cite

“…There are many discussions on how to make an agreement on one value out of values shown by the peers in presence of types of faults [11,13,14,8]. The authors [2,3,4,20] discuss types of precedent relations on values to show what value a peer can take after a value.…”

Section: Introductionmentioning

confidence: 98%

TBB-Scheme for Reliably Broadcast Messages among Peer Processes

2010 13th International Conference on Network-Based Information Systems

et al. 2010

Self Cite

Nowadays information systems are being shifted to distributed architectures to obtain the benefits like scalability, autonomy, and faulty-tolerance. The peer-to-peer (P2P) model as a fully distributed system, is composed of peer processes (peers) which cooperate with each other to achieve a common goal. Here, peers have to efficiently and flexibly make an agreement on one common value which satisfies an agreement condition. We use the multi-value exchange (MVE) scheme for efficiently making an agreement where each peer sends a package of multiple possible values to the other peers at ongoing rounds. In order to efficiently broadcast values in a group, we take advantage of the multipoint relaying (MPR) mechanism. Here, if a peer who forwards messages to other peers is faulty, the peers cannot receive messages. In this paper, we discuss a trustworthiness-based broadcast (TBB) scheme where only the trustworthy peers forward messages. That is, untrustworthy peers, i.e. peers prone to faults and malicious behaviors do not forward the messages. Here, the transmission fault implied by faults of untrustworthy peers can be reduced. We evaluated the TBB scheme in terms of the number of messages compared with the MPR one.

“…In the agreement protocol, it is significant for each peer to decide on which value to show to the other peers if there are multiple possible values. The authors [4] discuss the coordination strategies, forward, backward, mining, and observation strategies to efficiently make an agreement at each round. Some combinations of strategies taken by peers are inconsistent.…”

Section: Introductionmentioning

confidence: 99%

“…Some combinations of strategies taken by peers are inconsistent. We define what combinations of strategies are consistent, and discuss how the peers resolve the inconsistency of the strategies and take consistent strategies [4].…”

Section: Introductionmentioning

confidence: 99%

An MPR-based Solution for Flooding Broadcast Messages in Distributed Agreement Protocols

2010 International Conference on Complex, Intelligent and Software Intensive Systems

2010

Self Cite

Nowadays more and more information systems are being shifted to distributed architectures because of the benefits like scalability, autonomy, and faulty-tolerance implied from the essence of this distributed systems. Here, every process is peer and cooperates with other peers to achieve some objectives. Here, peers have to efficiently and flexibly make an agreement on one value which satisfies an agreement condition. We consider a distributed group of multiple peers with no centralized coordination. In order to efficiently make an agreement, we introduce a novel approach that each peer sends a package of multiple possible values to the other peers at each ongoing round. During the agreement procedure in traditional ways, every peer sends one value to the other peers at each round. It takes time for peers to exchange multiple values with each other and the peers might not be able to make an agreement depending on the order of values shown by the peers. By exchanging packages of values at one round, we can not only increase the possibility that every peer makes an agreement but also reduce the time to reach agreement and the number of messages exchanged among peers. In addition, peers have to efficiently broadcast packages of values to every peer in a group. In this paper, we newly introduce a broadcast message flooding algorithm by taking into account the multipoint relaying (MRPs) mechanism to increase the efficiency of the protocol.