Continuous Replica Placement schemes in distributed systems

ABSTRACT

The Replica Placement Problem (RPP) aims at creating a set of duplicated data objects across the nodes of a distributed system in order to optimize certain criteria. Typically, RPP formulations fall into two categories: static and dynamic. The first assumes that access statistics are estimated in advance and remain static, and, therefore, a one-time replica distribution is sufficient (IRPP). In contrast, dynamic methods change the replicas in the network potentially upon every request. This paper proposes an alternative technique, named Continuous Replica Placement Problem (CRPP), which falls between the two extreme approaches. CRPP can be defined as: Given an already implemented replication scheme and estimated access statistics for the next time period, define a new replication scheme, subject to optimization criteria and constraints. As we show in the problem formulation, CRPP is different in that the existing heuristics in the literature cannot be used either statically or dynamically to solve the problem. In fact, even with the most careful design, their performance will be inferior since CRPP embeds a scheduling problem to facilitate the proposed mechanism. We provide insight on the intricacies of CRPP and propose various heuristics.

References

1. Bowman, B., Debray, S. K., and Peterson, L. L. Reasoning about naming systems. ACM Trans. Program. Lang. Syst., 15, 5 (Nov. 1993), 795--825. P. Apers, "Data allocation in distributed database systems," ACM Transactions on Database Systems, Vol. 13(3), pp. 263--304, 1988.
2. Akamai Technologies Inc., http://www.akamai.com.
3. B. Awerbuch, Y. Bartal, and A. Fiat, "Optimally-competitive distributed file allocation," in Proc. ACM STOC, 1993, pp. 164--173.
4. C. Basnet, L. Foulds and J. Wilson, "An exact algorithm for a milk tanker scheduling and sequencing problem," in Annals of Operations Research, Vol. 86, pp. 559--568, 1999.
5. C. Bisdikian and B. Patel, "Cost-based program allocation for distributed multimedia-on-demand systems," IEEE Multimedia, Vol. 3(3), pp. 62--72, 1996.
6. K. Calvert and E. Zegura, "GT Internetwork Topology Models (GT-ITM)," Available at: http://www.cc.gatech.edu/projects/gtitm/.
7. N. Christofides, "Vehicle Routing," In The Traveling Salesman Problem, Lawler, Lenstra, Rinooy Kan and Shmoys, eds., John Wiley, pp. 431--448, 1985.
8. W. Chu, "Optimal file allocation in a multiple computer system," IEEE Transactions on Computers, Vol. 18(10), pp. 885--889, 1969.
9. L. Dowdy and D. Foster, "Comparative models of the file assignment problem," In ACM Computer Surveys, Vol. 14(2), pp. 287--313, 1982.
10. S. Dykes, K. Robbins and C. Jeffery, "Uncacheable documents and cold starts in Web proxy cache simulations: How two wrongs appear right," Technical Report CS-2001-01, University of Texas at San Antonio, Division of Computer Science, Jan. 2001.
11. I. Foster, "The Grid: Blueprint for a New Computing Infrastructure," Morgan Kaufmann, 2nd Ed., 2004.
12. S. Jamin, C. Jin, A. R. Kurc, D. Raz, and Y. Shavitt, "Constrained mirror placement on the Internet," in Proc. IEEE INFOCOM, April 2001, pp. 31--40.
13. J. Kangasharju, J. Roberts, and K. Ross, "Object replication strategies in content distribution networks," Computer Communications, Vol. 25(4), pp. 367--383, 2002.
14. M. Karlsson and C. Karamanolis, "Choosing replica Placement Heuristics for Wide-Area Systems," In Proc, ICDCS'04, pp, 350--359.
15. M. Karlsson, C. Karamanolis, and M. Mahalingam, "A framework for evaluating replica placement algorithms," HP Labs, Technical Report HPL-2002-219, July 2002.
16. Yu-K. Kwok and I. Ahmad, "Static scheduling algorithms for allocating directed task graphs to multiprocessors," in ACM Computing. Surveys, Vol. 31(4), pp. 406--471, 1999.
17. B. Li, M. Golin, G. Italiano, X. Deng, and K. Sohraby, "On the optimal placement of web proxies in the Internet," in Proc. IEEE INFOCOM, March 1999, pp. 1282--1290.
18. T. D. C. Little and D. Venkatesh, "Popularity-based assignment of movies to storage devices in a video-on-demand system," in ACM/Springer Multimedia Systems, Vol. 2(6), pp. 280--287, 1995.
19. T. Loukopoulos and I. Ahmad, "Optimizing Download Time of Embedded Multimedia Objects for Web Browsing," in IEEE Trans. on Parallel and Distributed Syst. (TPDS), Vol. 15(10), pp. 934--945, 2004.
20. T. Loukopoulos and I. Ahmad, "Static and adaptive data replication algorithms for fast information access in large distributed systems," in Proc, ICDCS'00, April 2000, pp. 385--392.
21. National Lab of Applied Network Research, IRCache Project, Sanitized access logs, available at: http://www.ircache.net/.
22. J. Potvin and S. Bengio, "The vehicle routing problem with time windows part II: genetic search," in Journal on Conputing, Vol. 8(2), pp. 165--172, 1996.
23. L. Qiu, V. Padmanabhan, and G. Voelker, "On the placement of web server replicas," in Proc. IEEE INFOCOM, April 2001, pp. 1587--1596.
24. M. Rabinovich, I. Rabinovich, R. Rajaraman, and A. Aggarwal, "A dynamic object replication and migration protocol for an Internet hosting service," in Proc. ICDCS'99, May 1999, pp. 101--113.
25. M. Rabinovich and O. Spatschek, "Web Caching and Replication," Addison-Wesley, 2002.
26. X. Tang and J. Xu, "On Replica Placement for QoS-Aware Content Distribution," in Proc, IEEE INFOCOM, March 2004, Hong Kong.
27. R. Tewari and N. Adam, "Distributed file allocation with consistency constraints," in Proc. ICDCS'92, June 1992.
28. O. Wolfson, S. Jajodia, and Y. Huang, "An adaptive data replication algorithm," ACM Transactions on Database Systems, Vol. 22(4), pp. 255--314, 1997.

Index Terms

• Computer systems organization

  • Architectures

    • Distributed architectures

• Information systems

  • Information storage systems

    • Storage management

• Software and its engineering

  • Software organization and properties

    • Contextual software domains

      • Operating systems

        • File systems management

        • Memory management

    • Software system structures

      • Distributed systems organizing principles