On models and algorithms for dynamic communication networks : the case for evolving graphs †

New technologies and the deployment of mobile and nomadic se rvices 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 rece ntly. In this paper, we introduce the evolving graphs , a simple model which aims at harnessing the complexity of an evolving setting as yielded by dynamic communication networks. We exemplify its use through the computation of shortest pat hs under different hypotheses in fixed-schedule dynamic networks.