메뉴 건너뛰기




Volumn , Issue , 2004, Pages 243-254

A peer-to-peer replica location service based on a distributed hash table

Author keywords

Grid; Peer to Peer; Replication

Indexed keywords

DISTRIBUTED SYSTEMS; GRID; HASH TABLE; PEER-TO-PEER; REPLICA LOCATION SERVICE (RLS); REPLICATION; SCALABILITY;

EID: 23944478582     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (39)

References (41)
  • 5
  • 6
    • 0014814325 scopus 로고    scopus 로고
    • Space/time trade-offs in hash coding with allowable errors
    • B. Bloom, "Space/Time Trade-offs in Hash Coding with Allowable Errors," Communications of ACM, vol. 13, pp. 422-426.
    • Communications of ACM , vol.13 , pp. 422-426
    • Bloom, B.1
  • 9
    • 33751095033 scopus 로고    scopus 로고
    • Mapping abstract complex workflows onto grid environments
    • E. Deelman, et. al, "Mapping Abstract Complex Workflows onto Grid Environments," Journal of Grid Computing, vol. 1, pp. 25-39.
    • Journal of Grid Computing , vol.1 , pp. 25-39
    • Deelman, E.1
  • 10
    • 33847090792 scopus 로고    scopus 로고
    • "Gnutella." http://gnutella.wego.com.
    • Gnutella
  • 11
    • 0038742218 scopus 로고    scopus 로고
    • Mapping the Gnutella network: Properties of large-scale peer-to-peer systems and implications for system design
    • M. Ripeanu, I. Foster, and A. Iamnitchi., "Mapping the Gnutella network: properties of large-scale peer-to-peer systems and implications for system design," IEEE Internet Computing Journal.
    • IEEE Internet Computing Journal
    • Ripeanu, M.1    Foster, I.2    Iamnitchi, A.3
  • 14
    • 2342444446 scopus 로고    scopus 로고
    • Routing algorithms for DHTs: Some open questions
    • Cambridge, USA, March
    • S. Ratnasamy, S. Shenker, and I. Stoica, "Routing algorithms for DHTs: Some open questions," presented at IPTPS02, Cambridge, USA, March 2002.
    • (2002) IPTPS02
    • Ratnasamy, S.1    Shenker, S.2    Stoica, I.3
  • 15
    • 0003858844 scopus 로고    scopus 로고
    • Tapestry: An infrastructure for fault-resilient wide-area location and routing
    • April
    • B. Y. Zhao, J. D. Kubiatowicz, and A. D. Joseph, "Tapestry: An infrastructure for fault-resilient wide-area location and routing," U.C. Berkeley, Berkeley Technical Report UCB-CSD-01-1141, April 2001.
    • (2001) U.C. Berkeley, Berkeley Technical Report , vol.UCB-CSD-01-1141
    • Zhao, B.Y.1    Kubiatowicz, J.D.2    Joseph, A.D.3
  • 36
    • 0030652065 scopus 로고    scopus 로고
    • Accessing nearby copies of replicated objects in a distributed environment
    • Newport, Rhode Island, June
    • C. Plaxton, R. Rajaraman, A. Richa, "Accessing nearby copies of replicated objects in a distributed environment," presented at ACM SPAA, Newport, Rhode Island, June 1997.
    • (1997) ACM SPAA
    • Plaxton, C.1    Rajaraman, R.2    Richa, A.3
  • 38
    • 1142282403 scopus 로고
    • Skip lists: A probabilistic alternative to BalancedTrees
    • W. Pugh, "Skip Lists: A Probabilistic Alternative to BalancedTrees," presented at Workshop on Algorithms and Data Structures, 1989.
    • (1989) Workshop on Algorithms and Data Structures
    • Pugh, W.1
  • 39
    • 33749391644 scopus 로고    scopus 로고
    • Incremental optimization in distributed hash table systems
    • H. Zhang, A. Goel, R. Govindan, "Incremental Optimization In Distributed Hash Table Systems," presented at ACM SIGMETRICS, 2003.
    • (2003) ACM SIGMETRICS
    • Zhang, H.1    Goel, A.2    Govindan, R.3


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