메뉴 건너뛰기




Volumn 29, Issue 4, 2011, Pages

Depot: Cloud storage with minimal trust

Author keywords

Byzantine fault tolerance; Cloud storage; Fork consistency; Fork Join Causal (FJC) consistency

Indexed keywords

BYZANTINE FAULT TOLERANCE; FAULTY NODE; FORK CONSISTENCY; FORK-JOIN-CAUSAL (FJC) CONSISTENCY; LIVENESS; MALICIOUS BEHAVIOR; RECOVERY PROPERTIES; STORAGE SYSTEMS; TRUST ASSUMPTIONS; TWO LAYERS;

EID: 84863181209     PISSN: 07342071     EISSN: 15577333     Source Type: Journal    
DOI: 10.1145/2063509.2063512     Document Type: Article
Times cited : (136)

References (75)
  • 2
    • 0029352313 scopus 로고
    • Causal memory: Definitions, implementation and programming
    • AHAMAD, M., NEIGER, G., BURNS, J. E., KOHLI, P., AND HUTTO, P. 1995. Causal memory: Definitions, implementation and programming. Distrib. Comput. 9, 1, 37-49.
    • (1995) Distrib. Comput. , vol.9 , Issue.1 , pp. 37-49
    • Ahamad, M.1    Neiger, G.2    Burns, J.E.3    Kohli, P.4    Hutto, P.5
  • 4
    • 84863121639 scopus 로고    scopus 로고
    • AMAZON S3 TEAM Amazon S3 availability event: July 20, 2008
    • AMAZON S3 TEAM. 2008. Amazon S3 Team. Amazon S3 availability event: July 20, 2008. http://status.aws.amazon.com/s3-20080720.html.
    • (2008) Amazon S3 Team
  • 7
  • 10
    • 72249117765 scopus 로고    scopus 로고
    • Magnolia suffers major data loss, site taken offline
    • CALORE, M. 2009. Magnolia suffers major data loss, site taken offline. Wired Mag.
    • (2009) Wired Mag
    • Calore, M.1
  • 11
    • 0345757358 scopus 로고    scopus 로고
    • Practical byzantine fault tolerance and proactive recovery
    • CASTRO, M. AND LISKOV, B. 2002. Practical Byzantine fault tolerance and proactive recovery. ACM Trans. Comput. Syst. 20, 4.
    • (2002) ACM Trans. Comput. Syst. , vol.20 , pp. 4
    • Castro, M.1    Liskov, B.2
  • 23
    • 0346739133 scopus 로고    scopus 로고
    • Fast and secure distributed read-only file system
    • DOI 10.1145/505452.505453
    • FU, K., KAASHOEK, M. F., AND MAZIÈRES, D. 2002. Fast and secure distributed read-only file system. ACM Trans. Comput. Syst. 20, 1, 1-24. (Pubitemid 135707562)
    • (2002) ACM Transactions on Computer Systems , vol.20 , Issue.1 , pp. 1-24
    • Fu, K.1    Kaashoek, M.F.2    Mazieres, D.3
  • 24
    • 1542640153 scopus 로고    scopus 로고
    • Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services
    • GILBERT, S. AND LYNCH, N. 2002. Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services. SIGACT News 33, 51-59.
    • (2002) SIGACT News , vol.33 , pp. 51-59
    • Gilbert, S.1    Lynch, N.2
  • 26
    • 0033900663 scopus 로고    scopus 로고
    • Rules of thumb in data engineering
    • GRAY, J. AND SHENOY, P. 2000. Rules of thumb in data engineering. In Data Engineering. 3-12.
    • (2000) Data Engineering , pp. 3-12
    • Gray, J.1    Shenoy, P.2
  • 31
    • 0025460579 scopus 로고
    • Linearizability: A correctness condition for concurrent objects
    • HERLIHY, M. P. AND WING, J. M. 1990. Linearizability: A correctness condition for concurrent objects. ACM Trans. Program. Lang. Syst. 12, 3.
    • (1990) ACM Trans. Program. Lang. Syst. , vol.12 , pp. 3
    • Herlihy, M.P.1    Wing, J.M.2
  • 35
    • 0026815276 scopus 로고
    • Disconnected operation in the coda file system
    • KISTLER, J. AND SATYANARAYANAN, M. 1992. Disconnected operation in the coda file system. ACM Trans. Comput. Syst. 10, 1, 3-5.
    • (1992) ACM Trans. Comput. Syst. , vol.10 , Issue.1 , pp. 3-5
    • Kistler, J.1    Satyanarayanan, M.2
  • 38
    • 0017996760 scopus 로고
    • Time, clocks, and the ordering of events in a distributed system
    • LAMPORT, L. 1978. Time, clocks, and the ordering of events in a distributed system. Comm. ACM 21, 7.
    • (1978) Comm. ACM , vol.21 , pp. 7
    • Lamport, L.1
  • 39
    • 0018518477 scopus 로고
    • How to make a multiprocessor computer that correctly executes multiprocess programs
    • LAMPORT, L. 1979. How to make a multiprocessor computer that correctly executes multiprocess programs. IEEE Trans. Comput. 28, 9, 690-691. (Pubitemid 10420526)
    • (1979) IEEE Transactions on Computers , vol.C-28 , Issue.9 , pp. 690-691
    • Lamport Leslie1
  • 44
    • 0032306029 scopus 로고    scopus 로고
    • Byzantine quorum systems
    • MALKHI, D. AND REITER, M. 1998. Byzantine quorum systems. Distrib. Comput. 11, 4, 203-213. (Pubitemid 128489949)
    • (1998) Distributed Computing , vol.11 , Issue.4 , pp. 203-213
    • Malkhi, D.1    Reiter, M.2
  • 60
    • 84863121641 scopus 로고    scopus 로고
    • S3 APP CATALOG
    • S3 APP CATALOG. 2011. AWS forum: Customer app catalog. http://developer.amazonwebservices.com/connect/kbcategory.jspa?categoryID=66.
    • (2011) AWS Forum: Customer App Catalog
  • 75
    • 36048935605 scopus 로고    scopus 로고
    • Strong accountability for network storage
    • YUMEREFENDI, A. AND CHASE, J. 2007. Strong accountability for network storage. ACM Trans. Storage 3, 3.
    • (2007) ACM Trans. Storage , vol.3 , pp. 3
    • Yumerefendi, A.1    Chase, J.2


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