arrow
返回

CARR: a scalable solution for network packet classification

delete2010-12-01
delete0
PRE
AI
W
Wei Li *
W
Weibin Zheng
J
Juanjuan Lin
X
Xiaohong Guan
L
Ling Li
S
Sohail S. Chaudhry
P
Pan Wang
L
Liu, Yanping
DOI:10.1111/j.1468-0394.2010.00563.xdelete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Modern Internet routers have to handle a large number of packet classification rules, which requires classification schemes to be scalable both in time and space. In this paper, we present a scalable packet classification algorithm that is developed by combining two new concepts to the well-known bit vector (BV) scheme. We propose a range search method based on a cache-aware tree (CATree) which makes full use of processor's cache line to reduce the number of dynamic random access memory (DRAM) accesses. Theoretically, the number of DRAM accesses of CATree is about log(m + 1) times lower than that of the widely used binary search algorithm, where m is the number of keys in a single cache line. Based on our computational results on a set of 1024 keys, the CATree algorithm is 36% faster than binary search algorithm and the performance is better when applied to a larger set of keys. In addition, we develop a rule re-arrangement algorithm to reduce the bitmap space of BV. With this rearrangement, the rules for the same action may be assigned an identical priority. This reduces the number of priorities as well as the memory space of the bitmap. Furthermore, this also reduces the number of memory accesses and hence, increases the CPU cache utilization. With CATree and rule re-arrangement, the cache-aware bit vector with rule re-arrangement algorithm achieves better performance in comparison with the regular BV scheme, both in space and time. In our experiments, the proposed algorithm reduces the bitmap memory space of a practical set of firewall rules by two orders of magnitude and is 91% faster than the regular BV.
Keyword:
packet classification
cache-utilization tree
binary search algorithm
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Expert Systems 封面图
Expert Systems
IF:
2.3
论文数:
2.6K
被引数:
3.8K

机构

B
Beijing Jiaotong University
学者数:
2.2W
论文数: 1.7W
被引数: 1.2W
X
xi'an jiaotong university
学者数:
9.3W
论文数: 6.7W
被引数: 75
V
Villanova University
学者数:
2.4K
论文数: 2.6K
被引数: 3.9K
W
Wuhan University of Technology
学者数:
3.4W
论文数: 2.4W
被引数: 4.4W
学者 查看更多机构
引用论文

引用论文

Topic Propagation in Conversational Search对话搜索中的主题传播
err2020-07-25
err0
errOAAI
errIda Mele; Cristina Ioana Muntean; Franco Maria Nardini; Raffaele Perego; Nicola Tonellotto; Ophir Frieder
err分享
err收藏
Fall detectors: a review of the literature
err2012-09-07
err0
errOAAI
errGillian Ward; Nikki Holliday; Simon Fielden; Sue Williams
err分享
err收藏
Electronic supply chain management applications by Swedish SMEs
err2007-05-01
err35
errOAAI
errBeheshti, H. M.; Hultman, M.; Jung, M. -L.; Opoku, R. A.; Salehi-Sangari, E.
err分享
err收藏
Hetarenium salts from pentafluoropyridine. Syntheses, spectroscopic properties, and applications
err2009-03-13
err0
PREAI
errAndreas Schmidt; Thorsten Mordhorst; Jan Christoph Namyslo; Werner Telle
err分享
err收藏
IP lookups using multiway and multicolumn search
err1999-06-01
err183
errOAAI
errLampson, B; Srinivasan, V; Varghese, G
err分享
err收藏
Norbornadiene complexes of transition metals
err1981-03-01
err0
PREAI
errA.A. Koridze; I.T. Chizhevsky; P.V. Petrovskii; E.I. Fedin; N.E. Kolobova; L.E. Vinogradova; L.A. Leites; V.G. Andrianov; Yu.T. Struchkov
err分享
err收藏
学者 查看更多内容