Abstract
Packet classification involves — given a set of rules — finding the highest priority rule matching an incoming packet. When designing packet classification algorithms, three metrics need to be considered: query time, update time and storage requirements. The algorithms proposed to-date have been heuristics that exploit structure inherent in the classification rules, and/or trade off one or more metrics for others. In this paper, we describe two new simple dynamic classification algorithms, Heap-on-Trie or HoT and Binarysearchtree-on-Trie or BoT for general classifiers. The performance of these algorithms is considered in the worst-case, i.e., without assumptions about structure in the classification rules. They are also designed to perform well (though not necessarily the “best”) in each of the metrics simultaneously.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Cisco Systems white paper, “Advanced qos services for the intelligent internet,” http://www.cisco.com/warp/public/cc/cisco/mkt/ios/qos/tech/qos_wp.htm.
T. V. Lakshman and D. Stiliadis, “High-speed policy-based packet forwarding using efficient multi-dimensional range matching,” in Proceedings of ACM SIGCOMM, Sept. 1998, pp. 191–202.
V. Srinivasan, G. Varghese, S. Suri, and M. Waldvogel, “Scalable level 4 switching and fast firewall processing,” in Proceedings of ACM SIGCOMM, Sept. 1998, pp. 203–214.
P. Gupta and N. McKeown, “Packet classification on multiple fields,” in Proceedings of ACM SIGCOMM, Sept. 1999, pp. 147–160.
D. Decasper, Z. Dittia, G. Parulkar, and B. Plattner, “Router plugins: A software architecture for next generation routers,” in Proceedings of ACM SIGCOMM, Sept. 1998, pp. 229–240.
P. Gupta and N. McKeown, “Packet classification using hierarchical intelligent cuttings,” Hot Interconnects VII, Aug. 1999.
V. Srinivasan, G. Varghese, and S. Suri, “Fast packet classification using tuple space search,” in Proceedings of ACM SIGCOMM, Sept. 1999, pp. 135–146.
M. M. Buddhikot, S. Suri, and M. Waldvogel, “Space decomposition techniques for fast layer-4 switching,” Protocols for High Speed Networks, vol. 66, no. 6, pp. 277–283, Aug. 1999.
A. Feldmann and S. Muthukrishnan, “Tradeoffs for Packet Classification,” in Proceedings of INFOCOM, Mar. 2000.
W. Doeringer, G. Karjoth, and M. Nassehi, “Routing on longest-matching prefixes,” IEEE/ACM Transactions on Networking, vol. 4, no. 1, pp. 86–97, Feb. 1996.
K. Mehlhorn and S. Naher, “Dynamic fractional cascading,” Algorithmica, vol. 5, pp. 215–241, 1990.
L. J. Guibas, “Private communication,”.
T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms, McGraw-Hill, 1990.
A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gupta, P., McKeown, N. (2000). Dynamic Algorithms with Worst-Case Performance for Packet Classification. In: Pujolle, G., Perros, H., Fdida, S., Körner, U., Stavrakakis, I. (eds) Networking 2000 Broadband Communications, High Performance Networking, and Performance of Communication Networks. NETWORKING 2000. Lecture Notes in Computer Science, vol 1815. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45551-5_45
Download citation
DOI: https://doi.org/10.1007/3-540-45551-5_45
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67506-8
Online ISBN: 978-3-540-45551-6
eBook Packages: Springer Book Archive