臺灣博碩士論文加值系統

新一代的網路架構以內容為中心的網路架構已成為近年來最熱門的網路研究主題，以資料名稱取代傳統IP的方式尋找資料，並且在每個路由器上裝備快取記憶體以儲存轉發的資料，使得資料可以再次讓使用者就近存取，但是快取記憶體空間是有限的，所以有效利用有限的快取記憶體空間是很重要的一個議題。Age-based cooperative caching的方法中提到利用資料的熱門程度以及快取設備的地點來決定資料的存活時間(time-to-live)，利用此方法可有效減少頻寬消耗。而我們延伸這個想法，利用動態的調整資料的存活時間來進一步的改善網路效能。當在短時間內多數的使用者針對同一筆資料進行存取時，我們利用延長資料的存活時間來改善快取命中率的問題，使得客戶端的使用者可以持續在快取記憶體中取得熱門的資料。另外，為了減少不同快取記憶體中儲存同一筆資料的問題，當下層路由器的快取記憶體儲存同一筆資料時，即通知上層路由器將快取記憶體中的資料存活時間減低，使得上層的資料可以提早過期而被其它資料替換。除此之外，當快取記憶體中的資料異動時，我們利用有限廣播的方式來達到互相傳遞快取資訊的位置，以達最短距離繞徑的目的。而模擬的結果顯示，我們的方法可以有效的增加資料命中率以及減少頻寬消耗、減低伺服器負載。另外，我們利用軟體自定網路(Software Defined Networks)的方法，將以內容為中心的網路架構以及我們的演算法實作出來，並以軟體自定網路Mininet擬真器進行效能測試，其效能數據和模擬的結果非常接近，皆顯示出我們的方法能有效的改進以內容為中心的網路效能。

Content-Centric Networking (CCN) is a novel networking paradigm. It changes the host-centric model to a content-centric model and allows each CCN router to cache content. Since the cache size of a router is limited, design of a cooperative caching scheme is an important issue in CCN. Among them is the Age-Based Cooperative caching scheme (ABC) which gives an age (i.e., time-to-live) to each piece of content in the cache based on the content popularity and the location of the cached node to reduce the bandwidth consumption and server loading. In this thesis, we focus on extending the idea of ABC by adding a dynamic age adjustment scheme. To handle short-term burst requests to the same content, our age adjustment scheme increases the content’s age value when the cache is hit. To reduce redundant data, our age scheme decreases the age value of an upstream node when the downstream node has cached the same content. Besides, we also propose a simple cache information update scheme to further enhance the routing performance. Simulation results show that our scheme can further enhance cache hit ratio and reduce server loading and bandwidth consumption. Furthermore, we realized the CCN architecture with our caching and routing schemes using Software Defined Networks (SDN). We use SDN emulator Mininet to verify the performance. The emulation results show that they are very close to the simulation results.

中文摘要 ................................................................................................................................................ iii
Abstract ................................................................................................................................................. iv
誌謝 ......................................................................................................................................................... v
本文目錄 ................................................................................................................................................ vi
圖目錄 ................................................................................................................................................... vii
表目錄 .................................................................................................................................................... ix
Chapter 1 Introduction ......................................................................................................................... 1
Chapter 2 Related Works ..................................................................................................................... 5
Chapter 3 Age Adjustment Scheme ..................................................................................................... 8
3.1 Dynamic Age-Adjusted Cooperative Caching .............................................................................. 8
3.2 Caching Information Update Scheme ........................................................................................... 9
Chapter 4 Implement CCN using SDN ............................................................................................. 10
Chapter 5 Performance Evaluation ................................................................................................... 17
5.1 Simulation ................................................................................................................................... 17
5.2 Emulation .................................................................................................................................... 29
Chapter 6 Conclusion ......................................................................................................................... 37

[1] V. Jacobson, et al., "Networking named content," in Proc. ACM CoNEXT, 2009.
[2] K. Cho, et al., "WAVE: Popularity-based and collaborative in-network caching for content-oriented networks," in INFOCOM Workshop, 2012.
[3] M. Gritter and D. R. Cheriton. (2000, Jul.). TRIAD: A new next-generation Internet architecture. Available: http://gregorio.stanford.edu/triad/index.html
[4] T. Koponen, et al., "A data-oriented (and beyond) network architecture," ACM SIGCOMM Computer Communication Review, vol. 37, pp. 181-192, 2007.
[5] L. Zhang, et al. (2010, Oct.). Named data networking (ndn) project. Available: http://www.named-data.net/techreport/TR001ndn-proj.pdf
[6] V. Jacobson, et al., "VoCCN: voice-over content-centric networks," in Proc. of the 2009 workshop on Re-architecting the internet, 2009.
[7] M. Caesar, et al., "ROFL: routing on flat labels," ACM SIGCOMM Computer Communication Review, vol. 36, pp. 363-374, 2006.
[8] H. Che, et al., "Analysis and design of hierarchical web caching systems," Proc. IEEE INFOCOM'01, vol. 3, pp. 1416-1424, 2001.
[9] X. Tang and S. T. Chanson, "Coordinated en-route web caching," IEEE Transactions on Computers, vol. 51, pp. 595-607, 2002.
[10] Z. Ming, et al., "Age-based cooperative caching in information-centric networks," in Workshop on Emerging Design Choices in Name-Oriented Networking, 2012.
[11] I. Psaras, et al., "Probabilistic in-network caching for information-centric networks," in Proceedings of the second edition of the ICN workshop on Information-centric networking, 2012, pp. 55-60.
[12] I. Psaras, et al., "Modelling and evaluation of CCN-caching trees," in NETWORKING 2011, ed: Springer, 2011, pp. 78-91.
[13] N. McKeown, et al., "OpenFlow: enabling innovation in campus networks," ACM SIGCOMM Computer Communication Review, vol. 38, pp. 69-74, 2008.
[14] B. Lantz, et al., "A network in a laptop: rapid prototyping for software-defined networks," in Proceedings of the 9th ACM SIGCOMM Workshop on Hot Topics in Networks, 2010, p. 19.
[15] N. Gude, et al., "NOX: towards an operating system for networks," ACM SIGCOMM Computer Communication Review, vol. 38, pp. 105-110, 2008.
[16] R. Sherwood, et al., "Flowvisor: A network virtualization layer," OpenFlow Switch Consortium, Tech. Rep, 2009.
[17] N. Laoutaris, et al., "The LCD interconnection of LRU caches and its analysis," Performance Evaluation, vol. 63, pp. 609-634, 2006.
[18] M. Xie, et al., "Enhancing cache robustness for content-centric networking," in INFOCOM, 2012 Proceedings IEEE, 2012, pp. 2426-2434.
[19] E. J. Rosensweig and J. Kurose, "Breadcrumbs: efficient, best-effort content location in cache networks," in IEEE INFOCOM, 2009.
[20] S. Eum, et al., "Potential based routing for ICN," in Proc. of the 7th Asian Internet Engineering Conference, 2011.
[21] R. Chiocchetti, et al., "INFORM: a dynamic INterest FORwarding Mechanism for Information Centric Networking."
[22] C. Yi, et al., "A case for stateful forwarding plane," Computer Communications, 2013.
[23] L. Saino, et al., "Hash-routing Schemes for Information Centric Networking," 2013.
[24] D. Rossi and G. Rossini, "Caching performance of content centric networks under multi-path routing (and more)," Technical report, Telecom ParisTech, 2011.
[25] L. Breslau, et al., "Web caching and Zipf-like distributions: Evidence and implications," in Proc. IEEE INFOCOM, vol. 1, pp. 126-134, 1999.