Title: A new overlay P2P network for efficient routing in group communication with regular topologies

Authors: Abdelhalim Hacini; Mourad Amad

Addresses: LaMOS Research Unit, Computer Science Department, Faculty of Exact Sciences, Bejaia University, 06000 Bejaia, Algeria ' LaMOS Research Unit of Bejaia University, Bouira University, 10000 Bouira, Algeria

Abstract: This research paper gives a new overlay P2P network to provide a performant and optimised lookup process. The lookup process of the proposed solution reduces the overlay hops and consequently the latency for content lookup, between any pair of nodes. The overlay network is constructed on top of physical networks without any centralised control and with a hierarchy of two levels. The architecture is based on regular topologies which are: the pancake graphs and the skip graphs. The focus of all topology construction schemes is to reduce the cost of the lookup process (number of hops and delay) and consequently improve the search performance for P2P applications deployed on the overlay network. Performance evaluations of our proposed scheme show that results obtained are globally satisfactory.

Keywords: P2P networking; pancake graphs; skip graphs; routing optimisation.

DOI: 10.1504/IJGUC.2020.103968

International Journal of Grid and Utility Computing, 2020 Vol.11 No.1, pp.30 - 48

Received: 05 Apr 2018
Accepted: 21 Oct 2018

Published online: 04 Dec 2019 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article