Loading [a11y]/accessibility-menu.js
Data structures for one-dimensional packet classification using most-specific-rule matching | IEEE Conference Publication | IEEE Xplore

Data structures for one-dimensional packet classification using most-specific-rule matching


Abstract:

We review the data structures that have been proposed for one-dimensional packet classification. Our review is limited to data structures for the case when ties among the...Show More

Abstract:

We review the data structures that have been proposed for one-dimensional packet classification. Our review is limited to data structures for the case when ties among the rules that match an incoming packet are broken by selecting the matching rule that is most specific. For the case when the rule filters are destination-address prefixes or are nonintersecting ranges, this tie breaker corresponds to longest-prefix or shortest-range matching, respectively. When the rule filters are arbitrary ranges, this tie breaker resolves the tie only when the rule set is conflict free. Data structures for both static and dynamic rule tables are discussed.
Date of Conference: 22-24 May 2002
Date Added to IEEE Xplore: 07 August 2002
Print ISBN:0-7695-1579-7
Print ISSN: 1087-4089
Conference Location: Makati City, Philippines

Contact IEEE to Subscribe

References

References is not available for this document.