Data Structures for One-Dimensional Packet Classification Using Most-Specific-Rule Matching

DOI10.1142/S0129054103001777MaRDI QIDQ5696913zbMATH OpenOpenAlexFDO

Authors Kun Suk Kim, Haibin Lu, Sartaj Sahni

Publication date 19 October 2005

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129054103001777

zbMATH Keywords

conflict-free rangeslongest-prefix matchingmost-specific-range matchingpacket classificationpacket routingrouter tablesstatic and dynamic rule tables

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• scientific article; zbMATH DE number 2089954
• Two stage packet classification using most specific filter matching and transport level sharing
• Fast packet classification for two-dimensional conflict-free filters
• Two-dimensional packet classification and filter conflict resolution in the internet
• Internet packet filter management and rectangle geometry

Cites work

• Priority Search Trees

Cited in

(4)

• Two-dimensional packet classification and filter conflict resolution in the internet
• Two stage packet classification using most specific filter matching and transport level sharing
• scientific article; zbMATH DE number 2089954 (Why is no real title available?)
• An (Almost) Optimal Solution for Orthogonal Point Enclosure Query in ℝ³

This page was built for publication: Data Structures for One-Dimensional Packet Classification Using Most-Specific-Rule Matching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5696913)