메뉴 건너뛰기




Volumn 4, Issue , 2004, Pages 2253-2262

Load balancing in dynamic structured P2P systems

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED HASH TABLE (DHT); PEER-TO-PEER SYSTEMS; VIRTUAL SERVERS;

EID: 8344287020     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2004.1354648     Document Type: Conference Paper
Times cited : (240)

References (16)
  • 2
    • 0034782005 scopus 로고    scopus 로고
    • Chord: A scalable peer-to-peer lookup service for internet applications
    • San Diego
    • Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek, and Hari Balakrishnan, "Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications," in Proc. ACM SIGCOMM, San Diego, 2001, pp. 149-160.
    • (2001) Proc. ACM SIGCOMM , pp. 149-160
    • Stoica, I.1    Morris, R.2    Karger, D.3    Frans Kaashoek, M.4    Balakrishnan, H.5
  • 4
    • 0003007594 scopus 로고    scopus 로고
    • Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems
    • Antony Rowstron and Peter Druschel, "Pastry: Scalable, Distributed Object Location and Routing for Large-scale Peer-to-Peer Systems," in Proc. Middleware, 2001.
    • (2001) Proc. Middleware
    • Rowstron, A.1    Druschel, P.2
  • 6
    • 8344261691 scopus 로고    scopus 로고
    • Simple load balancing for distributed hash tables
    • Feb
    • John Byers, Jeffrey Considine, and Michael Mitzenmacher, "Simple Load Balancing for Distributed Hash Tables," in Proc. IPTPS, Feb, 2003.
    • (2003) Proc. IPTPS
    • Byers, J.1    Considine, J.2    Mitzenmacher, M.3
  • 8
    • 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, Matthew Levine, Daniel Lewin, and Rina Panigrahy, "Consistent Hashing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the World Wide Web," in Proc. ACM STOC, May 1997.
    • (1997) Proc. ACM STOC
    • Karger, D.1    Lehman, E.2    Leighton, T.3    Levine, M.4    Lewin, D.5    Panigrahy, R.6
  • 9
    • 8344267648 scopus 로고    scopus 로고
    • A stochastic process on the hypercube with applications to peer-to-peer networks
    • M. Adler, Eran Halperin, R. M. Karp, and V. Vazirani, "A stochastic process on the hypercube with applications to peer-to-peer networks," in Proc. STOC, 2003.
    • (2003) Proc. STOC
    • Adler, M.1    Halperin, E.2    Karp, R.M.3    Vazirani, V.4
  • 10
    • 8344284362 scopus 로고    scopus 로고
    • New algorithms for load balancing in peer-to-peer systems
    • MIT LCS, July
    • David Karger and Matthias Ruhl, "New Algorithms for Load Balancing in Peer-to-Peer Systems," Tech. Rep, MIT-LCS-TR-911, MIT LCS, July 2003.
    • (2003) Tech. Rep , vol.MIT-LCS-TR-911
    • Karger, D.1    Ruhl, M.2
  • 11
    • 0012612933 scopus 로고    scopus 로고
    • Competitive hill-climbing strategies for replica placement in a distributed file system
    • J. R. Douceur and R. P. Wattenhofer, "Competitive Hill-Climbing Strategies for Replica Placement in a Distributed File System," in Proc. DISC, 2001.
    • (2001) Proc. DISC
    • Douceur, J.R.1    Wattenhofer, R.P.2
  • 12


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