An Aggregation-Based Routing Protocol for Structured Peer to Peer Overlay Networks

Abstract : Structured peer-to-peer (P2P) overlay networks provide a scalable object location and routing substrate for large scale distributed applications. However, due to the great number of nodes of such systems, message complexity of their routing protocol may considerably increase network traffic and average node hops of a message. This paper presents a novel Pastry-based routing protocol for structured P2P systems, which is specially suitable for handling per node multiple message routing requests. Our protocol exploits message aggregation and implements a multi-slice mechanism which multiplexes the sending of aggregated messages. Experimental results on top of PeerSim show that our protocol can reduce the average number of node hops messages, and thus, the global traffic and load of the network.
Type de document :
Communication dans un congrès
AP2PS 2010 - 2nd International Conference on Advances in P2P Systems, Oct 2010, Florence, Italy. ThinkMind, pp.76-81, 2010
Liste complète des métadonnées

https://hal.inria.fr/inria-00627466
Contributeur : Nicolas Hidalgo <>
Soumis le : mercredi 28 septembre 2011 - 16:51:08
Dernière modification le : jeudi 22 novembre 2018 - 14:04:52

Identifiants

  • HAL Id : inria-00627466, version 1

Citation

Nicolas Hidalgo, Luciana Arantes, Pierre Sens, Xavier Bonnaire. An Aggregation-Based Routing Protocol for Structured Peer to Peer Overlay Networks. AP2PS 2010 - 2nd International Conference on Advances in P2P Systems, Oct 2010, Florence, Italy. ThinkMind, pp.76-81, 2010. 〈inria-00627466〉

Partager

Métriques

Consultations de la notice

375