Computing shortest, fastest, and foremost journeys in dynamic networks - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports Year : 2002

Computing shortest, fastest, and foremost journeys in dynamic networks

Afonso Ferreira
Aubin Jarry
  • Function : Author

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. Unfortunately, the temporal variations in the network topology are hard to be effectively captured in a classical graph model. In this paper, we use and extend a recently proposed graph theoretic model -- the evolving graphs --, 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. Cost measures investigated here are hop count (shortest journeys), arrival date (foremost journeys), and time span (fastest journeys).
Fichier principal
Vignette du fichier
RR-4589.pdf (306.6 Ko) Télécharger le fichier
Loading...

Dates and versions

inria-00071996 , version 1 (23-05-2006)

Identifiers

  • HAL Id : inria-00071996 , version 1

Cite

Binh-Minh Bui-Xuan, Afonso Ferreira, Aubin Jarry. Computing shortest, fastest, and foremost journeys in dynamic networks. RR-4589, INRIA. 2002. ⟨inria-00071996⟩
360 View
55263 Download

Share

Gmail Facebook Twitter LinkedIn More