The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
혼잡 제어는 명명된 데이터 네트워킹(NDN)에서 뜨거운 주제입니다. NDN의 혼잡 제어 방법은 속도 기반 접근 방식과 창 기반 접근 방식의 두 가지 접근 방식으로 분류됩니다. 창 기반 접근 방식에서는 왕복 시간이 크게 변하기 때문에 최적의 창 크기를 결정할 수 없습니다. 따라서 rate-based 접근 방식은 NDN에 적합한 것으로 간주되어 활발히 연구되고 있다. 그러나 이 접근 방식에서는 홉별 제어가 연구되지 않았기 때문에 창 기반 접근 방식에는 여전히 개선의 여지가 있습니다. 본 논문에서는 NDN(HWCC)을 위한 hop-by-hop Widow-based 혼잡 제어 방법을 제안한다. 제안된 방법은 홉별 승인을 사용하여 홉별 관심 전송에 대한 창 크기 제어를 도입합니다. 또한 네트워크 자원 활용도를 높이기 위해 다중 경로 전달(M-HWCC)을 지원할 수 있도록 HWCC를 확장합니다. 시뮬레이션 결과, HWCC와 M-HWCC 모두 높은 처리량 성능과 최대-최소 공정성을 달성하는 동시에 혼잡을 효과적으로 방지하는 것으로 나타났습니다.
Takahiko KATO
Sophia University
Masaki BANDAI
Sophia University
Miki YAMAMOTO
Kansai University
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.
부
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
부
@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},}
부
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 -