Comparison of Access Policies for Replica Placement in Tree Networks - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year :

Comparison of Access Policies for Replica Placement in Tree Networks

(1, 2)
1
2

Abstract

In this paper, we discuss and compare several policies to place replicas in tree networks sub ject to server capacity. The client requests are known beforehand, while the number and location of the servers are to be determined. The standard approach in the literature is to enforce that all requests of a client be served by a single server in the tree (Single). One major contribution of this paper is to assess the impact of a new policy in which requests of a given client can be processed by multiple servers (Multiple), thus distributing the processing of requests over the platform. We characterize problem instances for which Multiple cannot be more than two times better than the optimal Single solution, if this latter exists. For such instances, we provide a procedure which builds a Single solution with a guarantee on its cost. This is a very interesting result for applications which do not accept multiple servers for a given client, since it might be more difficult to implement such a complex strategy.
Fichier principal
Vignette du fichier
rr2009-12.pdf (185.92 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

ensl-00374927 , version 1 (10-04-2009)

Identifiers

  • HAL Id : ensl-00374927 , version 1

Cite

Anne Benoit. Comparison of Access Policies for Replica Placement in Tree Networks. 2009. ⟨ensl-00374927⟩
61 View
157 Download

Share

Gmail Facebook Twitter LinkedIn More