.png){kind=icon}
.png){kind=icon}
Return
A constraint-programming-based approach for solving the data dissemination problem
.png){kind=icon}
OA
AI
DOI：10.1016/j.cor.2016.09.004.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Systems of mobile Systems are intermittently connected networks that use store-carry-forward routing for data transfers. Independent systems collaborate and exchange data to achieve a common goal. Data transfers are only possible between systems that are close enough to each other, when a so-called contact occurs. During a contact, a sending system can transmit to a receiving system a fixed amount of data held in its interna then assume it holds at a til buffer. We assume that the trajectories of component systems are predictable, and consequently that a sequence of contacts may be considered. This dissemination problem is aimed at finding a transfer plan such that a set of data can be transferred from a given subset of source systems to all the recipient systems. In this paper, we propose an original constraint-programming -based algorithm for solving this problem. Computational results show that this approach is an improvement on the integer-linear-programming-based approach that we proposed in a previous paper. (C) 2016 Elsevier Ltd. All rights reserved.
Keywords:
Combinatorial optimization
Constraint programming
Lower bounds
Symmetry-breaking techniques
Systems of systems
Data transfer problem
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.3
Papers:
6.5K
Citations:
1.8W