• A Note on Models, Algorithms,...

Result: A Note on Models, Algorithms, and Data Structures for Dynamic Communication Networks

Title:
A Note on Models, Algorithms, and Data Structures for Dynamic Communication Networks
Authors:
Ferreira, Afonso, Viennot, Laurent
Contributors:
Algorithms, simulation, combinatorics and optimization for telecommunications (MASCOTTE), Centre Inria d'Université Côte d'Azur, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-COMmunications, Réseaux, systèmes Embarqués et Distribués (Laboratoire I3S - COMRED), Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), Université Nice Sophia Antipolis (1965 - 2019) (UNS)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UniCA)-Université Nice Sophia Antipolis (1965 - 2019) (UNS)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UniCA)-Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), Université Nice Sophia Antipolis (1965 - 2019) (UNS)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UniCA)-Université Nice Sophia Antipolis (1965 - 2019) (UNS)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UniCA), High performance communication (HIPERCOM), Inria Paris-Rocquencourt, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université Paris-Sud - Paris 11 (UP11)-Centre Inria de Saclay, Institut National de Recherche en Informatique et en Automatique (Inria)-École polytechnique (X), Institut Polytechnique de Paris (IP Paris)-Institut Polytechnique de Paris (IP Paris)-Centre National de la Recherche Scientifique (CNRS), INRIA
Source:
[Research Report] RR-4403, INRIA. 2002
Publisher Information:
CCSD, 2002.
Publication Year:
2002
Collection:
collection:UNICE
collection:X
collection:CNRS
collection:INRIA
collection:UNIV-PSUD
collection:INRIA-SOPHIA
collection:INRIA-ROCQ
collection:INRIA-RRRT
collection:INRIA-SACLAY
collection:I3S
collection:INRIASO
collection:INRIA_TEST
collection:TESTALAIN1
collection:INRIA2
collection:LARA
collection:UNIV-PARIS-SACLAY
collection:UNIV-PSUD-SACLAY
collection:UNIV-COTEDAZUR
collection:TEST-NICE
collection:DEPARTEMENT-DE-MATHEMATIQUES
Subject Terms:
MOBILE NETWORKS, MODELS, ALGORITHMS, DYNAMIC NETWORKS, DYNAMIC GRAPHS, EVOLVING GRAPHS, SHORTEST PATHS, [INFO.INFO-OH]Computer Science [cs], Other [cs.OH]
Original Identifier:
HAL:
Document Type:
Report report<br />Reports
Language:
English
Access URL:
https://inria.hal.science/inria-00072185
https://inria.hal.science/inria-00072185v1/document
https://inria.hal.science/inria-00072185v1/file/RR-4403.pdf
Rights:
info:eu-repo/semantics/OpenAccess
Accession Number:
edshal.inria.00072185v1
Database:
HAL

Further Information

New technologies and the deployment of mobile and nomadic services are driving the emergence of complex communications networks, that have a highly dynamic behavior. Modeling such dynamics, and designing algorithms that take it into account, received considerable attention recently. In this note, we discuss a formal generalization of dynamic graphs, the evolving graphs, which aims at harnessing the complexity of an evolving setting as yielded by dynamic communication networks. We argue that evolving graphs are of great help when dealing with fixed-schedule networks. Moreover, we show how to exploit our model with networks where short time prediction is available.