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 , 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).
Type de document :
Communication dans un congrès
WiOpt'03: Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, Mar 2003, Sophia Antipolis, France. 10 p., 2003
Liste complète des métadonnées

https://hal.inria.fr/inria-00466676
Contributeur : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Soumis le : mercredi 24 mars 2010 - 14:33:07
Dernière modification le : jeudi 11 janvier 2018 - 16:02:55
Document(s) archivé(s) le : vendredi 25 juin 2010 - 12:19:45

Fichier

BuiXuan-evolving.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • 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., 2003. 〈inria-00466676〉

Partager

Métriques

Consultations de la notice

416

Téléchargements de fichiers

217