Leveraging Parallelism for Multi-dimensional Packet Classification on Software Routers

被引:2
作者
Ma, Yadi [1 ]
Banerjee, Suman [1 ]
Lu, Shan [1 ]
Estan, Cristian
机构
[1] Univ Wisconsin, Madison, WI 53715 USA
来源
SIGMETRICS 2010: PROCEEDINGS OF THE 2010 ACM SIGMETRICS INTERNATIONAL CONFERENCE ON MEASUREMENT AND MODELING OF COMPUTER SYSTEMS | 2010年 / 38卷 / 01期
关键词
Packet classification; Storm; parallelism;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We present a software-based solution to the multi-dimensional packet classification problem which can operate at high line speeds; e.g., in excess of 10 Gbps, using high-end multicore desktop platforms available today. Our solution, called Storm, leverages a common notion that a subset of rules are likely to be popular over short durations of time. By identifying a suitable set of popular rules one can significantly speed up existing software-based classification algorithms. A key aspect of our design is in partitioning processor resources into various relevant tasks, such as continuously computing the popular rules based on a sampled subset of traffic, fast classification for traffic that matches popular rules, dealing with packets that do not match the most popular rules, and traffic sampling. Our results show that by using a single 8-core Xeon processor desktop platform, it is possible to sustain classification rates of more than 15 Gbps for representative rule sets of size in excess of 5-dimensional 9000 rules, with no packet losses. This performance is significantly superior to a 8-way implementation of a state-of-the-art packet classification software system running on the same 8-core machine. Therefore, we believe that our design of packet classification functions can be a useful classification building block for Route Bricks-style designs, where a core router might be constructed as a mesh of regular desktop machines.
引用
收藏
页码:227 / 238
页数:12
相关论文
共 18 条
[11]  
Morris R, 1999, OPERATING SYSTEMS REVIEW, VOL 33, NO 5, DECEMBER 1999, P217, DOI 10.1145/319344.319166
[12]  
NETWORKS C, OCTEON NETWORK SERVI
[13]   Range searching and point location among fat objects [J].
Overmars, MH ;
vanderStappen, AF .
JOURNAL OF ALGORITHMS, 1996, 21 (03) :629-656
[14]  
Qi Y., 2009, IEEE INFOCOM
[15]  
Singh S., 2003, ACM SIGCOMM COMP COM, P213, DOI DOI 10.1145/863955.863980
[16]  
Srinivasan V, 1999, COMP COMM R, V29, P135, DOI 10.1145/316194.316216
[17]  
Taylor D., CLASSBENCH PACKET CL
[18]  
Woo T. Y. C., 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064), P1213, DOI 10.1109/INFCOM.2000.832499