Advertisement

Topology-Aware Multi-cluster Architecture Based on Efficient Index Techniques

  • Yun He
  • Qi Zhao
  • Jianzhong Zhang
  • Gongyi Wu
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3779)

Abstract

In this paper, we focus on how to construct an efficient unstructured P2P system. The main contributions of our proposal are two-fold. First, aiming at alleviating the topology mismatch problem between the P2P logical overlay network and the physical underlying network, we proposed a Topology-aware Multi-cluster Overlay (TMO) architecture where peers self-organize into clusters based on network locality. Second, in order to further improve the search efficiency of the TMO architecture, we present two novel index techniques, namely, cluster-index technique and topic-index technique. The two different techniques are highly effective in different application domains in which the TMO architecture is deployed. The simulation results indicate that our proposed schemes are efficient in both resource usage and data retrieval.

References

  1. 1.
  2. 2.
  3. 3.
    Stoica, I., Morris, R., Karger, D., Kaashoek, F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for Internet applications. In: Proceedings of ACM SIGCOMM (2001)Google Scholar
  4. 4.
    Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content -addressable addressable network. In: Proceedings of ACM SIGCOMM (2001)Google Scholar
  5. 5.
    Rowstron, A., Druschel, P.: Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In: Proceedings of International Conference on Distributed Systems Platforms (2001)Google Scholar
  6. 6.
    Ratnasamy, S., Handley, N., Karp, R., Shenker, S.: Topologically-Aware Overlay Construction and Server Selection. In: Proceedings of IEEE INFOCOM (2002)Google Scholar
  7. 7.
  8. 8.
    Cooper, B.F., Garcia-Molina, H.: Studying search networks with SIL. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol. 2735. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  9. 9.
    Yang, B., Garcia-Molina, H.: Improving Search in Peer-to-Peer Networks. In: Proceedings of IEEE ICDCS (2002)Google Scholar
  10. 10.
    Crespo, A., Garcia-Molina, H.: Routing indices for peer-to-peer systems. In: Proceedings of 22nd International Conference on Distributed Computing Systems (2002)Google Scholar
  11. 11.
    Lv, C., Cao, P., Cohen, E., Li, K., Shenker, S.: Search and replication in unstructured peer-to-peer networks. In: Proceedings of ACM ICS (2002)Google Scholar
  12. 12.
    Kermarrec, A.-N., Massoulie, L., Ganesh, A.J.: Probabilistic reliable dissemination in large-scale systems. IEEE Transactions on Parallel and Distributed Systems (2003)Google Scholar
  13. 13.
    Chu, J., Labonte, K., Levine, B.: Availability and Locality Measurements of Peer-to-Peer File Systems. In: Proceedings of SPIE (2002)Google Scholar
  14. 14.
    Sripanidkulchai, K.: The popularity of Gnutella queries and its implications on scalability. In: Proceedings of O’Reilly’s Peer-to-Peer and Web Services Conference (2001)Google Scholar
  15. 15.
    Zegura, E.W., Calvert, K.L., Bhattacharjee, S.: How to Model An Internetwork. In: Proceedings of IEEE INFOCOM (1996)Google Scholar

Copyright information

© IFIP International Federation for Information Processing 2005

Authors and Affiliations

  • Yun He
    • 1
  • Qi Zhao
    • 1
  • Jianzhong Zhang
    • 1
  • Gongyi Wu
    • 1
  1. 1.Department of Computer Science and TechnologyNankai UniversityTianjinChina

Personalised recommendations