Adaptive peer-to-peer routing with proximity

Chu Yee Liau, Achmad Nizar Hidayanto, Stephane Bressan

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)

Abstract

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 scalability of a pruning approach based on a pruning strategy considering the popularity of the resources.

Original languageEnglish
Pages (from-to)454-463
Number of pages10
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2736
Publication statusPublished - 1 Dec 2003

Fingerprint

Dive into the research topics of 'Adaptive peer-to-peer routing with proximity'. Together they form a unique fingerprint.

Cite this