Tsai Pei-Hsuan, Zhang Jun-Bin, Tsai Meng-Hsun
Institute of Manufacturing Information and Systems, National Cheng Kung University, Tainan City 701, Taiwan.
Department of Computer Science and Information Engineering, National Cheng Kung University, Tainan City 701, Taiwan.
Sensors (Basel). 2022 Jan 4;22(1):341. doi: 10.3390/s22010341.
With the development of new technologies and applications, such as the Internet of Things, smart cities, 5G, and edge computing, traditional Internet Protocol-based (IP-based) networks have been exposed as having many problems. Information-Centric Networking (ICN), Named Data Networking (NDN), and Content-Centric Networking (CCN) are therefore proposed as an alternative for future networks. However, unlike IP-based networks, CCN routing is non-deterministic and difficult to optimize due to frequent in-network caching replacement. This paper presents a novel -based routing algorithm that explores real-time in-network caching to ensure the routing table storing the optimal paths to the nearest content provider is up to date. Effective -selections, Pending Interest Table (PIT) , and Forwarding Information Base (FIB) are discussed and analyzed by simulation with different performance measurements. Compared with the basic CCN, in terms of qualitative analysis, the additional computational overhead of our approach is O( + + ∗ ) and O() on processing interest packets and data packets, respectively. However, in terms of quantitative analysis, our approach reduces the number of timeout interests by 6% and the average response time by 0.6 s. Furthermore, although basic CCN and our approach belong to the same Quality of Service (QoS) category, our approach outperforms basic CCN in terms of real values. Additionally, our -based approach performs better than RECIF+PIF and EEGPR. Owing to speedup FIB updating by probes, our approach provides more reliable interest packet routing when accounting for router failures. In summary, the results demonstrate that compared to basic CCN, our -based routing approach raises FIB accuracy and reduces network congestion and response time, resulting in efficient routing.
随着物联网、智慧城市、5G和边缘计算等新技术及应用的发展，传统的基于互联网协议（IP）的网络暴露出诸多问题。因此，信息中心网络（ICN）、命名数据网络（NDN）和内容中心网络（CCN）被提出作为未来网络的替代方案。然而，与基于IP的网络不同，CCN路由具有不确定性，且由于网络内缓存替换频繁，难以进行优化。本文提出了一种基于[具体内容未给出]的新型路由算法，该算法探索实时网络内缓存，以确保存储到最近内容提供者的最优路径的路由表是最新的。通过不同性能指标的仿真，对有效的[具体内容未给出]选择、待处理兴趣表（PIT）和转发信息库（FIB）进行了讨论和分析。与基本CCN相比，在定性分析方面，我们方法处理兴趣包和数据包时额外的计算开销分别为O([具体内容未给出])和O([具体内容未给出])。然而，在定量分析方面，我们的方法将超时兴趣的数量减少了6%，平均响应时间减少了0.6秒。此外，尽管基本CCN和我们的方法属于同一服务质量（QoS）类别，但我们的方法在实际值方面优于基本CCN。此外，我们基于[具体内容未给出]的方法比RECIF+PIF和EEGPR表现更好。由于通过探测加速了FIB更新，我们的方法在考虑路由器故障时提供了更可靠的兴趣包路由。总之，结果表明，与基本CCN相比，我们基于[具体内容未给出]的路由方法提高了FIB的准确性，减少了网络拥塞和响应时间，从而实现了高效路由。
