Predictable Disruption Tolerant Networks and Delivery Guarantees
| dc.creator | Francois, Jean-Marc | |
| dc.creator | Leduc, Guy | |
| dc.date | 2006-12-06 | |
| dc.date.accessioned | 2026-07-07T07:31:50Z | |
| dc.date.available | 2026-07-07T07:31:50Z | |
| dc.description | This article studies disruption tolerant networks (DTNs) where each node knows the probabilistic distribution of contacts with other nodes. It proposes a framework that allows one to formalize the behaviour of such a network. It generalizes extreme cases that have been studied before where (a) either nodes only know their contact frequency with each other or (b) they have a perfect knowledge of who meets who and when. This paper then gives an example of how this framework can be used; it shows how one can find a packet forwarding algorithm optimized to meet the 'delay/bandwidth consumption' trade-off: packets are duplicated so as to (statistically) guarantee a given delay or delivery probability, but not too much so as to reduce the bandwidth, energy, and memory consumption. | |
| dc.description | 9 pages | |
| dc.identifier | https://arxiv.org/abs/cs/0612034 | |
| dc.identifier | http://arxiv.org/abs/cs/0612034 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/118896 | |
| dc.subject | Networking and Internet Architecture | |
| dc.title | Predictable Disruption Tolerant Networks and Delivery Guarantees | |
| dc.type | text |