Skip to main content
Springer Nature Link
Log in

Approximation Algorithms for Data Management in Networks

  • Published:
Theory of Computing Systems Aims and scope Submit manuscript

Abstract

This paper deals with static data management in computer systems connected by networks. A basic functionality in these systems is the interactive use of shared data objects that can be accessed from each computer in the system. Examples for these objects are files in distributed file systems, cache lines in virtual shared memory systems, or pages in the WWW. In the static scenario we are given read and write request frequencies for each computer–object pair. The goal is to calculate a placement of the objects to the memory modules, possibly with redundancy, such that a given cost function is minimized. With the widespread use of commercial networks, as, e.g., the Internet, it is more and more important to consider commercial factors within data management strategies. The goal in previous work was to utilize the available resources, especially the bandwidth, as best as possible. We present data management strategies for a model in which commercial cost instead of the communication cost is minimized, i.e., we are given a metric communication cost function and a storage cost function. We introduce new deterministic algorithms for the static data management problem on trees and arbitrary networks. Our algorithms aim to minimize the total cost. Note that this problem is MaxSNP-hard on arbitrary networks. Our main result is a combinatorial algorithm that calculates a constant factor approximation for arbitrary networks in polynomial time. Further, we present a dynamic programming algorithm for trees that calculates an optimal placement of all objects in $X$ on a tree $T=(V,E)$ in time $O(|X| \cdot |V| \cdot \di(T) \cdot \log(\de(T)))$.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Heinz Nixdorf Institute and Department of Mathematics and Computer Science, Paderborn University, D-33098 Paderborn, Germany

    Christof Krick & Harald Räcke

  2. International Computer Science Institute, Berkeley, CA 94704-1198, USA

    Matthias Westermann

Authors
  1. Christof Krick
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Harald Räcke
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Matthias Westermann
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding authors

Correspondence to Christof Krick, Harald Räcke or Matthias Westermann.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Krick, C., Räcke, H. & Westermann, M. Approximation Algorithms for Data Management in Networks. Theory Comput Systems 36, 497–519 (2003). https://doi.org/10.1007/s00224-003-1085-7

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00224-003-1085-7

Keywords