跳到主要內容

臺灣博碩士論文加值系統

(216.73.216.208) 您好!臺灣時間:2025/10/02 07:00
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

: 
twitterline
研究生:游郅耘
研究生(外文):YOU, CHIH-YUN
論文名稱:基於路由器選擇和改善網路效能之內容核心網路快取機制
論文名稱(外文):Cache Scheme based on Router Selection and Network Performance Improvement for Content Centric Networks
指導教授:趙涵捷趙涵捷引用關係
指導教授(外文):Chao, Han-Chieh
口試委員:黃忠偉張耀中賴槿峰陳彥文趙涵捷
口試委員(外文):Whang, Jong-WoeiChang, Yao-ChungLai, Chin-FengChen, Yan-WenChao, Han-Chieh
口試日期:2016-07-20
學位類別:碩士
校院名稱:國立宜蘭大學
系所名稱:資訊工程學系碩士班
學門:工程學門
學類:電資工程學類
論文種類:學術論文
論文出版年:2016
畢業學年度:104
語文別:英文
論文頁數:22
中文關鍵詞:內容核心網路快取機制暫存技術ndnSIM
外文關鍵詞:Content Centric Network (CCN), Caching scheme, Content Storage, ndnSIMCaching SchemeContent StoragendnSIM
相關次數:
  • 被引用被引用:0
  • 點閱點閱:284
  • 評分評分:
  • 下載下載:34
  • 收藏至我的研究室書目清單書目收藏:2
根據網路發展趨勢推估,未來網路資料流量的大幅成長,將會造成許多服務無法使用的窘境,原因在於受限的網路頻寬以及傳輸協定,為解決上述問題,學者們紛紛研究並提出了新的傳輸架構,內容核心網路(Content Centric Network, CCN),是其中解決的方式之一,藉由以資料為基礎的網路方式取代現有的IP位址為基礎的傳輸方式,使用資料命名的特點和內容暫存的技術來改善整體網路傳輸效能,但是目前發展尚未穩定的資料快取機制,將會在傳輸路徑所經過的每個路由器中都快取資料,此方式會造成記憶空間的浪費,也壓縮了其他種類資料的儲存空間,因此如何有效地作快取節點的選擇,成為了此研究熱門討論的議題之一。
本研究將提出新的快取機制,藉由計算並給予用戶端到資料存放處路徑經過的各路由器一權重值,根據權重值作快取節點的選擇,以降低各用戶端取得資料所經過路徑的平均跳數為主要目標,並同時減少路由器快取資料的數量,解決一般快取節點選擇方式所造成的網路空間浪費和傳輸效率不佳的問題,如此一來便能更靈活的運用網路空間資源,提高網路傳輸的效能,文中使用ndnSIM模擬軟體,模擬提出機制在內容核心網路中與傳統方法進行比較,結果顯示提出方法確實改善傳統快取機制所造成的問題,提高整體網路傳輸的效率。

According to the trend of network development, estimates that future data traffic grew. The dilemma will cause many services cannot be used due to limited network bandwidth and the transfer protocol. In order to solve the above problem, scholars have studied and proposed new transport architecture, and Content Centric Network (CCN) is one way to solve. Through data-based network to replace the existing IP address-based transmission. Using name data and content cache to improve network performance, but the data cache scheme is not stable yet. This will result in a waste of memory space, and compression of the other types of data storage space. Therefore cache node selection has become one of the hot topics.
This research will present a new cache scheme, by calculating and give the client to the data repository path through router a weight value, and the choice of weights for the cache node. To reduce the client to obtain data the average hop count as its main objective, and at the same time reduces the number of router cache data. So can resolve the current caching scheme caused by the problem of waste and poor efficiency of internet space. This can provide greater flexibility in the use of space resources, and increasing the effectiveness of network transmission. In this paper we use the ndnSIM simulation of the proposed scheme compared with traditional methods. Result display proposed scheme improve the problems posed by the traditional caching scheme, and increase overall network efficiency.

摘要 i
ABSTRACT ii
致謝 iii
Contents iv
Chapter 1 Introduction 1
1.1 Introduction of Content Centric Network 1
Chapter 2 Background 3
2.1 Content Centric Network 3
2.2 Content Cache of Content Centric Network 4
2.3 Related Works 5
Chapter 3 Problem Definition 6
3.1 Problem Description 6
3.2 Cache Scheme based on Average Hop 8
3.3 CCN Example Scenario 11
3.4 AH Example Scenario 11
Chapter 4 Performance Evaluation 13
4.1 Simulation Settings 13
4.2 Simulation Results 14
Chapter 5 Conclusions and Future Works 20
Reference 21
[1]Bari Md. F., Chowdhury S. R., Ahmed R., Boutaba R., and Mathieu B,” A Survey of Naming and Routing in Information-Centric Networks” in Proceedings of IEEE Communications Magazine, pp. 44-53, Dec. 2012.
[2]Ahlgren B., Dannewitz C., Imbrenda C., Kutscher D., and Ohlman B,” A Survey of Information-Centric Networking.” in Proceedings of IEEE Communications Magazine, pp. 26-36, Dec. 2012.
[3]Psaras I., Chai W. K., and Pavlou G,” Probabilistic In-Network Caching for Information-Centric Networks.” in Proceedings of the second edition of the ICN workshop on Information-centric networking, pp. 55-60, Aug. 13-17, 2012.
[4]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 (CoNEXT ’09), pp. 1-12, Dec., 2009.
[5]W. K. Chai, D. He, I. Psaras, G. Pavlou,“ Cache ‘‘less for more’’ in information-centric networks. (extended version)”. Computer Communications .Vol. 36. pp. 758–770, 2013.
[6]Y. Li, T. Lin, H. Tang, and P. Sun,” A Chunk Caching Location and Searching Scheme in Content Centric Networking.” in Proceedings of IEEE International Conference on Communications, pp. 2655-2659, 2012.
[7]G. P. Mishra, M. Dave.,” Cost Effective Caching in Content Centric Networking.” in Proceedings of 11st International Conference on Next Generation Computing Technologies (NGCT), pp. 198-202, 2015.
[8]D. Rossi and G. Rossini,” Caching Performance of Content Centric Networks under Multi-path Routing (and more)“ in Proceedings of Telecom Paris Tech, Nov. 2011.
[9]G. P. Mishra, M. Dave.,” A Review on Content Centric Networking and Caching Strategies.” in Proceedings of Communication Systems and Network Technologies (CSNT), pp. 925-929, 2015.
[10]B. Feng, H. Zhou, G. Li, Zhang H., Chao H.-C,” Least Popularly Used: A Cache Replacement Policy for Information-Centric Networking.“ in Proceedings of Journal of Internet Technology, pp. 1-10, Jan. 2016.
[11]X. N. Nguyen, D. Saucez, and T. Turletti,” Efficient Caching in Content-Centric Networks using Open Flow.” in Proceedings of 32nd IEEE International Conference on Computer Communications, pp. 1-2, Feb. 2013.
[12]Jason Min Wang, Jun Zhang and Brahim Bensaou,“ Intra-AS Cooperative Caching for Content-Centric Networks,” in Proceedings of the 3rd ACM SIGCOMM workshop on Information-centric networking, pp. 61-66, Aug. 12-16, 2013.
[13]A. Afanasyev, I. Moiseenko, and L. Zhang,” ndnSIM: NDN simulator for NS-3,” NDN Project, Tech. Rep. NDN-0005, July 2012.

QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top