1. Robust routing in deterministic delay-tolerant networks
- Author
-
Antoine Jouglet, Ronan Bocquillon, Heuristique et Diagnostic des Systèmes Complexes [Compiègne] (Heudiasyc), Université de Technologie de Compiègne (UTC)-Centre National de la Recherche Scientifique (CNRS), Laboratoire d'Excellence 'Maîtrise des Systèmes de Systèmes Technologiques' (Labex MS2T), Laboratoire d'Informatique Fondamentale et Appliquée de Tours (LIFAT), Centre National de la Recherche Scientifique (CNRS)-Université de Tours-Institut National des Sciences Appliquées - Centre Val de Loire (INSA CVL), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA), Conseil Régional de Picardie, Université de Tours (UT)-Institut National des Sciences Appliquées - Centre Val de Loire (INSA CVL), and Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS) more...
- Subjects
Store-carry-and-forward routing ,Combinatorial optimization ,General Computer Science ,Computer science ,0211 other engineering and technologies ,Delay-tolerant networks DTNs ,02 engineering and technology ,Management Science and Operations Research ,Set (abstract data type) ,Transfer (computing) ,0202 electrical engineering, electronic engineering, information engineering ,Constraint programming ,Sequence ,021103 operations research ,business.industry ,Systems of systems ,[INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO] ,Modeling and Simulation ,020201 artificial intelligence & image processing ,Disruption-tolerant networks ,Routing (electronic design automation) ,Robust optimization ,business ,Computer network - Abstract
International audience; A system of systems is a set of heterogeneous independent systems that share data in pursuit of a common goal. These systems form a delay-/disruption-tolerant network (DTN), where routing is based on the store-carry-and-forward paradigm. Systems can communicate whenever they are close enough to each other, in what are called contacts. We assume that the movements of these systems may be predicted in advance and we consider that a sequence of contacts is given at the outset. During a contact, a given emitting system can transfer to a given receiving system a fixed amount of data (termed datum unit) that it has in its possession. The dissemination problem is to find a transfer plan such that all the data can be transferred from a given subset of source systems to a given subset of recipient systems. In this paper we study the problem where communications may fail. We propose an algorithm for finding a robust transfer plan that minimizes the dissemination length. more...
- Published
- 2018
- Full Text
- View/download PDF