A Scalable Peer-to-Peer Group Communication Protocol

  • Authors:
  • Isamu Tsuneizumi;Ailixier Aikebaier;Tomoya Enokido;Makoto Takizawa

  • Affiliations:
  • -;-;-;-

  • Venue:
  • AINA '10 Proceedings of the 2010 24th IEEE International Conference on Advanced Information Networking and Applications
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

In peer-to-peer (P2P) applications, a group of multiple peer processes (peers) are required to cooperate with each other in a distributed manner. Messages sent by peers have to be causally delivered to every peer in a group. Due to the message overhead O(n) for the number n of peers, the vect. cannot be used to causally deliver messages in a scalable group. On the other hand, the linear clock implies the message length O(1), but some pair of messages are unnecessarily ordered. Recently, more accurate physical clocks can be used in cooperation with the GPS time server. Even if each physical clock is synchronized with a time server, every physical clock does not show the same accurate time. The accuracy of the physical clock depends on distance to the time server, traffic in a network, and type of operating system. In this paper, we reduce the number of messages unnecessarily ordered by taking advantage of the linear time and physical time. In the evaluation, we show the number of messages unnecessarily ordered can be reduced composed with the linear clock.