Taming large classifiers with rule reference locality

Hyogon Kim, Jaesung Heo, Lynn Choi, Inhye Kang, Sunil Kim

Research output: Contribution to journalArticle

Abstract

An important aspect of packet classification problem on which little light has been shed so far is the rule reference dynamics. In this paper, we argue that for any given classifier, there is likely a significant skew in the rule reference pattern. We term such phenomenon rule reference locality, which we believe stems from biased traffic pattern and/or the existence of "super-rules" that cover a large subset of the rule hyperspace. Based on the observation, we propose an adaptive classification approach that dynamically accommodates the skewed and possibly time-varying reference pattern. It is not a new classification method per se, but it can effectively enhance existing packet classification schemes, especially for large classifiers. As an instance, we present a new classification method called segmented RFC with dynamic rule base reconfiguration (SRFC+DR). When driven by several large real-life packet traces, it yields a several-fold speedup for 5-field 100K-rule classification as compared with another scalable method ABV. In general, we believe exploiting the rule reference locality is a key to scaling to a very large number of rules in future packet classifiers.

Original languageEnglish
Pages (from-to)928-937
Number of pages10
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2662
Publication statusPublished - 2003 Dec 1

Fingerprint

Locality
Classifiers
Classifier
Hyperspace
Rule Base
Classification Rules
Reconfiguration
Classification Problems
Skew
Biased
Observation
Time-varying
Speedup
Fold
Likely
Trace
Traffic
Scaling
Cover
Subset

ASJC Scopus subject areas

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

Cite this

@article{c9c1b0a7473741adb1169c7cae470326,
title = "Taming large classifiers with rule reference locality",
abstract = "An important aspect of packet classification problem on which little light has been shed so far is the rule reference dynamics. In this paper, we argue that for any given classifier, there is likely a significant skew in the rule reference pattern. We term such phenomenon rule reference locality, which we believe stems from biased traffic pattern and/or the existence of {"}super-rules{"} that cover a large subset of the rule hyperspace. Based on the observation, we propose an adaptive classification approach that dynamically accommodates the skewed and possibly time-varying reference pattern. It is not a new classification method per se, but it can effectively enhance existing packet classification schemes, especially for large classifiers. As an instance, we present a new classification method called segmented RFC with dynamic rule base reconfiguration (SRFC+DR). When driven by several large real-life packet traces, it yields a several-fold speedup for 5-field 100K-rule classification as compared with another scalable method ABV. In general, we believe exploiting the rule reference locality is a key to scaling to a very large number of rules in future packet classifiers.",
author = "Hyogon Kim and Jaesung Heo and Lynn Choi and Inhye Kang and Sunil Kim",
year = "2003",
month = "12",
day = "1",
language = "English",
volume = "2662",
pages = "928--937",
journal = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
issn = "0302-9743",
publisher = "Springer Verlag",

}

TY - JOUR

T1 - Taming large classifiers with rule reference locality

AU - Kim, Hyogon

AU - Heo, Jaesung

AU - Choi, Lynn

AU - Kang, Inhye

AU - Kim, Sunil

PY - 2003/12/1

Y1 - 2003/12/1

N2 - An important aspect of packet classification problem on which little light has been shed so far is the rule reference dynamics. In this paper, we argue that for any given classifier, there is likely a significant skew in the rule reference pattern. We term such phenomenon rule reference locality, which we believe stems from biased traffic pattern and/or the existence of "super-rules" that cover a large subset of the rule hyperspace. Based on the observation, we propose an adaptive classification approach that dynamically accommodates the skewed and possibly time-varying reference pattern. It is not a new classification method per se, but it can effectively enhance existing packet classification schemes, especially for large classifiers. As an instance, we present a new classification method called segmented RFC with dynamic rule base reconfiguration (SRFC+DR). When driven by several large real-life packet traces, it yields a several-fold speedup for 5-field 100K-rule classification as compared with another scalable method ABV. In general, we believe exploiting the rule reference locality is a key to scaling to a very large number of rules in future packet classifiers.

AB - An important aspect of packet classification problem on which little light has been shed so far is the rule reference dynamics. In this paper, we argue that for any given classifier, there is likely a significant skew in the rule reference pattern. We term such phenomenon rule reference locality, which we believe stems from biased traffic pattern and/or the existence of "super-rules" that cover a large subset of the rule hyperspace. Based on the observation, we propose an adaptive classification approach that dynamically accommodates the skewed and possibly time-varying reference pattern. It is not a new classification method per se, but it can effectively enhance existing packet classification schemes, especially for large classifiers. As an instance, we present a new classification method called segmented RFC with dynamic rule base reconfiguration (SRFC+DR). When driven by several large real-life packet traces, it yields a several-fold speedup for 5-field 100K-rule classification as compared with another scalable method ABV. In general, we believe exploiting the rule reference locality is a key to scaling to a very large number of rules in future packet classifiers.

UR - http://www.scopus.com/inward/record.url?scp=35248844497&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=35248844497&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:35248844497

VL - 2662

SP - 928

EP - 937

JO - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

JF - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SN - 0302-9743

ER -