Joint optimization of flow entry aggregation and routing selection in software defined wireless access networks

Abstract

Software Defined Wireless Access Networks (SD-WAN) produce large amounts of traffic, which has caused limited flow table space in the TCAM. To solve the issue, this paper enables routing to overlap as many as possible with a minimum transmission delay, and thus traffic can be allocated to common paths to achieve flow entry aggregation. However, overlapping routing and traffic delay are two conflicting factors. An Integer Linear Program (ILP) is first proposed to minimize the total cost by tradeoff of the two factors. Through numerical experiments, this paper shows the effectiveness of the proposed method.