The DOI matches its Crossref record.
DTN routing as a resource allocation problem
Abstract
Many DTN routing protocols use a variety of mechanisms, including discovering the meeting probabilities among nodes, packet replication, and network coding. The primary focus of these mechanisms is to increase the likelihood of finding a path with limited information, so these approaches have only an incidental effect on such routing metrics as maximum or average delivery latency. In this paper, we present RAPID , an intentional DTN routing protocol that can optimize a specific routing metric such as worst-case delivery latency or the fraction of packets that are delivered within a deadline. The key insight is to treat DTN routing as a resource allocation problem that translates the routing metric into per-packet utilities which determine how packets should be replicated in the system. We evaluate RAPID rigorously through a prototype of RAPID deployed over a vehicular DTN testbed of 40 buses and simulations based on real traces. To our knowledge, this is the first paper to report on a routing protocol deployed on a real DTN at this scale. Our results suggest that RAPID significantly outperforms existing routing protocols for several metrics. We also show empirically that for small loads RAPID is within 10% of the optimal performance.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Cited by
Socially-aware routing for publish-subscribe in delay-tolerant mobile ad hoc networks
Costa, P., Mascolo, C., Musolesi, M., & Picco, G. (2008) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2008.080602 · Cited by 478
Attacks and countermeasures in the internet of vehicles
Sun, Y., Wu, L., Wu, S., Li, S., Zhang, T., Zhang, L., Xu, J., Xiong, Y., & Cui, X. (2017) · Annals of Telecommunications · doi:10.1007/s12243-016-0551-6 · Cited by 103
Security and Privacy in the Internet of Vehicles
Sun, Y., Wu, L., Wu, S., Li, S., Zhang, T., Zhang, L., Xu, J., & Xiong, Y. (2015) · 2015 International Conference on Identification, Information, and Knowledge in the Internet of Things (IIKI) · doi:10.1109/iiki.2015.33 · Cited by 81
ARBR: Adaptive reinforcement-based routing for DTN
Elwhishi, A., Ho, P.-H., Naik, K., & Shihada, B. (2010) · 2010 IEEE 6th International Conference on Wireless and Mobile Computing, Networking and Communications · doi:10.1109/wimob.2010.5645040 · Cited by 49
Metadata
- Authors
- Balasubramanian, A., Levine, B., & Venkataramani, A.
- Venue
- ACM SIGCOMM Computer Communication Review
- Published
- 2007-08-27
- Volume
- 37
- Issue
- 4
- Pages
- 373-384
- ISSN
- 0146-4833 (ISSN-L)
- OpenAlex
- W3162914541
- Cited by
- 430
- References
- 0
- FWCI
- 38.28
- Type
- journal article
- Language
- en
- Open access
- closed
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: DTN routing as a resource allocation problem. https://app.cochat.ai/papers/10.1145/1282427.1282422
- The paper
- Balasubramanian, A., Levine, B., & Venkataramani, A. (2007). DTN routing as a resource allocation problem. ACM SIGCOMM Computer Communication Review. https://doi.org/10.1145/1282427.1282422
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.
