Fast diagonal packet classification on tuple space - dealing with conflict free filters
Personal, Indoor and Mobile Radio Communications, 2003. PIMRC 2003. 14th IEEE Proceedings(2003)
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.
MoreTranslated text
Key words
quality of service,QoS,conflict-free filters,fast diagonal packet classification,lookup speeds,memory consumption,multidimensional packet classification,quality of service,tuple space,update time
AI Read Science
Must-Reading Tree
Example
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined