메뉴 건너뛰기




Volumn 18, Issue , 2004, Pages 1155-1163

LessLog: A logless file replication algorithm for peer-to-peer distributed systems

Author keywords

Fault tolerant protocols; File replication algorithms; Peer to peer distributed systems

Indexed keywords

ALGORITHMS; FAULT TOLERANT COMPUTER SYSTEMS; HIERARCHICAL SYSTEMS; MATHEMATICAL MODELS; SERVERS; TABLE LOOKUP;

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

References (16)
  • 1
    • 33847090792 scopus 로고    scopus 로고
    • Gnutella. http://dss.clip2.com/GnutellaProtocol04.pdf.
    • Gnutella
  • 2
    • 12444319679 scopus 로고    scopus 로고
    • Napster. http://www.napster.com/.
  • 5
    • 27644479713 scopus 로고    scopus 로고
    • Replication strategies in unstructured peer-to-peer networks
    • August
    • E. Cohen and S. Shenker. Replication Strategies in Unstructured Peer-to-Peer Networks. In Proceedings of ACM SIGCOMM, pages 177-190, August 2002.
    • (2002) Proceedings of ACM SIGCOMM , pp. 177-190
    • Cohen, E.1    Shenker, S.2
  • 7
    • 0030704545 scopus 로고    scopus 로고
    • Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web
    • May
    • D. Karger, E. Lehman, T. Leighton, M. Levine, D. Lewin, and R. 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
  • 12
    • 57349142855 scopus 로고    scopus 로고
    • Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems
    • A. Rowstron and P. Druschel. Pastry: Scalable, Decentralized Object Location and Routing for Large-scale Peer-to-Peer Systems. Lecture Notes in Computer Science, pages 329-340, 2001.
    • (2001) Lecture Notes in Computer Science , pp. 329-340
    • Rowstron, A.1    Druschel, P.2
  • 15
    • 0003858844 scopus 로고    scopus 로고
    • Tapestry: An infrastructure for fault-tolerant wide-area location and routing
    • UC Berkeley
    • B. Y. Zhao, J. D. Kubiatowicz, and A. D. Joseph. Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and Routing. Technical Report UCB/CSD-01-1141, UC Berkeley, 2001.
    • (2001) Technical Report , vol.UCB-CSD-01-1141
    • Zhao, B.Y.1    Kubiatowicz, J.D.2    Joseph, A.D.3
  • 16
    • 0034819333 scopus 로고    scopus 로고
    • Bayeux: An architecture for scalable and fault-tolerant wide-area data dissemination
    • June
    • S. Q. Zhuang, B. Y. Zhao, A. D. Joseph, R. H. Katz, and J. D. Kubiatowicz. Bayeux: An Architecture for Scalable and Fault-tolerant Wide-area Data Dissemination. In Proceedings of NOSSDAV, pages 11-20, June 2001.
    • (2001) Proceedings of NOSSDAV , pp. 11-20
    • Zhuang, S.Q.1    Zhao, B.Y.2    Joseph, A.D.3    Katz, R.H.4    Kubiatowicz, J.D.5


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