博碩士論文 101522039 詳細資訊




以作者查詢圖書館館藏 以作者查詢臺灣博碩士 以作者查詢全國書目 勘誤回報 、線上人數:27 、訪客IP:34.234.223.227
姓名 林志浩(Chih-hao Lin)  查詢紙本館藏   畢業系所 資訊工程學系
論文名稱
(Flow-table Distribution in Software-Defined Networks)
相關論文
★ 基於OP-TEE的可信應用程式軟體生態系統★ 在低軌道衛星無線通訊中的CSI預測方法
★ 為多流量低軌道衛星系統提出的動態換手策略★ 基於Trustzone的智慧型設備語音隱私保護系統
★ 一種減輕LEO衛星網路干擾的方案★ TruzGPS:基於TrustZone的位置隱私權保護系統
★ 在無線感測網路中連續型物體的偵測與追蹤協定之設計★ 在車用無線網路中利用虛擬地標的封包繞徑協定
★ 在無線感測網路下處理不同重要性區域的覆蓋問題★ 在車用網路環境下分散式計程車呼叫協定
★ 車用無線網路車輛密度偵測方法★ 在車用無線網路中利用適應道路分割法提供區域性階層式定位服務
★ 在無線感測網路中以延長網路生命週期為目的之避洞繞徑協定★ 利用車用無線網路尋找空停車位之協定
★ 在車載無線網路中以區域性為基礎的資源分享協定★ 設計於城市環境之分散式車載隨意行動網路位置服務
檔案 [Endnote RIS 格式]    [Bibtex 格式]    [相關文章]   [文章引用]   [完整記錄]   [館藏目錄]   [檢視]  [下載]
  1. 本電子論文使用權限為同意立即開放。
  2. 已達開放權限電子全文僅授權使用者為學術研究之目的,進行個人非營利性質之檢索、閱讀、列印。
  3. 請遵守中華民國著作權法之相關規定,切勿任意重製、散佈、改作、轉貼、播送,以免觸法。

摘要(中) 一般使用三元內容定址記憶體(Ternary Content Addressable Memory),實作交換器裡的SDN路由表(Flow-table)。因交換器硬體規格不同只能提供少量的TCAMs。在軟體定義網路(Software-define network)中,需要提供各式各樣的服務,像是安全防護、虛擬私人網路(VPN)、服務質量(QoS)、負載平衡和流量監控,而這些服務都需要龐大的規則(Rule)去完成。而要如何將這些龐大的規則存放在SDN交換器是個嚴重的問題。
在本篇論文中,我們的方法將完整的路由表(Full flow-table)分割成幾個小的部分路由表(partial flow-table),再將這些部分路由表分配給網路中的各個交換器。我們的目標是減少各個交換器使用的儲存空間和平衡各個交換器負載平衡。更重要的是在加入新的規則時,減少了控制者(controller)通訊成本。
摘要(英) The switch′s flow-table is usually implemented by using ternary content addressable memory (TCAMs). In SDN, TCAM supports just a few thousand or tens of thousands of entries (which is according to the different hardware). However, SDN needs to provide a variety of services, such like the security services, virtual private network (VPN), quality of service (QoS), load balancing, traffic monitoring and accounting, network address translation (NAT), etc. These services will need a lot of policies to complete, which is mapping to a large number of rules. So, how to store all the rules in the SDN switch becomes a serious problem. Our method decomposes a large SDN flow-tables into small ones and then distributing them across the network. Our goal is to reduce the total number of table entries and also balance the number of table entries in each switch. When the SDN tables update, our method also reduces the controller communication cost.
關鍵字(中) ★ 軟體定義網路
★ 三元內容定址記憶體
★ 路由表
★ 交換器
★ 控制者
關鍵字(英)
論文目次 Contents iii
List of Figures iv
1 Introduction 1
2 Related Work 5
2.1 Hierarchical approach . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6
2.2 Flat approaches . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7
3 Framework 10
3.1 Algorithm Framework . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10
3.2 Algorithm overview . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12
4 The proposed algorithm 13
4.1 Path-index assignment . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13
4.2 Distribute the full flow-table . . . . . . . . . . . . . . . . . . . . . . . . . . 15
5 The rule insertion 20
6 Simulation 21
6.1 Flow-table Distribution . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 21
6.2 The Rule insertion . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 22
7 Conclusion 27
Reference 28
參考文獻 [1] http://www.sdncentral.com/, “sdn central.”
[2] http://archive.openflow.org/, “Openflow.”
[3] N. McKeown, T. Anderson, H. Balakrishnan, G. Parulkar, L. Peterson, J. Rexford,
S. Shenker, and J. Turner, “Openflow: enabling innovation in campus networks,”
ACM SIGCOMM Computer Communication, vol. 38, pp. 69–74, 2008.
[4] http://searchnetworking.techtarget.com/, “Searchnetworking.”
[5] F. Yu, T. V. Lakshman, M. Motoyama, and R. Katz, “Ssa,” in Architecture for
networking and communications systems, Oct 2005, pp. 105–113.
[6] B. Stephens, A. Cox, W. Felter, C. Dixon, and J. Carter, “Past: Scalable ethernet
for data centers,” international conference on Emerging networking experiments and
technologies, pp. 49–60, 2012.
[7] Y. Kanizo, D. Hay, and I. Keslassy, “Palette: Distributing tables in software-defined
networks,” in INFOCOM, 2013 Proceedings IEEE, 2013, pp. 545–549.
[8] Y. Zhang, M. Roughan, N. Duffield, and A. Greenberg, “Fast accurate computation
of large-scale ip traffic matrices from link loads,” ACM SIGMETRICS, vol. 31, pp.
206–217, 2003.
[9] A. Lakhina, M. Crovella, and C. Diot, “Diagnosing network-wide traffic anomalies,”
ACM SIGCOMM Computer Communication, vol. 34, pp. 219–230, 2004.
[10] X. Li, F. Bian, H. Zhang, C. Diot, R. Govindan, W. H. Hong, and G. Iannaccone,
“Mind: A distributed multi-dimensional indexing system for network diagnosis,”
IEEE International Conference on Computer Communications, pp. 1–12, 2006.
[11] M. Kodialam and T. V. Lakshman, “Detecting network intrusions via sampling: a
game theoretic approach,” in INFOCOM 2003. Twenty-Second Annual Joint Conference
of the IEEE Computer and Communications. IEEE Societies, vol. 3, 2003,
pp. 1880–1889.
[12] V. Sekar, M. K. Reiter, W. Willinger, H. Zhang, R. R. Kompella, and D. G. Andersen,
“csamp: A system for network-wide flow monitoring,” USENIX Symposium on
Networked Systems Design and Implementation, pp. 223–246, 2008.
[13] K. Suh, Y. Guo, J. Kurose, and D. Towsley, “Locating network monitors: complexity,
heuristics, and coverage,” in IEEE Computer and Communications Societies, vol. 1,
2005, pp. 351–361.
[14] S. Raza, G. Huang, C.-N. Chuah, S. Seetharaman, and J. Singh, “Measurouting: A
framework for routing assisted traffic monitoring,” in INFOCOM, 2010 Proceedings
IEEE, 2010, pp. 1–9.
[15] A. Di Pietro, F. Huici, D. Costantini, and S. Niccolini, “Decon: Decentralized coordination
for large-scale flow monitoring,” in INFOCOM IEEE Conference on Computer
Communications Workshops , 2010, 2010, pp. 1–5.
[16] D. L. Applegate, G. Calinescu, D. S. Johnson, H. Karlo, K. Ligett, and J. Wang,
“Compressing rectilinear pictures and minimizing access control lists,” ACM-SIAM
symposium on Discrete algorithms, pp. 1066–1075, 2007.
[17] C. R. Meiners, A. X. Liu, and E. Torng, “Bit weaving: A non-prefix approach to
compressing packet classifiers in tcams,” IEEE/ACM Transactions on Networking,
vol. 20, pp. 488–500, 2012.
[18] A. Liu, C. Meiners, and E. Torng, “Tcam razor: A systematic approach towards
minimizing packet classifiers in tcams,” IEEE/ACM Transactions on Networking,
vol. 18, pp. 490–500, 2010.
[19] M. Yu, J. Rexford, M. J. Freedman, and J. Wang, “Scalable flow-based networking
with difane,” ACM SIGCOMM Computer Communication, vol. 40, pp. 351–362,
2010.
[20] N. Kang, Z. Liu, J. Rexford, and D. Walker, “Optimizing the ”one big switch”
abstraction in software-defined networks,” ACM conference on Emerging networking
experiments and technologies, pp. 13–24, 2013.
[21] Q. Dong, S. Banerjee, J. Wang, and D. Agrawal, “Wire speed packet classification
without tcams: A few more registers (and a bit of logic) are enough,” ACM SIGMETRICS,
vol. 35, pp. 253–264, 2007.
[22] http://mininet.org/, “Mininet.”
[23] http://www.projectfloodlight.org/, “Project floodligh.”
指導教授 張貴雲(Guey-Yun Chang) 審核日期 2014-8-13
推文 facebook   plurk   twitter   funp   google   live   udn   HD   myshare   reddit   netvibes   friend   youpush   delicious   baidu   
網路書籤 Google bookmarks   del.icio.us   hemidemi   myshare   

若有論文相關問題,請聯絡國立中央大學圖書館推廣服務組 TEL:(03)422-7151轉57407,或E-mail聯絡  - 隱私權政策聲明