TMPR-scheme for reliably broadcast messages among peer processes

  • Authors:

  • Ailixier Aikebaier;Tomoya Enokido;Makoto Takizawa

  • Affiliations:

  • Department of Computers and Information Science, Faculty of Science and Technology, Seikei University, 3-3-1 Kichijoji-kitamachi, Musashino-shi, Tokyo, 180-8633, Japan.;Faculty of Business Administration, Rissho University, 4-2-16 Osaki, Shinagawa, Tokyo, 141-8602, Japan.;Department of Computers and Information Science, Faculty of Science and Technology, Seikei University, 3-3-1 Kichijoji-kitamachi, Musashino-shi, Tokyo, 180-8633, Japan

  • Venue:
  • International Journal of Grid and Utility Computing
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Nowadays information systems are being shifted to distributed architectures. The peer-to-peer (P2P) model as a fully distributed system, is composed of peer processes (peers). Here, peers have to efficiently and flexibly make an agreement on one common value which satisfies an agreement condition. In the agreement protocol, each peer has to deliver values to all the peers in a group. We take advantage of the multipoint relaying (MPR) mechanism to efficiently broadcast messages. Here, if a peer which forwards messages to other peers is faulty, the peers cannot receive messages. In this paper, we newly discuss a trustworthiness-based broadcast (TBB) algorithm where only the trustworthy peers forward messages. That is, untrustworthy peers, i.e., peers prone to faults and malicious behaviours do not forward messages. Here, the transmission fault implied by faulty peers can be reduced. We evaluate the TBB algorithm in terms of the number of messages compared with the pure flooding and MPR algorithms.