On Optimal Packet Routing in Deterministic DTNs - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2013

On Optimal Packet Routing in Deterministic DTNs

Résumé

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.
Fichier principal
Vignette du fichier
main.pdf (153.6 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00923328 , version 1 (02-01-2014)

Identifiants

Citer

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, ⟨10.1109/VTCSpring.2013.6692662⟩. ⟨hal-00923328⟩

Collections

INRIA INRIA2
102 Consultations
143 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More