메뉴 건너뛰기




Volumn , Issue , 2005, Pages

TreeP: A tree based P2P network architecture

Author keywords

B tree; Distributed system; Grid; Heterogeneous systems; Hierarchy topologies; Lookup; P2P; Routing strategies

Indexed keywords

CHLORINE COMPOUNDS; CLIENT SERVER COMPUTER SYSTEMS; COMPUTER SOFTWARE; ELECTRIC NETWORK TOPOLOGY; MAINTENANCE OF WAY; MIDDLEWARE; TOPOLOGY;

EID: 50149093726     PISSN: 15525244     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CLUSTR.2005.347022     Document Type: Conference Paper
Times cited : (25)

References (32)
  • 5
    • 50149086846 scopus 로고    scopus 로고
    • T. Hossfeld, K. Leibnitz, R. Pries, K. Tutschku, nformation Diffusion in eDonkey Filesharing Networks, Australian Telecommunication Networks and Applications Conference, December 8-10, 2004.
    • T. Hossfeld, K. Leibnitz, R. Pries, K. Tutschku, nformation Diffusion in eDonkey Filesharing Networks, Australian Telecommunication Networks and Applications Conference, December 8-10, 2004.
  • 7
    • 1242291299 scopus 로고    scopus 로고
    • Early measurements of a cluster-based architecture for P2P systems
    • San Francisco, CA, USA, November 1-2
    • B. Krishnamurthy, J. Wang, Y. Xie, Early measurements of a cluster-based architecture for P2P systems, ACM SIGCOMM Internet Measurement Workshop, San Francisco, CA, USA, November 1-2, 2001.
    • (2001) ACM SIGCOMM Internet Measurement Workshop
    • Krishnamurthy, B.1    Wang, J.2    Xie, Y.3
  • 8
    • 50149084408 scopus 로고    scopus 로고
    • I. Stoica_, R. Morris, D. Karger, M. F. Kaashoek, H. Balakrishnan, Chord: A scalable peer-to-peer lookup service for internet applications, ACM SIGCOMM Internet Measurement Workshop, San Francisco, CA, USA, November 1-2, 2001.
    • I. Stoica_, R. Morris, D. Karger, M. F. Kaashoek, H. Balakrishnan, Chord: A scalable peer-to-peer lookup service for internet applications, ACM SIGCOMM Internet Measurement Workshop, San Francisco, CA, USA, November 1-2, 2001.
  • 11
    • 0003007594 scopus 로고    scopus 로고
    • Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems
    • Heidelberg, Germany, November 12-16
    • A. Rowstron, P. Druschel, Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems, IFIP/ACM International Conference on Distributed Systems, Heidelberg, Germany, November 12-16, 2001.
    • (2001) IFIP/ACM International Conference on Distributed Systems
    • Rowstron, A.1    Druschel, P.2
  • 12
    • 0003858844 scopus 로고    scopus 로고
    • Tapestry: An infrastructure for fault-tolerant wide-area location and routing, U. C
    • UCB//CSD-01, 2001
    • B.Y. Zhao, J. Kubiatowicz, AD. Joseph, Tapestry: an infrastructure for fault-tolerant wide-area location and routing, U. C. Berkeley Technical Report UCB//CSD-01, 2001
    • Berkeley Technical Report
    • Zhao, B.Y.1    Kubiatowicz, J.2    Joseph, A.D.3
  • 17
  • 21
    • 50149105645 scopus 로고    scopus 로고
    • B-tree on P2P: Providing content indexing over DHT Overlays
    • Technical Report, Universidade do Minho, March
    • C. Baquero, N. Lopes, B-tree on P2P: Providing content indexing over DHT Overlays, Technical Report, Universidade do Minho, March 2004.
    • (2004)
    • Baquero, C.1    Lopes, N.2
  • 24
    • 50149083817 scopus 로고    scopus 로고
    • M. Castro et al., Topology-Aware Routing in Structured Peer-to-Peer Overlay Networks, Tech. Rep. MSR-TR-2002-82, Microsoft Research, one Microsoft Way, Redmond, WA, 98052, 2002.
    • M. Castro et al., Topology-Aware Routing in Structured Peer-to-Peer Overlay Networks, Tech. Rep. MSR-TR-2002-82, Microsoft Research, one Microsoft Way, Redmond, WA, 98052, 2002.
  • 28
    • 50149108718 scopus 로고    scopus 로고
    • J. Beal, parentless Distributed Hierarchy Formation, Technical report IA Lab MIT, 2003.
    • J. Beal, parentless Distributed Hierarchy Formation, Technical report IA Lab MIT, 2003.
  • 31
    • 0018480749 scopus 로고    scopus 로고
    • D. Comer, ubiquitous B-tree, Computer Survey, 11, No 2, 1979.
    • D. Comer, ubiquitous B-tree, Computer Survey, Vol 11, No 2, 1979.


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.