Skip to main content
SpringerLink
Log in

Facility location models to locate data in information networks: a literature review

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

The usage of the Internet has grown substantially in recent times. This has resulted in high volumes of data traffic. There is a concomitant rise in bandwidth demands that could result in excessive download delays (or latency). Thus, a single-server system is no more a prudent choice for data storage. Replication of content and placing them on multiple servers is a method that is used to reduce latency. However, this solution comes at a huge cost. Moreover, replicating objects randomly does not necessarily improve system performance. It is possible to arrive at a solution to the problem of placing content so as to achieve better cost performance. Other performance measures include latency, load balancing and data availability. We refer to the problem of locating content as data location problem in information networks, or DLPIN. The choice of server locations, query routing strategy and user assignment are some of the important problems that require attention along with the location of the data/content. Resource constraints and the nature of traffic (static/dynamic) are two important parameters in the problem environment, and therefore are key distinguishing features in the models. The main contribution of this paper is a novel classification and study of DLPIN on the basis of problem features. The research in this area started with files, the smallest units of allocation. Gradually, files and programs, database segments and entire databases (or mirrors) have been studied. We design examples from these use cases to elaborate a variety of problems in a comprehensive review. Facility location models from physical logistics are extensively used to model these problems. Our paper presents a literature survey of such mathematical models for data location problems. We present a gap analysis that provides pointers to possible future research in this area. This paper also serves to document the success in the use of mathematical programming approaches for data location in information networks.

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

Access this article

Log in via an institution

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

Notes

  1. http://www.research.rutgers.edu/~davison/web-caching/bibliography.html.

References

  • Acharya, S., & Zdonik, S. B. (1993). An efficient scheme for dynamic data replication. Technical report, Brown University, Providence, RI, USA.

  • Adl, R. K., Rankoohi, R., & Taghi, S. M. (2009). A new ant colony optimization based algorithm for data allocation problem in distributed databases. Knowledge and Information Systems, 20(3), 349–373. doi:10.1007/s10115-008-0182-y. ISSN 0219-1377.

  • Aggarwal, A., & Rabinovich, M. (1998). Performance of dynamic replication schemes for an internet hosting service. Technical report, AT&T Labs.

  • Anderson, E., Hall, J., Hartline, J. D., Hobbs, M., Karlin, A. R., Saia, J., et al. (2001). An experimental study of data migration algorithms. In Proceedings of the 5th international workshop on algorithm engineering (WAE ’01) (pp. 145–158). London, Springer. ISBN: 3-540-42500-4.

  • Apers, P. M. G. (1988). Data allocation in distributed database systems. ACM Transactions on Database Systems, 13, 263–304.

    Article  Google Scholar 

  • Applegate, D., Archer, A., Gopalakrishnan, V., Lee, S., & Ramakrishnan, K. K. (2010). Optimal content placement for a large-scale vod system. In Proceedings of the 6th international conference (Co-NEXT ’10) (pp. 4:1–4:12). New York: ACM. doi:10.1145/1921168.1921174. ISBN: 978-1-4503-0448-1

  • Applegate, D., Archer, A., Gopalakrishnan, V., Lee, S., & Ramakrishnan, K. K. (2013). Content placement via the exponential potential function method. In M. Goemans & J. Correa (Eds)., Integer programming and combinatorial optimization. Lecture notes in computer science (Vol. 7801, pp. 49–61). Berlin: Springer. ISBN: 978-3-642-36693-2.

  • Awerbuch, B., Bartal, Y., & Fiat, A. (2003). Competitive distributed file allocation. Information and Computation, 185(1), 1–40. doi:10.1016/S0890-5401(03)00055-5. ISSN: 0890-5401.

  • Azoulay-Schwartz, R., & Kraus, S. (2002). Negotiation on data allocation in multi-agent environments. Autonomous Agents and Multi-agent Systems, 5(2), 123–172. doi:10.1023/A:1014838726454. ISSN: 1387-2532.

  • Baev, I., Rajaraman, R., & Swamy, C. (2008). Approximation algorithms for data placement problems. SIAM Journal on Computing, 38(4), 1411–1429. doi:10.1137/080715421. ISSN: 0097-5397.

  • Bartolini, N., Lo, F., & Petrioli, P. C. (2003). Optimal dynamic replica placement in content delivery networks. In Proceedings of the IEEE international conference on networking (pp. 125–130).

  • Bektas, T., & Ouveysi, I. (2008a). Mathematical models for resource management and allocation in cdns. In R. Buyya, M. Pathan, & A. Vakali (Eds.), Content delivery networks. Lecture notes electrical engineering (Vol. 9, pp. 225–250). Berlin: Springer. ISBN: 978-3-540-77886-8.

  • Bektas, T., Cordeau, J.-F., Erkut, E., & Laporte, G. (2008b). Exact algorithms for the joint object placement and request routing problem in content distribution networks. Computers & Operations Research, 35(12), 3860–3884. doi:10.1016/j.cor.2007.02.005. ISSN 0305-0548 (Part Special Issue: Telecommunications Network Engineering).

  • Bell, D. A. (1984). Difficult data placement problems. The Computer Journal, 27(4), 315–320.

    Article  Google Scholar 

  • Benoit, A., Rehn, V., & Robert, Y. (2007). Strategies for replica placement in tree networks. International Parallel and Distributed Processing Symposium, 141. doi:10.1109/IPDPS.2007.370331.

  • Boffey, T. B. (1989). Location of software in distributed computing systems. The Journal of the Operational Research Society, 40(10), 863–870. ISSN: 0160-5682.

  • Borghoff, U. M. (1992). Design of optimal distributed file systems: A framework for research. SIGOPS Operating Systems Review, 26(4), 30–61. doi:10.1145/142854.142861. ISSN: 0163-5980.

  • Borst, S., Gupta, V., & Walid, A. (2010). Distributed caching algorithms for content distribution networks. In Proceedings of the IEEE INFOCOM (pp. 1–9). doi:10.1109/INFCOM.2010.5461964.

  • Brunstrom, A., Leutenegger, S. T., & Simha, R. (1995). Experimental evaluation of dynamic data allocation strategies in a distributed database with changing workloads. In Proceedings of the fourth international conference on information and knowledge management (CIKM ’95) (pp. 395–402). New York, NY: ACM. doi:10.1145/221270.221652. ISBN: 0-89791-812-6

  • Campbell, J. F., Ernst, A. T., & Krishnamoorthy, M. (2002). Facility location: applications and theory. In H. Hamacher & Z. Drezner (Eds.), Hub location problems. Berlin: Springer.

    Chapter  Google Scholar 

  • Campbell, J. F., Ernst, A. T., & Krishnamoorthy, M. (2005a). Hub arc location problems: Part 1. Introduction and results. Management Science, 51(10), 1540–1555.

    Article  Google Scholar 

  • Campbell, J. F., Ernst, A. T., & Krishnamoorthy, M. (2005b). Hub arc location problems: Part 2. Formulations and optimal algorithms. Management Science, 51(10), 1556–1571.

    Article  Google Scholar 

  • Carraresi, P., & Gallo, G. (1982). Optimal location of files and programs in computer networks. In J.-L. Goffin & J.-M. Rousseau (Eds.), Applications, volume 20 of mathematical programming studies (pp. 39–53). Berlin: Springer. doi:10.1007/BFb0121225. ISBN: 978-3-642-00851-1.

  • Casey, R. G. (1972). Allocation of copies of a file in an information network. In Proceedings of the spring joint computer conference (AFIPS ’72), May 16–18 (pp. 617–625). New York, NY: ACM. doi:10.1145/1478873.1478955.

  • Ceri, S., Martella, G., & Pelagatti, G. (1982). Optimal file allocation in a computer network: A solution method based on the knapsack problem. Computer Networks (1976), 6(5), 345–357. doi:10.1016/0376-5075(82)90104-0. ISSN: 0376-5075.

  • Chandy, J. A. (2008). A generalized replica placement strategy to optimize latency in a wide area distributed storage system. In Proceedings of the 2008 international workshop on data-aware distributed computing (DADC ’08) (pp. 49–54). New York, NY: ACM. doi:10.1145/1383519.1383525. ISBN: 978-1-60558-154-5.

  • Chandy, K. M., & Hewes, J. E. (1976). File allocation in distributed systems. In Proceedings of the ACM SIGMETRICS conference on computer performance modeling measurement and evaluation (SIGMETRICS ’76) (pp. 10–13). New York, NY: ACM. doi:10.1145/800200.806177.

  • Chang, S.-K., & Liu, A.-C. (1982). File allocation in a distributed database. International Journal of Parallel Programming, 11(5), 325–340.

    Google Scholar 

  • Chen, P. P. S. (1973). Optimal file allocation in multi-level storage systems. In Proceedings of the national computer conference and exposition (AFIPS ’73), June 4–8 (pp. 277–282). New York, NY: ACM. doi:10.1145/1499586.1499662.

  • Chen, L.-C., & Choi, H.-A. (2001). Approximation algorithms for data distribution with load balancing of web servers. In Proceedings of the 3rd IEEE international conference on cluster computing (CLUSTER ’01) (p. 274). Washington, DC: IEEE Computer Society. ISBN: 0-7695-1116-3.

  • Chen, Y., Katz, R. H., & Kubiatowicz, J. (2002). Dynamic replica placement for scalable content delivery. In Revised papers from the first international workshop on peer-to-peer systems (IPTPS ’01) (pp. 306–318). London: Springer. ISBN: 3-540-44179-4.

  • Cheng, C.-H., Lee, W.-K., & Wong, K.-F. (2002). A genetic algorithm-based clustering approach for database partitioning. IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews, 32(3), 215–230.

    Article  Google Scholar 

  • Chu, W. W. (1969). Optimal file allocation in a multiple computer system. IEEE Transactions on Computers, 18(10), 885–889. doi:10.1109/T-C.1969.222542. ISSN: 0018-9340.

  • Ciciani, B., Dias, D. M., & Yu, P. S. (1992). Analysis of concurrency-coherency control protocols for distributed transaction processing systems with regional locality. IEEE Transactions on Software Engineering, 18(10), 899–914. ISSN: 0098-5589.

  • Cidon, I., Kutten, S., & Soffer, R. (2002). Optimal allocation of electronic content. Computer Networks, 40(2), 205–218. doi:10.1016/S1389-1286(02)00251-7. ISSN: 1389-1286.

  • Cook, S. A., Pachl, J. K., & Pressman, I. S. (2002). The optimal location of replicas in a network using a read-one-write-all policy. Distributed Computing, 15(1), 57–66. doi:10.1007/s446-002-8031-5. ISSN: 0178-2770.

  • Cronin, E., Jamin, S., Jin, C., Kurc, A. R., Raz, D., Shavitt, Y., et al. (2006). Constrained mirror placement on the internet. IEEE Journal on Selected Areas in Communications, 20(7), 1369–1382.

    Article  Google Scholar 

  • Darabant, A. S., Campan, A., Moldovan, G., & Grebla, H. (2004). Ai clustering techniques: A new approach in horizontal fragmentation of classes with complex attributes and methods in object oriented databases. In Proceedings of the international conference on theory and applications of mathematics and informatics (ICTAMI 2004).

  • Daudpota, N. H. (1998). Five steps to construct a model of data allocation for distributed database systems. Journal of Intelligent Information Systems, 11, 153–168. ISSN: 0925-9902.

  • Deane, J. K., Rakes, T. R., & Agarwal, A. (2012). Designing content distribution networks for optimal cost and performance. Information Technology and Management, 13(1):1–15. doi:10.1007/s10799-011-0107-4. ISSN: 1385-951X.

  • Dowdy, L. W., & Foster, D. V. (1982). Comparative models of the file assignment problem. ACM Computing Surveys, 14(2), 287–313. doi:10.1145/356876.356883. ISSN: 0360-0300.

  • Eisner, M. J., & Severance, D. G. (1976). Mathematical techniques for efficient record segmentation in large shared databases. Journal of the ACM, 23, 619–635. ISSN: 0004-5411.

  • Elam, J., & Stutz, J. (1976). Some considerations and models for the distribution of a data base. Technical report CCS 279, University of Texas, Austin, TX.

  • Ernst, A. T., Jiang, H., & Krishnamoorthy, M. (2006). Exact solutions to task allocation problems. Management Science, 52(10), 1634–1646.

    Article  Google Scholar 

  • Eswaran, K. P. (1974). Placement of records in a file and file allocation in a computer network. Information Processing Letters, 8, 304–307.

    Google Scholar 

  • Fisher, M. L., & Hochbaum, D. S. (1980). Database location in computer networks. Journal of the ACM, 27(4), 718–735. doi:10.1145/322217.322226. ISSN: 0004-5411.

  • Fujita, N., Ishikawa, Y., Iwata, A., & Izmailov, R. (2004). Coarse-grain replica management strategies for dynamic replication of web contents. Computer Networks, 45(1), 19–34. doi:10.1016/j.comnet.2004.02.006. ISSN: 1389-1286.

  • Gandhi, R., & Mestre, J. (2006). Approximation, randomization, and combinatorial optimization. Algorithms and techniques. In J. Diaz, K. Jansen, J. D. P. Rolim & U. Zwick (Eds.), Combinatorial algorithms for data migration to minimize average completion time. Berlin: Springer.

  • Gavish, B., & Pirkul, H. (1986). Computer and database location in distributed computer systems. IEEE Transactions on Computers, 35(7), 583–590. ISSN: 0018-9340.

  • Gavish, B., & Sheng, O. R. L. (1990). Dynamic file migration in distributed computer systems. Communications of the ACM, 33, 177–189. ISSN: 0001-0782.

  • Gavish, B., & Suh, M. W. (1992). Configuration of fully replicated distributed database system over wide area networks. Annals of Operations Research, 36(1–4), 167–192. doi:10.1007/BF02094329. ISSN: 0254-5330.

  • Ghosh, D., Murthy, I., & Moffett, A. (1992). File allocation problem: Comparison of models with worst case and average communication delays. Operations Research, 40(6), 1074–1085. doi:10.1287/opre.40.6.1074.

    Article  Google Scholar 

  • Graham, J. M., & Hinds, C. V. (1999). Optimal placement of distributed interrelated data components using genetic algorithms. In Proceedings of the 37th annual southeast regional conference (CD-ROM) (ACM-SE 37) (p. 44). New York, NY: ACM. doi:10.1145/306363.306417. ISBN: 1-58113-128-3.

  • Grapa, E., & Belford, G. G. (1977). Some theorems to aid in solving the file allocation problem. Communications of the ACM, 20(11), 878–882. doi:10.1145/359863.359895. ISSN: 0001-0782.

  • Guo, X., Li, J., Yang, J., & Wang, J. (2008). The research on dynamic replication and placement of file using dual-threshold dynamic file migration algorithm. In International conference on computer science and software engineering (Vol. 3, pp. 236–240). doi:10.1109/CSSE.2008.951.

  • Hababeh, I. O., Ramachandran, M., & Bowring, N. (2007). A high-performance computing method for data allocation in distributed database systems. Journal of Supercomputing, 39(1), 3–18. doi:10.1007/s11227-006-0001-8. ISSN: 0920-8542.

  • Hac, A. (1989). A distributed algorithm for performance improvement through file replication, file migration, and process migration. IEEE Transactions on Software Engineering, 15(11), 1459–1470. doi:10.1109/32.41337. ISSN: 0098-5589.

  • Hall, J., Hartline, J., Karlin, A. R., Saia, J., & Wilkes, J. (2001). On algorithms for efficient data migration. In Proceedings of the twelfth annual ACM-SIAM symposium on discrete algorithms (SODA ’01) (pp. 620–629). Philadelphia, PA: Society for Industrial and Applied Mathematics. ISBN: 0-89871-490-7.

  • Hatzopoulos, M., & Kollias, J. G. (1980). The file allocation problem under dynamic usage. Information Systems, 5(3), 197–201. doi:10.1016/0306-4379(80)90011-3. ISSN: 0306-4379.

  • He, J., Zhao, X., & Zhao, B. (2012). A fast, simple and near-optimal content placement scheme for a large-scale VOD system. In IEEE international conference on communication systems (ICCS) (pp. 378–382). doi:10.1109/ICCS.2012.6406174.

  • Hess, M. F. (1992). Simulated annealing applied to a file allocation problem. Master’s thesis, University of British Columbia.

  • Hoffer, J. A. (1976). An integer programming formulation of computer data base design problems. Information Sciences, 11(1), 29–48.

    Article  Google Scholar 

  • Hurley, R. T., & Yeap, S. Aun. (1996). File migration and file replication: A symbiotic relationship. IEEE Transactions on Parallel and Distributed Systems, 7, 578–586. doi:10.1109/71.506696. ISSN: 1045-9219.

  • Hwang, K.-W., Applegate, D., Archer, A., Gopalakrishnan, V., Lee, S., Misra, V., et al. (2012). Leveraging video viewing patterns for optimal content placement. In R. Bestak, L. Kencl, L. Li, J. Widmer, & H. Yin (Eds.), NETWORKING 2012, volume 7290 of Lecture notes in computer science (pp. 44–58). Berlin: Springer. ISBN: 978-3-642-30053-0.

  • Kalpakis, K., Dasgupta, K., & Wolfson, O. (2001). Optimal placement of replicas in trees with read, write, and storage costs. IEEE Transactions on Parallel and Distributed Systems, 12(6), 628–637. doi:10.1109/71.932716. ISSN: 1045-9219.

  • Kangasharju, J., Roberts, J., & Ross, K. W. (2002). Object replication strategies in content distribution networks. Computer Communications, 25(4), 376–383.

    Article  Google Scholar 

  • Karkazis, J., & Boffey, T. B. (1981). The multi-commodity facilities location problem. The Journal of the Operational Research Society, 32(9), 803–814. ISSN: 0160-5682.

  • Karlaplem, K., & Pun, N. M. (1997). Query driven data allocation algorithms for distributed database systems. In 8th international conference on database and expert systems applications (DEXA’97). Lecture notes in computer science (Vol. 1308, pp. 347–356), Toulouse.

  • Karlsson, M., & Karamanolis, C. (2004). Choosing replica placement heuristics for wide-area systems. In Proceedings of the 24th international conference on distributed computing systems (ICDCS’04) (pp. 350–359). Washington, DC: IEEE Computer Society. ISBN: 0-7695-2086-3.

  • Karlsson, M., & Mahalingam, M. (2002). Do we need replica placement algorithms in content delivery networks. In Proceedings of the international workshop on web content caching and distribution (WCW) (pp. 117–128).

  • Karlsson, M., Karamanolis, C., & Mahalingam, M. (2002). A framework for evaluating replica placement algorithms. Technical report HPL-2002, HP Laboratories.

  • Kayaaslan, E., Cambazoglu, B. B., & Aykanat, C.. (2013). Document replication strategies for geographically distributed web search engines. Information Processing & Management, 49(1), 51–66. ISSN: 0306-4573.

  • Khan, S. U., & Ahmad, I. (2008). Comparison and analysis of ten static heuristics-based internet data replication techniques. Journal of Parallel and Distributed Computing, 68(2), 113–136. doi:10.1016/j.jpdc.2007.06.009. ISSN: 0743-7315.

  • Khan, S. U., & Ahmad, I. (2010). Replicating data objects in large distributed database systems: an axiomatic game theoretic mechanism design approach. Distributed and Parallel Databases, 28(2–3), 187–218. ISSN: 0926-8782.

  • Khuller, S., & Kim, Y.-A. (2004). Algorithms for data migration with cloning. SIAM Journal on Computing, 33(2), 448–461. doi:10.1137/S009753970342585X. ISSN: 0097-5397.

  • Kim, Y.-A. (2003). Data migration to minimize the average completion time. In Proceedings of the fourteenth annual ACM–SIAM symposium on discrete algorithms (SODA ’03) (pp. 97–98). Philadelphia, PA: Society for Industrial and Applied Mathematics. ISBN: 0-89871-538-5.

  • Kim, Y.-A. (2005). Data migration to minimize the total completion time. Journal of Algorithms, 55(1), 42–57. doi:10.1016/j.jalgor.2004.07.009. ISSN: 0196-6774.

  • Kleinrock, L. (1976). Queueing systems, volume 2: Computer applications. New York: Wiley.

  • Kollias, J. G., & Hatzopoulos, M. (1981). Allocation of copies of s distinct files in an information network. Information Systems, 6(3), 201–204. doi:10.1016/0306-4379(81)90022-3. ISSN: 0306-4379.

  • Kumar, K.A., Deshpande, A., & Khuller, S. (2013). Data placement and replica selection for improving co-location in distributed environments (CoRR, abs/1302.4168).

  • Kumar, A., Pathak, R. M., & Gupta, Y. P. (1995). Genetic algorithm based approach for file allocation on distributed systems. Computers & Operations Research, 22(1), 41–54. doi:10.1016/0305-0548(93)E0017-N. ISSN: 0305-0548.

  • Kunnathur, A. S., & Solis, R. (1989). Multiple copy file allocation and placement in a distributed information network. Computers and Industrial Engineering, 16(2), 225–234.

    Article  Google Scholar 

  • Kwok, Y. K., Karlapalem, K., Ahmad, I., & Pun, N. M. (1996). Design and evaluation of data allocation algorithms for distributed multimedia database systems. IEEE Journal on Selected areas in Communication, 14, 1332–1348.

    Article  Google Scholar 

  • La, C.-A., Michiardi, P., Casetti, C., Chiasserini, C.-F., & Fiore, M. (2011). Content replication and placement in mobile networks (CoRR, abs/1102.3013).

  • Laning, L. J., & Leonard, M. S. (1983). File allocation in a distributed computer communication network. IEEE Transactions on Computers, 32(3), 232–244. doi:10.1109/TC.1983.1676215. ISSN: 0018-9340.

  • Laoutaris, N., Zissimopoulos, V., & Stavrakakis, L. (2004). Joint object placement and node dimensioning for internet content distribution. Information Processing Letters, 89(6):273–279. doi:10.1016/j.ipl.2003.12.002. ISSN: 0020-0190.

  • Laoutaris, N., Zissimopoulos, V., & Stavrakakis, I. (2005). On the optimization of storage capacity allocation for content distribution. Computer Networks 47(3):409–428. doi:10.1016/j.comnet.2004.07.020. ISSN: 1389-1286.

  • Lee, H., Shi, Y., & Stolen, J. (1994). Allocating data files over a wide area network: Goal setting and compromise design. Information & Management, 26(2), 85–93.

    Article  Google Scholar 

  • Loukopoulos, T., & Ahmad, I. (2004). Static and adaptive distributed data replication using genetic algorithms. Journal of Parallel and Distributed Computing, 64(11), 1270–1285. doi:10.1016/j.jpdc.2004.04.005. ISSN: 0743-7315.

  • Maggs, B., Meyer auf der Heide, F., Voecking, B., & Westermann, M. (1997). Exploiting locality for data management in systems of limited bandwidth. In Proceedings of the 38th annual symposium on foundations of computer science (FOCS ’97) (p. 284). Washington, DC: IEEE Computer Society. ISBN: 0-8186-8197-7.

  • Mahmood, A. (2005). Object grouping and replication algorithms for word wide web. Informatica, 29(3), 347–356.

    Google Scholar 

  • Mahmood, A. (2007). Dynamic replication of web contents. Science in China Series F: Information Sciences, 50(6), 811–830.

    Article  Google Scholar 

  • Mahmood, A. (2010). Replicating web contents using a hybrid particle swarm optimization. Information Processing & Management, 46(2), 170–179. doi:10.1016/j.ipm.2009.06.006. ISSN: 0306–4573.

  • Mahmood, A., Khan, H. U., & Fatmi, H. A. (1994). Adaptive file allocation in distributed computer systems. Distributed Systems Engineering, 1, 354–361.

    Article  Google Scholar 

  • Mamaghani, A. S., Mahi, M., Meybodi, M. R., & Moghaddam, M. H. (2010). A novel evolutionary algorithm for solving static data allocation problem in distributed database systems. In Proceedings of the second international conference on network applications, protocols and services (NETAPPS ’10) (pp. 14–19). Washington, DC: IEEE Computer Society. doi:10.1109/NETAPPS.2010.10. ISBN: 978-0-7695-4177-8.

  • Manghui, T., Xia, Z., Li, P., & Tadayon, N. (2009). Allocation of partitioned data by using a neural network based approach. Neurocomputing, 72(4–6), 1000–1011. doi:10.1016/j.neucom.2008.04.011. ISSN: 0925-2312.

  • March, S. T., & Rho, S.. (1995). Allocating data and operations to nodes in distributed database design. IEEE Transactions on Knowledge and Data Engineering, 7(2), 305–317. doi:10.1109/69.382299. ISSN: 1041-4347.

  • McClean, S. I., Bell, D. A., & McErlean, F. J. (1991). Heuristic methods for the data placement problem. The Journal of the Operational Research Society, 42(9), 767–774. ISSN: 0160-5682.

  • Menon, S. (2005). Allocating fragments in distributed databases. IEEE Transactions on Parallel and Distributed Systems, 16(7), 577–585. ISSN: 1045-9219.

  • Morgan, H. L., & Levin, K. D. (1977). Optimal program and data locations in computer networks. Communications of the ACM, 20(5), 315–322. doi:10.1145/359581.359591. ISSN: 0001-0782.

  • Mukkamala, R., Bruell, S. C., & Shultz, R. K. (1988). Design of partially replicated distributed database systems: an integrated methodology. SIGMETRICS Performance Evaluation Review, 16, 187–196. ISSN: 0163-5999.

  • Murthy, K., Kam, J., & Krishnamoorthy, M. S. (1983). An approximation algorithm to the file allocation problem in computer networks. In Proceedings of the 2nd ACM SIGACT–SIGMOD symposium on principles of database systems (PODS ’83) (pp. 258–266). New York, NY: ACM. doi:10.1145/588058.588087. ISBN: 0-89791-097-4

  • Navathe, S. B., & Ra, M. (1989). Vertical partitioning for database design: A graphical algorithm. SIGMOD Record, 18, 440–450.

    Article  Google Scholar 

  • Nguyen, T. V., Safaei, F., Boustead, P., & Chou, C. T. (2005). Provisioning overlay distribution networks. Computer Networks 49(1):103–118. doi:10.1016/j.comnet.2005.04.001. ISSN: 1389-1286.

  • Pallis, G., Vakali, A., Stamos, K., Sidiropoulos, A., Katsaros, D., & Manolopoulos, Y. (2005). A latency-based object placement approach in content distribution networks. In Proceedings of the third Latin American web congress (LA-WEB ’05) (p. 140). Washington, DC: IEEE Computer Society. doi:10.1109/LAWEB.2005.3. ISBN: 0-7695-2471-0.

  • Park, S.-J., & Baik, D.-K. (1997). A data allocation considering data availability in distributed database systems. In Proceedings of the international conference on parallel and distributed systems (ICPADS ’97) (pp. 708–713). Washington, DC: IEEE Computer Society. ISBN: 0-8186-8227-2.

  • Passarella, A. (2012). Review: A survey on content-centric technologies for the current internet: Cdn and p2p solutions. Computer Communications, 35(1), 1–32. ISSN: 0140-3664.

  • Pathan, M., & Buyya, R. (2007). A taxonomy and survey of content delivery networks. Technical report GRIDS-TR-2007-4, The University of Melbourne, Australia.

  • Pirkul, H. (1986). An integer programming model for the allocation of databases in a distributed computer system. European Journal of Operational Research, 26(3), 401–411. doi:10.1016/0377-2217(86)90142-6. ISSN: 0377-2217.

  • Presti, F. L., Petrioli, C., & Vicari, C. (2005). Dynamic replica placement in content delivery networks. In 13th IEEE international symposium on modeling, analysis, and simulation of computer and telecommunication systems (pp. 351–360). doi:10.1109/MASCOTS.2005.29.

  • Qiu, L., Padmanabhan, V. N., & Voelker, G. (2001). On the placement of web server replicas. In Proceedings of the IEEE infocom, Anchorage, AK, April 22–26.

  • Rabinovich, M., Rabinovich, I., Rajaraman, R., & Aggarxwal, A. (1998). A dynamic object replication and migration protocol for an internet hosting service. In Proceedings of the IEEE ICDCS (pp. 101–113).

  • Radoslavov, P., Govindan, R., & Estrin, D. (2002). Topology-informed internet replica placement. Computer Communications, 25(4), 384–392.

    Article  Google Scholar 

  • Ram, S., & Marsten, R. E. (1991). A model for database allocation incorporating a concurrency control mechanism. IEEE Transactions on Knowledge and Data Engineering, 3(3), 389–395. doi:10.1109/69.91051. ISSN: 1041-4347.

  • Robinson, E. P., & Gao, L. L. (1994). Location of computers and multiple files in distributed computer systems. Mathematical and Computer Modelling, 20(7), 111–120. doi:10.1016/0895-7177(94)90074-4. ISSN: 0895-7177.

  • Sacca, D., & Wiederhold, G. (1985). Database partitioning in a cluster of processors. ACM Transactions on Database Systems, 10, 29–56. doi:10.1145/3148.3161. ISSN: 0362-5915.

  • Sarathy, R., Shetty, B., & Sen, A. (1997a). A constrained nonlinear 0–1 program for data allocation. European Journal of Operational Research, 102(3), 626–647. doi:10.1016/S0377-2217(96)00234-2. ISSN: 0377-2217.

  • Savio, S. H. T. (2005). Approximate algorithms for document placement in distributed web servers. IEEE Transactions on Parallel and Distributed Systems, 16(6), 489–496. doi:10.1109/TPDS.2005.63. ISSN: 1045-9219.

  • Segall, A., & Sandell Jr., N. (1979). Dynamic file assignment in a computer network—part II: Decentralized control. IEEE Transactions on Automatic Control, 24(5), 709–716. ISSN: 0018-9286.

  • Sen, S. (1994). File placement over a network using simulated annealing. In Proceedings of the ACM symposium on applied computing (SAC ’94) (pp. 251–255). New York, NY: ACM. doi:10.1145/326619.326740. ISBN: 0-89791-647-6.

  • Sen, G., Krishnamoorthy, M., Rangaraj, N., & Narayanan, V. (2014a). Exact approaches for static data segment allocation problem in an information network. Computers & Operations Research. doi:10.1016/j.cor.2014.05.023. ISSN: 0305-0548.

  • Sen, G., Krishnamoorthy, M., Rangaraj, N., & Narayanan, V. (2014b). Mathematical models and empirical analysis of a simulated annealing approach for two variants of the static data segment location problem. Networks (under review).

  • Shoshani, A., & Rotem, D. (Eds.). (2009). Scientific data management: challenges, technology, and deployment. Boca Raton: CRC Press.

    Google Scholar 

  • Singh, A., & Kahlon, K. S. (2009). Non-replicated dynamic data allocation in distributed database system. IJCSNS International Journal of Computer Science and Network Security, 9(9).

  • Sivasubramanian, S., Pierre, G., & van Steen, M. (2005). Autonomic data placement strategies for update-intensive web applications. In Proceedings of the first international workshop on advanced architectures and algorithms for internet delivery and applications (AAA-IDEA ’05) (pp. 2–9). Washington, DC. IEEE Computer Society. doi:10.1109/AAA-IDEA.2005.4. ISBN: 0-7695-2525-3.

  • Sleit, A., AlMobaideen, W., Al-Areqi, S., & Yahya, A. (2007). A dynamic object fragmentation and replication algorithm in distributed database systems. American Journal of Applied Sciences, 4(8), 613–618.

    Article  Google Scholar 

  • So, S.-K., Ahmad, I., & Karlapalem, K. (1999). Response time driven multimedia data objects allocation for browsing documents in distributed environments. IEEE Transactions on Knowledge and Data Engineering, 11(3), 386–405. doi:10.1109/69.774100. ISSN: 1041-4347.

  • Sofianopoulou, S. (1992). The process allocation problem: A survey of the application of graph-theoretic and integer programming approaches. The Journal of the Operational Research Society, 43(5), 407–413. ISSN: 0160-5682.

  • Srinivasan, G., & Gautam, N. (2002). Optimal location of web servers. In Proceedings of the industrial engineering research conference.

  • Srinivasan, M. M., & Kant, K. (1987). The file allocation problem- a queueing network optimization approach. Computers & Operations Research, 14(5), 349–361. doi:10.1016/0305-0548(87)90032-3. ISSN: 0305-0548.

  • Stephens, A. B., Yesha, Y., & Humenik, K. (1994). Optimal allocation for partially replicated database systems on ring networks. IEEE Transactions on Knowledge and Data Engineering, 6(6), 975–982. doi:10.1109/69.334886. ISSN: 1041-4347.

  • Szymaniak, M., Pierre, G., & van Steen, M. (2005). Latency-driven replica placement. In Proceedings of the 2005 symposium on applications and the internet (SAINT ’05) (pp. 399–405), Washington, DC: IEEE Computer Society. doi:10.1109/SAINT.2005.37. ISBN: 0-7695-2262-9.

  • Tamhankar, A. M., & Ram, S. (1998). Database fragmentation and allocation: An integrated methodology and case study. IEEE Transactions on Systems, Man and Cybernetics, Part A: Systems and Humans, 28(3), 288–305.

    Article  Google Scholar 

  • Terzi, E., Vakali, A., & Angelis, L. (2004). A simulated annealing approach for multimedia data placement. Journal of Systems and Software, 73(3), 467–480. doi:10.1016/j.jss.2003.09.020. ISSN: 0164-1212.

  • Ulus, T., & Uysal, M. (2003). Heuristic approach to dynamic data allocation in distributed database systems. Pakistan Journal of Information and Technology, 2, 1682–6027.

    Google Scholar 

  • Wah, B. W. (1984). File placement on distributed computer systems. Computer, 17(1), 23–32. doi:10.1109/MC.1984.1658928. ISSN: 0018-9162.

  • Walla, J., Ruthmair, M., & Raidl, G. R. (2009). Solving a video-server load re-balancing problem by mixed integer programming and hybrid variable neighborhood search. In Proceedings of the 6th international workshop on hybrid metaheuristics (HM ’09) (pp. 84–99). Berlin: Springer. ISBN: 978-3-642-04917-0.

  • Wei, Y., Aslinger, A. A., Son, S. H., & Stankovic, J. A. (2004). Order: A dynamic replication algorithm for periodic transactions in distributed real-time databases. In Proceedings of real-time and embedded computing systems and applications (RTCSA 04) (pp. 152–169). Charlottesville, VA: University of Virginia.

  • Wolfson, O., & Milo, A. (1991). The multicast policy and its relationship to replicated data placement. ACM Transactions on Database Systems, 16(1), 181–205. doi:10.1145/103140.103146. ISSN: 0362-5915.

  • Wolfson, O., Jajodia, S., & Huang, Y. (1997). An adaptive data replication algorithm. ACM Transactions on Database Systems, 22(2), 255–314. doi:10.1145/249978.249982. ISSN: 0362-5915.

  • Wujuan, L., & Veeravalli, B. (2008). Design and analysis of an adaptive object replication algorithm in distributed network systems. Computer Communications, 31(10), 2005–2015. doi:10.1016/j.comcom.2008.01.005. ISSN: 0140-3664.

  • Yilmaz, E., & Manzano, Y. (2002). Surveying formal and practical approaches for optimal placement of replicas on the web. Technical report TR020701, Florida State University, Tallahassee, FL.

  • Yu, C. T., Siu, M. K., Lam, K., & Chen, C. H. (1983). File allocation in distributed databases with interaction between files. In Proceedings of the 9th international conference on very large data bases (VLDB ’83) (pp. 248–259). San Francisco, CA: Morgan Kaufmann. ISBN: 0-934613-15-X.

  • Zhuo, L., Wang, C.-L., & Lau, F. C. M. (2002). Load balancing in distributed web server systems with partial document replication. In Proceedings of the international conference on parallel processing (pp. 305–312).

  • Zhuo, L., Wang, C.-L., & Lau, F. C. M. (2003). Document replication and distribution in extensible geographically distributed web servers. Journal of Parallel and Distributed Computing, 63(10), 927–944. doi:10.1016/S0743-7315(03)00095-9. ISSN: 0743-7315.

Download references

Author information

Authors and Affiliations

  1. IITB-Monash Research Academy, IIT Bombay, Powai, Mumbai, 400076, India

    Goutam Sen & Mohan Krishnamoorthy

  2. Industrial Engineering and Operations Research, IIT Bombay, Powai, Mumbai, 400076, India

    Narayan Rangaraj & Vishnu Narayanan

Authors
  1. Goutam Sen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mohan Krishnamoorthy
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Narayan Rangaraj
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Vishnu Narayanan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Goutam Sen.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Sen, G., Krishnamoorthy, M., Rangaraj, N. et al. Facility location models to locate data in information networks: a literature review. Ann Oper Res 246, 313–348 (2016). https://doi.org/10.1007/s10479-015-1840-6

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-015-1840-6

Keywords

Search

Navigation