The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Penghala Internet perlu mengklasifikasikan paket masuk dengan cepat ke dalam aliran untuk menyokong ciri seperti keselamatan Internet, rangkaian peribadi maya dan Kualiti Perkhidmatan (QoS). Pengelasan paket menggunakan maklumat yang terkandung dalam pengepala paket, dan jadual peraturan yang telah ditetapkan dalam penghala. Klasifikasi paket pelbagai medan secara amnya merupakan masalah yang sukar. Oleh itu, penyelidik telah mencadangkan pelbagai algoritma. Kajian ini mencadangkan kaedah pengekodan pelbagai dimensi di mana parameter seperti alamat IP sumber, alamat IP destinasi, port sumber, port destinasi dan jenis protokol diletakkan dalam ruang berbilang dimensi. Sama seperti algoritma yang paling terkenal sebelum ini, iaitu, persilangan peta bit, pengekodan berbilang dimensi adalah berdasarkan pendekatan carian julat berbilang dimensi, di mana peraturan dibahagikan kepada beberapa set peraturan bebas perlanggaran berbilang dimensi. Set ini kemudiannya digunakan untuk membentuk vektor pengekodan baharu untuk menggantikan vektor bit algoritma persilangan peta bit. Purata storan memori pengekodan ini ialah θ (L
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Salinan
Chi Jia HUANG, Chien CHEN, "Fast Packet Classification Using Multi-Dimensional Encoding" in IEICE TRANSACTIONS on Communications,
vol. E92-B, no. 6, pp. 2044-2053, June 2009, doi: 10.1587/transcom.E92.B.2044.
Abstract: Internet routers need to classify incoming packets quickly into flows in order to support features such as Internet security, virtual private networks and Quality of Service (QoS). Packet classification uses information contained in the packet header, and a predefined rule table in the routers. Packet classification of multiple fields is generally a difficult problem. Hence, researchers have proposed various algorithms. This study proposes a multi-dimensional encoding method in which parameters such as the source IP address, destination IP address, source port, destination port and protocol type are placed in a multi-dimensional space. Similar to the previously best known algorithm, i.e., bitmap intersection, multi-dimensional encoding is based on the multi-dimensional range lookup approach, in which rules are divided into several multi-dimensional collision-free rule sets. These sets are then used to form the new coding vector to replace the bit vector of the bitmap intersection algorithm. The average memory storage of this encoding is θ (L
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E92.B.2044/_p
Salinan
@ARTICLE{e92-b_6_2044,
author={Chi Jia HUANG, Chien CHEN, },
journal={IEICE TRANSACTIONS on Communications},
title={Fast Packet Classification Using Multi-Dimensional Encoding},
year={2009},
volume={E92-B},
number={6},
pages={2044-2053},
abstract={Internet routers need to classify incoming packets quickly into flows in order to support features such as Internet security, virtual private networks and Quality of Service (QoS). Packet classification uses information contained in the packet header, and a predefined rule table in the routers. Packet classification of multiple fields is generally a difficult problem. Hence, researchers have proposed various algorithms. This study proposes a multi-dimensional encoding method in which parameters such as the source IP address, destination IP address, source port, destination port and protocol type are placed in a multi-dimensional space. Similar to the previously best known algorithm, i.e., bitmap intersection, multi-dimensional encoding is based on the multi-dimensional range lookup approach, in which rules are divided into several multi-dimensional collision-free rule sets. These sets are then used to form the new coding vector to replace the bit vector of the bitmap intersection algorithm. The average memory storage of this encoding is θ (L
keywords={},
doi={10.1587/transcom.E92.B.2044},
ISSN={1745-1345},
month={June},}
Salinan
TY - JOUR
TI - Fast Packet Classification Using Multi-Dimensional Encoding
T2 - IEICE TRANSACTIONS on Communications
SP - 2044
EP - 2053
AU - Chi Jia HUANG
AU - Chien CHEN
PY - 2009
DO - 10.1587/transcom.E92.B.2044
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E92-B
IS - 6
JA - IEICE TRANSACTIONS on Communications
Y1 - June 2009
AB - Internet routers need to classify incoming packets quickly into flows in order to support features such as Internet security, virtual private networks and Quality of Service (QoS). Packet classification uses information contained in the packet header, and a predefined rule table in the routers. Packet classification of multiple fields is generally a difficult problem. Hence, researchers have proposed various algorithms. This study proposes a multi-dimensional encoding method in which parameters such as the source IP address, destination IP address, source port, destination port and protocol type are placed in a multi-dimensional space. Similar to the previously best known algorithm, i.e., bitmap intersection, multi-dimensional encoding is based on the multi-dimensional range lookup approach, in which rules are divided into several multi-dimensional collision-free rule sets. These sets are then used to form the new coding vector to replace the bit vector of the bitmap intersection algorithm. The average memory storage of this encoding is θ (L
ER -