Abstract
Over the past decade, peer-to-peer (P2P) based systems have received a tremendous amount of attention. A fundamental problem that confronts peer-to-peer (P2P) applications is to construct an efficient system which can support flexible search. This paper presents CTL-P2P, a cluster-based two-layered P2P architecture model that addresses this problem. CTL-P2P is a combination of structured topology and unstructured topology. It utilizes semantic-based interest and behavioural peer clustering to form clusters. Each cluster is an unstructured topology, and uses heterogeneity to select super-peers as local servers of clusters. Super peers constitute the high-level structured topology. Results from theoretical analysis and simulations show that CTL-P2P is scalable, with low maintenance cost, high search efficiency and stable network 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.
Similar content being viewed by others
References
Lv, Q., Cao, P., Cohen, E., Li, K., Shenker, S.: Search and replication in unstructured peer- to-peer networks. In: Proceedings of the 16th International Conference on Supercomputing, pp. 84–95 (2002)
Sen, S., Wang, J.: Analyzing peer-to-peer traffic across large networks. ACM/IEEE Trans. Network 12(2), 219–232 (2004)
Stoica, I., Morris, R., Karger, D.R., Kaashoek, M.F., Balakrishnan, H.: Chord: a scalable peer-to-peer lookup service for Internet applications. In: Proceedings of the 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM 2001), pp. 149–160. ACM Press (2001)
Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content-addressable network. In: Proceedings of the 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM 2001), pp. 161–172. ACM Press (2001)
The Gnutella2 Developer Network, http://www.gnutella2.com
Zhao, B.Y., Duan, Y., Huang, L., Joseph, A.D., Kubiatowicz, J.D.: Brocade: Landmark Routing on Overlay Networks. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, pp. 34–44. Springer, Heidelberg (2002)
Xu, Z., Mahalingam, M., Karlsson, M.: Turning heterogeneity into an advantage in overlay routing. In: Proceedings of Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies, INFOCOM 2003 (2003)
Joung, Y.-J., Wang, J.-C.: Chord2: A two-layer Chord for reducing maintenance overhead via heterogeneity. Computer Networks 51, 712–731 (2007)
RDFStore 2006.RDFStore, http://rdfstore.sourceforge.net
Lu, E.J.-L., Huang, Y.-F., Lu, S.-C.: ML-Chord: A multi-layered P2P resource sharing model. Journal of Network and Computer Applications 32, 578–588 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yu, Q., Chen, X., Wang, H. (2012). A Two-Layered P2P Resource Sharing Model Based on Cluster. In: Tan, Y., Shi, Y., Ji, Z. (eds) Advances in Swarm Intelligence. ICSI 2012. Lecture Notes in Computer Science, vol 7332. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31020-1_24
Download citation
DOI: https://doi.org/10.1007/978-3-642-31020-1_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31019-5
Online ISBN: 978-3-642-31020-1
eBook Packages: Computer ScienceComputer Science (R0)