✦ LIBER ✦

Locating replicas of a database on a network

✍ Scribed by Hakimi, S. Louis; Schmeichel, Edward F.

Publisher: John Wiley and Sons
Year: 1997
Tongue: English
Weight: 82 KB
Volume: 30
Category: Article
ISSN: 0028-3045
DOI: 10.1002/(sici)1097-0037(199708)30:1<31::aid-net4>3.0.co;2-m

No coin nor oath required. For personal study only.

✦ Synopsis

We study the problem of locating replicas of a database on a network to minimize the communication cost. We first present extensions of the p-median theorem to prove that under two different measures of communication cost one can always optimally locate the replicas at the vertices (nodes) of the network. We briefly review the fact that the problem is NP-hard for general networks under either measure of communication cost, and we then provide efficient algorithms for solving the problem on tree networks for either of the two measures.

📜 SIMILAR VOLUMES

A dynamic replica allocation method base

A dynamic replica allocation method based on database migration in broadband networks

✍ Takahiro Hara; Kaname Harumoto; Masahiko Tsukamoto; Shojiro Nishio; Jun Okui 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 225 KB 👁 2 views

Locating a cycle in a transportation or

Locating a cycle in a transportation or a telecommunications network

✍ Gilbert Laporte; Inmaculada Rodríguez Martín 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 277 KB 👁 1 views

Location of an obnoxious facility on a n

Location of an obnoxious facility on a network: A voting approach

✍ Martine Labbé 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 494 KB 👁 1 views

Heuristics for the location of inspectio

Heuristics for the location of inspection stations on a network

✍ Michel Gendreau; Gilbert Laporte; Isabelle Parent 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 385 KB 👁 1 views

This article considers the preventive flow interception problem (FIP) on a network. Given a directed network with known origin-destination path flows, each generating a certain amount of risk, the preventive FIP consists of optimally locating m facilities on the network in order to maximize the tota

Minimum covering criterion for obnoxious

Minimum covering criterion for obnoxious facility location on a network

✍ Berman, Oded; Drezner, Zvi; Wesolowsky, George O. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 381 KB 👁 1 views

The objective of this article was to find a location of a new facility on a network so that the total number (weight) of nodes within a prespecified distance R is minimized. This problem is applicable when locating an obnoxious facility such as garbage dumps, nuclear reactors, prisons, and military

A unified approach to network location p

A unified approach to network location problems

✍ Nickel, Stefan; Puerto, Justo 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 124 KB 👁 2 views

In this paper, we introduce a new type of single-facility location problem on networks which includes as special cases most of the classical criteria in the literature. Structural results as well as a finite dominating set for the optimal locations are developed. Also, the extension to the multifaci