Please use this identifier to cite or link to this item: http://hdl.handle.net/11455/36530
標題: Scalable packet classification for enabling Internet differentiated services
作者: Wang, P.C.
王丕中
Chan, C.T.
Lee, C.L.
Chang, H.Y.
關鍵字: best matching prefix
multicast
multidimensional range lookup
packet
classification
routers
lookup
期刊/報告no:: Ieee Transactions on Multimedia, Volume 8, Issue 6, Page(s) 1239-1249.
摘要: Nowadays, IP networks are rapidly evolving toward a QoS-enabled infrastructure. The need for packet classification is increasing in accordance with emerging differentiated services. While the new differentiated services could significantly increase the number of rules, it has been demonstrated that performing packet classification on a potentially large number of rules is difficult and has poor worst-case performance. In this work, we present an enhanced tuple pruning search algorithm called "Tuple Pruning Plus" (TPP) for packet classification, which outperforms the existing schemes on the scalability. Our main idea is to simplify the lookup procedure and to avoid unnecessary tuple probing by maintaining the least-cost property of rule through precomputation and the proposed Information Marker. With extra rules added for In,formation Marker, only one tuple access is required in each packet classification. In our experiments, 70 MB DRAM is used to achieve 50 million packets per second (MPPS) for a 1 M-rule set, showing a performance improvement by a factor of 50. We also present a heuristic to further reduce the required storage to about 20 MB. These results demonstrate the effectiveness of the TPP scheme to achieve high speed packet classification.
URI: http://hdl.handle.net/11455/36530
ISSN: 1520-9210
文章連結: http://dx.doi.org/10.1109/tmm.2006.884610
Appears in Collections:資訊網路與多媒體研究所

文件中的檔案:

取得全文請前往華藝線上圖書館



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.