Computer Science - Research and Development

, Volume 27, Issue 3, pp 169–179

Migrating and replicating data in networks

Open Access
Special Issue Paper

Abstract

We survey data management problems in the light of competitive analysis. We review classic results on the file allocation, the page migration, and the page replication problems in a model in which the total cost of communication is subject to optimization. We also briefly present classic and recent extensions of these problems, such as versions that incorporate memory capacity constraints or dynamic changes to the network.

Keywords

Online algorithms Competitive analysis Data management File allocation Page migration 

References

  1. 1.
    Achlioptas D, Chrobak M, Noga J (2000) Competitive analysis of randomized paging algorithms. Theor Comput Sci 234(1–2):203–218 MathSciNetMATHCrossRefGoogle Scholar
  2. 2.
    Albers S, Koga H (1995) Page migration with limited local memory capacity. In: Proc of the 4th int workshop on algorithms and data structures (WADS), pp 147–158 Google Scholar
  3. 3.
    Albers S, Koga H (1998) New on-line algorithms for the page replication problem. J Algorithms 27(1):75–96. Also appeared in Proc of the 4th SWAT, pp 25–36 (1994) MathSciNetMATHCrossRefGoogle Scholar
  4. 4.
    Alon N, Azar Y (1992) On-line Steiner trees in the Euclidean plane. In: Proc of the 8th ACM symp on computational geometry (SoCG), pp 337–343 Google Scholar
  5. 5.
    Awerbuch B, Bartal Y, Fiat A (1993) Competitive distributed file allocation. In: Proc of the 25th ACM symp on theory of computing (STOC), pp 164–173 Google Scholar
  6. 6.
    Awerbuch B, Bartal Y, Fiat A (1993) Heat & Dump: competitive distributed paging. In: Proc of the 34th IEEE symp on foundations of computer science (FOCS), pp 22–31 Google Scholar
  7. 7.
    Awerbuch B, Bartal Y, Fiat A (1998) Distributed paging for general networks. J Algorithms 28(1):67–104. Also appeared in Proc of the 7th SODA, pp 574–583 (1996) MathSciNetMATHCrossRefGoogle Scholar
  8. 8.
    Bartal Y (1996) Distributed paging. In: Dagstuhl workshop on on-line algorithms, pp 97–117 Google Scholar
  9. 9.
    Bartal Y (1996) Probabilistic approximations of metric spaces and its algorithmic applications. In: Proc of the 37th IEEE symp on foundations of computer science (FOCS), pp 184–193 Google Scholar
  10. 10.
    Bartal Y (1998) On approximating arbitrary metrics by tree metrics. In: Proc of the 30th ACM symp on theory of computing (STOC), pp 161–168 Google Scholar
  11. 11.
    Bartal Y, Fiat A, Rabani Y (1995) Competitive algorithms for distributed data management. J Comput Syst Sci 51(3):341–358. Also appeared in Proc of the 24nd STOC, pp 39–50 (1992) MathSciNetCrossRefGoogle Scholar
  12. 12.
    Bartal Y, Charikar M, Indyk P (2001) On page migration and other relaxed task systems. Theor Comput Sci 268(1):43–66. Also appeared in Proc of the 8th SODA, pp 43–52 (1997) MathSciNetMATHCrossRefGoogle Scholar
  13. 13.
    Ben-David S, Borodin A, Karp RM, Tardos G, Wigderson A (1994) On the power of randomization in online algorithms. Algorithmica 11(1):2–14. Also appeared in Proc of the 22nd STOC, pp 379–386 (1990) MathSciNetMATHCrossRefGoogle Scholar
  14. 14.
    Bienkowski M (2005) Dynamic page migration with stochastic requests. In: Proc of the 17th ACM symp on parallelism in algorithms and architectures (SPAA), pp 270–278 CrossRefGoogle Scholar
  15. 15.
    Bienkowski M, Byrka J (2005) Bucket game with applications to set multicover and dynamic page migration. In: Proc of the 13th European symp on algorithms (ESA), pp 815–826 Google Scholar
  16. 16.
    Bienkowski M, Korzeniowski M (2005) Dynamic page migration under Brownian motion. In: Proc of the European conf in parallel processing (Euro-Par), pp 962–971 Google Scholar
  17. 17.
    Bienkowski M, Korzeniowski M, Meyer auf der Heide F (2004) Fighting against two adversaries: page migration in dynamic networks. In: Proc of the 16th ACM symp on parallelism in algorithms and architectures (SPAA), pp 64–73 CrossRefGoogle Scholar
  18. 18.
    Bienkowski M, Dynia M, Korzeniowski M (2005) Improved algorithms for dynamic page migration. In: Proc of the 22nd symp on theoretical aspects of computer science (STACS), pp 365–376 Google Scholar
  19. 19.
    Bienkowski M, Byrka J, Korzeniowski M, Meyer auf der Heide F (2009) Optimal algorithms for page migration in dynamic networks. J Discrete Algorithms 7(4):545–569 MathSciNetMATHCrossRefGoogle Scholar
  20. 20.
    Black DL, Sleator DD (1989) Competitive algorithms for replication and migration problems. Technical Report CMU-CS-89-201, Department of Computer Science, Carnegie-Mellon University Google Scholar
  21. 21.
    Borodin A, El-Yaniv R (1998) Online computation and competitive analysis. Cambridge University Press, Cambridge MATHGoogle Scholar
  22. 22.
    Chrobak M, Larmore LL, Reingold N, Westbrook J (1997) Page migration algorithms using work functions. J Algorithms 24(1):124–157. Also appeared in Proc of the 4th ISAAC, pp 406–415 (1993) MathSciNetMATHCrossRefGoogle Scholar
  23. 23.
    Fakcharoenphol J, Rao S, Talwar K (2004) A tight bound on approximating arbitrary metrics by tree metrics. J Comput Syst Sci 69(3):485–497. Also appeared in Proc of the 35th STOC, pp 448–455 (2003) MathSciNetMATHCrossRefGoogle Scholar
  24. 24.
    Fiat A, Karp RM, Luby M, McGeoch LA, Sleator DD, Young NE (1991) Competitive paging algorithms. J Algorithms 12(4):685–699 MATHCrossRefGoogle Scholar
  25. 25.
    Fleischer R, Seiden SS (2000) New results for online page replication. In: Proc of the 3rd int workshop on approximation algorithms for combinatorial optimization (APPROX), pp 144–154 CrossRefGoogle Scholar
  26. 26.
    Fleischer R, Głazek W, Seiden SS (2004) New results for online page replication. Theor Comput Sci 324(2–3):219–251 MATHCrossRefGoogle Scholar
  27. 27.
    Głazek W (1999) Lower and upper bounds for the problem of page replication in ring networks. In: Proc of the 24th int symp on mathematical foundations of computer science (MFCS), pp 273–283 Google Scholar
  28. 28.
    Głazek W (2001) Online algorithms for page replication in rings. Theor Comput Sci 268(1):107–117 MATHCrossRefGoogle Scholar
  29. 29.
    Imase M, Waxman BM (1991) Dynamic Steiner tree problem. SIAM J Discrete Math 4(3):369–384 MathSciNetMATHCrossRefGoogle Scholar
  30. 30.
    Karlin AR, Manasse MS, Rudolph L, Sleator DD (1988) Competitive snoopy caching. Algorithmica 3(1):77–119. Also appeared in Proc of the 27th FOCS, pp 244–254 (1986) MathSciNetCrossRefGoogle Scholar
  31. 31.
    Karp RM (1992) On-line algorithms versus off-line algorithms: how much is it worth to know the future. In: Proc of the IFIP 12th world computer congress, pp 416–429 Google Scholar
  32. 32.
    Koga H (1993) Randomized on-line algorithms for the page replication problem. In: Proc of the 4th int symp on algorithms and computation (ISAAC), pp 436–445 Google Scholar
  33. 33.
    Lund C, Reingold N, Westbrook J, Yan DCK (1999) Competitive on-line algorithms for distributed data management. SIAM J Comput 28(3):1086–1111. Also appeared as on-line distributed data management in Proc of the 2nd ESA, pp 202–214 (1994) MathSciNetMATHCrossRefGoogle Scholar
  34. 34.
    Matsubayashi A (2008) Uniform page migration on general networks. Int J Pure Appl Math 42(2):161–168 MathSciNetGoogle Scholar
  35. 35.
    McGeoch LA, Sleator DD (1991) A strongly competitive randomized paging algorithm. Algorithmica 6(6):816–825 MathSciNetMATHCrossRefGoogle Scholar
  36. 36.
    Sleator DD, Tarjan RE (1985) Amortized efficiency of list update and paging rules. Commun ACM 28(2):202–208 MathSciNetCrossRefGoogle Scholar
  37. 37.
    Vazirani VV (2001) Approximation algorithms. Springer, Berlin Google Scholar
  38. 38.
    Westbrook J (1994) Randomized algorithms for the multiprocessor page migration. SIAM J Comput 23:951–965. Also appeared in Proc of the DIMACS workshop on on-line algorithms, pp 135–149 (1992) CrossRefGoogle Scholar
  39. 39.
    Westbrook J, Yan DCK (1995) The performance of greedy algorithms for the on-line Steiner tree and related problems. Theory Comput Syst 28(5):451–468. Also appeared in Proc of the 3rd WADS, pp 622–633 (1993) MathSciNetMATHGoogle Scholar

Copyright information

© The Author(s) 2011

Authors and Affiliations

  1. 1.Institute of Computer ScienceUniversity of WroclawWroclawPoland

Personalised recommendations