Causally ordered delivery in a hierarchical group of peer processes

  • Authors:

  • Kojiro Taguchi;Kenichi Watanabe;Tomoya Enokido;Makoto Takizawa

  • Affiliations:

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

  • Venue:
  • Computer Communications
  • Year:
  • 2005

Quantified Score

Hi-index 0.24

Visualization

Abstract

Large number of peer processes are cooperating by exchanging messages in peer-to-peer systems. In traditional group protocols, each process communicates with all the other processes in a flat group. Due to the communication and computation overhead O(n) to O(n^2) for the number n of processes, it is difficult, may be impossible to adopt the group protocols to a scalable group. In this paper, we discuss a hierarchical group protocol aiming at reducing communication and computation overheads for a group of large number of peer processes. A hierarchical group is composed of subgroups, where each subgroup is furthermore composed of subgroups. Each subgroup supports its own synchronization mechanism to causally order messages. Even if messages are causally ordered in one subgroup, the messages may not be causally ordered in another subgroup. We discuss how to globally causally order messages by using local ordering mechanisms of each subgroup. Finally, we evaluate the hierarchical group protocol compared with traditional flat group protocol in terms of delivery time of messages.