A scalable and hierarchical P2P architecture based on Pancake graph for group communication

Article type: Research Article

Authors: Hacini, Abdelhalim^a | Amad, Mourad^{a; b; *} | Fouzi, Semchedine^{a; c}

Affiliations: [a] LaMOS Research Unit, Computer Science Department, Faculty of Exact Sciences, Bejaia University, 06000 Bejaia, Algeria | [b] Bouira University, 10000 Bouira, Algeria | [c] Setif University, 19000 Setif, Algeria

Correspondence: [*] Corresponding author. Tel.: 00213551428098; E-mail: [email protected].

Abstract: P2P network is characterized by several important aspects: scalability, decentralization and dynamicity. One of the major problems posed by decentralization and dynamicity of P2P network is how to discover and access to a resource, since it is very difficult to get an overall view of all resources in the P2P community. The most important concern is how to locate a particular resource and identifying the optimized path, that reaches the peer responsible for this requested resource, with a minimum number of hops and an optimized delay. In this paper, we propose a new scalable and hierarchical P2P architecture for lookup acceleration and optimization based on Pancake graph. This architecture can supports many type of applications such as: file sharing, collaborative work and asynchronous distributed group communication, etc. The performance evaluation shows that results are globally satisfactory.

Keywords: P2P network, Pancake graph, lookup optimization, group communication

DOI: 10.3233/JHS-170572

Journal: Journal of High Speed Networks, vol. 23, no. 4, pp. 287-309, 2017