skip to main content
10.1145/863955.863960acmconferencesArticle/Chapter ViewAbstractPublication PagescommConference Proceedingsconference-collections
Article
Free Access

A delay-tolerant network architecture for challenged internets

Published:25 August 2003Publication History

ABSTRACT

The highly successful architecture and protocols of today's Internet may operate poorly in environments characterized by very long delay paths and frequent network partitions. These problems are exacerbated by end nodes with limited power or memory resources. Often deployed in mobile and extreme environments lacking continuous connectivity, many such networks have their own specialized protocols, and do not utilize IP. To achieve interoperability between them, we propose a network architecture and application interface structured around optionally-reliable asynchronous message forwarding, with limited expectations of end-to-end connectivity and node resources. The architecture operates as an overlay above the transport layers of the networks it interconnects, and provides key services such as in-network data storage and retransmission, interoperable naming, authenticated forwarding and a coarse-grained class of service.

References

  1. J. Alonso, K. Fall, "A Linear Programming Formulation of Flows over Time with Piecewise Constant Capacity and Transit Times", Intel Research Technical Report IRB-TR-03-007, June 2003.]]Google ScholarGoogle Scholar
  2. Border et. al., "Performance Enhancing Proxies Intended to Mitigate Link-Related Degradations", Internet RFC3135, June 2001.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. V. Cerf et. al., "Interplanetary Internet (IPN): Architectural Definition", http://www.ipnsig.org/reports/memo-ipnrg-arch-00.pdf.]]Google ScholarGoogle Scholar
  4. V. Cerf, R. Kahn, "A Protocol for Packet Network Inter- communication", IEEE Trans. on Comm., COM-22(5), May 1974 CFDP Protocol Specification, CCSDS 727.0-B-1, Jan 2002, http://www.ccsds.org.]]Google ScholarGoogle Scholar
  5. CFDP Protocol Specification, CCSDS 727.0-B-1, Jan 2002, http://www.ccsds.org]]Google ScholarGoogle Scholar
  6. E. Chen, J. Stewart, "A Framework for Inter-Domain Route Aggregation", Internet RFC2519, Feb 1999.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. D. Clark, "The Design Philosophy of the DARPA Internet Protocols", Proc. SIGCOMM 1988.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. K. Fall, "A Delay-Tolerant Network Architecture for Challenged Internets", Intel Research Technical. Report IRB-TR-03-003, Feb 2003.]]Google ScholarGoogle Scholar
  9. D. Feldmeier, A. McAuley, J. Smith, D. Bakin, W. Marcus, T. Raleigh, "Protocol Boosters", IEEE JSAC, Apr 1998.]]Google ScholarGoogle Scholar
  10. M. Gritter, D. Cheriton, "An Architecture for Content Routing Support in the Internet", Proc. Usenix USITS, March 2001.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. J. Heidemann et. al., "Building Efficient Wireless Sensor Networks with Low-Level Naming", Proc. SOSP, Oct 2001.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. P. Juang, H. Oki, Y. Wang, M. Maronosi, L. Peh, D. Rubenstein, "Energy-Efficient Computing for Wildlife Tracking: Design Tradeoffs and Early Experiences with ZebraNet", Proc. ASPLOS, Oct 2002.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. M. Mealling, R. Denenbers, eds., "Report from the Joint W3C/IETF URI Planning Interest Group: Uniform Resource Identifiers (URIs), URLs, and Uniform Resource Names (URNs): Clarifications and Recommendations", Internet RFC 3305, Aug 2002.]]Google ScholarGoogle Scholar
  14. D. Mills, "Network Time Protocol (Version 3) Specification, Implementation and Analysis", Internet RFC1305, Mar 1992.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. D. Mills, H. Nair, "Timekeeping in the Interplanetary Internet", in progress, http//:www.eecis.udel.edu/ mills/ipin.html.]]Google ScholarGoogle Scholar
  16. J. Saltzer, D. Reed, D. Clark, "End-to-End Arguments in System Design", ACM Trans on Computer Systems, 2(4), Nov 1984.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. R. Shah, S. Roy, S. Jain, W. Brunette, "Data MULEs: Modeling a Three-tier Architecture for Sparse Sensor Networks", IEEE SNPA Workshop, May 2003.]]Google ScholarGoogle ScholarCross RefCross Ref
  18. J. Sterbenz, et. al., "Survivable Mobile Wireless Networks: Issues, Challenges and Research Directions", WiSe 2002, Sep 2002.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. J. Sterbenz, T. Saxena, R. Krishnan, "Latency-Aware Information Access with User-Directed Fetch Behaviour for Weakly-Connected Mobile Wireless Clients", BBN Tech. Report 8340, May 2002.]]Google ScholarGoogle Scholar
  20. A. Vahdat, D. Becker, "Epidemic Routing for Partially-Connected Ad Hoc Networks", Duke Tech Report CS-2000-06, 2000.]]Google ScholarGoogle Scholar
  21. W. Adgie-Winoto, E. Schwartz, H. Balakrishnan, J. Lilley, "The Design and Implementation of an Intentional Naming System", Proc. SOSP, Dec 1999.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. J. Wroclawski, "The MetaNet: White Paper", Workshop on Research Directions for the Next Generation Internet", May 1997, http://www.cra.org/Policy/NGI/papers/wroklawWP.]]Google ScholarGoogle Scholar

Index Terms

  1. A delay-tolerant network architecture for challenged internets

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Conferences
      SIGCOMM '03: Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
      August 2003
      432 pages
      ISBN:1581137354
      DOI:10.1145/863955

      Copyright © 2003 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 25 August 2003

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • Article

      Acceptance Rates

      SIGCOMM '03 Paper Acceptance Rate34of319submissions,11%Overall Acceptance Rate554of3,547submissions,16%

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader