Abstract
In this paper, the authors propose a high-speed implementation of a parameter filter, using a multidimensional space search algorithm with the introduction of virtual bounding rectangles. The authors have proposed and implemented a KUPF architecture for the problem of packet classification reflecting the complex policies of a router. Because parameter filters generally have filters for multiple parameters, the conventional methods for increasing speed are not applicable to KUPF. R-tree and R*-tree, which construct a search tree using minimum bounding rectangles and accelerate the search, are known search methods for multidimensional spaces. Meanwhile, this proposal represents filter rules in multidimensional space with the introduction of virtual bounding rectangles, while normalizing differences in the properties of each parameter and applying an R*-tree. KUPF-VR, in which this proposal is implemented, had an improved search speed compared to conventional KUPF and was clearly superior in the case of a large number of filter rules, compared to methods specialized for IP packet processing.
| Original language | English |
|---|---|
| Pages (from-to) | 92-103 |
| Number of pages | 12 |
| Journal | Systems and Computers in Japan |
| Volume | 38 |
| Issue number | 13 |
| DOIs | |
| Publication status | Published - 2007 Nov 30 |
| Externally published | Yes |
Fingerprint
Keywords
- Access list
- Packet classification
- Parameter filter
- QoS
ASJC Scopus subject areas
- Hardware and Architecture
- Information Systems
- Theoretical Computer Science
- Computational Theory and Mathematics
Cite this
Design and implementation of a parameter filter based on virtual bounding rectangles. / Kakiuchi, Masatoshi; Morishima, Naoto; Sunahara, Hideki.
In: Systems and Computers in Japan, Vol. 38, No. 13, 30.11.2007, p. 92-103.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - Design and implementation of a parameter filter based on virtual bounding rectangles
AU - Kakiuchi, Masatoshi
AU - Morishima, Naoto
AU - Sunahara, Hideki
PY - 2007/11/30
Y1 - 2007/11/30
N2 - In this paper, the authors propose a high-speed implementation of a parameter filter, using a multidimensional space search algorithm with the introduction of virtual bounding rectangles. The authors have proposed and implemented a KUPF architecture for the problem of packet classification reflecting the complex policies of a router. Because parameter filters generally have filters for multiple parameters, the conventional methods for increasing speed are not applicable to KUPF. R-tree and R*-tree, which construct a search tree using minimum bounding rectangles and accelerate the search, are known search methods for multidimensional spaces. Meanwhile, this proposal represents filter rules in multidimensional space with the introduction of virtual bounding rectangles, while normalizing differences in the properties of each parameter and applying an R*-tree. KUPF-VR, in which this proposal is implemented, had an improved search speed compared to conventional KUPF and was clearly superior in the case of a large number of filter rules, compared to methods specialized for IP packet processing.
AB - In this paper, the authors propose a high-speed implementation of a parameter filter, using a multidimensional space search algorithm with the introduction of virtual bounding rectangles. The authors have proposed and implemented a KUPF architecture for the problem of packet classification reflecting the complex policies of a router. Because parameter filters generally have filters for multiple parameters, the conventional methods for increasing speed are not applicable to KUPF. R-tree and R*-tree, which construct a search tree using minimum bounding rectangles and accelerate the search, are known search methods for multidimensional spaces. Meanwhile, this proposal represents filter rules in multidimensional space with the introduction of virtual bounding rectangles, while normalizing differences in the properties of each parameter and applying an R*-tree. KUPF-VR, in which this proposal is implemented, had an improved search speed compared to conventional KUPF and was clearly superior in the case of a large number of filter rules, compared to methods specialized for IP packet processing.
KW - Access list
KW - Packet classification
KW - Parameter filter
KW - QoS
UR - http://www.scopus.com/inward/record.url?scp=35048842708&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=35048842708&partnerID=8YFLogxK
U2 - 10.1002/scj.20287
DO - 10.1002/scj.20287
M3 - Article
AN - SCOPUS:35048842708
VL - 38
SP - 92
EP - 103
JO - Systems and Computers in Japan
JF - Systems and Computers in Japan
SN - 0882-1666
IS - 13
ER -