A practical congestion control scheme for named data networking

Klaus Schneider, Cheng Yi, Beichuan Zhang, Lixia Zhang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

36 Citations (Scopus)

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.

Original languageEnglish (US)
Title of host publicationACM-ICN 2016 - Proceedings of the 2016 3rd ACM Conference on Information-Centric Networking
PublisherAssociation for Computing Machinery, Inc
Pages21-30
Number of pages10
ISBN (Electronic)9781450344678
DOIs
StatePublished - Sep 26 2016
Event3rd ACM International Conference on Information-Centric Networking, ACM-ICN 2016 - Kyoto, Japan
Duration: Sep 26 2016Sep 28 2016

Other

Other3rd ACM International Conference on Information-Centric Networking, ACM-ICN 2016
CountryJapan
CityKyoto
Period9/26/169/28/16

Fingerprint

Telecommunication links
Routers
Tunnels
Throughput
Bandwidth

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Computer Science Applications
  • Information Systems

Cite this

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

A practical congestion control scheme for named data networking. / Schneider, Klaus; Yi, Cheng; Zhang, Beichuan; Zhang, Lixia.

ACM-ICN 2016 - Proceedings of the 2016 3rd ACM Conference on Information-Centric Networking. Association for Computing Machinery, Inc, 2016. p. 21-30.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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. Association for Computing Machinery, Inc, pp. 21-30, 3rd ACM International Conference on Information-Centric Networking, ACM-ICN 2016, Kyoto, Japan, 9/26/16. https://doi.org/10.1145/2984356.2984369
Schneider K, Yi C, Zhang B, Zhang L. A practical congestion control scheme for named data networking. In ACM-ICN 2016 - Proceedings of the 2016 3rd ACM Conference on Information-Centric Networking. Association for Computing Machinery, Inc. 2016. p. 21-30 https://doi.org/10.1145/2984356.2984369
Schneider, Klaus ; Yi, Cheng ; Zhang, Beichuan ; Zhang, Lixia. / A practical congestion control scheme for named data networking. ACM-ICN 2016 - Proceedings of the 2016 3rd ACM Conference on Information-Centric Networking. Association for Computing Machinery, Inc, 2016. pp. 21-30
@inproceedings{4fc5ac40703240e5b376a5116485f56a,
title = "A practical congestion control scheme for named data networking",
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.",
author = "Klaus Schneider and Cheng Yi and Beichuan Zhang and Lixia Zhang",
year = "2016",
month = "9",
day = "26",
doi = "10.1145/2984356.2984369",
language = "English (US)",
pages = "21--30",
booktitle = "ACM-ICN 2016 - Proceedings of the 2016 3rd ACM Conference on Information-Centric Networking",
publisher = "Association for Computing Machinery, Inc",

}

TY - GEN

T1 - A practical congestion control scheme for named data networking

AU - Schneider, Klaus

AU - Yi, Cheng

AU - Zhang, Beichuan

AU - Zhang, Lixia

PY - 2016/9/26

Y1 - 2016/9/26

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84994138790&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84994138790&partnerID=8YFLogxK

U2 - 10.1145/2984356.2984369

DO - 10.1145/2984356.2984369

M3 - Conference contribution

AN - SCOPUS:84994138790

SP - 21

EP - 30

BT - ACM-ICN 2016 - Proceedings of the 2016 3rd ACM Conference on Information-Centric Networking

PB - Association for Computing Machinery, Inc

ER -