On Optimal Packet Routing in Deterministic DTNs

Abstract : In this paper, we investigate the problem of determining the routing that minimizes the maximum/average delivery time or the maximum/average delivery delay for a set of packets in a deterministic Delay Tolerant Network, i.e. in a network for which all the nodes' transmission opportunities are known in advance. While the general problem with multiple sources and multiple destinations is NP-hard, we present a polynomial time algorithm that can efficiently compute the optimal routing in the case of a single destination or of a single packet that needs to be routed to multiple destinations.
Type de document :
Communication dans un congrès
IEEE VTC - 77th Vehicular Technology Conference, Jun 2013, Dresden, Germany. pp.1-5, 2013, 〈10.1109/VTCSpring.2013.6692662〉
Liste complète des métadonnées

Littérature citée [18 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-00923328
Contributeur : Giovanni Neglia <>
Soumis le : jeudi 2 janvier 2014 - 14:19:43
Dernière modification le : samedi 27 janvier 2018 - 01:31:43
Document(s) archivé(s) le : jeudi 3 avril 2014 - 13:10:09

Fichier

main.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

Giovanni Neglia, Xiaolan Zhang, Jim Kurose, Don Towsley, Haixiang Wang. On Optimal Packet Routing in Deterministic DTNs. IEEE VTC - 77th Vehicular Technology Conference, Jun 2013, Dresden, Germany. pp.1-5, 2013, 〈10.1109/VTCSpring.2013.6692662〉. 〈hal-00923328〉

Partager

Métriques

Consultations de la notice

261

Téléchargements de fichiers

263