Using redundancy to cope with failures in a delay tolerant network

By Sushant Jain, Michael J. Demmer, Rabin K. Patra, Kevin R. Fall. Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, 2005

341 citations recorded by the source corpus.

Subfields: Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/334ef08d2f0acb63b058d14fa8f6e5743d9f0213

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

1. Zhili Sun
2. Zhensheng Zhang
3. Thrasyvoulos Spyropoulos
4. Konstantinos Psounis
5. Cauligi S. Raghavendra
6. Brian Neil Levine
7. Cecilia Mascolo
8. Mirco Musolesi

Citations in the corpus

• Efficient Routing in Intermittently Connected Mobile Networks: The Single-Copy Case (2008, background): “yet in the context of reliability, is undertaken in [31].”
• Spray and Focus: Efficient Mobility-Assisted Routing for Heterogeneous and Correlated Mobility (2007, background): “the point of view of reliability borrows some ideas from modern portfolio theory [42].”
• Practical Routing in Delay-Tolerant Networks (2005, background): “present a theoretical approach to determine which set of paths to use, provided that the path failure probabilities are known and independent [20].”
• DTN routing as a resource allocation problem (2007, background): “Proposed protocols attempt to limit replication or otherwise clear useless packets in various ways: (i) using historic meeting information [12, 7, 6, 23]; (ii) removing useless packets using acknowledgments of delivered data [6]; (iii) using probabilistic mobility information to infer delivery [30];”
• Erasure-coding based routing for opportunistic networks (2005, background): “This is part of our ongoing effort and is discussed in [5].”
• Efficient Routing in Intermittently Connected Mobile Networks: The Multiple-Copy Case (2008, background): “yet in the context of reliability, is undertaken in [31].”
• Message ferry route design for sparse ad hoc networks with mobile nodes (2006, background): “consider routing when the dynamics of end-to-end connectivity are known with certainty [10] or probabilistically [11].”
• Prioritized epidemic routing for opportunistic networks (2007, background): “A number of ideas have been explored to improve the efficiency of Epidemic Routing, including probabilistic forwarding and purging [9], controlled replication called “spray and wait” [16], and using portfolio theory (Sharpe Ratio) and erasure coding [10].”
• Socially-aware routing for publish-subscribe in delay-tolerant mobile ad hoc networks (2008, background): “certain degree of redundancy in the system [26], [27].”
• Routing in Delay/Disruption Tolerant Networks: A Taxonomy, Survey and Challenges (2013, methodology): “Algorithm in [100] Path Failure Probability, Replication Factor, Splitting Factor Limited by Coding Rate Not Mentioned Not Mentioned Not Mentioned”
• Routing in intermittently connected mobile ad hoc networks and delay tolerant networks: overview and challenges (2006, methodology): “To extend the work in [16], the authors of [ 40 ] assume the probability, Pi, that the transmission over link i is successful (independent of other transmissions) is known.”
• Delay-Tolerant Networking Architecture (2007, background): “More technical descriptions may be found in [KF03], [JFP04], [JDPF05], and [WJMF05].”