For a peer-to-peer (P2P) system holding massive amount of data, an efficient and scalable search for resource sharing is a key determinant to its practical usage. Unstructured P2P networks avoid the limitations of centralized systems and the drawbacks of a highly structured approach, because they impose few constraints on topology and data placement, and they support highly versatile search mechanisms. However their search algorithms are usually based on simple flooding schemes, showing severe inefficiencies. In this paper, to address this major limitation, we propose and evaluate the adoption of a local adaptive routing protocol. The routing algorithm adopts a simple Reinforcement Learning scheme (driven by query interactions among neighbors), in order to dynamically adapt the topology to peer interests. Preliminaries evaluations show that the approach is able to dynamically group peer nodes in clusters containing peers with shared interests and organized into a small world network.

GATALI L, LO RE G, URSO A, GAGLIO S (2005). Reinforcement Learning for P2P Searching. In Proceedings of the Seventh International Workshop on Computer Architecture for Machine Perception (CAMP’05).

Reinforcement Learning for P2P Searching

GAGLIO S
2005-01-01

Abstract

For a peer-to-peer (P2P) system holding massive amount of data, an efficient and scalable search for resource sharing is a key determinant to its practical usage. Unstructured P2P networks avoid the limitations of centralized systems and the drawbacks of a highly structured approach, because they impose few constraints on topology and data placement, and they support highly versatile search mechanisms. However their search algorithms are usually based on simple flooding schemes, showing severe inefficiencies. In this paper, to address this major limitation, we propose and evaluate the adoption of a local adaptive routing protocol. The routing algorithm adopts a simple Reinforcement Learning scheme (driven by query interactions among neighbors), in order to dynamically adapt the topology to peer interests. Preliminaries evaluations show that the approach is able to dynamically group peer nodes in clusters containing peers with shared interests and organized into a small world network.
IEEE-CAMP 2005 (International Workshop on Computer Architecture for Machine Perception)
July,4-6, Terrasini (PA) Italy
2005
6
GATALI L, LO RE G, URSO A, GAGLIO S (2005). Reinforcement Learning for P2P Searching. In Proceedings of the Seventh International Workshop on Computer Architecture for Machine Perception (CAMP’05).
Proceedings (atti dei congressi)
GATALI L; LO RE G; URSO A; GAGLIO S
File in questo prodotto:
File Dimensione Formato  
11e24d85bf47ff61f03c988230b3249316d8.pdf

Solo gestori archvio

Dimensione 690.56 kB
Formato Adobe PDF
690.56 kB Adobe PDF   Visualizza/Apri   Richiedi una copia

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/10447/9000
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 5
  • ???jsp.display-item.citation.isi??? 1
social impact