Séminaire Mathématique de Béjaia
Volume 9, Numéro 1, Pages 25-29
2010-12-31
Authors : Amad Mourad . Aïssani Djamil .
In this paper, we propose a novel P2P architecture for improving dependability, adaptability, and scalability, whereas maintaining low complexity and rapid convergence for lookup algorithm. The new architecture is termed HPM, because it is organized as a set of hierarchical rings, which connect neighboring nodes in terms of both physical and logical locations, facilitating inter and intra routing mechanisms. In particular, we show that lookup cost of HPM is O(\sum_{i=1}^4 log_2(n_i )), where n_i represents the number of nodes on ring level i.
P2P, Routing Optimization, Physical Proximity
Inglebert J-m
.
Courtrai L
.
Sadou S
.
pages 10-16.
Benabbou F.
.
Benkiran A.
.
Horlait E.
.
pages 157-164.
Chabani Amina Yousra
.
Hammami Raid Imade Eddine
.
Barkat Mourad
.
pages 519-537.