TBB-Scheme for Reliably Broadcast Messages among Peer Processes

Abstract

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.

Trustworthy-based efficient data broadcast model for P2P interaction in resource-constrained wireless environments

“…It depends on the overlay topology among peers how many number of relay peers are required to cover all the peers in a sub-network. The only existing trustworthy-based broadcast scheme (TBB) that has been reported in [6,27] adopts the concept of MPR scheme subject to the condition that only trustworthy peers can become a relay peer. The trustworthiness is determined based on the past interactions of the successful transactions over unsuccessful ones.…”

“…This section studies the performance of the proposed TEMPR scheme and its comparison with the pure flooding [9] and the earlier trustworthy-based MPR method or TBB [6,27]. The analysis includes power consumption and bandwidth usage of each category of node in the P2P network namely the broadcast peer, the first neighbour/relay peer and the second level neighbour/leaf peer.…”

Trustworthy Group Making Algorithm in Distributed Systems

“…neighbors of an initiator peer are first included and then first neighbors of each first neighbor peer are included, until the number of members satisfy the group objectives like the scale of a required group. We discuss the trustworthiness-based broadcast (TBB) algorithm [22] to chose most trustworthy members to deliver the initiator message to the other peers as a relay peer in the group established. The trustworthiness of each peer is not considered when a group is established.…”

“…In this paper, we also consider the efficiency of the message broadcasting procedure. That is, we have to reduce the number of messages to deliver messages to all the peers in a group G. In addition, by taking advantage of the TBB algorithm [22], we can increase the reliability of the message delivery process. According to the TBB algorithm, the most reliable path for a source peer to deliver messages to the other peers in the group G can be selected, even in presence of peer faults.…”