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

DOI10.1007/3-540-45655-4_2MaRDI QIDQ4808616zbMATH OpenFDO

Authors Sartaj Sahni

Publication date 12 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2387/23870002.htm

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Data Structures for One-Dimensional Packet Classification Using Most-Specific-Rule Matching
• 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

Cited in

(3)

• Two-dimensional packet classification and filter conflict resolution in the internet
• Two stage packet classification using most specific filter matching and transport level sharing
• Data Structures for One-Dimensional Packet Classification Using Most-Specific-Rule Matching

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 Q4808616)