A Multi-layered Model for Scalable Group Communication in P2P Overlay Networks

A group of n (>1) peers are required to cooperate with each other in distributed applications. In this paper, we consider a distributed group of multiple peers in P2P overlay networks. A P2P group is distributed, i.e. no centralized controller and is scalable and heterogeneous since various types and huge number of computers are interconnected in types of networks. In group communication, messages have to be causally delivered to every peer. In order to realize a scalable group, messages are ordered by linear time (LT) and physical time (PT) since message length is O(1). In order to use the physical time, each peer has to hold information on the accuracy of physical clock of each peer and minimum delay time among every pair of peers. Hence, the size of the information is O (n^2). In this paper, we newly discuss a multi-layered hierarchical model to reduce the size of group information. We evaluate the hierarchical model in terms of the group information size and delay time compared with a flat group model.

[1]  Tomoya Enokido,et al.  Reduction of Messages Unnecessarily Ordered in Scalable Group Communication , 2010, 2010 International Conference on Complex, Intelligent and Software Intensive Systems.

[2]  Tomoya Enokido,et al.  Hybrid Clock-Based Synchronization in a Scalable Heterogeneous Group , 2010, 2010 13th International Conference on Network-Based Information Systems.

[3]  Gabriel Hugh Elkaim,et al.  Global Positioning System (GPS) , 2006 .

[4]  Prashant Malik,et al.  Cassandra: a decentralized structured storage system , 2010, OPSR.

[5]  Tomoya Enokido,et al.  A scalable group communication protocol with hybrid clocks , 2011, Concurr. Comput. Pract. Exp..

[6]  Rüdiger Schollmeier,et al.  A definition of peer-to-peer networking for the classification of peer-to-peer architectures and applications , 2001, Proceedings First International Conference on Peer-to-Peer Computing.

[7]  Tomoya Enokido,et al.  A Scalable Peer-to-Peer Group Communication Protocol , 2010, 2010 24th IEEE International Conference on Advanced Information Networking and Applications.

[8]  Nancy A. Lynch,et al.  Impossibility of distributed consensus with one faulty process , 1985, JACM.

[9]  Ulrich Schmid,et al.  Synchronized universal time coordinated for distributed real-time systems , 1995 .

[10]  Louise E. Moser,et al.  Membership algorithms for asynchronous distributed systems , 1991, [1991] Proceedings. 11th International Conference on Distributed Computing Systems.

[11]  Leslie Lamport,et al.  Time, clocks, and the ordering of events in a distributed system , 1978, CACM.

[12]  Srinivasan Keshav,et al.  Efficient and decentralized computation of approximate global state , 2006, CCRV.

[13]  Friedemann Mattern,et al.  Algorithms for distributed termination detection , 1987, Distributed Computing.