Towards a formalism for routing in challenged networks

Proceedings of the Annual International Conference on Mobile Computing and Networking, MOBICOM

Volumn , Issue , 2007, Pages 3-10

  Ramanathan, Ram ^a   Basu, Prithwish ^a   Krishnan, Rajesh ^a  

^a BBN TECHNOLOGIES   (United States)

Author keywords

Challenged networks; Disruption tolerant networks; Formalism

Indexed keywords

CHALLENGED NETWORKS; DISRUPTION TOLERANT NETWORKS; FORMAL FRAMEWORK; ROUTING MECHANISMS;

ALGORITHMS; BANDWIDTH; NETWORK ROUTING; OPTIMIZATION; PROBLEM SOLVING; SCHEDULING;

FAULT TOLERANT COMPUTER SYSTEMS;

EID: 38849151520     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1287791.1287794     Document Type: Conference Paper

References (25)

1. Wizzy project. http://www.wizzy.org.za.
2. A. V. A. Balasubramanian, B.N. Levine. Dtn routing as a resource allocation problem. In Proc. ACM SIGCOMM, Aug 2007.
3. J.-Y. Boudec and P. Thiran. Network Calculus: A Theory of Deterministic Queueing Systems for the Internet. Springer, LNCS, 2001.
4. B. Burns, O. Brock, and B. Levine. Mv routing and capacity building in disruption tolerant networks. In In Proc. IEEE Infocom, August 2005.
5. D. Dolev and J. Welch. Crash resilient communications in dynamic networks. IEEE Transactions on Computers, 1997.
6. P. J. et al. Energy-efficient computing for wildlife tracking: Design tradeoffs and early experiences with zebranet. In Proc. ASPLOS, Oct 2002.
7. S. B. et al. Delay-tolerant networking: An approach to interplanetary internet. IEEE Communications Magazine, June, 2003.
8. V. C. et al. Delay-tolerant network architecture, July 2004. Internet-Draft.
9. A. Ferreira. On models and algorithms for dynamic communication networks: the case for evolving graphs. In In Proc. ALGOTEL, 2002.
10. F. Harary. Graph Theory. Addison Wesley, 1995.
11. K. Harras, K. Almeroth, and E. Belding-Royer. Delay tolerant mobile networks (dtmns): Controlled flooding schemes in sparse mobile networks, 2005.
12. J. Hopcroft and J. Ullman. Introduction to Automata Theory, Languages and Computation. Addison Wesley, 1979.
13. S. Jain, M. Demmer, R. Patra, and K. Fall. Using redundancy to cope with failures in a delay tolerant network. In SIGCOMM '05: Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications, pages 109-120, 2005.
14. S. Jain, K. Fall, and R. Patra. Routing in a delay tolerant network. In SIGCOMM, Aug 2004.
15. E. Jones, L. Li, and P. Ward. Practical routing in delay-tolerant networks. In In Proc. ACM WDTN, 2005.
16. A. Lindgren, A. Doria, and O. Scheln. Probabilistic routing in intermittently connected networks. In Proc. ACM Mobihoc, 2003.
17. P. Marshall. The disruption tolerant networking program, 2005. http://www.darpa.mil/sto/solicitaitions/DTN/briefs.htm.
18. S. Merugu, M. Ammar, and E. Zegura. Space-time routig in wireless networks with predictable mobility. In Georgia Tech Report GIT-CC-04-07, March 2004.
19. A. Pentland, R. Fletcher, and A. Hasson. Daknet: Rethinking connectivity in developing nations. IEEE Computer 37(1), 78-83, Jan 2004.
20. R. Ramanathan, R. Hansen, P. Basu, R. Hain, and R. Krishnan. Prioritized epidemic for routing in opportunistic networks. In Proc. ACM MobiOpp, June 2007.
21. J. Sobrinho. An algebraic theory of dynamic network routing. IEEE/ACM Transactions on Networking, Oct 2005. (13)5.
22. T. Spyropoulos, K. Psounis, and C. Raghavendra. Spray and wait: An efficient routing scheme for intermittently connected wireless networks. In Proc. ACM Sigcomm Workshop on DTN, 2005.
23. A. Vahdat and D. Becker. Epidemic routing for partially connected ad hoc networks, 2000.
24. X. Zhang, G. Neglia, J. Kurose, and D. Towsley. Performance modeling of epidemic routing. In In Proc. IFIP Networking, 2006.
25. Z. Zhang. Routing in intermittently connected mobile ad hoc networks and delay tolerant networks: Overview and challenges. IEEE Communication Surveys and Tutorials, Jan 2006.