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
Les routeurs Internet doivent classer rapidement les paquets entrants en flux afin de prendre en charge des fonctionnalités telles que la sécurité Internet, les réseaux privés virtuels et la qualité de service (QoS). La classification des paquets utilise les informations contenues dans l'en-tête du paquet et une table de règles prédéfinies dans les routeurs. La classification des paquets de plusieurs champs est généralement un problème difficile. Les chercheurs ont donc proposé différents algorithmes. Cette étude propose une méthode de codage multidimensionnelle dans laquelle des paramètres tels que l'adresse IP source, l'adresse IP de destination, le port source, le port de destination et le type de protocole sont placés dans un espace multidimensionnel. Semblable à l'algorithme le plus connu, à savoir l'intersection de bitmaps, le codage multidimensionnel est basé sur l'approche de recherche de plage multidimensionnelle, dans laquelle les règles sont divisées en plusieurs ensembles de règles multidimensionnelles sans collision. Ces ensembles sont ensuite utilisés pour former le nouveau vecteur de codage destiné à remplacer le vecteur binaire de l'algorithme d'intersection bitmap. Le stockage mémoire moyen de cet encodage est θ (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.
Copier
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
Copier
@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},}
Copier
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 -