An Effective Flow-Rule-Reducing Algorithm for Flow Tables in Software-Defined Networks
| Autor: | Yan-Jing Wu, Jhen-Siang Syu, Cheng-Han Lin, Wen-Shyang Hwang, Ming-Hua Cheng |
|---|---|
| Rok vydání: | 2020 |
| Předmět: |
Network architecture
OpenFlow Computer science Computation 05 social sciences Design flow Data compression ratio 02 engineering and technology Flow (mathematics) Control theory 020204 information systems 0502 economics and business 0202 electrical engineering electronic engineering information engineering 050211 marketing Software-defined networking Algorithm |
| Zdroj: | ICS |
| Popis: | The flow table of an OpenFlow switch plays a crucial role in software-defined networks (SDNs), which have novel network architecture. To achieve fast lookup in flow tables, the OpenFlow switch uses ternary content-addressable memory to design flow tables. However, this memory has limited capacity for flow tables and some flow rules may be redundant, which can cause a congestion problem in flow tables. The congestion problem also influences the performance of the entire network. This paper proposes an effective flow-rule-reduction (EFRR) algorithm for reducing the number of flow rules for an OpenFlow switch and improving the performance of an SDN. The proposed EFRR algorithm favorably trades-off computation time and compression rate and reduces the number of flow rules efficiently. According to simulation results obtained using a Mininet controller, the EFRR algorithm results in a higher compression rate and a shorter computation time. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|