The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
Less pain, most of the gain: incrementally deployable ICN
Abstract
Information-Centric Networking (ICN) has seen a significant resurgence in recent years. ICN promises benefits to users and service providers along several dimensions (e.g., performance, security, and mobility). These benefits, however, come at a non-trivial cost as many ICN proposals envision adding significant complexity to the network by having routers serve as content caches and support nearest-replica routing. This paper is driven by the simple question of whether this additional complexity is justified and if we can achieve these benefits in an incrementally deployable fashion. To this end, we use trace-driven simulations to analyze the quantitative benefits attributed to ICN (e.g., lower latency and congestion). Somewhat surprisingly, we find that pervasive caching and nearest-replica routing are not fundamentally necessary---most of the performance benefits can be achieved with simpler caching architectures. We also discuss how the qualitative benefits of ICN (e.g., security, mobility) can be achieved without any changes to the network. Building on these insights, we present a proof-of-concept design of an incrementally deployable ICN architecture.
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
Jacobson, V., Smetters, D. K., Thornton, J. D., Plass, M. F., Briggs, N. H., & Braynard, R. L. (2009) · Proceedings of the 5th international conference on Emerging networking experiments and technologies · doi:10.1145/1658939.1658941 · Cited by 4,031
Web caching and Zipf-like distributions: evidence and implications
Breslau, L., Cao, P., Fan, L., Phillips, G., & Shenker, S. (1999) · IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320) · doi:10.1109/infcom.1999.749260 · Cited by 3,467
Self-citationZhang, L., Afanasyev, A., Burke, J., Jacobson, V., claffy, K., Crowley, P., Papadopoulos, C., Wang, L., & Zhang, B. (2014) · ACM SIGCOMM Computer Communication Review · doi:10.1145/2656877.2656887 · Cited by 2,270
End-To-End Arguments In System Design
And, S. R., Saltzer, J. H., Reed, D. P., & Clark, D. D. (1984) · Cited by 2,130
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
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
Self-citationMeasuring ISP Topologies With Rocketfuel
Spring, N., Mahajan, R., Wetherall, D., & Anderson, T. (2004) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2003.822655 · Cited by 1,010
Named Data Networking (NDN) Project
Zhang, L., Estrin, D. L., Burke, J. A., Jacobson, V. L., Thornton, J. D., Smetters, D. K., Zhang, B., & Tsudik, G. (2010) · Cited by 915
Youtube traffic characterization: a view from the edge
Gill, P., Arlitt, M., Li, Z., & Mahanti, A. (2007) · Proceedings of the 7th ACM SIGCOMM conference on Internet measurement · doi:10.1145/1298306.1298310 · Cited by 852
On the scale and performance of cooperative Web proxy caching
Wolman, A., Voelker, M., Sharma, N., Cardwell, N., Karlin, A., & Levy, H. M. (1999) · Proceedings of the seventeenth ACM symposium on Operating systems principles · doi:10.1145/319151.319153 · Cited by 496
LIPSIN: line speed publish/subscribe inter-networking
Jokela, P., Zahemszky, A., Esteve Rothenberg, C., Arianfar, S., & Nikander, P. (2009) · Proceedings of the ACM SIGCOMM 2009 conference on Data communication · doi:10.1145/1592568.1592592 · Cited by 434
Finding a needle in Haystack: facebook's photo storage
Beaver, D., Kumar, S., Li, H. C., Sobel, J., & Vajgel, P. (2010) · doi:10.5555/1924943.1924947 · Cited by 419
Separating key management from file system security
Mazières, D., Kaminsky, M., Kaashoek, M. F., & Witchel, E. (1999) · Proceedings of the seventeenth ACM symposium on Operating systems principles · doi:10.1145/319151.319160 · Cited by 332
Information-centric networking: seeing the forest for the trees
Ghodsi, A., Shenker, S., Koponen, T., Singla, A., Raghavan, B., & Wilcox, J. (2011) · Proceedings of the 10th ACM Workshop on Hot Topics in Networks · doi:10.1145/2070562.2070563 · Cited by 321
Self-citationDoS and DDoS in Named Data Networking
Gasti, P., Tsudik, G., Uzun, E., & Zhang, L. (2013) · 2013 22nd International Conference on Computer Communication and Networks (ICCCN) · doi:10.1109/icccn.2013.6614127 · Cited by 315
Developing Information Networking Further: From PSIRP to PURSUIT
Fotiou, N., Nikander, P., Trossen, D., & Polyzos, G. C. (2012) · Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering · doi:10.1007/978-3-642-30376-0_1 · Cited by 262
Naming in content-oriented architectures
Ghodsi, A., Koponen, T., Rajahalme, J., Sarolahti, P., & Shenker, S. (2011) · Proceedings of the ACM SIGCOMM workshop on Information-centric networking · doi:10.1145/2018584.2018586 · Cited by 197
Self-citationCooperative content distribution and traffic engineering in an ISP network
Jiang, W., Zhang-Shen, R., Rexford, J., & Chiang, M. (2009) · Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems · doi:10.1145/1555349.1555377 · Cited by 181
The Secure HyperText Transfer Protocol
Rescorla, E., & Schiffman, A. (1999) · doi:10.17487/rfc2660 · Cited by 138 · cited 2×
“The Metalink HTTP extension [8], S-HTTP [36] (competing with HTTPS at the time), and HTTPi [40] (an improvement over S-HTTP to support today’s common use cases) show how to possibly extend HTTP for this purpose.”
MethodOn preserving privacy in content-oriented networks
Arianfar, S., Koponen, T., Raghavan, B., & Shenker, S. J. (2011) · ACM Conference on Information-Centric Networking (ICN) · doi:10.1145/2018584.2018589 · Cited by 101
Self-citationCOMET: Content mediator architecture for content-aware networks
García, G. L., Bęben, A., Ramon, F. J., Maeso, A., Psaras, I., Pavlou, G., Wang, N., Śliwiński, J., Spirou, S., Σούρσος, Σ., et al. (2011) · Bristol Research (University of Bristol) · Cited by 76
Enabling content-aware traffic engineering
Poese, I., Frank, B., Smaragdakis, G., Uhlig, S., Feldmann, A., & Maggs, B. M. (2012) · ACM SIGCOMM Computer Communication Review · doi:10.1145/2378956.2378960 · Cited by 73
Self-citationIntelligent design enables architectural evolution
Ghodsi, A., Shenker, S. J., Koponen, T., et al. (2011) · ACM Workshop on Hot Topics in Networks (HotNets) · doi:10.1145/2070562.2070565 · Cited by 67
Self-citationDistributing content simplifies ISP traffic engineering
Sharma, A., Venkataramani, A., & Sitaraman, R. K. (2013) · ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS) · doi:10.1145/2465529.2465764 · Cited by 59
TailGate: handling long-tail content with a little help from friends
Traverso, S., Huguenin, K., Trestian, I., Erramilli, V., Laoutaris, N., & Papagiannaki, K. (2012) · International World Wide Web Conference (WWW) · doi:10.1145/2187836.2187858 · Cited by 54
Practical end-to-end web content integrity
Singh, K., Wang, H. J., Moshchuk, A., Jackson, C., & Lee, W. (2012) · International World Wide Web Conference (WWW) · doi:10.1145/2187836.2187926 · Cited by 19
Cited by
Zhang, L., Afanasyev, A., Burke, J., Jacobson, V., claffy, K., Crowley, P., Papadopoulos, C., Wang, L., & Zhang, B. (2014) · ACM SIGCOMM Computer Communication Review · doi:10.1145/2656877.2656887 · Cited by 2,270
A Survey of Caching Mechanisms in Information-Centric Networking
Zhang, M., Luo, H., & Zhang, H. (2015) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2015.2420097 · Cited by 360
Wireless caching: technical misconceptions and business barriers
Paschos, G., Bastug, E., Land, I., Caire, G., & Debbah, M. (2016) · IEEE Communications Magazine · doi:10.1109/mcom.2016.7537172 · Cited by 321
Metadata
- Authors
- Fayazbakhsh, S. K., Lin, Y., Tootoonchian, A., Ghodsi, A., Koponen, T., Maggs, B., Ng, K. C., Sekar, V., & Shenker, S.
- Venue
- Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM
- Publisher
- ACM
- Published
- 2013-08-27
- Pages
- 147-158
- OpenAlex
- W2156104365
- Cited by
- 307
- References
- 26
- FWCI
- 40.27
- Type
- conference paper
- 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
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.