A distributed coordination protocol in an order-heterogeneous group

  • Authors:

  • Ailixier Aikebaier;Tomoya Enokido;Makoto Takizawa

  • Affiliations:

  • Department of Computers and Systems Engineering, Tokyo Denki University, Ishizaka, Hatoyama, Hiki, Saitama, 350 0394, Japan.;Department of Computers and Systems Engineering, Tokyo Denki University, Ishizaka, Hatoyama, Hiki, Saitama, 350 0394, Japan.;Department of Computers and Systems Engineering, Tokyo Denki University, Ishizaka, Hatoyama, Hiki, Saitama, 350 0394, Japan

  • Venue:
  • International Journal of Web and Grid Services
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

In Peer-to-Peer (P2P) overlay networks, a group of multiple peer processes are required to cooperate to make a global decision. Each process takes a value and exchanges values with the other processes until the agreement condition is satisfied. We define existentially and preferentially precedent relations which show what values a process can take after taking a value and which value a process prefers to another value, respectively. Based on the precedent relations, each process takes the most preferable value in the values which are changeable from current value, at each round. We discuss a coordination protocol among multiple values in a type of heterogeneous system, where some pair of processes has different precedent relations on the same domain. A process learns the precedent relations of another process through exchanging values. A process takes a value that other processes can take by using the knowledge on the other processes.