Abstract
As the rising applications of Named Data Networking (NDN) continue to increase the demand on network bandwidth, developing effective congestion mechanisms has become one of the high-priority research tasks for NDN architecture. This paper explores rate control protocol (RCP), a unique hop-by-hop feature in NDN routing, and one-To-one relationship between interest requests and data packets to develop a novel congestion control mechanism for NDN. Specifically, we have designed and implemented a rate-based, explicit and hop-by-hop congestion control algorithm, NDN Hop-by-Hop RCP, namely NHBH-RCP, to achieve high link utilization and increase overall network throughput. In addition, we compare the naive congestion control algorithm in NDN with NHBH-RCP via various experiments and find that our proposed algorithm significantly enhances the performance of data transfer in NDN and reduces flow-completion time between consumers and producers.
Original language | English (US) |
---|---|
Title of host publication | Proceedings - 2015 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery, CyberC 2015 |
Publisher | Institute of Electrical and Electronics Engineers Inc. |
Pages | 538-541 |
Number of pages | 4 |
ISBN (Print) | 9781467391993 |
DOIs | |
State | Published - Oct 26 2015 |
Event | 7th International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery, CyberC 2015 - Xi'an, China Duration: Sep 17 2015 → Sep 19 2015 |
Other
Other | 7th International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery, CyberC 2015 |
---|---|
Country/Territory | China |
City | Xi'an |
Period | 9/17/15 → 9/19/15 |
Keywords
- Algorithm design and analysis
- Bandwidth
- Computers
- Convergence
- Payloads
- Protocols
- Throughput
ASJC Scopus subject areas
- Computational Theory and Mathematics
- Computer Networks and Communications
- Artificial Intelligence