A Novel Algorithm for Flow-Rule Placement in SDN Switches

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

580 Downloads (Pure)

Abstract

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.
Original languageEnglish
Title of host publicationProceedings of the 4th IEEE International Conference on Network Softwarization
Number of pages9
PublisherIEEE
Publication date2018
ISBN (Print)978-1-5386-4633-5
DOIs
Publication statusPublished - 2018
Event4th IEEE International Conference on Network Softwarization - Meridien Versailles, Montreal, Canada
Duration: 25 Jun 201829 Jun 2018

Conference

Conference4th IEEE International Conference on Network Softwarization
LocationMeridien Versailles
CountryCanada
CityMontreal
Period25/06/201829/06/2018

Keywords

  • SDN
  • Flow tables
  • TCAM
  • OpenFlow Pipelines

Cite this

Kentis, A. M., Pilimon, A., Soler, J., Berger, M. S., & Ruepp, S. R. (2018). A Novel Algorithm for Flow-Rule Placement in SDN Switches. In Proceedings of the 4th IEEE International Conference on Network Softwarization IEEE. https://doi.org/10.1109/NETSOFT.2018.8459979
Kentis, Angelos Mimidis ; Pilimon, Artur ; Soler, José ; Berger, Michael Stübert ; Ruepp, Sarah Renée. / A Novel Algorithm for Flow-Rule Placement in SDN Switches. Proceedings of the 4th IEEE International Conference on Network Softwarization. IEEE, 2018.
@inproceedings{450840ce911143cab3c751353bfa9787,
title = "A Novel Algorithm for Flow-Rule Placement in SDN Switches",
abstract = "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.",
keywords = "SDN, Flow tables, TCAM, OpenFlow Pipelines",
author = "Kentis, {Angelos Mimidis} and Artur Pilimon and Jos{\'e} Soler and Berger, {Michael St{\"u}bert} and Ruepp, {Sarah Ren{\'e}e}",
year = "2018",
doi = "10.1109/NETSOFT.2018.8459979",
language = "English",
isbn = "978-1-5386-4633-5",
booktitle = "Proceedings of the 4th IEEE International Conference on Network Softwarization",
publisher = "IEEE",
address = "United States",

}

Kentis, AM, Pilimon, A, Soler, J, Berger, MS & Ruepp, SR 2018, A Novel Algorithm for Flow-Rule Placement in SDN Switches. in Proceedings of the 4th IEEE International Conference on Network Softwarization. IEEE, 4th IEEE International Conference on Network Softwarization, Montreal, Canada, 25/06/2018. https://doi.org/10.1109/NETSOFT.2018.8459979

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 proceedingArticle in proceedingsResearchpeer-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 -

Kentis AM, Pilimon A, Soler J, Berger MS, Ruepp SR. A Novel Algorithm for Flow-Rule Placement in SDN Switches. In Proceedings of the 4th IEEE International Conference on Network Softwarization. IEEE. 2018 https://doi.org/10.1109/NETSOFT.2018.8459979