메뉴 건너뛰기




Volumn , Issue , 2003, Pages 283-287

Multi-space distributed hash tables for multiple transport domains

Author keywords

Distributed hash table; Overlay networks; Peer to peer networking

Indexed keywords

DATA STRUCTURES; DISTRIBUTED COMPUTER SYSTEMS; INTERNET PROTOCOLS; PEER TO PEER NETWORKS; PROBLEM SOLVING;

EID: 33744906350     PISSN: 15566463     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/icon.2003.1266204     Document Type: Conference Paper
Times cited : (3)

References (12)
  • 1
    • 0035699610 scopus 로고    scopus 로고
    • PAST: A large-scale, persistent peer-to-peer storage utility
    • Schloss Elmau, Germany, May
    • P. Druschel and A. Rowstron. PAST: A large-scale, persistent peer-to-peer storage utility. In HotOS VIII, pages 75-80, Schloss Elmau, Germany, May 2001.
    • (2001) HotOS VIII , pp. 75-80
    • Druschel, P.1    Rowstron, A.2
  • 2
    • 0030704545 scopus 로고    scopus 로고
    • Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the world wide web
    • May
    • David Karger, Eric Lehman, Tom Leighton, Mathhew Levine, Daniel Lewin, and Rina Panigrahy. Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the world wide web. In ACM Symposium on Theory of Computing, pages 654-663, May 1997.
    • (1997) ACM Symposium on Theory of Computing , pp. 654-663
    • Karger, D.1    Lehman, E.2    Leighton, T.3    Levine, M.4    Lewin, D.5    Panigrahy, R.6
  • 7
    • 57349142855 scopus 로고    scopus 로고
    • Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems
    • Antony Rowstron and Peter Druschel. Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. Lecture Notes in Computer Science, 2218:329-, 2001.
    • (2001) Lecture Notes in Computer Science , vol.2218 , pp. 329
    • Rowstron, A.1    Druschel, P.2


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