The hash history approach for reconciling mutual inconsistency

Proceedings - International Conference on Distributed Computing Systems

Volumn , Issue , 2003, Pages 670-677

  Kang, Brent Byung Hoon ^a   Wilensky, Robert ^a   Kubiatowicz, John ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; DATA COMMUNICATION SYSTEMS; GRAPH THEORY; MERGING; MOBILE COMPUTING; SYNCHRONIZATION;

HASH HISTORY APPROACH; MUTUAL INCONSISTENCY;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0037629683     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. A. Demers et al. Epidemic algorithms for replicated database maintenance. In Proc. of ACM PODC Symp., 1987.
2. P. S. Almeida, C. Baquero, and V. Fonte, Version stamps- decentralized version vectors. In Proc. of IEEE ICDCS, 2002.
3. C. Baquero and F. Moura. Improving causality logging in mobile computing networks. ACM Mobile Computing and Communications Review, 2(4):62-66, 1998.
4. K. P. Birman and T. A. Joseph. Reliable communication in the presence of failures. ACM Transactions on Computer Systems, 5(1):47-76, 1987.
5. I. Clark, O. Sandberg, B. Wiley, and T. Hong. Freenet: A distributed anonymous information storage and retrieval system. In Proc. of the Workshop on Design Issues in Anonymity and Unobservability, Berkeley, CA, 2000.
6. D. Stott Parker et al. Detection of mutual inconsistency in distributed systems. IEEE Transactions on Software Engineering, 9(3):240-247, May 1983.
7. F. Dabek, M. F. Kaashoek, D. Karger, R. Morris, and I. Stoica. Wide-area cooperative storage with CFS. In Proc. of ACM SOSP, 2001.
8. R. Dingledine, M. Freedman, and D. Molnar. The freehaven project: Distributed anonymous storage service. In Proc. of the Workshop on Design Issues in Anonymity and Unobservability, 2000.
9. P. Druschel and A. Rowstron. Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility. In Proc. of ACM SOSP, 2001.
10. R. A. Golding. A weak-consistency architecture for distributed information services. Computing Systems, 5(4) (UCSC-CRL-92-31) 379-405, 1992.
11. J. J. Kistler and M. Satyanarayanan. Disconnected operation in the coda file system. ACM Transactions on Computer Systems, 10(1):3-25, 1992.
12. J. Kubiatowicz et al. Oceanstore: An architecture for global-scale persistent storage. In Proc. of ASPLOS, 2000.
13. M. Satyanarayanan et al. Coda: a highly available file system for a distributed workstation environment. IEEE Transactions on Computers, 39(4):447-459, 1990.
14. P. Reiher et al. Resolving file conflicts in the ficus file system. In USENIX Conference Proceedings, Summer 1994.
15. K. Petersen et al. Flexible update propagation for weakly consistent replication. In Proc. of ACM SOSP, 1997.
16. R. Prakash and M. Singhal. Dependency sequences and hierarchical clocks: efficient alternatives to vector clocks for mobile computing systems. Wireless Networks, 3(5):349-360, 1997.
17. R. Guy et al. Implementation of the Ficus Replicated File System. In USENIX Conference Proceedings, Summer 1990.
18. D. Ratner, P. Reiher, and G. J. Popek. Dynamic version vector maintenance. Technical Report CSD-970022, University of California, Los Angeles, June 1997.
19. S. K. Sarin and N. A. Lynch. Discarding obsolete information in a replicated database system. IEEE Transactions on Software Engineering, 13(1):39-47, 1987.
20. R. Schwarz and F. Mattern. Detecting causal relationships in distributed computations: In search of the holy grail. Distributed Computing, 7(3):149-174, 1994.
21. M. Waldman, A. Rubin, and L. Cranor. Publius: A robust, tamper-evident, censorship-resistant, web publishing system. In Proc. 9th USENIX Security Symposium, 2000.
22. H. Yu and A. Vahdat. The costs and limits of availability for replicated services. In Proc. of ACM SOSP, 2001.