IEICE TRANSACTIONS on Communications
A Congestion Control Method for Named Data Networking with Hop-by-Hop Window-Based Approach
Summary :
Congestion control is a hot topic in named data networking (NDN). Congestion control methods for NDN are classified into two approaches: the rate-based approach and the window-based approach. In the window-based approach, the optimum window size cannot be determined due to the largely changing round-trip time. Therefore, the rate-based approach is considered to be suitable for NDN and has been studied actively. However, there is still room for improvement in the window-based approach because hop-by-hop control in this approach has not been explored. In this paper, we propose a hop-by-hop widow-based congestion control method for NDN (HWCC). The proposed method introduces a window-size control for per-hop Interest transmission using hop-by-hop acknowledgment. In addition, we extend HWCC so that it can support multipath forwarding (M-HWCC) in order to increase the network resources utilization. The simulation results show that both of HWCC and M-HWCC achieve high throughput performance, as well as the max-min fairness, while effectively avoiding congestion.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E102-B No.1 pp.97-110
- Publication Date
- 2019/01/01
- Publicized
- 2018/06/28
- Online ISSN
- 1745-1345
- DOI
- 10.1587/transcom.2018EBP3045
- Type of Manuscript
- PAPER
- Category
- Network System
Authors
Takahiko KATO
Sophia University
Masaki BANDAI
Sophia University
Miki YAMAMOTO
Kansai University
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Takahiko KATO, Masaki BANDAI, Miki YAMAMOTO, "A Congestion Control Method for Named Data Networking with Hop-by-Hop Window-Based Approach" in IEICE TRANSACTIONS on Communications,
vol. E102-B, no. 1, pp. 97-110, January 2019, doi: 10.1587/transcom.2018EBP3045.
Abstract: Congestion control is a hot topic in named data networking (NDN). Congestion control methods for NDN are classified into two approaches: the rate-based approach and the window-based approach. In the window-based approach, the optimum window size cannot be determined due to the largely changing round-trip time. Therefore, the rate-based approach is considered to be suitable for NDN and has been studied actively. However, there is still room for improvement in the window-based approach because hop-by-hop control in this approach has not been explored. In this paper, we propose a hop-by-hop widow-based congestion control method for NDN (HWCC). The proposed method introduces a window-size control for per-hop Interest transmission using hop-by-hop acknowledgment. In addition, we extend HWCC so that it can support multipath forwarding (M-HWCC) in order to increase the network resources utilization. The simulation results show that both of HWCC and M-HWCC achieve high throughput performance, as well as the max-min fairness, while effectively avoiding congestion.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.2018EBP3045/_p
Copy
@ARTICLE{e102-b_1_97,
author={Takahiko KATO, Masaki BANDAI, Miki YAMAMOTO, },
journal={IEICE TRANSACTIONS on Communications},
title={A Congestion Control Method for Named Data Networking with Hop-by-Hop Window-Based Approach},
year={2019},
volume={E102-B},
number={1},
pages={97-110},
abstract={Congestion control is a hot topic in named data networking (NDN). Congestion control methods for NDN are classified into two approaches: the rate-based approach and the window-based approach. In the window-based approach, the optimum window size cannot be determined due to the largely changing round-trip time. Therefore, the rate-based approach is considered to be suitable for NDN and has been studied actively. However, there is still room for improvement in the window-based approach because hop-by-hop control in this approach has not been explored. In this paper, we propose a hop-by-hop widow-based congestion control method for NDN (HWCC). The proposed method introduces a window-size control for per-hop Interest transmission using hop-by-hop acknowledgment. In addition, we extend HWCC so that it can support multipath forwarding (M-HWCC) in order to increase the network resources utilization. The simulation results show that both of HWCC and M-HWCC achieve high throughput performance, as well as the max-min fairness, while effectively avoiding congestion.},
keywords={},
doi={10.1587/transcom.2018EBP3045},
ISSN={1745-1345},
month={January},}
Copy
TY - JOUR
TI - A Congestion Control Method for Named Data Networking with Hop-by-Hop Window-Based Approach
T2 - IEICE TRANSACTIONS on Communications
SP - 97
EP - 110
AU - Takahiko KATO
AU - Masaki BANDAI
AU - Miki YAMAMOTO
PY - 2019
DO - 10.1587/transcom.2018EBP3045
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E102-B
IS - 1
JA - IEICE TRANSACTIONS on Communications
Y1 - January 2019
AB - Congestion control is a hot topic in named data networking (NDN). Congestion control methods for NDN are classified into two approaches: the rate-based approach and the window-based approach. In the window-based approach, the optimum window size cannot be determined due to the largely changing round-trip time. Therefore, the rate-based approach is considered to be suitable for NDN and has been studied actively. However, there is still room for improvement in the window-based approach because hop-by-hop control in this approach has not been explored. In this paper, we propose a hop-by-hop widow-based congestion control method for NDN (HWCC). The proposed method introduces a window-size control for per-hop Interest transmission using hop-by-hop acknowledgment. In addition, we extend HWCC so that it can support multipath forwarding (M-HWCC) in order to increase the network resources utilization. The simulation results show that both of HWCC and M-HWCC achieve high throughput performance, as well as the max-min fairness, while effectively avoiding congestion.
ER -
English
