Abstract
Ternary Content Addressable Memory (TCAM) capacity problem is an important issue in Software-Defined Networking. Rule caching is an efficient technique to solve the TCAM capacity problem. However, there exists rule dependency problem in wildcard-rule caching technique. In this paper, we utilize cover-set method to solve the rule dependency problem and propose a wildcard-rule caching algorithm to cache rules into TCAM. In addition, we also propose a cache replacement algorithm considering both temporal and spatial localities. According to the simulation results, our wildcard-rule caching algorithm and cache replacement algorithm have better performance than previous works in terms of caching ratio and hit ratio, respectively.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
