HKUST Library Institutional Repository Banner

HKUST Institutional Repository >
Computer Science and Engineering >
CSE Conference Papers >

Please use this identifier to cite or link to this item:
Title: An overview of data replication on the Internet
Authors: Loukopoulos, Thanasis
Ahmad, Ishfaq
Papadias, Dimitris
Keywords: Internet
Response time
Issue Date: May-2002
Citation: Proceedings of International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN), pp. 31-38, Manila, Philippines, May 22-24, 2002
Abstract: The proliferation of the Internet is leading to high expectation on the fast turnaround time. Clients abandoning their connections due to excessive downloading delays translates directly to profit losses. Hence, minimizing the latency perceived by end-users has become the primary performance objective compared to more traditional issues, such as server utilization. The two promising techniques to improve the Internet responsiveness are caching and replication. In this paper we present an overview of recent research in replication. We begin by arguing on the important role of replication in decreasing client perceived response time and proceed by illustrating the main topics that affect its successful deployment on the Internet. We analyze and characterize existing research, providing taxonomies and classifications whenever possible. Our discussion reveals several open problems and research directions.
Rights: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder
Appears in Collections:CSE Conference Papers

Files in This Item:

File Description SizeFormat
ISPAN02.pdf251KbAdobe PDFView/Open

All items in this Repository are protected by copyright, with all rights reserved.