You are here:
| Reference : Delivery Guarantees In Predictable Disruption Tolerant Networks |
| Scientific congresses and symposiums : Paper published in a journal | |||
| Engineering, computing & technology : Computer science | |||
| http://hdl.handle.net/2268/3351 | |||
| Delivery Guarantees In Predictable Disruption Tolerant Networks | |
| English | |
| François, Jean-Marc [Université de Liège - ULg > Dép. d'électric., électron. et informat. (Inst.Montefiore) > Réseaux informatiques > >] | |
Leduc, Guy  [Université de Liège - ULg > Dép. d'électric., électron. et informat. (Inst.Montefiore) > Réseaux informatiques >] | |
| May-2007 | |
| Lecture Notes in Computer Science | |
| Springer | |
| 4479 | |
| 167-178 | |
| Yes | |
| No | |
| International | |
| 0302-9743 | |
| Berlin | |
| Germany | |
| IFIP Networking 2007 | |
| 14-18 May 2007 | |
| Atlanta | |
| USA | |
| [en] DTN ; Routing | |
| [en] 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 either (a) 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. | |
| Researchers | |
| http://hdl.handle.net/2268/3351 | |
| 10.1007/978-3-540-72606-7_15 |
| File(s) associated to this reference | ||||||||||||||
|
Fulltext file(s):
| ||||||||||||||
All documents in ORBi are protected by a user license.
