Please use this identifier to cite or link to this item:
|Title:||Adaptive peer-to-peer routing with proximity||Authors:||Liau, C.Y.
|Issue Date:||2003||Citation:||Liau, C.Y.,Hidayanto, A.N.,Bressan, S. (2003). Adaptive peer-to-peer routing with proximity. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2736 : 454-463. ScholarBank@NUS Repository.||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. © Springer-Verlag Berlin Heidelberg 2003.||Source Title:||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)||URI:||http://scholarbank.nus.edu.sg/handle/10635/39680||ISSN:||03029743|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on May 17, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.