Building Semantic Peer-to-Peer Networks upon CAN

  • Jiantao Song
  • Yong Zhang
  • Chaofeng Sha
  • Hong Zhu
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2816)


Existing decentralized architectures for peer-to-peer (P2P) networks can be generally partitioned into two categories: unstructured (such as Gnutella) and structured (such as CAN, Chord, Pastry and Tapestry). Based on Content Addressable Networks (CAN), we propose a hybrid scheme for building Semantic Peer-to-peer Networks (SPNs) where semantically related nodes are connected to each other. The entire peer-to-peer overlay networks are overlapped by many SPNs and all these SPNs are logically organized into a hierarchy. Then we provide a searching algorithm to “focus” query propagation only in appropriate SPNs. As a result, the nodes visited for a lookup can be reduced by several orders of magnitude compared to Gnutella.


Overlay Network Distribute Hash Table Query Propagation Dominant Class Blue Edge 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Breslau, L., Cao, P., Fan, L., Philips, G., Shenker, S.: Web Caching and Zipf-like Distributions: Evidence and Implications. In: IEEE INFOCOM (1999)Google Scholar
  2. 2.
    Byers, J., Considine, J., Mitzenmacher, M.: Simple Load Balancing for Distributed Hash Tables. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol. 2735. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  3. 3.
    Cohen, E., Fiat, A., Kaplan, H.: Associative Search in Peer to Peer Networks: Harnessing Latent Semantics. In: IEEE INFOCOM 2003 (2003)Google Scholar
  4. 4.
    Crespo, A., Garcia-Molina, H.: Routing indices for peer-to-peer systems. In: Proceedings of the 22nd IEEE International Conference on Distributed Computing Systems, ICDCS (July 2002)Google Scholar
  5. 5.
    Crespo and H. Garcia-Molina. Semantic Overlay Networks. Submitted for Publication,
  6. 6.
    Gnutella website,
  7. 7.
    Joachims, T.: Text categorization with Support Vector Machines: Learning with many relevant features. In: Nédellec, C., Rouveirol, C. (eds.) ECML 1998. LNCS, vol. 1398. Springer, Heidelberg (1998)Google Scholar
  8. 8.
    Keleher, P., Bhattacharjee, S., Silaghi, B.: Are virtualized overlay networks too much of a good thing? In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, p. 225. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  9. 9.
    Lv, Q., Cao, P., Cohen, E., Li, K., Shenker, S.: Search and replication in unstructured peer to peer networks. In: Proceedings of the 16th annual ACM International Conference on supercomputing (2002)Google Scholar
  10. 10.
    Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content addressable network. In: Proc. ACM SIGCOMM (2001)Google Scholar
  11. 11.
    Baeza-Yates, B.R.-N.R.: Modern Information Retrieval. Addison-Wesley, Reading (1999)Google Scholar
  12. 12.
    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) (November 2001)Google Scholar
  13. 13.
    Saroiu, S., Gummadi, P., Gribble, S.: A Measurement Study of Peer-to-Peer File Sharing Systems. In: MMCN (2002)Google Scholar
  14. 14.
    Sripanidkulchai, K., Maggs, B., Zhang, H.: Efficient Content Location Using Interest-Based Locality in Peer-to-Peer Systems. In: IEEE INFOCOM 2003 (2003)Google Scholar
  15. 15.
    Stoica, R., Morris, D., Karger, M.F., Kaashoek, H., Balakrishnan, C.: A scalable peer-to-peer lookup service for internet applications. In: Proc. ACM SIGCOMM (August. 2001)Google Scholar
  16. 16.
    Trianta.llou, P., Xiruhaki, C., Koubarakis, M. Ntarmos, N.: Towards high performance peer-to-peer content and resource sharing systems. In: CIDR, 2003. Google Scholar
  17. 17.
    Witten, I., Frank, E.: Data Mining. Morgan Kaufmann Publishers, San Francisco (1999)Google Scholar
  18. 18.
    Yang, B., Garcia-Molina, H.: Efficient Search in Peer-to-Peer Networks. In: Proceedings of the 22nd IEEE International Conference on Distributed Computing Systems, ICDCS (July 2002)Google Scholar
  19. 19.
    Zhao, Y., Kubiatowicz, J. Joseph, A.: Tapestry: An infrastructure for faulttolerant wide-area location and routing. Technical report, U. C. Berkeley (2001)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Jiantao Song
    • 1
  • Yong Zhang
    • 1
  • Chaofeng Sha
    • 1
  • Hong Zhu
    • 1
  1. 1.Department of Computer Science and EngineeringFudan UniversityShanghaiChina

Personalised recommendations