XLXiuqi Li

Xiuqi Li

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Xiuqi Li has a total of 1 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • ISRL: intelligent search by reinforcement learning in unstructured peer-to-peer networks

    by Xiuqi Li, Jie Wu, Shi Zhong

    Existing searches in unstructured peer-to-peer (P2P) networks are either blind or informed based on simple heuristics. Blind schemes suffer from low query quality. Simple heuristics lack theoretical background to support the simulation results. In this paper, we propose an intelligent searching scheme, called intelligent search by reinforcement learning (ISRL), which systematically seeks the best route to desired files by reinforcement learning (RL). In artificial intelligence, RL has been proven to be able to learn the best sequence of actions to achieve a certain goal. To discover the best path to desired files, ISRL not only explores new paths by forwarding queries to randomly chosen neighbors, but also exploits the paths that have been discovered for reducing the cumulative query cost. We design three models of ISRL: a basic version for finding one desired file, MP-ISRL for finding at least k files, and C-ISRL for reducing maintenance overhead through clustering when there are many queries. ISRL outperforms existing searching approaches in unstructured P2P networks by achieving similar query quality with lower cumulative query cost. The experimental result confirms the performance improvement of ISRL.


  • A hybrid searching scheme in unstructured P2P networks

    by Xiuqi Li, Jie Wu

    The existing searching schemes in peer-to-peer (P2P) networks are either forwarding-based or non-forwarding based. In forwarding-based schemes, queries are forwarded from the querying source to the query destination nodes. These schemes offer low state maintenance. However, querying sources do not entirely have control over query processing. In non-forwarding based methods, queries are not forwarded and the querying source directly probes its neighbors for the desired files. Non-forwarding searching provides querying sources flexible control over the searching process at the cost of high state maintenance. In this paper, we seek to combine the powers of both forwarding and non-forwarding searching schemes. We propose an approach where the querying source directly probes its own extended neighbors and forwards the query to a subset of its extended neighbors and guides these neighbors to probe their own extended neighbors on its behalf. Our approach can adapt query processing to the popularity of the sought files without having to maintain a large set of neighbors because its neighbors' neighbors are also in the searching scope due to the 1-hop forwarding inherent in our approach. It achieves a higher query efficiency than the forwarding scheme and a better success rate than the non-forwarding approach. To the best of our knowledge, the work in this paper is the first one to combine forwarding and non-forwarding P2P searching schemes. Experimental results demonstrate the effectiveness of our approach.