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

DOI10.1142/S0129054103001777zbMath1101.68497OpenAlexW2061687419MaRDI QIDQ5696913

Kun Suk Kim, Haibin Lu, Sartaj K. 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

packet routingpacket classificationconflict-free rangeslongest-prefix matchingmost-specific-range matchingrouter tablesstatic and dynamic rule tables

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (1)

An (Almost) Optimal Solution for Orthogonal Point Enclosure Query in ℝ³

Cites Work

• Priority Search Trees

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