This Article 
 Bibliographic References 
 Add to: 
PeerCluster: A Cluster-Based Peer-to-Peer System
October 2006 (vol. 17 no. 10)
pp. 1110-1123

Abstract—This paper proposes a cluster-based peer-to-peer system, called PeerCluster, for sharing data over the Internet. In PeerCluster, all participant computers are grouped into various interest clusters, each of which contains computers that have the same interests. The intuition behind the system design is that by logically grouping users interested in similar topics together, we can improve query efficiency. To efficiently route and broadcast messages across/within interest clusters, a hypercube topology is employed. In addition, to ensure that the structure of the interest clusters is not altered by arbitrary node insertions/deletions, we have devised corresponding JOIN and LEAVE protocols. The complexities of these protocols are analyzed. Moreover, we augment PeerCluster with a system recovery mechanism to make it robust against unpredictable computer/network failures. Using an event-driven simulation, we evaluate the performance of our approach by varying several system parameters. The experimental results show that PeerCluster outperforms previous approaches in terms of query efficiency, while still providing the desired functionality of keyword-based search.

[1] Open Directory Project (ODP), http:/, 1998.
[2] The Discussion Board of eDonkey,, 2001.
[3] K. Aberer, “P-Grid: A Self-Organizing Access Structure for P2P Information Systems,” Proc. Int'l Conf. Cooperative Information Systems, 2001.
[4] L. Bhuyan and D.P. Agrawal, “Generalized Hypercube and Hyperbus Structures for a Computer Network,” vol. 33, pp. 323-333, 1984.
[5] T.F. Chan and Y. Saad, “Multigrid Algorithms on the Hypercube Multiprocessor,” IEEE Trans. Computers, vol. 35, no. 11, pp. 969-977, Nov. 1986.
[6] Y. Chawathe, S. Ratnasamy, B.L.N. Lanham, and S. Shenker, “Making Gnutella-Link P2P Systems Scalable,” Proc. SIGCOMM '03, 2003.
[7] M.S. Chen, P.S. Yu, and K.L. Wu, “Optimal NODUP All-to-All Broadcasting Schemes in Distributed Computing Systems,” IEEE Trans. Parallel and Distributed Systems, vol. 5, pp. 1275-1285, 1994.
[8], The Gnutella Protocol Specification V0.4, , Mar. 2001.
[9] E. Cohen, A. Fiat, and H. Kaplan, “Associative Search in Peer to Peer Networks: Harnessing Latent Semantics,” Proc. IEEE INFOCOM '03, 2003.
[10] T.H. Cormen, C.E. Leiserson, and R.L. Rivest, Introduction to Algorithms. MIT Press/McGraw-Hill Book Company, 1990.
[11] A. Crespo, “Routing Indices for Peer-to-Peer Systems,” Proc. 22nd Int'l Conf. Distributed Computing Systems (ICDCS), 2002.
[12] N. Gunther, “Hypernets— Good (G)news for Gnutella,” , 2002.
[13] F. Harary, Graph Theory. Mass.: Addison-Wesley, 1969.
[14] J. Liebeherr and T.K. Beam, “HyperCast: A Protocol for Maintaining Multicast Group Members in a Logical Hypercube Topology,” Proc. First Int'l Workshop Networked Group Comm. (NGC '99), 1999.
[15] Q. Liv, P. Cao, E. Cohen, K. Li, and S. Shenker, “Search and Replication in Unstructured Peer-to-Peer Network,” Proc. ACM SIGMETRIC '02, 2002.
[16] Napster Inc., Napster Website, http:/, 2006.
[17] W. Nejdl, M. Wolpers, W. Siberski, C. Schmitz, M. Schlosser, I. Brunkhorst, and A. Lser, “Super-Peer-Based Routing and Clustering Strategies for RDF-Based Peer-to-Peer Networks,” Proc. 12th Int'l World Wide Web Conf. (WWW '03), 2003.
[18] S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, “A Scalable Content-Addressable Network,” Proc. SIGCOMM '01, 2001.
[19] P. Reynolds and A. Vahdat, “Efficient Peer-to-Peer Keyword Searching,” Proc. ACM/IFIP/USENIX Middleware Conf., 2003.
[20] J. Ritter, “Why Gnutella Can't Scale? No, Really,” , Feb. 2001.
[21] A. Rowstron and P. Druschel, “Pastry: Scalable, Distributed Object Location and Routing for Large-Scale Peer-to-Peer Systems,” Proc. 18th IFIP/ACM Int'l Conf. Distributed Systems Platforms (Middleware '01), 2001.
[22] M. Schlosser, M. Sintek, S. Decker, and W. Nejdl, “A Scalable and Ontology-Based P2P Infrastructure for Semantic Web Services,” Proc. Second Int'l Conf. Peer-to-Peer Computing, pp. 104-111, 2002.
[23] K. Sripanidkulchai, “The Popularity of Gnutella Queries and Its Implications on Scalability,” p2pgnutella.html, Feb. 2001.
[24] K. Sripanidkulchai, B. Maggs, and H. Zhang, “Efficient Content Location and Retrieval in Peer-to-Peer Systems by Exploiting Locality in Interests,” Proc. ACM SIGCOMM '01, 2001.
[25] K. Sripanidkulchai, B. Maggs, and H. Zhang, “Efficient Content Location Using Interest-Based Locality in Peer-to-Peer Systems,” Proc. IEEE INFOCOM '03, 2003.
[26] I. Stoica, R. Morris, D. Karger, F. Kaashoek, and H. Balakrishnan, “Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications,” Proc. SIGCOMM '01, 2001.
[27] G. Vrana, Peering through the Peer-to-Peer Fog, EDN Access (, 2001.
[28] B. Yang and H. Garcia-Molina, “Comparing Hybrid Peer-to-Peer Systems,” Proc. Very Large Data Bases Conf. (VLDB), 2001.
[29] B. Yang and H. Garcia-Molina, “Improving Search in Peer-to-Peer Systems,” Proc. 22nd Int'l Conf. Distributed Computing Systems (ICDCS), 2002.
[30] B.Y. Zhao, J. Kubiatowicz, and A. Joseph, “Tapestry: An Infrastructure for Fault-Tolerant Wide Area Location and Routing,” Technical Report UCB/CSD-01-1141, Univ. of California at Berkeley, 2001.

Index Terms:
Data broadcasting, data sharing, hypercube, peer-to-peer.
Xin-Mao Huang, Cheng-Yue Chang, Ming-Syan Chen, "PeerCluster: A Cluster-Based Peer-to-Peer System," IEEE Transactions on Parallel and Distributed Systems, vol. 17, no. 10, pp. 1110-1123, Oct. 2006, doi:10.1109/TPDS.2006.142
Usage of this product signifies your acceptance of the Terms of Use.