Abstract
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the 4th IEEE International Conference on Network Softwarization |
| Number of pages | 9 |
| Publisher | IEEE |
| Publication date | 2018 |
| ISBN (Print) | 978-1-5386-4633-5 |
| DOIs | |
| Publication status | Published - 2018 |
| Event | 4th IEEE International Conference on Network Softwarization - Meridien Versailles, Montreal, Canada Duration: 25 Jun 2018 → 29 Jun 2018 |
Conference
| Conference | 4th IEEE International Conference on Network Softwarization |
|---|---|
| Location | Meridien Versailles |
| Country | Canada |
| City | Montreal |
| Period | 25/06/2018 → 29/06/2018 |
Keywords
- SDN
- Flow tables
- TCAM
- OpenFlow Pipelines
Cite this
}
A Novel Algorithm for Flow-Rule Placement in SDN Switches. / Kentis, Angelos Mimidis; Pilimon, Artur; Soler, José; Berger, Michael Stübert; Ruepp, Sarah Renée.
Proceedings of the 4th IEEE International Conference on Network Softwarization. IEEE, 2018.Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
TY - GEN
T1 - A Novel Algorithm for Flow-Rule Placement in SDN Switches
AU - Kentis, Angelos Mimidis
AU - Pilimon, Artur
AU - Soler, José
AU - Berger, Michael Stübert
AU - Ruepp, Sarah Renée
PY - 2018
Y1 - 2018
N2 - The forwarding rules, used by the legacy and SDN network devices to perform routing/forwarding decisions, are generally stored in Ternary Content Addressable Memory (TCAM) modules, which offer constant look-up times, but have limited capacity, due to their high capital and operational costs, high power consumption and high silicon footprint. To counter this limitation, some commercial switches offer both, hardware and software flow table implementations, termed hybrid flow table architecture in this paper. The software-based tables are stored in non-TCAM memory modules, which offer higher capacity, but with slower lookup times. In addition, these memory modules are limited in terms of how many requests they can serve per time unit. Thus, exceeding this threshold will lead to packet loss in the network. This paper proposes a novel placement algorithm, which dynamically decides whether a new flow rule should be placed in a hardware (expensive) or a software (cheap) table. The placement decisions are based on a number of criteria with the goal to increase the utilization of the software-based table, without introducing performance degradation in the network in terms of significant delay and packet loss. The performance of the placement algorithm was evaluated through experimental measurements in a testbed, which comprises a hybrid SDN switch, a server performing traffic generation and a server hosting the SDN controller. The results indicate that, by limiting the maximum allowed processing capacity of the software table, the number of accommodated flows is significantly increased, while bounding any excessive delays and avoiding packet loss.
AB - The forwarding rules, used by the legacy and SDN network devices to perform routing/forwarding decisions, are generally stored in Ternary Content Addressable Memory (TCAM) modules, which offer constant look-up times, but have limited capacity, due to their high capital and operational costs, high power consumption and high silicon footprint. To counter this limitation, some commercial switches offer both, hardware and software flow table implementations, termed hybrid flow table architecture in this paper. The software-based tables are stored in non-TCAM memory modules, which offer higher capacity, but with slower lookup times. In addition, these memory modules are limited in terms of how many requests they can serve per time unit. Thus, exceeding this threshold will lead to packet loss in the network. This paper proposes a novel placement algorithm, which dynamically decides whether a new flow rule should be placed in a hardware (expensive) or a software (cheap) table. The placement decisions are based on a number of criteria with the goal to increase the utilization of the software-based table, without introducing performance degradation in the network in terms of significant delay and packet loss. The performance of the placement algorithm was evaluated through experimental measurements in a testbed, which comprises a hybrid SDN switch, a server performing traffic generation and a server hosting the SDN controller. The results indicate that, by limiting the maximum allowed processing capacity of the software table, the number of accommodated flows is significantly increased, while bounding any excessive delays and avoiding packet loss.
KW - SDN
KW - Flow tables
KW - TCAM
KW - OpenFlow Pipelines
U2 - 10.1109/NETSOFT.2018.8459979
DO - 10.1109/NETSOFT.2018.8459979
M3 - Article in proceedings
SN - 978-1-5386-4633-5
BT - Proceedings of the 4th IEEE International Conference on Network Softwarization
PB - IEEE
ER -