The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
A delay-tolerant network architecture for challenged internets
Open accessAbstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Epidemic routing for partially-connected ad hoc networks
Vahdat, A. M. (2000) · Cited by 4,624
(2011) · SpringerReference · doi:10.1007/springerreference_27387 · Cited by 3,053
End-To-End Arguments In System Design
And, S. R., Saltzer, J. H., Reed, D. P., & Clark, D. D. (1984) · Cited by 2,130
Andersen, D., Balakrishnan, H., Kaashoek, F., & Morris, R. (2001) · Proceedings of the eighteenth ACM symposium on Operating systems principles · doi:10.1145/502034.502048 · Cited by 1,868
Juang, P., Oki, H., Wang, Y., Martonosi, M., Peh, L. S., & Rubenstein, D. (2002) · Proceedings of the 10th international conference on Architectural support for programming languages and operating systems · doi:10.1145/605397.605408 · Cited by 1,804
Data MULEs: modeling a three-tier architecture for sparse sensor networks
Shah, R. C., Roy, S., Jain, S., & Brunette, W. (2003) · Proceedings of the First IEEE International Workshop on Sensor Network Protocols and Applications, 2003. · doi:10.1109/snpa.2003.1203354 · Cited by 1,322
A digital fountain approach to reliable distribution of bulk data
Byers, J. W., Luby, M., Mitzenmacher, M., & Rege, A. (1998) · Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/285237.285258 · Cited by 1,138
Network Time Protocol (Version 3) Specification, Implementation and Analysis
Mills, D. L. (1992) · doi:10.17487/rfc1305 · Cited by 851
A Protocol for Packet Network Intercommunication
Cerf, V., & Kahn, R. (1974) · IEEE Transactions on Communications · doi:10.1109/tcom.1974.1092259 · Cited by 834
The design and implementation of an intentional naming system
Adjie-Winoto, W., Schwartz, E., Balakrishnan, H., & Lilley, J. (1999) · Proceedings of the seventeenth ACM symposium on Operating systems principles · doi:10.1145/319151.319164 · Cited by 673
The design philosophy of the DARPA internet protocols
Clark, D. (1988) · Symposium proceedings on Communications architectures and protocols · doi:10.1145/52324.52336 · Cited by 655
Building efficient wireless sensor networks with low-level naming
Heidemann, J., Silva, F., Intanagonwiwat, C., Govindan, R., Estrin, D., & Ganesan, D. (2001) · Proceedings of the eighteenth ACM symposium on Operating systems principles · doi:10.1145/502034.502049 · Cited by 598
Performance Enhancing Proxies Intended to Mitigate Link-Related Degradations
Border, J., Kojo, M., Griner, J., Montenegro, G., & Shelby, Z. (2001) · doi:10.17487/rfc3135 · Cited by 596
An architecture for content routing support in the internet
Gritter, M., & Cheriton, D. R. (2001) · Cited by 254
TCP extensions for space communications
Durst, R. C., Miller, G. J., & Travis, E. J. (1996) · ACM Annual International Conference on Mobile Computing and Networking (MobiCom) · doi:10.1145/236387.236398 · Cited by 140
A protocol for packet network intercommunication
Cerf, V. G., & Icahn, R. E. (2005) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1064413.1064423 · Cited by 74
Traffic Networks and Flows over Time
Köhler, E., Möhring, R. H., & Skutella, M. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-02094-0_9 · Cited by 45
Cited by
Underwater acoustic sensor networks: research challenges
Akyildiz, I. F., Pompili, D., & Melodia, T. (2005) · Ad Hoc Networks · doi:10.1016/j.adhoc.2005.01.004 · Cited by 3,086
The ONE simulator for DTN protocol evaluation
Keränen, A., Ott, J., & Kärkkäinen, T. (2009) · Proceedings of the Second International ICST Conference on Simulation Tools and Techniques · doi:10.4108/icst.simutools2009.5674 · Cited by 2,315
A survey of information-centric networking
Ahlgren, B., Dannewitz, C., Imbrenda, C., Kutscher, D., & Ohlman, B. (2012) · IEEE Communications Magazine · doi:10.1109/mcom.2012.6231276 · Cited by 1,630
BUBBLE Rap: Social-Based Forwarding in Delay-Tolerant Networks
Hui, P., Crowcroft, J., & Yoneki, E. (2011) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2010.246 · Cited by 1,515
A data-oriented (and beyond) network architecture
Koponen, T., Chawla, M., Chun, B.-G., Ermolinskiy, A., Kim, K. H., Shenker, S., & Stoica, I. (2007) · Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/1282380.1282402 · Cited by 1,368
Metadata
- Authors
- Fall, K.
- Venue
- Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
- Publisher
- ACM
- Published
- 2003-08-25
- Pages
- 27-34
- OpenAlex
- W2112316694
- Cited by
- 3,082
- References
- 17
- FWCI
- 32.88
- Type
- conference paper
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.