Computer Science – Networking and Internet Architecture
Scientific paper
2006-12-06
Computer Science
Networking and Internet Architecture
9 pages
Scientific paper
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.
Francois Jean-Marc
Leduc Guy
No associations
LandOfFree
Predictable Disruption Tolerant Networks and Delivery Guarantees does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Predictable Disruption Tolerant Networks and Delivery Guarantees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Predictable Disruption Tolerant Networks and Delivery Guarantees will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-452128