Abstract
Unstructured peer-to-peer systems rely on strategies and data structures (Routing Indices) for the routing of requests in the network. For those requests corresponding to information retrieval queries, the emphasis can be either put on the effectiveness of the routing by privileging the relevance of the documents retrieved, or on the efficiency of the routing by privileging the response time. We propose in this paper a novel routing strategy based on adaptive Routing Indices. The Routing Indices are adaptive to the environment, i.e. network traffic, location, as well as relevance of the documents indexed, thanks to a reinforcement learning approach to their maintenance. The strategy can be used to tune the compromise between efficient and effective routing. It combines the estimation of the response time of routes with the estimation of the relevance of routes to keywords. We study performance and the tuning of the compromise offered by this novel strategy under various characteristics of the network and traffic.
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
GNUTELLA, http://gnutella.wego.com
Clarke, I., Sandberg, O., Wiley, B., Hong, T.W.: Freenet: A distributed anonymous information storage and retrieval system. In: LNCS (2001)
Liau, C.Y., Achmad Nizar, H., Bressan, S.: Adaptive peer-to-peer routing with proximity. In: 14th International Conference on Database and Expert Systems Applications (2003)
Ripeanu, M.: Peer-to-peer architecture case study: Gnutella network. In: Computer Science Department, The University of Chicago, Chicago (2002)
Yang, B., Garcia-Molina, H.: Efficient search in peer-to-peer network. In: Proceedings of the 22nd International Conference on Distributed Computing Systems (2002)
Crespo, A., Garcia-Molina, H.: Routing indices for peer-to-peer systems. In: Proceedings International Conference on Distributed Computing Systems (July 2002)
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)
Kumar, S., Mikkulainen, R.: Dual reinforcement q-routing: An on-line adaptive routing algorithm. In: Proceedings of the Artificial Neural Networks in Engineering Conference (1998)
Kumar, S., Miikkulainen, R.: Confidence based dual reinforcement q-routing: An adaptive online network routing algorithm
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bressan, S., Hidayanto, A.N., Liau, C.Y., Hasibuan, Z.A. (2004). Adaptive Double Routing Indices: Combining Effectiveness and Efficiency in P2P Systems. In: Galindo, F., Takizawa, M., Traunmüller, R. (eds) Database and Expert Systems Applications. DEXA 2004. Lecture Notes in Computer Science, vol 3180. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30075-5_67
Download citation
DOI: https://doi.org/10.1007/978-3-540-30075-5_67
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22936-0
Online ISBN: 978-3-540-30075-5
eBook Packages: Springer Book Archive