Evolving graphs and least cost journeys in dynamic networks - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2003

Evolving graphs and least cost journeys in dynamic networks


New technologies and the deployment of mobile and nomadic services are driving the emergence of complex communications networks, that have a highly dynamic behavior. This naturally engenders new route-discovery problems under changing conditions over these networks. In this paper, we use and extend a recently proposed graph theoretic model, which helps capture the evolving characteristic of such networks, in order to propose and formally analyze least cost journeys (the analog of paths in usual graphs) in a class of dynamic networks, where the changes in the topology can be predicted in advance. Cost measures investigated here are hop count (shortest journeys), arrival date (foremost journeys), and time span (fastest journeys).
Fichier principal
Vignette du fichier
BuiXuan-evolving.pdf (347.7 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00466676 , version 1 (24-03-2010)


  • HAL Id : inria-00466676 , version 1


Binh-Minh Bui-Xuan, Afonso Ferreira, Aubin Jarry. Evolving graphs and least cost journeys in dynamic networks. WiOpt'03: Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, Mar 2003, Sophia Antipolis, France. 10 p. ⟨inria-00466676⟩
334 View
231 Download


Gmail Facebook Twitter LinkedIn More