HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

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

Afonso Ferreira 1 Laurent Viennot 2
1 MASCOTTE - Algorithms, simulation, combinatorics and optimization for telecommunications
CRISAM - Inria Sophia Antipolis - Méditerranée , Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
2 HIPERCOM - High performance communication
Inria Paris-Rocquencourt, UP11 - Université Paris-Sud - Paris 11, Inria Saclay - Ile de France, X - École polytechnique, CNRS - Centre National de la Recherche Scientifique : UMR
Abstract : 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.
Document type :
Complete list of metadata

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Tuesday, May 23, 2006 - 8:00:03 PM
Last modification on : Friday, February 4, 2022 - 3:10:09 AM
Long-term archiving on: : Sunday, April 4, 2010 - 10:57:25 PM


  • HAL Id : inria-00072185, version 1


Afonso Ferreira, Laurent Viennot. A Note on Models, Algorithms, and Data Structures for Dynamic Communication Networks. [Research Report] RR-4403, INRIA. 2002. ⟨inria-00072185⟩



Record views


Files downloads