命名中心網路(Named Data Networking, NDN)主要是使用以資料名稱命名而不是以現有網路的IP位址來進行資料的傳輸、建立網路路由資料暫存庫與基於內容命名的路由機制，來降低資料傳輸的流量，加快資料獲取的相對應速度。在命名中心網路當中，網路可以辨別資料內容，並且將他們儲存到最近的路由器上，藉此提供從用戶端到最近的資料內容的最佳化路徑，透過最佳化的路徑和資源來確保資料內容傳輸的高效性。
命名中心網路(NDN)是下一代網路中熱門的議題之一，而針對於命名中心網路的路由尋徑目前仍鮮少受到討論，但是路由尋徑在網路架構當中依舊扮演著重要的角色。在本論文中在NDN中利用平行名稱查詢(Parallel Name Lookup, PNL)，將NDN以名稱前綴樹(Name Prefix Tree, NPT)的方式構築，讓通過路由器接口的資料封包做紀錄，紀錄各接口流量與接入檔案的類型，儲存成經歷記錄儲存至轉發資料庫當中，當接收到下一個興趣封包時，就能透過經歷記錄計算出各接口的流量與檔案類型，透過貝式分類法做演算選擇最佳的接口，藉以修正蟻群最佳化路由(Ant-colony Optimization Routing)的嗅探封包(Sniffing Packets)計算出的最短路徑之接口，來確保較短的傳送路徑而且避免蟻群最佳化中途點有目標資料的浪費情況。本論文以資料接口流量與資料類型做為路徑預判的決策，藉由此種分類決策增進尋徑效能並大幅減少資料搜尋時產生的興趣封包，同時降低路徑選擇的風險與帶來的衝擊。

Launched by the University of California at Los Angeles, the Named Data Networking (NDN) project aims to change the current Internet communication protocol between hosts. NDN uses data names instead of IP addresses for transmissions and develops a Content Store (CS) and a name-based routing mechanism to decrease the throughput and improve the data retrieval response time. In NDN, the network can identify the content and save it to the nearest router, thereby providing the optimal path from the client to the closest copy of the content. Therefore, efficient content delivery can be guaranteed by path and resources optimization.
The Next Generation Network (NGN) has been a major research direction while the NDN is one of the most popular topics in NGN. Routing in NDN has been rarely discussed but it absolutely plays an important role in a new network architecture. In this paper, we use Parallel Name Lookup (PNL) to build the NDN by Name Prefix Tree (NPT). Our proposed scheme records the data packets received by the router, takes down the data flow and data types of each face, and save the information to the Forwarding Information Base (FIB). When the router receives the next interest packet, we can calculate the flow and the data type according to the record and choose the best face using a Bayesian classification. Through the sniffing packets of ant-colony optimization routing, our scheme can verify the face of the shortest path, ensure the shortest path and avoid the fast-path problem in ant forwarding mode. In this paper, data received by the face and the required data type is used for path prediction. By using such a classification method, our proposed scheme can improve the routing efficiency, significantly decrease the interest packets generated in data searching, and reduce the risks and impacts of path selection.

目   錄
圖目錄	VI
表目錄	VIII
第一章  緒論	- 1 -
1.1 前言	- 1 -
1.2 動機與目的	- 2 -
1.3 論文章節架構	- 4 -
第二章 背景知識與相關研究	- 5 -
2.1 命名中心網路(Named Data Networking, NDN)	- 5 -
2.1.1 命名中心網路(NDN)的架構	- 6 -
2.1.2 預定興趣表(Pending Interest Table, PIT)	- 9 -
2.1.3 命名中心網路(NDN)的路由	- 10 -
2.1.4 命名系統	- 16 -
2.1.5 快取暫存	- 18 -
2.2 名稱前綴樹(Name Prefix Tree, NPT)	- 19 -
2.3 平行名稱查詢(Parallel Name Lookup, PNL)	- 21 -
2.4 蟻群最佳化路由(Ant-colony Optimization Routing)	- 21 -
第三章 平行服務查詢與貝式分類法	- 24 -
3.1 環境建置與路由器架構介紹	- 25 -
3.2 平行服務查詢	- 26 -
3.3 接口流量與檔案類型的貝氏分類法	- 27 -
3.4 嗅探封包(Sniffing Packets)之尋徑利用	- 30 -
第四章 模擬環境與模擬結果分析	- 31 -
4.1 平均延遲時間與興趣封包數	- 32 -
4.2 累積興趣封包數	- 37 -
第五章 結論與未來展望	- 39 -
參考文獻	- 40 -

圖目錄
圖2.1：網際網路與資料命名網路協定的沙漏模型比較[1]	- 5 -
圖2.2：NDN架構中的封包[1]	- 6 -
圖2.3：NDN網路中節點轉發過程[1]	- 7 -
圖2.4：NDN網路中預定興趣表示意圖	- 9 -
圖2.5：NDN路由器對興趣封包處理流程	- 12 -
圖2.6：NDN路由器對資料封包處理流程	- 14 -
圖2.7：NDN網路整體路由示意圖	- 15 -
圖2.8：NPT架構FIB、PIT與CS示意圖	- 20 -
圖2.9：以NDN為服務的蟻群最佳化路由	- 22 -
圖3.1：NDN貝氏轉發模式網路架構	- 26 -
圖3.2：轉發資料庫(FIB)經歷資料暫存示意圖	- 27 -
圖3.3：簡單貝氏網路示意圖	- 29 -
圖3.4：基於接口流量與檔案類型的貝氏分類器	- 29 -
圖3.5：基於貝氏分類修正蟻群最佳路徑之接口	- 30 -
圖4.1：模擬場景圖	- 31 -
圖4.2：平均延遲比較(100個節點)	- 33 -
圖4.3：平均延遲比較(500個節點)	- 34 -
圖4.4：平均延遲比較(1000個節點)	- 34 -
圖4.5：興趣封包數比較(100個節點)	- 35 -
圖4.6：興趣封包數比較(500個節點)	- 36 -
圖4.7：興趣封包數比較(1000個節點)	- 36 -
圖4.8：時間內累積興趣封包數比較	- 38 -

表目錄
表4.1：模擬參數表	- 32 -

[1]	L. Zhang, D. Estrin, V. Jacobson, and B. Zhang, ”Named data networking (NDN) project,” in Technical Report, NDN-0001, 2010.
[2]	Haowei Yuan, Tian Song, and Crowley P., “Scalable NDN Forwarding: Concepts, Issues and Principles,” Computer Communications and Networks (ICCCN), 2012 21st International Conference on July 30 2012-Aug. 2 2012. 
[3]	楊柳; 馬少武; 王曉湘, “以內容為中心的互聯網體系架構研究,”信息通信技術, 2011 pp. 66-70.
[4]	唐暉; 周旭; 韓言妮; 覃毅芳, “以內容為中心的下一代寬帶網絡演進,” 信息通信技術, 2011, pp. 38-43.
[5]	Hu, Hongyu, Bi Jun, Feng Tao, Wang Sen, Lin Pingping, Wang You, “A Survey on New Architecture Design of Internet,” Computational and Information Sciences (ICCIS), 2011 International Conference on Chengdu, China 21-23 Oct. 2011, pp. 729-732.
[6]	V. Jacobson, D. K. Smetters, J. D. Thornton, M. F. Plass, N. H. Briggs, and R. L. Braynard, “Networking named content,” in Proceedings of the 5th international conference on Emerging networking experiments and technologies, ser. CoNEXT '09. New York, NY, USA: ACM, 2009, pp. 1-12.
[7]	Ul Haque M., Pawlikowski K., Willig A., and Bischofs L., “Performance analysis of blind routing algorithms over content centric networking architecture,” Computer and Communication Engineering (ICCCE), 2012 International Conference on 3-5 July 2012, pp. 922-927. 
[8]	Ntuli N., and Sunyoung Han, “Detecting router cache snooping in Named Data Networking,” ICT Convergence (ICTC), 2012 International Conference on 15-17 Oct. 2012, pp. 714-718.
[9]	Yi Wang, Huichen Dai, Junchen Jiang, Keqiang He, Wei Meng, and Bin Liu, “Parallel Name Lookup for Named Data Networking,” Global Telecommunications Conference (GLOBECOM 2011), 2011 IEEE on 5-9 Dec. 2011. 
[10]	Yi Wang, Keqiang He, Huichen Dai, Wei Meng, Junchen Jiang, Bin Liu, and Yan Chen, “Scalable Name Lookup in NDN Using Effective Name Component Encoding,” Distributed Computing Systems (ICDCS), 2012 IEEE 32nd International Conference on 18-21 June 2012, pp. 688-697.
[11]	Ding Shuai, Chen Zhen, and Liu Zhi, “Parallelizing FIB Lookup in Content Centric Networking,” Networking and Distributed Computing (ICNDC), 2012 Third International Conference on 21-24 Oct. 2012, pp.6-10.
[12]	Lin Na, Huo Zhisheng , and Liu Hongdong, “An Ant Colony Dynamic Route Guidance Algorithm of Multi-Route Searching Based on Immune Genetics,” Wireless Communications, Networking and Mobile Computing (WiCOM), 2012 8th International Conference on 21-23 Sept. 2012.
[13]	Shashank Shanbhag, Nico Schwan, Ivica Rimac, and Matteo Varvello, “SoCCeR: services over content-centric routing,” Proceedings of the ACM SIGCOMM Workshop on Information-Centric Networking (ICN '11), Toronto, Canada, 2011. New York, NY, USA: ACM, 2011, pp. 62-67.
[14]	Kuan-Yu Su, Hsien-Kai Hsin, En-Jui Chang, and An-Yeu Wu, “ACO-Based Deadlock-Aware Fully-Adaptive Routing in Network-on-Chip Systems,” Signal Processing Systems (SiPS), 2012 IEEE Workshop on 17-19 Oct. 2012, pp. 209-214.
[15]	Zhonghua Zhao, Wei Huangfu, and Linmin Sun, “NSSN: A network monitoring and packet sniffing tool for wireless sensor networks,” Wireless Communications and Mobile Computing Conference (IWCMC), 2012 8th International on 27-31 Aug. 2012, pp. 537-542.
[16]	Suzuki I., ”Proposal of fuzzy coverage region classifier as an extension of the naive Bayes classifier and improvement of its zero-one loss,” in Fuzzy Systems (FUZZ-IEEE), 2012 IEEE International Conference on 10-15 June 2012. 
[17]	Pedro Domingos, and Michael Pazzani, “On the Optimality of the Simple Bayesian Classifier under Zero-One Loss,” Machine Learning - ML, vol. 29, no. 2-3, 1997 pp. 103-130.
[18]	Manap H.H., Tahir N.M., and Abdullah R., “Anomalous gait detection using Naive Bayes classifier,” in Industrial Electronics and Applications (ISIEA), 2012 IEEE Symposium on 23-26 Sept. 2012, pp. 378-381.
[19]	YE Runsheng and XU Mingwei, “Neighbor Cache Explore Routing Strategy in NDN,” ISSN 1673-9418 CODEN JKYTA8 Journal of Frontiers of Computer Science and Technology.
[20]	Zegura E, Calvert K, and Bhattacharjee S. “How to model an internetwork,” Proceedings of the 15th Annual Joint Conference of the IEEE Computer Societies (INFOCOM '96), San Francisco, CA, USA, 1996. Washington, DC, USA: IEEE Computer Society, 1996, pp. 594-602.