Design and implementation of a parameter filter based on virtual bounding rectangles

Masatoshi Kakiuchi, Naoto Morishima, Hideki Sunahara

Research output: Contribution to journalArticle

1 Citation (Scopus)

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 languageEnglish
Pages (from-to)92-103
Number of pages12
JournalSystems and Computers in Japan
Volume38
Issue number13
DOIs
Publication statusPublished - 2007 Nov 30
Externally publishedYes

Fingerprint

Rectangle
R-tree
Filter
Routers
Search Trees
Router
Search Methods
Search Algorithm
Accelerate
Processing
High Speed
Design

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 journalArticle

@article{c75388438e184e08bf55bceea007da34,
title = "Design and implementation of a parameter filter based on virtual bounding rectangles",
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.",
keywords = "Access list, Packet classification, Parameter filter, QoS",
author = "Masatoshi Kakiuchi and Naoto Morishima and Hideki Sunahara",
year = "2007",
month = "11",
day = "30",
doi = "10.1002/scj.20287",
language = "English",
volume = "38",
pages = "92--103",
journal = "Systems and Computers in Japan",
issn = "0882-1666",
publisher = "John Wiley and Sons Inc.",
number = "13",

}

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

VL - 38

SP - 92

EP - 103

JO - Systems and Computers in Japan

JF - Systems and Computers in Japan

SN - 0882-1666

IS - 13

ER -