Home // ICDS 2018, The Twelfth International Conference on Digital Society and eGovernments // View article

Flow Table Congestion in Software Defined Networks

Authors:
Tauseef Jamal
Pedro Amaral
Khurrum Abbas

Keywords: congestion; flow table; optimal routing;

Abstract:
Security is a major concern for today’s networks and network applications. Denial of Service (DoS) is major threat to availability of service. DoS is easy to detect but hard to mitigate. There are several types of DoS attacks, such as flooding etc. Software Defined Networks (SDN) inherit security threats from traditional networks along with threats specific to them. Flow table congestion is an example of such problem specific to SDN networks. The attacker generates multiple packets as messages to the controller. Because of this, the switch’s Ternary Content Addressable Memory (TCAM) is flooded with controller replies. TCAMs are very expensive and power hungry. To avoid this type of attack, different aggregation strategies have been proposed. These techniques save TCAMs at the cost of lost statistics in OpenFlow flow table. In this paper, we used an improved version of Optimal Routing Table Construction (ORTC) to perform flow aggregation similar to Fast Flow Table Aggregation (FFTA). Some disadvantages of FFTA include loss of flow table statistics and counts. Our proposed technique reduces the number of flows to solve Flow Table Congestion Problem along with maintaining the consistency of statistics.

Pages: 48 to 53

Copyright: Copyright (c) IARIA, 2018

Publication date: March 25, 2018

Published in: conference

ISSN: 2308-3956

ISBN: 978-1-61208-615-6

Location: Rome, Italy

Dates: from March 25, 2018 to March 29, 2018