Reference : Predictable disruption tolerant networks and delivery guarantees
Reports : Other
Engineering, computing & technology : Computer science
http://hdl.handle.net/2268/29762
Predictable disruption tolerant networks and delivery guarantees
English
François, Jean-Marc [Université de Liège - ULg > Dép. d'électric., électron. et informat. (Inst.Montefiore) > Réseaux informatiques > > > >]
Leduc, Guy mailto [Université de Liège - ULg > Dép. d'électric., électron. et informat. (Inst.Montefiore) > Réseaux informatiques >]
Dec-2006
arXiv/cs
9
arXiv:0612034
[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 (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.
FP6-FET ANA (FP6-IST- 27489)
Researchers
http://hdl.handle.net/2268/29762
http://arxiv.org/abs/cs/0612034v1

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Open access
JMF-0612034v1.pdfPublisher postprint286.91 kBView/Open

Bookmark and Share SFX Query

All documents in ORBi are protected by a user license.