GPM: A generic and scalable P2P model that optimizes tree depth for multicast communications

  • Authors:
  • Mourad Amad;Ahmed Meddahi;Djamil Aïssani;Gilles Vanwormhoudt

  • Affiliations:
  • L.A.M.O.S. (Laboratory of Modelization and Optimization of Systems), University of Bejaia, 06000 Bejaia, Algeria;Institut Telecom/Telecom Lille 1, France;L.A.M.O.S. (Laboratory of Modelization and Optimization of Systems), University of Bejaia, 06000 Bejaia, Algeria;Institut Telecom/Telecom Lille 1, France

  • Venue:
  • International Journal of Communication Systems
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

Group communications (real-time and non-real-time) refer to one-to-many or many-to-many communications. On the one hand, multicast is considered as an appropriate solution for supporting group communication-oriented applications (we distinguish IP network multicast from application layer multicast). On the other hand, peer-to-peer model tends to be a good candidate for supporting today Internet applications (e.g. P2P IPTV, P2P VoIP, etc.). In this context, P2P has attracted significant interest in the recent years. This is mainly due to its properties that also make P2P well adapted to today social networks. In this paper, we propose GPM (Generic P2P Multicast): a novel generic and scalable approach, that optimizes multicast tree depth in P2P networks (structured and unstructured), and contributes to control the network overlay latency. For multicast tree construction, the approach we propose is based on a distributed algorithm using a specific data structures (adjacency and forwarding matrixes). GPM model inherits from P2P attributes such as scalability, flexibility and fault tolerance, while taking into consideration the respective characteristics of one-to-many and many-to-many type of applications. We also give a performance evaluation for validation and comparison purposes while considering some main existing application layer multicast protocols. Copyright © 2011 John Wiley & Sons, Ltd.