內容中心網路(Content-Centric Network，CCN)，是一種以資料內容為中心的新一代網路傳輸架構。基於此傳輸架構，資料於傳遞的過程中可以暫存於節點的儲存區內；使得該節點在收到資料請求時，可以直接從儲存區中提取，提高整體網路的傳輸效率。在CCN中，節點在發送查詢的請求時，需要透過Forwarding Information Base (FIB)；其功能類似IP協定的路由表，會將查詢的請求轉發至資料來源的提供者。此外，在FIB中的記錄為資料來源的提供者，而非節點中所暫存的資料本身。然而，無法事先得知其他節點中所暫存的資料，因此在查詢資料的過程將耗費龐大的計算成本及時間。如果FIB能同時記錄節點中暫存的資料，將降低網路資源耗費的成本，進而提升網路的效能。但如此一來，網路中的節點會因額外記錄每個節點所儲存的資料導致儲存空間需求的增加，也相對地提高了資料搜尋的成本。本論文提出一套在內容中心網路下基於查詢相似度之搜尋方法(SAQS)；此方法以節點本身所暫存資料的訊息進行分析，並以陣列的形式呈現；接著計算暫存的資料與查詢的權重，最後選擇計算結果最佳的節點進行轉發，以此提升搜尋的效率。此外，當有多個節點同時匹配轉發條件時，也能以此方法將能決定出最佳的節點。最後模擬驗證本論文提出的SAQS與其他方法之比較；在不同的網路拓樸環境及參數設定下，SAQS有較佳的資料搜尋命中率，且所耗費的Hop數及延遲時間也較少。

The Content-Centric Network (CCN) is a new generation of network transmission architecture which focuses on data content delivery. In a CCN, the content can be cached in the storage area of a node during the data delivery process, and a node can directly extract data from the storage area when receiving the query, thus improving the efficiency of data content distribution in a network. The node needs to forward the query through the Forwarding Information Base (FIB). Its function is similar to the IP protocol routing table, and the query is forwarded to the provider of the content source. In addition, the record in the FIB is the provider of the content source, not the content itself cached in the node. However, the router cannot know the data cached in other routers in advance, so the process of querying data will consume huge computational cost and time. This paper proposes a Search Approach Based on Query Similarity (SAQS). This method analyzes the information cached in the node itself, then calculates the cached content and the weight of query, and decides the best node for forwarding data in order to improve the efficiency of the search. In addition, when multiple nodes match the forwarding conditions at the same time, this method can also decide the best forwarding node. Finally, SAQS is compared with other methods through simulation verification. Under different network topologies and parameter settings, SAQS has better cache hit ratio, smaller number of hops and shorter delay time.

[1] 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, Dec. 2009, pp. 1–12.
[2] G. Xylomenos, C. N. Ververidis, V. A. Siris, N. Fotiou, C. Tsilopoulos, X. Vasilakos, K. V. Katsaros, and G. C. Polyzos, “A survey of information-centric networking research,” IEEE Communications Surveys Tutorials, pp. 1–26, Jul. 2013.
[3] B. Ahlgren, C. Dannewitz, C. Imbrenda, D. Kutscher, and B. Ohlman, “A survey of information-centric networking,” IEEE Communications Magazine, pp. 26–36, Jul. 2012.
[4] “Parc, a xerox company, ” https://www.parc.com/.
[5] R. Chiocchetti, D. Rossi, and G. Rossini, “ccnsim: An highly scalable ccn simulator,” in 2013 IEEE International Conference on Communications, Jun. 2013, pp. 2309–2314.
[6] G. Zhang, Y. Li, and T. Lin, “Caching in information centric networking: A survey,” Computer Networks, pp. 3128–3141, Nov. 2013.
[7] N. Laoutaris, H. Che, and I. Stavrakakis, “The lcd interconnection of lru caches and its analysis,” Performance Evaluation, pp. 609–634, Jan. 2006.
[8] N. Laoutaris, S. Syntila, and I. Stavrakakis, “Meta algorithms for hierarchical web caches,” in IEEE International Conference on Performance, Computing, and Communications, Apr. 2004, pp. 445–452.
[9] V. Jacobson, J. Burke, D. Estrin, L. Zhang, B. Zhang, G. Tsudik, K. Claffy, D. Krioukov, D. Massey, C. Papadopoulos, P. Ohm, T. Abdelzaher, K. Shilton, L. Wang, E. Yeh, E. Uzun, G. Edens, and P. Crowley, “Named Data Networking (NDN) Project 2012 - 2013 Annual Report,” Tech. Rep., Oct. 2013.
[10] S. Podlipnig and L. B¨osz¨ormenyi, “A survey of web cache replacement strategies,” ACM Comput. Surv, pp. 374–398, Dec. 2003.
[11] C. Yi, A. Afanasyev, L. Wang, B. Zhang, and L. Zhang, “Adaptive forwarding in named data networking,” SIGCOMM Comput. Commun. Rev., pp. 62–67, Jun. 2012.
[12] A. Afanasyev, C. Yi, L. Wang, B. Zhang, and L. Zhang, “Snamp: Secure namespace mapping to scale ndn forwarding,” in 2015 IEEE Conference on Computer Communications Workshops, Apr. 2015, pp. 281–286.
[13] H. Dai, J. Lu, Y. Wang, and B. Liu, “A two-layer intra-domain routing scheme for named data networking,” in 2012 IEEE Global Communications Conference, Dec. 2012, pp. 2815–2820.
[14] A. Udugama, X. Zhang, K. Kuladinithi, and C. Goerg, “An on-demand multi-path interest forwarding strategy for content retrievals in ccn,” in 2014 IEEE Network Operations and Management Symposium, May. 2014, pp. 1–6.
[15] G. Rossini and D. Rossi, “Evaluating ccn multi-path interest forwarding strategies,” Computer Communications, pp. 771–778, Apr. 2013.
[16] W. K. Chai, D. He, I. Psaras, and G. Pavlou, “Cache “less for more” in information-centric networks (extended version),” Computer Communications, pp. 758–770, Apr. 2013.
[17] I. Psaras, W. K. Chai, and G. Pavlou, “Probabilistic in-network caching for information-centric networks,” in Proceedings of the Second Edition of the ICN Workshop on Information-centric Networking, Aug. 2012, pp. 55–60.
[18] L. P. Du, T.-A. Le, N. D. Thai, and P. L. Vo, “The performance of caching strategies in content centric networking,” in 2017 International Conference on Information Networking, Jan. 2017, pp. 628–632.
[19] C. Bernardini, T. Silverston, and O. Festor, “A comparison of caching strategies for content centric networking,” in 2015 IEEE Global Communications Conference, Dec. 2015, pp. 1–6.
[20] M. Arifuzzaman, Y. Keping, Q. N. Nguyen, and S. Takuro, “Locating the content in the locality: Icn caching and routing strategy revisited,” in 2015 European Conference on Networks and Communications, Jun. 2015, pp. 423–428.
[21] D. Kim, Y. B. Ko, and S. H. Lim, “Comprehensive analysis of caching performance under probabilistic traffic patterns for content centric networking,” China Communications, pp. 127–136, Mar. 2016.
[22] G. Rossini and D. Rossi, “Coupling caching and forwarding: Benefits, analysis, and implementation,” in Proceedings of the 1st ACM Conference on Information-Centric Networking, Sep. 2014, pp. 127–136.
[23] K. Thar, T. Z. Oo, C. Pham, S. Ullah, D. H. Lee, and C. S. Hong, “Efficient forwarding and popularity based caching for content centric network,” in 2015 International Conference on Information Networking, Jan. 2015, pp. 330–335.
[24] S. Oueslati, J. Roberts, and N. Sbihi, “Flow-aware traffic control for a content-centric network,” in 2012 Proceedings IEEE INFOCOM, Mar. 2012, pp. 2417–2425.
[25] N. Rozhnova and S. Fdida, “An effective hop-by-hop interest shaping mechanism for ccn communications,” in 2012 Proceedings IEEE INFOCOM Workshops, Mar. 2012, pp. 322–327.
[26] G. Carofiglio, M. Gallo, and L. Muscariello, “Joint hop-by-hop and receiver-driven interest control protocol for content-centric networks,” in Proceedings of the Second Edition of the ICN Workshop on Information- centric Networking, Aug. 2012, pp. 37–42.
[27] C. L. Hu, Y. H. Chang, and K. F. Huang, “Searching with feature similarity in unstructured peer-to-peer networks,” in 2014 7th International Conference on Ubi-Media Computing and Workshops, Jul. 2014, pp. 65–71.

[28] A. Varga and R. Hornig, “An overview of the omnet++ simulation environment,” in Proceedings of the 1st International Conference on Simulation Tools and Techniques for Communications, Networks and Systems & Workshops, Mar. 2008, pp. 60:1–60:10.

[29] C. Yi, J. Abraham, A. Afanasyev, L. Wang, B. Zhang, and L. Zhang, “On the role of routing in named data networking,” in Proceedings of the 1st ACM Conference on Information-Centric Networking, Sep. 2014, pp. 27–36.