A new overlay P2P network for efficient routing in group communication with regular topologies
by Abdelhalim Hacini; Mourad Amad
International Journal of Grid and Utility Computing (IJGUC), Vol. 11, No. 1, 2020

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.

Online publication date: Tue, 03-Dec-2019

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Grid and Utility Computing (IJGUC):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com