Facility location models to locate data in information networks: a literature review
From MaRDI portal
Publication:512996
DOI10.1007/s10479-015-1840-6zbMath1357.90028OpenAlexW2072065130MaRDI QIDQ512996
Vishnu Narayanan, Goutam Sen, Narayan Rangaraj, Mohan Krishnamoorthy
Publication date: 3 March 2017
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-015-1840-6
Integer programming (90C10) Communication networks in operations research (90B18) Discrete location and assignment (90B80)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Exact approaches for static data segment allocation problem in an information network
- Comparison and analysis of ten static heuristics-based Internet data replication techniques
- Static and adaptive distributed data replication using genetic algorithms
- Exact algorithms for the joint object placement and request routing problem in content distribution networks
- Joint object placement and node dimensioning for internet content distribution
- An integer programming model for the allocation of databases in a distributed computer system
- The file allocation problem under dynamic usage
- Configuration of fully replicated distributed database system over wide area networks
- An integer programming formulation of computer data base design problems
- A constrained nonlinear 0-1 program for data allocation
- Optimal allocation for partially replicated database systems on tree- based networks
- Document replication and distribution in extensible geographically distributed web servers.
- Competitive distributed file allocation.
- Coarse-grain replica management strategies for dynamic replication of Web contents
- Dynamic replication of web contents
- Provisioning overlay distribution networks
- Hub Arc Location Problems: Part I—Introduction and Results
- Hub Arc Location Problems: Part II—Formulations and Optimal Algorithms
- Exact Solutions to Task Allocation Problems
- Architecture and performance models for QoS-driven effective peering of content delivery networks
- Approximation Algorithms for Data Placement Problems
- Combinatorial Algorithms for Data Migration to Minimize Average Completion Time
- Dynamic file assignment in a computer network--Part II: Decentralized control
- Database Location in Computer Networks
- The Multi-Commodity Facilities Location Problem
- Optimal location of files and programs in computer networks
- File allocation in a distributed database
- Heuristic Methods for the Data Placement Problem
- The Process Allocation Problem: a Survey of the Application of Graph-Theoretic and Integer Programming Approaches
- File Allocation Problem: Comparison of Models with Worst Case and Average Communication Delays
- Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases
- Optimal program and data locations in computer networks
- Some theorems to aid in solving the file allocation problem
- Algorithms for Data Migration with Cloning
- Data migration to minimize the total completion time
- Location of Software in Distributed Computing Systems
- Content Placement via the Exponential Potential Function Method
- The optimal location of replicas in a network using a READ-ONE-WRITE-ALL policy
- Database partitioning in a cluster of processors
- Optimal File Allocation in a Multiple Computer System
