Abstract
Quality of service (QoS) is an imperative feature by must newly emerging applications. The first step to provide QoS is to distinguish packets into different data flows, called packet classification. There are many algorithms in multi-dimensional packet classification. Among those algorithms, we can see the tradeoffs between lookup speeds, memory consumption, and update time. In this paper, we proposed a fast algorithm for two-dimensional lookup in tuple space to deal with conflict-free filters. It can achieve O(log w) lookup time while maintaining O(nlog w) memory consumption.
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.
