Publications

Abstract : In OpenFlow switch, a limited number of row entries can be stored in the flow table, to the maximum of its capacity. Once its maximum capacity is reached, one has to remove one of the entries to accommodate the new entry. This paper proposes a mechanism to remove the entry from the flow table of OpenFlow switch, which uses the combination of less frequently used and least recently used. Removed entries are stored in a separate cache memory. Since OpenFlow switch has multiple row table, any one of the tables can be utilized for this approach. Instead of approaching the controller for every new packet, the entry can be looked up in the cache table. For inserting any new entry into the flow table, it will be searched in the flow table. If it is not found in the flow table called as table miss. Then it can be searched in the cache table. The experimental results show that the proposed approach gives an average performance improvement (in terms of table miss) of 13.87% and 13.88% against LRU and LFU. This approach reduces the frequent interaction between OpenFlow switch and the controller. The experimental results also show that proposed approach reduces the controller interaction by 17% and 15% more than LRU and LFU approaches