Reinforcement Learning for Query-Oriented Routing Indices in Unstructured Peer-to-Peer Networks

Authors:
Cong Shi;Shicong Meng;Yuanjie Liu;Dingyi Han;Yong Yu
Affiliations:
Shanghai Jiaotong University, China;Shanghai Jiaotong University, China;Shanghai Jiaotong University, China;Shanghai Jiaotong University, China;Shanghai Jiaotong University, China
Venue:
P2P '06 Proceedings of the Sixth IEEE International Conference on Peer-to-Peer Computing
Year:
2006

Citing 0
Cited 2

A dynamic routing protocol for keyword search in unstructured peer-to-peer networks

Computer Communications
Range Query Using Learning-Aware RPS in DHT-Based Peer-to-Peer Networks

CCGRID '09 Proceedings of the 2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid

Quantified Score

Hi-index	0.00

Visualization

Abstract

The idea of building query-oriented routing indices has changed the way of improving routing efficiency from the basis as it can learn the content distribution during the query routing process. It gradually improves routing efficiency with no excessive network overhead of the routing index construction and maintenance. However, the previously proposed mechanism is not practically effective due to the slow improvement of routing efficiency. In this paper, we propose a novel mechanism for queryoriented routing indices which quickly achieves high routing efficiency at low cost. The maintenance method employs reinforcement learning to utilize mass peer behaviors to construct and maintain routing indices. It explicitly uses the expected value of returned content number to depict the content distribution, which helps quickly approximate the real distribution. Meanwhile, the routing method is to retrieve as many contents as possible. It also helps speed up the learning process further. The experimental evaluation shows that the mechanism has high routing efficiency, quick learning ability and satisfactory performance under churn.