Operating system support for massive replication
Pages 227 - 230
Abstract
The increasing number of devices used by each user to access data and services and the increasing importance of the data and services available electronically both favor "access-anywhere" network-delivered services. Unfortunately, making such services highly available is difficult. For example, even though end servers or service hosting sites advertise an availability of "four nines" (99.99%) or "five nines" (99.999%), the end-to-end service availability (as perceived by clients) istypically limited to two nines because of poor wide area network availability [6]. Moreover, although network bandwidths are improving quickly, network latencies are much more difficult to improve in wide area networks, which limits performance for access-anywhere services if those services are delivered from a single location.
References
[1]
http://www.ietf.org/html.charters/diffserv-charter.html.
[2]
Akamai. Fast internet content delivery with freeflow. In White Paper, Nov 1999.
[3]
G. Banga, P. Druschel, and J. C. Mogul. Resource containers: A new facility for resource management in server systems. In OSDI, 1999.
[4]
L. Brakmo, S. O'Malley, and L. Peterson. Tcp vegas: New techniques for congestion detection and avoidance. In Proceedings of SIGCOMM'94 Conference, 1994.
[5]
B. Chandra. Web workloads influencing disconnected services access. Master's thesis, UT Austin, 2001.
[6]
B. Chandra, M. Dahlin, L. Gao, A. Khoja, A. Razzaq, and A. Sewani. Resource management for scalable disconnected access to web services. In WWW10, May 2001.
[7]
J. Chase, D. Anderson, P. Thakar, A. Vahdat, and R. Doyle. Managing Energy and Server Resources in Hosting Centres. In SOSP 2001.
[8]
M. Dahlin. Historical disk storage costs, mar 2002. http://cs.utexas.edu/~dahlin/techTrends/data/diskPrices/data.
[9]
D. Duchamp. Prefetching Hyperlinks. In Proceedings of the USITS, October 1999.
[10]
J. Gray and P. Shenoy. Rules of Thumb in Data Engineering. In "Proc. 16th Internat. Conference on Data Engineering", pages 3--12, 2000.
[11]
S. Gribble, A. Whittaker, and M. Shaw. Denali: Lightweight virtual machines for distributed and networked applications. Technical Report 02-02-01, Univ. of Washington, 2002.
[12]
J. Howard, M. Kazar, S. Menees, D. Nichols, M. Satyanarayanan, R. Sidebotham, and M. West. Scale and Performance in a Distributed File System. ACM Transactions on Computer Systems, 6(1):51--81, February 1988.
[13]
Madhukar Korupolu and Mike Dahlin. Coordinated placement and replacement for large-scale distributed caches. In Workshop On Internet Applications, June 1999.
[14]
A. Odlyzko. Internet growth: Myth and reality, use and abuse. Journal of Computer Resource Management, 2001.
[15]
V. Sundaram, A. Chandra, P. Goyal, P. J. Shenoy, J. Sahni, and H. M. Vin. Application performance in the QLinux multimedia operating system. In ACM Multimedia, 2000.
[16]
D. Terry, M. Theimer, K. Petersen, A. Demers, M. Spreitzer, and C. Hauser. Managing Update Conflicts in Bayou, a Weakly Connected Replicated Storage System. In Proceedings of SOSP 1995, pages 172--183, December 1995.
[17]
R. Tewari, M. Dahlin, H. Vin, and J. Kay. Design Considerations for Distributed Caching on the Internet. In Proceedings of ICDCS 1999, May 1999.
[18]
A. Venkataramani, M. Dahlin. and P. Weidmann. Bandwidth constrained placement in a WAN. In PODC, Aug 2001.
[19]
A. Venkataramani, R. Kokku, and M. Dahlin. System support for background replication. Technical Report TR-02-30, UT, Austin Department of Computer Sciences, May 2002.
[20]
A. Venkataramani, P. Yalagandula, R. Kokku, S. Sharif, and M. Dahlin. Potential costs and benefits of long-term prefetching for content-distribution. In WCW, June 2001.
[21]
H. Yu and Amin Vahdat. The Costs and Limits of Availability for Replicated Services. In Proceedings of SOSP 2001, 2001.
- Operating system support for massive replication
Recommendations
Branch replication scheme: A new model for data replication in large scale data grids
Data replication is a practical and effective method to achieve efficient and fault-tolerant data access in grids. Traditionally, data replication schemes maintain an entire replica in each site where a file is replicated, providing a read-only model. ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
July 2002
258 pages
Copyright © 2002 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]
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 July 2002
Check for updates
Qualifiers
- Article
Acceptance Rates
Overall Acceptance Rate 37 of 37 submissions, 100%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 79Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 29 Nov 2024
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in