Reference : Predictable disruption tolerant networks and delivery guarantees

	Document type :	Reports : Other
	Discipline(s) :	Engineering, computing & technology : Computer science
	To cite this reference:	http://hdl.handle.net/2268/29762

Title :	Predictable disruption tolerant networks and delivery guarantees
Language :	English
Author, co-author :	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 >]
Publication date :	Dec-2006
Collection and collection volume :	arXiv/cs
Page number :	9
Report number :	arXiv:0612034
Abstract :	[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.
Name of the research project :	FP6-FET ANA (FP6-IST- 27489)
Target :	Researchers
Permalink :	http://hdl.handle.net/2268/29762
Other URL :	http://arxiv.org/abs/cs/0612034v1

	File(s) associated to this reference
	Fulltext file(s): File Commentary Version Size Access Open access JMF-0612034v1.pdf Publisher postprint 286.91 kB View/Open

All documents in ORBi are protected by a user license.

 

© ULg Library Network |  Feedback |  ORBi legal notices

Dspace v1.5