Skip to Main content Skip to Navigation
Conference papers

Evolving graphs and least cost journeys in dynamic networks

Binh-Minh Bui-Xuan 1 Afonso Ferreira 2 Aubin Jarry 2
2 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
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. 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).
Complete list of metadata

https://hal.inria.fr/inria-00466676
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Submitted on : Wednesday, March 24, 2010 - 2:33:07 PM
Last modification on : Thursday, November 12, 2020 - 2:30:10 PM
Long-term archiving on: : Friday, June 25, 2010 - 12:19:45 PM

File

BuiXuan-evolving.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00466676, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

597

Files downloads

440