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

Sen, Goutam; Krishnamoorthy, Mohan; Rangaraj, Narayan; Narayanan, Vishnu

doi:10.1007/s10479-015-1840-6

Cited by 9 publications

(7 citation statements)

References 117 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The simplified model is a classical user assignment problem (UAP) model, and Sen et al [14] reviews various methods to quickly and efficiently solve the UAP problem. Because this paper deals with the cost minimization problem, it is necessary to convert the objective function into a fitness function to ensure that excellent individuals have large fitness values.…”

Section: Fitness Functionmentioning

confidence: 99%

A Cost-Effective Data Replica Placement Strategy Based on Hybrid Genetic Algorithm for Cloud Services

Huang

2018

Lecture Notes in Business Information Processing

View full text Add to dashboard Cite

Cloud computing provide an efficient big data processing platform for many small and medium scale enterprises, how to replicate and allocate data in clouds is a critical problem influencing cost consumption for small and medium scale enterprises. Cloud data management systems mainly serve two kinds of workloads, one is readintensive analytical workloads (e.g. OLAP), the other is write-intensive transactional workloads (e.g. OLTP). It is essential to minimize data management costs like storage, communication bandwidth, update and power with guaranteeing the service level agreements. Toward two workloads, a cost-effective data replica placement approach for minimizing data management costs on cloud computing centers is proposed. The definition of different data management costs is identified first, then we construct the cost optimization model of the data replica placement problem. The paper proposes a hybrid genetic algorithm and a data support-based initialization method that addresses the problem. Experiments show that the approach result in significant reduction in total data management cost and the algorithm is with good performance.

show abstract

Section: Fitness Functionmentioning

confidence: 99%

A Cost-Effective Data Replica Placement Strategy Based on Hybrid Genetic Algorithm for Cloud Services

Huang

2018

Lecture Notes in Business Information Processing

View full text Add to dashboard Cite

show abstract

“…Constraints (8) ensure that a user view can be allocated to a server only if the server is assigned a configuration that has all the fragments needed by the user view. Constraints (9) state that each server is allocated a fragment combination. Constraints (10) serve the same purpose as constraints (4).…”

Section: Dddp1mentioning

confidence: 99%

“…A comprehensive review of these studies can be found in [9]. Here, we consider studies that are most related to the topic of our paper.…”

Section: Introductionmentioning

confidence: 99%

Fragment Allocation and Replication in Distributed Databases

Amiri¹

2017

IJDTA

View full text Add to dashboard Cite

show abstract

“…The problem of placing files, selecting the servers, and assigning users to those servers gives rise to very complex decision problem frameworks. State‐of‐the‐art reviews of optimization models for this kind problem are available in the literature (see ). This approach is limited in the literature to small‐scale problems; real‐world examples have a large number of files and users.…”

Section: Introductionmentioning

confidence: 99%

“…In data location literature (see for a comprehensive review), many studies assume an underlying tree network. The network structure is often predefined.…”

Section: Introductionmentioning

confidence: 99%

Mathematical models and empirical analysis of a simulated annealing approach for two variants of the static data segment allocation problem

et al. 2016

Self Cite

View full text Add to dashboard Cite

We consider a content distribution network (CDN) in which data hubs or servers are established in multiple locations to cater to local demands. The distributions of data to these hubs along with related network design problems (such as hub location and user assignment) are the key decision problems to consider to minimize the total routing cost. A new model for allocation of segments is introduced in Sen, Krishnamoorthy, Rangaraj and Narayanan, Comput Oper 62 (2015), 282–295, in which local preferences guide the database partitioning process, and the servers are fully connected to each other. In this article, we develop a simulated annealing (SA) approach (referred to as SA‐mesh) to solve this problem and compare its performance with the corresponding mixed‐integer linear programming (MILP) formulation. We also formulate a much harder variant of the problem in which servers are interconnected by a tree. We develop a SA algorithm (referred to as SA‐tree) for this variant, in which a local search is incorporated to find a suboptimal tree backbone. We use a customized data structure based on linked lists to represent a solution in our algorithms. This enables our algorithms to scale to much larger instances of the problem. We use optimal solutions and the benchmarks obtained by CPLEX to justify the performance of our algorithms. © 2016 Wiley Periodicals, Inc. NETWORKS, Vol. 68(1), 4–22 2016

show abstract

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

Cited by 9 publications

References 117 publications

A Cost-Effective Data Replica Placement Strategy Based on Hybrid Genetic Algorithm for Cloud Services

A Cost-Effective Data Replica Placement Strategy Based on Hybrid Genetic Algorithm for Cloud Services

Fragment Allocation and Replication in Distributed Databases

Mathematical models and empirical analysis of a simulated annealing approach for two variants of the static data segment allocation problem

Contact Info

Product

Resources

About