Skip to main content

Collaborative Q-Learning Based Routing Control in Unstructured P2P Networks

  • Conference paper
  • First Online:
MultiMedia Modeling (MMM 2016)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 9516))

Included in the following conference series:

Abstract

Query routing among peers whilst locating required resources is still an acute issue discussed P2P networking, especially in unstructured P2P networks. Such an issue becomes worse when there is frequent in and out movement of the peers in the network and also with node failures. We propose a new method to assure alternative routing path to balance the query loads among the peers under higher network churns. The proposed collaborative Q-learning method learns the networks parameters such as processing capacity, number of connections, and number of resources in the peers, along with their state of congestion. By this technique, peers are avoided to forward queries to the congested peers. Our simulation results show that the required resources are located more quickly and queries in the whole network are also balanced. Also our proposed protocol exhibits more robustness and adaptability under high network churns and heavy workloads than that of the random walk method.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Risson, J., Moors, T.: Survey of research towards robust peer-to-peer networks: search methods. Comput. Netw. 50(17), 3485–3521 (2006)

    Article  MATH  Google Scholar 

  2. Lua, E.K., Crowcroft, J., Pias, M., Sharma, R., Lim, S.: Survey of research towards robust peer-to-peer networks: search methods. Commun. Surv. Tutorials 7(2), 72–93 (2005)

    Article  Google Scholar 

  3. Khataniar, G., Goswami, D.: HUP: an unstructured hierarchical peer-to-peer protocol. In: Proceedings of the International MultiConference of Engineers and Computer Scientists, pp. 671–676 (2010)

    Google Scholar 

  4. Li, J.-S., Chao, C.-H.: An efficient super-peer overlay construction and broadcasting scheme based on perfect difference graph. IEEE Trans. Parallel Distrib. Syst. 21(5), 594–606 (2010)

    Article  Google Scholar 

  5. Fakasa, G.J., Karakostas, B.: An efficient super-peer overlay construction and broadcasting scheme based on perfect difference graph. Inf. Softw. Technol. 46(6), 423–431 (2004)

    Article  Google Scholar 

  6. Xu, Z., Bhuyan, L.N.: Effective load balancing in p2p systems. In: IEEE International Symposium on Cluster Computing and the Grid, pp. 81–88 (2006)

    Google Scholar 

  7. Sreenu, G., Dhanya, P.M., Thampi, S.M.: Enhancement of bartercast using reinforcement learning to effectively manage freeriders. In: Advances in Computing and Communications, pp. 126–136 (2011)

    Google Scholar 

  8. Merino, L.R., Anta, A.F., Lópze, L., Cholvi, V.: Self-managed topologies in p2p networks. Comput. Netw. 53(10), 1722–1736 (2009)

    Article  MATH  Google Scholar 

  9. Pournaras, E., Exarchakos, G., Antonopoulos, N.: Load-driven neighbourhood reconfiguration of gnutella overlay. Comput. Commun. 31(13), 3030–3039 (2008)

    Article  Google Scholar 

  10. Morales, R., Gupta, I.: AVMON: optimal and scalable discovery of consistent availability monitoring overlays for distributed systems. IEEE Trans. Parallel Distrib. Syst. 20(4), 446–459 (2009)

    Article  Google Scholar 

  11. Merugu, S., Srinivasan, S., Zegura, E.: Adding structure to unstructured peer-to-peer networks: the use of small-world graphs. J. Parallel Distrib. Comput. 65(2), 142–153 (2005)

    Article  MATH  Google Scholar 

  12. Liu, L., Antonopoulos, N., Mackin, S., Xu, J., Russell, D.: Efficient resource discovery in self-organized unstructured peer-to-peer networks. Concurrency Comput. Pract. Experience 23(2), 159–183 (2009)

    Article  Google Scholar 

  13. Wu, K., Wu, C., Liu, L.: State-based search strategy in unstructured p2p. In: Proceedings of 13th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing, pp. 381–386 (2010)

    Google Scholar 

  14. van Hasselt, H.: Reinforcement learning in continuous state and action spaces. In: Wiering, M., van Otterlo, M. (eds.) Reinforcement Learning. ALO, vol. 12, pp. 205–248. Springer, Heidelberg (2012)

    Google Scholar 

  15. Gheshlaghi Azar, M., Munos, R., Ghavamzadaeh, M., Kappen, H.J.: Speedy Q-Learning. In: Advances in Neural Information Processing Systems, (NIPS 24), pp. 2411–2419 (2011)

    Google Scholar 

  16. Sarolu, S., Gummadi, P.K., Gribble, S.D.: A measurement study of peer-to-peer file sharing systems. In: Proceedings of Multimedia Computing and Networking (2002)

    Google Scholar 

Download references

Acknowledgments

This work was funded in part by the National Natural Science Foundation of China (No. 61572240).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Xiang-Jun Shen .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Shen, XJ., Chang, Q., Gou, JP., Mao, QR., Zha, ZJ., Lu, K. (2016). Collaborative Q-Learning Based Routing Control in Unstructured P2P Networks. In: Tian, Q., Sebe, N., Qi, GJ., Huet, B., Hong, R., Liu, X. (eds) MultiMedia Modeling. MMM 2016. Lecture Notes in Computer Science(), vol 9516. Springer, Cham. https://doi.org/10.1007/978-3-319-27671-7_76

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-27671-7_76

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-27670-0

  • Online ISBN: 978-3-319-27671-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics