Dynamic Algorithms with Worst-Case Performance for Packet Classification
Networking(2000)
摘要
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.
更多查看译文
关键词
update time,incoming packet,packet classification algorithm,storage requirement,packet classification,new simple dynamic classification,worst-case performance,dynamic algorithms,query time,highest priority rule,general classifier,classification rule
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络