On Optimal Packet Routing in Deterministic DTNs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2013

On Optimal Packet Routing in Deterministic DTNs


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
Origin : Files produced by the author(s)

Dates and versions

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



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⟩


96 View
135 Download



Gmail Facebook Twitter LinkedIn More