| DC 欄位 |
值 |
語言 |
| DC.contributor | 資訊工程學系 | zh_TW |
| DC.creator | 王竣鋒 | zh_TW |
| DC.creator | Chun-Feng Wang | en_US |
| dc.date.accessioned | 2015-7-7T07:39:07Z | |
| dc.date.available | 2015-7-7T07:39:07Z | |
| dc.date.issued | 2015 | |
| dc.identifier.uri | http://ir.lib.ncu.edu.tw:444/thesis/view_etd.asp?URN=102522030 | |
| dc.contributor.department | 資訊工程學系 | zh_TW |
| DC.description | 國立中央大學 | zh_TW |
| DC.description | National Central University | en_US |
| dc.description.abstract | 近幾年來，軟體定義網路(SDN)已經變成了一個重要而且受歡迎的技術，這個技術提供了真實網路中開發新協議與政策的更好的彈性。而在軟體定義網路中的控制器轉換網路政策成網路規則，這些規則大多都儲存於交換器中的封包路徑表格中，而封包路徑表格通常都是用三態內容尋址儲存器(TCAM)來實作。而三態內容尋址儲存器有著一些限制，這種儲存器價格較為昂貴、耗電量高、以及高廢熱的產生使得在交換器中的三態內容尋址儲存器並不會太大，因此，若交換器需要儲存上百甚至上千條的規則的話，可能會不夠用。而其中一個解決的方案是若交換器有這樣規則的需求時，才向控制器尋問並快取這些規則，但這樣會使得封包延遲與佔用龐大的緩衝區。在此篇論文中，我們提出了一個規則分散與放置的演算法來提高效能，這個演算法會分散規則到各個交換器上，我們的演算法不僅適合用於容量小三態內容尋址儲存器的交換器上，更可保證語意上的正確性(即網路全域的行為不會受到改變)，我們在現有的系統上實作了我們的演算法並且展示一些結果來說明我們的演算法可以增進整個網路效能。 | zh_TW |
| dc.description.abstract | Recently, Software-defined Network (SDN) has become an important and popular technology which provides for the flexibility of developing new protocols and the policies of real networks. The controller in SDN translates network policies into rules which are installed in the flow tables (Flow tables are usually stored in ternary content addressable memory (TCAM)) of switches in the networks. Hence, TCAM usually has some critical disadvantages (e.g., high costs, power consumption and high heat generation). Flow tables cannot scale beyond a few hundred entries. Therefore, switches may need to cache rules reactively (i.e., installing rules on demand). However, when cache misses happen, switches will send the packet-in message to the controller and reactively cache the rules, which causes packet delay and large buffers. In this thesis, we propose a rule partition and allocation algorithm that distributes rules across network switches to improve the performance. Our algorithm not only is applicable to small TCAM switch scenario, but also guarantees semantically-invariant (i.e., the global action of the network is unchanged). We implement our algorithm into the real world SDN scenario and the experiment result shows that our algorithm have obviously reduced TCAM usage. | en_US |
| DC.subject | 軟體定義網路 | zh_TW |
| DC.subject | 三態內容尋址儲存器 | zh_TW |
| DC.subject | OpenFlow | zh_TW |
| DC.subject | 規模可伸縮性 | zh_TW |
| DC.subject | Software-defined Networks | en_US |
| DC.subject | TCAM | en_US |
| DC.subject | OpenFlow | en_US |
| DC.subject | Scalability | en_US |
| DC.title | Heterogeneous Flow Table Distribution in Software-defined Networks | en_US |
| dc.language.iso | en_US | en_US |
| DC.type | 博碩士論文 | zh_TW |
| DC.type | thesis | en_US |
| DC.publisher | National Central University | en_US |