內容中心網路(Content-Centric Networking, CCN)透過為資料內容(Content)命名以取代現行以IP位址為主之網路架構，CCN強調「請求內容」，以「興趣封包(Interest Packet)」與「資料封包(Data Packet)」作為資料交換，並在路由器中加入快取記憶體暫存資料內容，縮短請求回覆時間。然而網路中資料內容數量極其龐大，路由器快取記憶體容量大小有限，所暫存之資料內容勢必具高變動性，以致內容中心網路之路由表(FIB)所記錄之路由資訊具有時效性。
本論文針對內容中心網路之路由表提出優化改善及更新機制，讓路由表能夠記錄更多路由資訊，且路由資訊考慮到資料內容暫存在快取記憶體中之時效性，在路由器收到繞送資料內容並且紀錄路由資訊時進行有效更新，以降低興趣封包因路由資訊失效而導致錯誤轉送之機率。本論文將透過NdnSIM之實驗開發平台進行模擬實驗，將本文所提出之路由表優化更新機制運用在現行CCN架構轉發策略之中，並在不同暫存替換策略進行比較，結果顯示本文所提出之路由表優化更新機制能夠有效提升興趣封包在路由表中之命中率。

Content-Centric Networking(CCN) replaces the current IP-based network architecture by naming data content. CCN is based on “request content” by using “Interest Packet” and “Data Packet” as information exchange, and add the cache memory in the router to store the content, in order to reduce the response time of the request sent by user. However, the amount of data content is extremely large in the network, and the size of cache memory in the router is limited. The data content stored in the router may change at any time, cause the information recorded at the routing table(FIB) would be invalid.
In this paper, we propose an optimization and update mechanism for the FIB in the CCN, let routing table can record more information of data content. The routing information take into account the effectiveness of data content, and update the routing table effectively when the router receives the data content. So that, it can raise the accuracy of the routing table by reducing the amount of invalid information record.

[1] B. Mathieu, P. Truong, W. You, and J.-F. Peltier, “Information-centric networking: a natural design for social network applications,” Communications Magazine, IEEE, vol. 50, no. 7, pp. 44–51, 2012
[2] B. Ahlgren, C. Dannewitz, C. Imbrenda, D. Kutscher, and B. Ohlman, “A survey of information-centric networking,” IEEE Commun. Mag., vol. 50, no. 7, pp. 26–36, Jul. 2012.
[3] T. Koponen et al., “A data-oriented (and beyond) network architecture,” ACM SIGCOMM Comput. Commun. Rev., vol. 37, no. 4, pp. 181–192, 2007
[4] N. Fotiou, D. Trossen, and G. C. Polyzos, “Illustrating a publish-subscribe Internet architecture,” Telecommun. Syst., vol. 51, no. 4, pp. 233–245, Dec. 2012.
[5] V. Dimitrov and V. Koptchev. 2010. PSIRP Project – Publishsubscribe Internet Routing Paradigm: New Ideas for Future Internet. In Proceedings of CompSysTech. ACM, NY, USA.
[6] B. Ahlgren et al., “Second NetInf architecture description,” 4Ward EU FP7 Project, Tech. Rep. D-6.2 v2.0 FP7-ICT-2007-1-216041- 4WARD/D-6.2, Apr. 2010.
[7] V. Jacobson et al., “Networking named content,” in Proc. 5th ACM CoNEXT, Rome, Italy, Dec. 2009, pp. 1–12.
[8] L. Zhang, D. Estrin, J. Burke, V. Jacobson, and J. D. Thornton, “Named data networking (NDN) project,” PARC, Palo Alto, CA, USA, Tech. Rep. ndn-0001, 2010.
[9] V. Jacobson, “A New Way to Look at Networking,” Google Tech Talk, 2006, https://www.youtube.com/watch?v=8Z685OF-PS8
[10] T.B. Lee, L. Masinter and R. Fielding , “Uniform Resource Identifier (URI): Generic Syntax,”Internet standards track RFC 3986,pp.1-61, 2005
[11] Z. Li and G. Simon, ‘‘Cooperative caching in a content centric network for video stream delivery,’’ J. Netw. Syst. Manage., vol. 23, no. 3, pp. 445–473,Jul. 2015.
[12] M. Badov, A. Seetharam, J. Kurose, V. Firoiu, and S. Nanda, ‘‘Congestion-aware caching and search in information-centric networks,’’ in Proc. 1st ACM Conf. Inf.-Centric Netw. (ICN), New York, NY, USA, Sep. 2014, pp. 37–46.
[13] I. Psaras, W. K. Chai, and G. Pavlou, ‘‘Probabilistic in-network caching for information-centric networks,’’ in Proc. 2nd ACM SIGCOMM Workshop Inf.-Centric Netw., New York, NY, USA, Aug. 2012, pp. 55–60.
[14] D. Perino and M. Varvello, ‘‘A reality check for content centric networking,’’ in Proc. ACM SIGCOMM Workshop Inf.-Centric Netw. (ICN), New York, NY, USA, Aug. 2011, pp. 44–49.
[15] G. Carofiglio, M. Gallo, L. Muscariello, and D. Perino, ‘‘Modeling data transfer in content-centric networking,’’ in Proc. 23rd Int. Teletraffic Congr. (ITC), Sep. 2011, pp. 111–118.
[16] P. Goel, E. Holmberg, M. Konezny, R. Ayyagari, and D. Sillman, ‘‘CCNx packet processing on PARC router platform,’’ in Proc. 2nd ACM Conf. Inf. Centric Netw. (ICN), New York, NY, USA, Sep. 2015, pp. 211–212.
[17] L. Zhang, A. Afanasyev, J. Burke, V. Jacobson, kc claffy, P. Crowley, C. Papadopoulos, L. Wang, and B. Zhang, “Named Data Networking,” ACM SIGCOMM Computer Communication Review, Vol. 44, No.3, pp. 66-73, 2014.
[18] Named Data Networking, https://named-data.net/project/archoverview/
[19] Content Centric Networking Project (CCN), Palo Alto ResearchCenter (PARC), accessed on May 2015. [Online]. Available: http://blogs.parc.com/ccnx/
[20] A. S. Vijendran and S. Thavamani, ‘‘Least recently used replica replacement technique in distributed computing network,’’ in Proc. Int. Conf.Intell. Comput. Appl. (ICICA), Mar. 2014, pp. 104–108.
[21] D. Lee, J. Choi, J. H. Kim, S. H. Noh, S. L. Min, Y. Cho, and C. S. Kim. Lrfu: A spectrum of policies that subsumes the least recently used and least frequently used policies. IEEE Transactions on Computers, 50(12):1352– 1361, 2001.
[22] C. Yi, A. Afanasyev, I. Moiseenko, L. Wang, B. Zhang, and L. Zhang, ‘‘A case for stateful forwarding plane,’’ Comput. Commun., Inf.-Centric Netw., vol. 36, no. 7, pp. 779–791, Apr. 2013.
[23] C. Yi, A. Afanasyev, L. Wang, B. Zhang, and L. Zhang, ‘‘Adaptive forwarding in named data networking,’’ SIGCOMM Comput. Commun. Rev., vol. 42, no. 3, pp. 62–67, Jul. 2012.
[24] A. Afanasyev, I.Moiseenko, and L. Zhang,” ndnSIM : NDN simulator for NS-3,” NDN Project, Tech. Rep. NDN-0005, July 2012.