Simulating wide-area replication
Pages 267 - 274
Abstract
We describe our experiences with simulating replication algorithms for use in far flung distributed systems. The algorithms under scrutiny mimic epidemics. Epidemic algorithms seem to scale and adapt to change (such as varying replica sets) well. The loose consistency guarantees they make seem more useful in applications where availability strongly outweighs correctness; e.g., distributed name service.
References
[1]
Richard A. Becker, John M. Chambers, and Allan R. Wilks. New S Language: A Programming Environment for Data Analysis and Graphics. Wadsworth, 1988.]]
[2]
T. Bemers-Lee, R. Cailliau, A. Luotonen, H. E Nielsen, and A. Secret. The WorldWide Web. Communications of the ACM, 37(8):76-82, August 1994.]]
[3]
T. Bemers-Lee. Universal Resource Identifiers in WWW. Request for Comments 1630. ARPA Network Working Group, June 1994.]]
[4]
Andrew D. Birrel, Roy Levin, Roger M. Needham, and Michael D. Schroeder. Grapevine: An exercise in distributed computing. Communications of the ACM, 25(4):260--74, April 1982.]]
[5]
Andrew Black, Norman Hutchinson, Eric Jul, Henry Levy, and Larry Carter. Distribution and abstract types in Emerald. 1EEE Transactions on Software Engineering, SE-13(1):65-76, January 1987.]]
[6]
Stefano Ceri and Giuseppe Pelagatti. Distributed Databases; Principles and Systems, Computer Science Series. McGraw-Hill International Editions, 1984.]]
[7]
Alan Demers, Dan Greene, Carl Hauser, Wes Irish, John Larson, Scott Shenker, Howard Sturgis, Dan Swinehart, and Doug Terry. Epidemic algorithms for replicated database maintenance. Proceedings of the 6 th Annual ACM Symposium on Principles of Distributed Computing, pages 1-12. ACM, August 1987. Order no. 536870.]]
[8]
G. N. Dixon, G. D. Parrington, S. K. Shrivastava, and S. M. Wheater. The treatment of persistent objects in Arjuna. Proceedings of ECOOP '89, July 1989.]]
[9]
D.K. Gifford. Weighted voting for replicated data. Proceedings of the 7 th Symposium on Operating System Principles (Pacific Grove), pages 150-61. ACM, 1979.]]
[10]
M. Frans Kaashoek, Andrew S. Tanenbaum, Susan Flynn Hummel, and Henri E. Bal. An efficient reliable broadcast protocol. Operating Systems Review, 23(4):5-19, October 1989.]]
[11]
Rivka Ladin, Barbara Liskov, and Sanjay Ghemawat. Providing high availability using lazy replication. ACM Transactions on Computer Systems, 10(4):360-91, November 1992.]]
[12]
Butler W. Lampson. Designing a Global Name Service. Proceedings of the 5 th ACM Symposium on Principles of Distributed Computing, pages 1-10. ACM, 1986.]]
[13]
Darrell Long, Andrew Muir, and Richard Golding. A longitudinal survey of Internet host reliability. Technical report UCSC-CRL-95-16. Computer and Information Sciences Board, University of California at Santa Cruz, February 1995.]]
[14]
Chaoying Ma. Designing a Universal Name Service. Technical report TR 270. University of Cambridge Computer Laboratory, November 1992.]]
[15]
Roger M. Needham. Names. In Sape J. Mullender, editor, Distributed Systems, Frontier Series, pages 315-27. Addison-Wesley Publishing Company, New York, 1993.]]
[16]
R. Rivest. The MD5 Message-Digest Algorithm. Request for comments 1321. ARPA Network Working Group, Aprl 1992.]]
[17]
Marc Shapiro, Peter Dickman, and David Plainfossr. SSP chains: robust, distributed references supporting acyclic garbage collection. Technical report 1799. INRIA, November 1992.]]
[18]
A. S. Tanenbaum, Robbert van Renesse, Hans van Staveren, G. J. Sharp, S. J. Mullender, A. J. Jansen, and G. van Rossum. Experiences with the Amoeba distributed operating system. Communications of the ACM, 33(12):47-63, December 1990.]]
[19]
Guido van Rossum. An Introduction to Python for UNIX/C Programmers. Proceedings of the NLUUG (The Netherlands), November 1993.]]
Recommendations
Pseudo-Active Replication of Distributed Objects in Wide-Area Networks
DOA '99: Proceedings of the International Symposium on Distributed Objects and ApplicationsIn this paper, we discuss how to replicate a server in order to obtain fault-tolerant services. In the active replication, all the requests from a client are performed by all the server replicas in the same order. The replicas are rather placed on ...
Improving Wide-Area Replication Performance through Informed Leader Election and Overlay Construction
CLOUD '13: Proceedings of the 2013 IEEE Sixth International Conference on Cloud ComputingReplication is an important building block to achieve high availability in the presence of failures. Until recently, wide-area replication with strong consistency guarantees was regarded as impractical due to performance constraints. We investigate how ...
Protocol for Pseudo-Active Replication in Wide-Area Network
ICPP '99: Proceedings of the 1999 International Workshops on Parallel ProcessingIn this paper, we discuss how to replicate a server in order to obtain fault-tolerant services. In the active replication, all the requests from a client are performed by all the server replicas in the same order. The replicas are rather placed on ...
Comments
Information & Contributors
Information
Published In
September 1996
326 pages
ISBN:9781450373395
DOI:10.1145/504450
- General Chair:
- Andrew Herbert,
- Program Chair:
- Andrew S. Tanenbaum
Copyright © 1996 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 09 September 1996
Check for updates
Qualifiers
- Article
Conference
Acceptance Rates
Overall Acceptance Rate 37 of 37 submissions, 100%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 260Total Downloads
- Downloads (Last 12 months)14
- Downloads (Last 6 weeks)0
Reflects downloads up to 12 Aug 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in