Abstract
Intuitively, the peers who share similar interests tend to have a high probability of connecting to each other and sharing the resources. In this paper, we use ontology model represent user’s interests instead of using the conventional Vector Space Model. Each interest concept hierarchy is then interpreted within the Information Theory framework as a probabilistic decision tree. The interest-matching algorithm uses the KL (Kullback-Leiber) distance as a measure of deviation between two probabilistic decision trees. Then we use an interest-based group model to organize the peers with similar interests into a subnet. Our content location solution is on top of the existing Gnutella network. When using our algorithm, called interest-based subnet, a significant amount of flooding can be avoided, making Gnutella a more competitive solution. The extensive simulation results show the efficiency of the proposed model in peer-to-peer system.
This paper is supported by the Shanghai Science and Technology Development Foundation under Grant No. 03DZ15027
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.
Similar content being viewed by others
References
Rowstron, A., Druschel, P.: Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In: IFIP/ACM International Conference on Distributed Systems Platforms, Middleware (2001)
Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for Internet applications. In: Proceedings of ACM SIGCOMM (2001)
Ratnasamy, S., Shenker, S., Stoica, I.: Routing algorithms for DHTs: Some open questions. In: Proceedings of International Peer-To-Peer Workshop (2002)
Iamnitchi, A., Ripeanu, M., Foster, I.: Locating Data in (Small-World?) P2P Scientific Collaborations. In: Proceedings of International Peer-To-Peer Workshop (2002)
Sripanidkulchai, K., Maggs, B., Zhang, H.: Efficient content location using interest-based locality in peer to peer systems. In: INFOCOM 2003 (April 2003)
Xue, G., Shi, H., You, J., Yao, W.: Distributed Stable-Group Differentiated Admission Control Algorithm in Mobile Peer-to-Peer Media Streaming System. China Journal of Electronics 40 (2003)
Gruber, T.: A translation approach to portable ontology specifications. Knowledge Acquisition (1993)
Cover, T.M., Thomas, J.A.: Elements of Information Theory. Jon Wiley & Sons, Inc., Chichester (1993)
Li, B.: QoS-aware Adaptive Services in Mobile Ad-hoc Networks. In: Wolf, L., Hutchinson, D.A., Steinmetz, R. (eds.) IWQoS 2001. LNCS, vol. 2092, pp. 251–268. Springer, Heidelberg (2001)
Wang, K., Li, B.: Efficient and guaranteed service coverage in partitionable mobile adhoc networks. In: Proceedings of IEEE INFOCOM 2002 (June 2002)
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
Xue, G., You, J., He, X. (2004). Content Location Using Interest-Based Subnet in Peer-to-Peer System. In: Li, M., Sun, XH., Deng, Qn., Ni, J. (eds) Grid and Cooperative Computing. GCC 2003. Lecture Notes in Computer Science, vol 3032. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24679-4_71
Download citation
DOI: https://doi.org/10.1007/978-3-540-24679-4_71
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21988-0
Online ISBN: 978-3-540-24679-4
eBook Packages: Springer Book Archive