TU Berlin

Internet Network ArchitecturesAidan Walton's Publications

Page Content

to Navigation

Aidan Walton's Publications

Tradeoffs for packet classification
Citation key FM-TPC-00
Author Feldmann, Anja and Muthukrishnan, S.
Title of Book INFOCOM 2000: Proceedings of the Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies
Pages 1193–1202
Year 2000
ISBN 0-7803-5880-5
DOI http://dx.doi.org/10.1109/INFCOM.2000.832493
Location Tel Aviv, Israel
Volume 3
Month March
Abstract We present an algorithmic framework for solving the packet classification problem that allows various access time vs. memory tradeoffs. It reduces the multi-dimensional packet classification problem to solving a few instances of the one-dimensional IP lookup problem. It gives the best known lookup performance with moderately large memory space. Furthermore, it efficiently supports a reasonable number of additions and deletions to the rulesets without degrading the lookup performance. We perform a thorough experimental study of the tradeoffs for the two-dimensional packet classification problem on rulesets derived from datasets collected from AT\&T WorldNet, an Internet Service Provider.
Link to publication Download Bibtex entry


Quick Access

Schnellnavigation zur Seite über Nummerneingabe