Skip to Main content Skip to Navigation
Conference papers

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.
Document type :
Conference papers
Complete list of metadata

Cited literature [18 references]  Display  Hide  Download

https://hal.inria.fr/hal-00923328
Contributor : Giovanni Neglia Connect in order to contact the contributor
Submitted on : Thursday, January 2, 2014 - 2:19:43 PM
Last modification on : Thursday, January 20, 2022 - 5:31:44 PM
Long-term archiving on: : Thursday, April 3, 2014 - 1:10:09 PM

File

main.pdf
Files produced by the author(s)

Identifiers

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

Share

Metrics

Record views

91

Files downloads

120