การออกแบบและพัฒนากลไกปรับปรุงเส้นทางสำหรับเครือข่ายเนมดาต้า

Named Data Networking (NDN) is a promising candidate for future network architecture, and is well suited to today's complex networks. A named prefix of the NDN Interest-packet has been used for searching a desire data. Furthermore, such NDN data can be temporarily stored in intermediate devices without concerning for locations. So, the Interest-packet plays an important role for NDN network communication. Currently, A Best-Route algorithm has been widely used in the major NDN's network Testbed. However, the Best-Route always selects a lowest routing cost, which is unreliable in disruptive networks. เท this paper, we have developed a Longest Prefix Reduction (LPR) algorithm to handle NDN path-convergence. LPR actively updates routing paths. [ABSTRACT FROM AUTHOR]