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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Karger, D., Kaashoek, F., Stoica, I., Morris, R., Balakrishnan, H.: Chord: A scalable Peer-To-Peer lookup service for internet applications. In: Proceedings of the 2001 ACM SIGCOMM Conference, pp. 149–160 (2001)
Handley, M., Karp, R., Ratnasamy, S., Francis, P., Shenker, S.: A scalable content addressable network. In: Proceedings of the 2001 ACM SIGCOMM Conference (2001)
GNUTELLA, http://gnutella.wego.com
Wiley, B., Clarke, I., Sandberg, O., Hong, T.W.: Freenet: A distributed anonymous information storage and retrieval system. LNCS (2001)
Kubiatowicz, J., et al.: Routing indices for peer-to-peer systems. In: Proceedings International Conference on Distributed Computing Systems (July 2002)
NAPSTER, http://www.napster.com
Kaelbling, L.P., Littman, M.L., Moore, A.P.: Reinforcement learning: A survey. Journal of Artificial Intelligence Research 4, 237–285 (1996)
Littman, M., Boyan, J.: A distributed reinforcement learning scheme for network routing. In: Proceedings of the International Workshop on Applications of Neural Networks to Telecommunications (1993)
Sutton, R.S., Barto, A.G.: Reinforcement learning: An introduction. MIT Press, Cambridge (1998)
Oram, A. (ed.): Peer-to-Peer: Harnessing the Power of Disruptive Technologies. O’Reilly & Associates, Sebastopol (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liau, C.Y., Hidayanto, A.N., Bressan, S. (2003). Adaptive Peer-to-Peer Routing with Proximity. In: Mařík, V., Retschitzegger, W., Štěpánková, O. (eds) Database and Expert Systems Applications. DEXA 2003. Lecture Notes in Computer Science, vol 2736. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45227-0_45
Download citation
DOI: https://doi.org/10.1007/978-3-540-45227-0_45
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40806-2
Online ISBN: 978-3-540-45227-0
eBook Packages: Springer Book Archive