A novel eviction policy based on shortest remaining time for software defined networking flow tables

Software defined networking is a modern paradigm that divides the control plane from the data plane for improved network manageability. A flow table in the data plane has limited and expensive memory called TCAM. The presence of unwanted flow rules would lead to flow bloat conditions and make the lookup operation inefficient. Eviction schemes based on LRU policy have been widely studied in the literature which preempts the life of the least recently used flow rule and reduces the occupancy of the flow table. LRU considers the past behavior for the eviction of a flow rule. This paper proposes a novel policy that preempts a flow rule by considering its future characteristic, the shortest remaining time (SRT). A rule with a higher probability of being used is avoided from eviction to mitigate the degradation of performance. The modeling of the SRT technique exhibits better utilization of a flow rule that has higher probability of being used. On the other hand, LRU does not guarantee that the evicted flow rule will not be used frequently in the future and it has been shown that an incorrectly evicted flow rule incurs controller delay. The experimental results show that for different traffic rates, SRT has reduced the delay by 15%, reinstallation count by 25%, and jitter by 40%. SRT has increased utilization by 22% compared to LRU. This paper introduces a novel eviction policy called shortest remaining time (SRT) for flow tables in software-defined networking, prioritizing flow rule removal based on future usage characteristics to improve network efficiency. Experimental results demonstrate that SRT reduces delay by 15%, reinstallation count by 25%, and jitter by 40%, while increasing utilization by 22% compared to the traditional LRU policy. image