The issue of data replication is considered in the context of a restricted system model motivated by certain distributed data-warehousing applications. A new replica management protocol is defined for this model in which global serializability is ensured, while message overhead and deadlock frequenc
Content Replication in a Distributed and Controlled Environment
β Scribed by Bo Li
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 409 KB
- Volume
- 59
- Category
- Article
- ISSN
- 0743-7315
No coin nor oath required. For personal study only.
β¦ Synopsis
Recently, we have witnessed a phenomenal growth in the InternetΓIntranet coupled with rapid deployment of new services. Information dissemination over the network has become one of the most important activities in our daily life. The existing systems, however, often suffer from notorious long delays experienced by clients, especially during peak hours. This is caused by the combination of a variety of factors, including inadequate link bandwidth, server overload, and network congestion. Content replication has been shown to be one of the most effective mechanisms to cope with this problem. The basic idea is to replicate the information across a network so that clients' requests can be spread out. One of the major issues is which locations inside the network these replications should take place, i.e., where to place the replicated servers. In this paper we investigate the content replication is a controlled and distributed environment. The salient feature of this environment is that the decision where to replicate information can be determined by a single authority, the Intranet being the typical example. We consider the problem of placing multiple replicated servers within a network, given there exist multiple target web servers as information providers. We formulate this as an optimization problem by taking into consideration the characteristics of the network topology. We first show that this is a NP-complete problem, and then we present a number of heuristsic-based algorithms for content replications. Finally, in order to investigate various trade-offs in terms of cost and algorithm complexity, we carry out comparison studies among different heuristic algorithms and, also, with an optimal placement algorithm we recently proposed for the single target web server environment.
π SIMILAR VOLUMES
Clinical research databases can meet both research and clinical needs, but this ideal is seldom achieved. Priorities often di er for those who collect and ultimately use the data and those who develop data systems. Traditional database designs also create logistical barriers that hamper communicatio