A practical congestion control scheme for named data networking

132Citations
Citations of this article
71Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Traditional congestion control mechanisms are designed for end-toend connections and do not fit the Named Data Networking (NDN) architecture, in which content can be retrieved from multiple sources and through multiple paths. To fully exploit the NDN architecture, a congestion control scheme must consider the effects of in-network caching, multipath forwarding, and multicast data delivery. Moreover, the solution must not assume known link bandwidths or Data packet sizes, as these assumptions may not hold for overlay links, wireless links, or applications with varying Data packet sizes. In this paper we propose PCON: a practical congestion control scheme to address the above issues. PCON detects congestion based on the CoDel AQM (by measuring packet queuing time), then signals it towards consumers by explicitly marking certain packets, so that downstream routers can divert traffic to alternative paths and consumers can reduce their Interest sending rates. Our simulations show that PCON's forwarding adaptation reaches a higher total throughput than existingwork while maintaining similarRTT fairness. Moreover, PCON can adapt to the changing capacity of IP tunnels and wireless links, conditions that other hop-by-hop schemes do not consider.

Cite

CITATION STYLE

APA

Schneider, K., Yi, C., Zhang, B., & Zhang, L. (2016). A practical congestion control scheme for named data networking. In ACM-ICN 2016 - Proceedings of the 2016 3rd ACM Conference on Information-Centric Networking (pp. 21–30). Association for Computing Machinery, Inc. https://doi.org/10.1145/2984356.2984369

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free