Using Redundancy to Cope with Failures in a Delay Tolerant Network. Sushant Jain, Michael Demmer, Rabin Patra, Kevin Fall Source: www.cs.utexas.edu/~lili/ classes/F05/slides/dtn-yogita.ppt . Outline of Discussion. Introduction Erasure Coding Formal Problem Statement Path Failure Models
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
Using Redundancy to Cope with Failures in a Delay Tolerant Network
Sushant Jain, Michael Demmer, Rabin Patra, Kevin Fall
Source: www.cs.utexas.edu/~lili/ classes/F05/slides/dtn-yogita.ppt
for kth strategy
Bernoulli Path Failure, are different
Formulation of Mixed Integer Program (MIP)
Objective: Maximize Sharpe Ratio
1km x 1km planar area, source and destination at opposite corners.
Message size 10KB, Contact bandwidth 100Kbps, Storage capacity of MULE 1MB
Velocity of MULE 10m/s.
pi = Prob(Di ≤ T),