臺灣博碩士論文加值系統

近年來，為了提升網路的效能以及資料的可用性，內容核心網路(Content Centric Network, CCN)被提出以取代現有的IP位址連線方式，希望透過資料命名的特性與內容暫存的方式來提升網路效能，其中內容暫存的方式則是在網路傳輸路徑中的節點暫存資料，例如在網路轉發路徑上的路由器中進行暫存。因此，在快取內容的選擇上更為重要，因為在內容核心網路裡，每個路由器上的快取空間大小是有限的，而現有的快取機制無法有效地善用內容核心網路之內容暫存特性，在內容核心網路資料傳遞得過程中，往往會造成過多重複且不精確的內容暫存在路由器裡，嚴重地浪費路由器的暫存空間。本研究針對內容核心網路之暫存議題做探討，提出一個名為CPUL(Content Popularity and User Location)的快取機制，將內容核心網路裡用戶端所請求的資料分為熱門內容以及一般內容，並針對這兩種屬性的資料快取暫存於對應的路由器快取空間，如此一來，便能夠讓路由器快取到重要的資料減少用戶端獲取資料的時間，而模擬結果驗證提出的CPUL機制不僅能在較少的跳數以及延遲時間下提升資料內容的快取命中率，同時達到較少的快取空間使用。

For improving Internet performance and data availability, Content Centric Network (CCN) has been proposed in recent years. It replaces the current IP address connection method with the features of named data and content stores for improving network performance. The content store is used to cache data at nodes in the transmission path. For instance, data cached at the routers where in its forwarding path. As a result, the content selection for content cache is vital to CCNs, because the cache size of each router is limited. However, existing content cache scheme in CCN cannot utilize the feature of content store efficiently. It wastes the size of content cache and results in redundant replica in CCN routers while transmitting data. This research aims to tackle the cache issues of CCN and proposes a cache scheme named content popularity and user location (CPUL) cache scheme. Based on the content popularity of data and users’ locations, the data requested by users are classified into popular content and normal content. In addition, data are cached to corresponding routers based on its attributes. As a result, the proposed CPUL cache scheme is able to decrease the time for request data content because it caches correct data. In simulation results, the proposed CPUL cache scheme not only improves content hit rate but also reduces latency time. Furthermore, it uses less cache size and fewer hop count compared to traditional CCN cache scheme.

Contents
摘要 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 5
2.3 Related Works 5
Chapter 3 Problem Definition 7
3.1 Problem Description 7
3.2 Cache Scheme based on Content Popularity and User Location 11
3.3 CPUL Example Scenario 14
Chapter 4 Performance Evaluation 16
4.1 Simulation Settings 16
4.2 Simulation Results 17
Chapter 5 Conclusions and Future Works 27

[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]Feng B., Zhou H., Li G., 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.
[5]Nguyen X. N., Saucez D., and Turletti T,” Efficient Caching in Content-Centric Networks using OpenFlow.” in Proceedings of 32nd IEEE International Conference on Computer Communications, pp. 1-2, Feb., 2013.
[6]Perino D. and Varvello M,” A Reality Check for Content Centric Networking.” in Proceedings of 1st ACM SIGCOMM workshop on Information-Centric Networking, pp. 44-49, Aug. 15-19, 2011.
[7]Yan H., Gao D., Su W., and Chao H.-C,” A Forwarding Strategy of Counteracting Redundancy Data in Named Data Networking.” in Proceedings of International Journal of Communication Systems, pp. 2289-2310, Aug., 2015.
[8]Jacobson V., Mosko M., Smetters D., and Garcia-Luna-Aceves J,” Content Centric Networking.” in Proceedings of Whitepaper, Palo Alto Research Center, pp. 1-2, 2007.
[9]Liu Y ., Sevigne C ., Lederer S., Rainer B., Muller C., Timmerer C., and Hellwagner H,” Dynamic Adaptive Streaming over CCN: A Caching and Overhead Analysis.” in Proceedings of IEEE International Conference on Communications, pp. 3629-3633, June 9-13, 2013.
[10]Rossi D. and Rossini G,” Caching Performance of Content Centric Networks under Multi-path Routing (and more). “in Proceedings of Telecom ParisTech, Nov., 2011.
[11]Wang Y., Li Z., Tyson G., Uhlig S., and Xie G,” Optimal Cache Allocation for Content-Centric Networking.” in Proceedings of 21st IEEE International Conference on Network Protocols, pp. 1-10, Oct. 7-10, 2013.
[12]Tyson G., Kaune S., Miles S., El-khatib Y., Mauthe A. and Taweel A,” A Trace-Driven Analysis of Caching in Content-Centric Networks.” in Proceedings of 21st International Conference on Computer Communications and Networks, pp. 1-7, July 30-Aug. 2, 2012.
[13]Wu Q., Li Z., and Xie G,” CodingCache: Multipath-aware CCN Cache with Network Coding.” in Proceedings of 3rd ACM SIGCOMM workshop on Information-Centric Networking, pp. 41-42, Aug. 12-16, 2013.
[14]Xu Y., Li Y., Lin T., Zhang G., Wang Z., and Ci S,” A Dominating-set-based Collaborative Caching with Request Routing in Content Centric Networking.” in Proceedings of IEEE International Conference on Communications, pp. 3624-3628, June 9-13, 2013.
[15]Li Y., Lin T., Tang H., and Sun P,”A Chunk Caching Location and Searching Scheme in Content Centric Networking.” in Proceedings of IEEE International Conference on Communications, pp. 2655-2659, May, 2012.
[16]Bernardini C., Silverston T. and Festor O,” MPC: Popularity-based Caching Strategy for Content Centric Networks.” in Proceedings of IEEE International Conference on Communications, pp. 3619-3623, June 9-13, 2013.
[17]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.
[18]王聖傑,梁宗達,曾繁勛,趙涵捷,周立德,“基於內容熱門度與使用者位置之內容核心網路快取機制”in Proceedings of TANET 2015, Oct. 21-23, 2015.