Adaptive Peer-to-Peer Routing with Proximity [chapter]

Chu Yee Liau, Achmad Nizar Hidayanto, Stephane Bressan
2003 Lecture Notes in Computer Science  
In this paper, we presented a routing strategy for requests in unstructured peer-to-peer networks. The strategy is based on the adaptive routing Q-routing. The strategy uses reinforcement learning to estimate the cost of routing a request. Such a strategy is scalable only if the routing indices are of reasonable size. We proposed and comparatively evaluated three methods for the pruning for the pruning of the routing indices. Our experiments confirm the validity of the adaptive routing and the
more » ... calability of a pruning approach based on a pruning strategy considering the popularity of the resources.
doi:10.1007/978-3-540-45227-0_45 fatcat:ddxjvab2kne65n7lvpkqvrzkra