臺灣博碩士論文加值系統

資料命名網路 (Named Data Networking, NDN) 為近年提出頗具特色的資料內容為主軸的網路傳輸架構。在資料命名網路的架構中，每個路由節點都具有暫存快取的功能，皆可作為資源持有者在網際網路中進行資源的擴散與分享。其中，資料命名網路透過資料發布者、資料路徑和資料名稱的結合來作為各路由節點進行封包轉送與導引的依據，從各路由節點中的Content Store (CS) 取得使用者需要的資料內容，滿足使用者的需求。在網際網路中，最頻繁的狀況不外乎是網路壅塞，而資料命名網路在架構訂立時也同時考慮了頻寬供給的需求。在架構中，各個路由節點都有能力將相同的請求進行過濾篩選，避免相同及重複發送的請求佔據大部分頻寬。而持有資料封包並且暫存快取於CS中的路由節點，也可當作一個分流節點使有效的分散頻寬流量。但就以目前的資料命名網路，還是一個未能完全頂替傳統TCP/IP網路環境的網路傳輸架構，也就代表還有許多可進行改善的地方。
本論文為嘗試改進目前的資料命名網路，提出了複數個方法並且進行整合。其中的方法有，將興趣封包 (Interest packet) 與資料封包 (Data packet) 的對應數量進行調整、不同於目前節點將資料內容進行分散式的暫存快取化和加入新的資訊於路由之間資訊的交換，使調整過後的資料命名網路更有利於使用者更方便的請求資料內容。提出本論文的目的為提升資料命名網路於大型資料內容與多媒體串流傳輸時，能以更精簡且更具效率的方式取得使用者需求的資料內容。

Named Data Networking (NDN) is an innovative network architecture which uses data information to be the main concept of the network architecture in data through. In Named Data Networking, each node has the ability to cache data that could be a temporary provider broadcasting or sharing data chunk. In forwarding plane of NDN, it integrate the NDN name of content provider, content path and content name into a completely published link that used to guide the interest packet and data packet to the suitable interface. Information consumers can trace along the interest packet way to pull the data packet back, then it can satisfy the request of consumers from the temporary content provider. In the Internet, the traffic jam usually makes users that can't obtain the information they want easily. In the architecture of NDN, it also consider the event of traffic jam when the architecture established by researchers. By the way, every node in NDN has the capability to filter the same interest request that avoid consumer using many times the bandwidth to request the same data in the same data flow. The temporary content provider can also be a middle node to provide data packet and bear some bandwidth from interest requests. But, the Named Data Networking is still not enough to instead of TCP/IP network architecture. It also means that NDN can be improved in advanced.
In this thesis, three methods are proposed including "Using partial caching to improve the data packet's life cycle that can handle more interest packet's request", "To accelerate the data packet transportation by changing content name of interest packet in order to pull more data packet back" and "Automatically establishing the FIB guide interface by information packet exchange from neighbor nodes". The main goal of this thesis is to provide an efficient data caching and data transportation in NDN. It can speed up the data transportation and reduce the traffic load in NDN.

目錄
摘要 i
Abstract ii
致謝 i
目錄 ii
圖目錄 iv
表目錄 vi
第1章 緒論 7
1.1 研究背景 8
資料命名網路 (Named Data Networking, NDN) 8
1.2 研究動機與目的 10
1.3 論文架構 11
第2章 相關文獻探討 12
2.1 資料命名網路 (NDN) 之研究背景 12
2.1.1 資料命名網路架構 12
2.1.2 資料命名網路的封包欄位結構 13
2.1.3 路由節點的封包處理機制 15
2.2 網路多媒體之影音串流 19
2.3 部分快取機制 20
2.4 文獻探討與成效分析 21
2.4.1 興趣封包與資料封包 21
2.4.2 封包轉送策略 22
第3章 命名內容部分快取機制設計 23
3.1 部分快取機制 (Partial Caching) 23
3.2 單一興趣請求多重資料回應機制 28
3.3 路由直接轉傳機制 32
第4章 實驗及分析 37
4.1 實驗拓樸 38
4.1.1 BA 39
4.1.2 BA-2 44
4.2 實驗結果比較 49
第5章 結論與未來展望 51
第6章 參考文獻 52

[1] NDN project. [Online]. Available: http://named-data.net/

[2] L. Zhang, A. Afanasyev, J. Burke, V. Jacobson, K. claffy, P. Crowley, C. Papadopoulos, L. Wang, and B. Zhang, “Named data networking,” ACM SIGCOMM Computer Communication Review, Vol.44, Issue 3, pp. 66-73, July. 2014.

[3] V. Jacobson, D. K. Smetters, J. D. Thornton, M. Plass, N. Briggs, and R. Braynard, “Networking Named Content,” in Proc. 5th international conference on Emerging networking experiments and technologies, pp. 1-12, 2009.

[4] B. Ahlgren, C. Dannewitz, C. Imbrenda, D. Kutscher, and B. Ohlman, “A Survey of Information-Centric Networking,” IEEE Trans. Communications Magazine, Vol. 50, no. 7, pp. 26-36, 2012.

[5] M.F. Bari, S. Chowdhury, R. Ahmed, R. Boutaba, and B. Mathieu, “A Survey of Naming and Routing in Information-Centric Networks,” IEEE Trans. Communications Magazine, Vol. 50, no. 12, pp. 44-53, 2012.

[6] H. Xu, Z. Chen, R. Chen, and J. Cao, “Live Streaming with Content Centric Networking,” in Proc. 3rd International Conference on Networking and Distributed Computing, pp. 1-5, 2012.

[7] D. Kulinski, J. Burke, and L. Zhang, “Video Streaming over Named Data Networking,” IEEE COMSOC MMTC E-Letter, Vol. 8, No. 4, pp. 6-9, July. 2013.

[8] J.M. Hsu, H.Y. Chiou, and Y.S. Ye, “A Partial Cache for Multimedia Content in Named Data Networking,” IEEE Trans. International Conference on Platform Technology and Service (PlatCon), pp. 37-38, Jan. 2015.

[9] Triangular Number. [Online]. Available: http://en.wikipedia.org/wiki/Triangular_number.

[10] Trapezoid. [Online]. Available: http://en.wikipedia.org/wiki/Trapezoid

[11] X. Hu and J. Gong, “Distributed in-network cooperative caching,” IEEE Trans. 2nd International Conference on Cloud Computing and Intelligent Systems (CCIS), Vol. 02, pp. 735-740, Nov. 2012.


[12] A. Afanasyev, P. Mahadevan, I. Moiseenko, E. Uzun, and L. Zhang, “Interest flooding attack and countermeasures in Named Data Networking,” IEEE Trans. IFIP Networking Conference, pp. 1-9, May. 2013.

[13] A. Compagno, M. Conti, P. Gasti, and G. Tsudik, “Poseidon: Mitigating interest flooding DDoS attacks in Named Data Networking,” IEEE Trans. 38th Conference on Local Computer Networks (LCN), pp. 630-638, Oct. 2013.

[14] S. DiBenedetto, C. Papadopoulos, and D. Massey, “Routing Policies in Named Data Networking,” in Proc. ACM SIGCOMM workshop on Information-centric networking, pp. 38-43, 2011.

[15] J.J. Garcia-Luna-Aceves, “Name-Based Content Routing in Information Centric Networks Using Distance Information,” in Proc. 1st ACM Conference on Information-Centric Networking (ICN-2014), Sep. 2014.

[16] C. Tsilopoulos and G. Xylomenos, “Supporting diverse traffic types in information centric networks,” in Proc. ACM SIGCOMM workshop on Information-centric networking, pp. 13-18, 2011.

[17] ccnSim.[Online].Available: http://www.infres.enst.fr/~drossi/index.php?n=Software.ccnSim

[18] A.A. Barakabitze and T. Xiaoheng, “Caching and data routing in Information Centric Networking (ICN): the Future Internet Perspective,” IJARCSSE Trans. Vol. 4, Issue. 11, Nov. 2014.

[19] W. K. Chai, D. He, I. Psaras, and G. Pavlou, “Cache “Less for More” in Information-centric Networks,” in Proc. 11th international IFIP TC 6 conference on Networking - Volume Part I, pp. 27-40, 2012.

[20] J. Li, H. Wu, B. Liu, J. Lu, Y. Wang, X. Wang, Y. Zhang, and L. Dong, “Popularity-driven Coordinated Caching in Named Data Networking,” in Proc. 8th ACM/IEEE symposium on Architectures for networking and communications systems, pp. 15-26, 2012.

[21] J.M. Wang and B. Bensaou, “Progressive Caching in CCN,” IEEE Trans. Global Communications Conference (GLOBECOM), pp. 2727-2732, Dec. 2012.

[22] L. Saino, I. Psaras, and G. Pavlou, “Icarus: a Caching Simulator for Information Centric Networking (ICN),” in Proc. 7th International ICST Conference on Simulation Tools and Techniques, pp. 66-75, 2014.

[23] T. LI and Y. LI, “A Content Popularity Based Cache Replacement Algorithm for NDN,” Available: http://www.paper.edu.cn/html/releasepaper/2012/12/897/

[24] Y. Wang, Z. Li, G. Tyson, S. Uhlig, and G. Xie, “Optimal Cache Allocation for Content-Centric Networking,” IEEE Trans. 21st International Conference on Network Protocols (ICNP), pp. 1-10, Oct. 2013.

[25] C. LI and K. Okamura, “Cluster-based In-networking Caching for Content-Centric Networking,” IJCSNS International Journal of Computer Science and Network Security, Vol. 14 No. 11, Nov. 2014.

[26] T. Le, Y. Lu, and M. Gerla, “Social Caching and Content Retrieval in Disruption Tolerant Networks (DTNs),” IEEE Trans. International Conference on Computing, Networking and Communications (ICNC), pp. 905-910, Feb. 2015.

[27] S.K. Fayazbakhsh, Y. Lin, A. Tootoonchian, A. Ghodsi, T. Koponen, B. Maggs, K.C. Ng, V. Sekar, and S. Shenker, “Less Pain, Most of the Gain: Incrementally Deployable ICN,” in Proc. ACM SIGCOMM conference on SIGCOMM, pp. 147-158, 2013.

[28] A. Dan and D. Towsley, “An approximate analysis of the lru and fifo buffer replacement schemes”, in Proc. ACM SIGMETRICS conference on Measurement and modeling of computer systems, pp. 143-152, 1990.