A Note on Models, Algorithms, and Data Structures for Dynamic Communication Networks
Résumé
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.