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
Kawalan kesesakan adalah topik hangat dalam rangkaian data bernama (NDN). Kaedah kawalan kesesakan untuk NDN dikelaskan kepada dua pendekatan: pendekatan berasaskan kadar dan pendekatan berasaskan tingkap. Dalam pendekatan berasaskan tetingkap, saiz tetingkap optimum tidak dapat ditentukan kerana masa perjalanan pergi dan balik yang banyak berubah. Oleh itu, pendekatan berasaskan kadar dianggap sesuai untuk NDN dan telah dikaji secara aktif. Walau bagaimanapun, masih terdapat ruang untuk penambahbaikan dalam pendekatan berasaskan tingkap kerana kawalan lompat demi hop dalam pendekatan ini belum diterokai. Dalam kertas ini, kami mencadangkan kaedah kawalan kesesakan berasaskan janda hop-by-hop untuk NDN (HWCC). Kaedah yang dicadangkan memperkenalkan kawalan saiz tetingkap untuk penghantaran Faedah per-hop menggunakan pengakuan hop-by-hop. Di samping itu, kami memanjangkan HWCC supaya ia boleh menyokong pemajuan berbilang laluan (M-HWCC) untuk meningkatkan penggunaan sumber rangkaian. Keputusan simulasi menunjukkan bahawa kedua-dua HWCC dan M-HWCC mencapai prestasi pemprosesan yang tinggi, serta kesaksamaan maksimum min, sambil mengelakkan kesesakan dengan berkesan.
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.
Salinan
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
Salinan
@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},}
Salinan
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 -