NDN Testbed with an Applied Congestion Control Algorithm for Scientific Data 


Vol. 42,  No. 11, pp. 2135-2138, Nov.  2017
10.7840/kics.2017.42.11.2135


PDF
  Abstract

Initially based on IP architecture, scientific applications are strongly affected by complicated data management, redundant network utilization, and weak security measures. Named Data Networking (NDN) is going to solve the problems of current architecture and improve it in general. And one of the existing approaches in NDN is congestion control. We have set up an NDN testbed with climate science application and applied an NDN congestion control algorithm. As a contribution, we have made a practical comparison between an existing NDN congestion control algorithm and TCP based schemes such as BIC, HTCP, and New Reno. In this experiment, we utilized real climate data with a parallel retrieving method.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

A. Ni and H. Lim, "NDN Testbed with an Applied Congestion Control Algorithm for Scientific Data," The Journal of Korean Institute of Communications and Information Sciences, vol. 42, no. 11, pp. 2135-2138, 2017. DOI: 10.7840/kics.2017.42.11.2135.

[ACM Style]

Alexandr Ni and Huhnkuk Lim. 2017. NDN Testbed with an Applied Congestion Control Algorithm for Scientific Data. The Journal of Korean Institute of Communications and Information Sciences, 42, 11, (2017), 2135-2138. DOI: 10.7840/kics.2017.42.11.2135.

[KICS Style]

Alexandr Ni and Huhnkuk Lim, "NDN Testbed with an Applied Congestion Control Algorithm for Scientific Data," The Journal of Korean Institute of Communications and Information Sciences, vol. 42, no. 11, pp. 2135-2138, 11. 2017. (https://doi.org/10.7840/kics.2017.42.11.2135)

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880