內容中心網路下基於查詢相似度之搜尋方法

以作者查詢圖書館館藏

、以作者查詢臺灣博碩士

、以作者查詢全國書目

、勘誤回報

、線上人數：15

、訪客IP：13.58.112.1

姓名

胡瀚(Han Hu) 查詢紙本館藏

畢業系所

通訊工程學系

論文名稱

內容中心網路下基於查詢相似度之搜尋方法
(A Search Approach Based on Query Similarity in Content-Centric Networks)

相關論文

★ 非結構同儕網路上以特徵相似度為基準之搜尋方法	★ 以階層式叢集聲譽為基礎之行動同儕網路拓撲架構
★ 線上RSS新聞資料流中主題性事件監測機制之設計與實作	★ 耐延遲網路下具密度感知的路由方法
★ 整合P2P與UPnP內容分享服務之家用多媒體閘道器：設計與實作	★ 家庭網路下簡易無縫式串流影音播放服務之設計與實作
★ 耐延遲網路下訊息傳遞時間分析與高效能路由演算法設計	★ BitTorrent P2P 檔案系統下載端網路資源之可調式配置方法與效能實測
★ 耐延遲網路中利用訊息編碼重組條件之資料傳播機制	★ 耐延遲網路中基於人類移動模式之路由機制
★ 車載網路中以資料匯集技術改善傳輸效能之封包傳送機制	★ 適用於交叉路口環境之車輛叢集方法
★ 車載網路下結合路側單元輔助之訊息廣播機制	★ 耐延遲網路下以靜態中繼節點（暫存盒）最佳化訊息傳遞效能之研究
★ 耐延遲網路下以動態叢集感知建構之訊息傳遞機制	★ 跨裝置影音匯流平台之設計與實作

檔案

[Endnote RIS 格式]

[Bibtex 格式]

[相關文章]

[文章引用]

[完整記錄]

[館藏目錄]

[檢視]

[下載]

本電子論文使用權限為同意立即開放。
已達開放權限電子全文僅授權使用者為學術研究之目的，進行個人非營利性質之檢索、閱讀、列印。
請遵守中華民國著作權法之相關規定，切勿任意重製、散佈、改作、轉貼、播送，以免觸法。

摘要(中)

內容中心網路(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.

關鍵字(中)

★ 搜尋演算
★ 資料暫存
★ 內容傳遞
★ 內容傳輸網路
★ 內容中心網路

關鍵字(英)

★ Search Algorithm
★ Data Caching
★ Content Forwarding
★ Content Distribution Network
★ Content- Centric Network

論文目次

目錄

摘要 i
目錄 iv
圖目錄 vi
表目錄 ix
第一章簡介 1
第二章背景與相關文獻探討 4
2.1 背景 4
2.1.1內容中心網路(CCN) 4
2.1.2路由轉發架構 6
2.1.3網路環境 7
2.1.4查詢轉發策略 8
2.1.5資料暫存策略 10
2.1.6資料替換策略 12
2.2 相關文獻 13
第三章相似度之查詢搜尋方法 15
3.1 研究目的 15
3.2 系統架構 16
3.3 資料分類 16
3.4 查詢權重 17
3.5 暫存命中向量 18
3.6 節點評比機制 19

第四章模擬及數據分析 24
4.1 實驗設計 24
4.2 模擬環境 24
4.3 效能指標 27
4.4 暫存空間之影響 28
4.5 資料內容總數之影響 28
4.6 隨機拓樸之效能 35
第五章結論與未來研究工作 41
參考文獻 42

參考文獻

[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. Cla?y, 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.

指導教授

胡誌麟(Chih-Lin Hu)

審核日期

2018-8-21

推文