IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v246y2016i1d10.1007_s10479-015-1840-6.html
   My bibliography  Save this article

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

Author

Listed:
  • Goutam Sen

    (IIT Bombay)

  • Mohan Krishnamoorthy

    (IIT Bombay)

  • Narayan Rangaraj

    (IIT Bombay)

  • Vishnu Narayanan

    (IIT Bombay)

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.

Suggested Citation

  • Goutam Sen & Mohan Krishnamoorthy & Narayan Rangaraj & Vishnu Narayanan, 2016. "Facility location models to locate data in information networks: a literature review," Annals of Operations Research, Springer, vol. 246(1), pages 313-348, November.
  • Handle: RePEc:spr:annopr:v:246:y:2016:i:1:d:10.1007_s10479-015-1840-6
    DOI: 10.1007/s10479-015-1840-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-015-1840-6
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10479-015-1840-6?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. J. F. Campbell & A. T. Ernst & M. Krishnamoorthy, 2005. "Hub Arc Location Problems: Part I---Introduction and Results," Management Science, INFORMS, vol. 51(10), pages 1540-1555, October.
    2. Pirkul, Hasan, 1986. "An integer programming model for the allocation of databases in a distributed computer system," European Journal of Operational Research, Elsevier, vol. 26(3), pages 401-411, September.
    3. Andreas Ernst & Houyuan Jiang & Mohan Krishnamoorthy, 2006. "Exact Solutions to Task Allocation Problems," Management Science, INFORMS, vol. 52(10), pages 1634-1646, October.
    4. J. F. Campbell & A. T. Ernst & M. Krishnamoorthy, 2005. "Hub Arc Location Problems: Part II---Formulations and Optimal Algorithms," Management Science, INFORMS, vol. 51(10), pages 1556-1571, October.
    5. Deb Ghosh & Ishwar Murthy & Allen Moffett, 1992. "File Allocation Problem: Comparison of Models with Worst Case and Average Communication Delays," Operations Research, INFORMS, vol. 40(6), pages 1074-1085, December.
    6. Lidong Wang, 2012. "RFID-based information technology and management in agriculture and food supply chains," International Journal of Information Technology and Management, Inderscience Enterprises Ltd, vol. 11(3), pages 225-239.
    7. Sarathy, Rathindra & Shetty, Bala & Sen, Arun, 1997. "A constrained nonlinear 0-1 program for data allocation," European Journal of Operational Research, Elsevier, vol. 102(3), pages 626-647, November.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Thyago Celso Cavalcante Nepomuceno & Victor Diogho Heuer de Carvalho & Lúcio Camara e Silva & Jadielson Alves de Moura & Ana Paula Cabral Seixas Costa, 2022. "Exploring the Bedouin Syndrome in the Football Fan Culture: Addressing the Hooliganism Phenomena through Networks of Violent Behavior," IJERPH, MDPI, vol. 19(15), pages 1-19, August.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Alumur, Sibel A. & Yaman, Hande & Kara, Bahar Y., 2012. "Hierarchical multimodal hub location problem with time-definite deliveries," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 48(6), pages 1107-1120.
    2. Ivan Contreras & Moayad Tanash & Navneet Vidyarthi, 2017. "Exact and heuristic approaches for the cycle hub location problem," Annals of Operations Research, Springer, vol. 258(2), pages 655-677, November.
    3. Camilo Ortiz-Astorquiza & Ivan Contreras & Gilbert Laporte, 2019. "An Exact Algorithm for Multilevel Uncapacitated Facility Location," Transportation Science, INFORMS, vol. 53(4), pages 1085-1106, July.
    4. Nassim Mrabti & Nadia Hamani & Laurent Delahoche, 2022. "A Comprehensive Literature Review on Sustainable Horizontal Collaboration," Sustainability, MDPI, vol. 14(18), pages 1-38, September.
    5. Alumur, Sibel A. & Nickel, Stefan & Saldanha-da-Gama, Francisco, 2012. "Hub location under uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 46(4), pages 529-543.
    6. Kratica, Jozef & Stanimirovic, Zorica & Tosic, Dusan & Filipovic, Vladimir, 2007. "Two genetic algorithms for solving the uncapacitated single allocation p-hub median problem," European Journal of Operational Research, Elsevier, vol. 182(1), pages 15-28, October.
    7. Víctor Blanco & Elena Fernández & Yolanda Hinojosa, 2023. "Hub Location with Protection Under Interhub Link Failures," INFORMS Journal on Computing, INFORMS, vol. 35(5), pages 966-985, September.
    8. Alumur, Sibel A. & Campbell, James F. & Contreras, Ivan & Kara, Bahar Y. & Marianov, Vladimir & O’Kelly, Morton E., 2021. "Perspectives on modeling hub location problems," European Journal of Operational Research, Elsevier, vol. 291(1), pages 1-17.
    9. Kumar, Pramesh & Khani, Alireza, 2022. "Planning of integrated mobility-on-demand and urban transit networks," Transportation Research Part A: Policy and Practice, Elsevier, vol. 166(C), pages 499-521.
    10. de Sá, Elisangela Martins & de Camargo, Ricardo Saraiva & de Miranda, Gilberto, 2013. "An improved Benders decomposition algorithm for the tree of hubs location problem," European Journal of Operational Research, Elsevier, vol. 226(2), pages 185-202.
    11. Alumur, Sibel & Kara, Bahar Y., 2008. "Network hub location problems: The state of the art," European Journal of Operational Research, Elsevier, vol. 190(1), pages 1-21, October.
    12. Meuffels, W.J.M., 2015. "The design of road and air networks for express service providers," Other publications TiSEM d3266cb8-bc55-41be-adc7-4, Tilburg University, School of Economics and Management.
    13. Yıldız, Barış & Karaşan, Oya Ekin, 2015. "Regenerator Location Problem and survivable extensions: A hub covering location perspective," Transportation Research Part B: Methodological, Elsevier, vol. 71(C), pages 32-55.
    14. Nader Azizi, 2019. "Managing facility disruption in hub-and-spoke networks: formulations and efficient solution methods," Annals of Operations Research, Springer, vol. 272(1), pages 159-185, January.
    15. Kewcharoenwong, Panitan & Li, Qiaofeng & Üster, Halit, 2023. "Lagrangean relaxation algorithms for fixed-charge capacitated relay network design," Omega, Elsevier, vol. 121(C).
    16. Contreras, Ivan & Fernández, Elena & Marín, Alfredo, 2010. "The Tree of Hubs Location Problem," European Journal of Operational Research, Elsevier, vol. 202(2), pages 390-400, April.
    17. Alibeyg, Armaghan & Contreras, Ivan & Fernández, Elena, 2016. "Hub network design problems with profits," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 96(C), pages 40-59.
    18. Marianov, Vladimir & Eiselt, H.A., 2024. "Fifty Years of Location Theory - A Selective Review," European Journal of Operational Research, Elsevier, vol. 318(3), pages 701-718.
    19. El Mehdi Ibnoulouafi & Mustapha Oudani & Tarik Aouam & Mounir Ghogho, 2022. "Intermodal Green p-Hub Median Problem with Incomplete Hub-Network," Sustainability, MDPI, vol. 14(18), pages 1-29, September.
    20. James F. Campbell & Morton E. O'Kelly, 2012. "Twenty-Five Years of Hub Location Research," Transportation Science, INFORMS, vol. 46(2), pages 153-169, May.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:246:y:2016:i:1:d:10.1007_s10479-015-1840-6. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.