Paper Abstract and Keywords |
Presentation |
2019-10-25 14:15
Computational Complexity of Whitelist Constructing Takashi Harada (Kochi Univ. of Tech.), Ken Tanaka (Kanagawa Univ.) COMP2019-23 |
Abstract |
(in Japanese) |
(See Japanese page) |
(in English) |
Packet classification is to classify packets arriving a network equipment according to the classification policy. It is achieved by linear search that compares packets with rules in the rule list representing the classification policy one by one. Linear search has the problem that the larger the number of rules becomes, the processing latency is increasing. This latency can be reduced when a lot of packets are evaluated at the top of the rule list. Therefore, in this article, we introduce the optimization problem called optimal white list constructing, that minimizes the latency caused by packet classification preserving the classification policy. Besides, we prove that the decision version of this optimization problem is NP-hard by reducing from the decision problem, ONSET TRUTH TABLE MIN SOP. This fact suggests that we should develop a heuristic algorithm instead of an exact algorithm for optimal white list constructing and investigate what property implies this hard problem is solvable in polynomial time. |
Keyword |
(in Japanese) |
(See Japanese page) |
(in English) |
packet classification / decision list / NP-hard / / / / / |
Reference Info. |
IEICE Tech. Rep., vol. 119, no. 249, COMP2019-23, pp. 39-46, Oct. 2019. |
Paper # |
COMP2019-23 |
Date of Issue |
2019-10-18 (COMP) |
ISSN |
Online edition: ISSN 2432-6380 |
Copyright and reproduction |
All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034) |
Download PDF |
COMP2019-23 |
Conference Information |
Committee |
COMP |
Conference Date |
2019-10-25 - 2019-10-25 |
Place (in Japanese) |
(See Japanese page) |
Place (in English) |
Sapporo Campus, Hokkaido University |
Topics (in Japanese) |
(See Japanese page) |
Topics (in English) |
|
Paper Information |
Registration To |
COMP |
Conference Code |
2019-10-COMP |
Language |
Japanese |
Title (in Japanese) |
(See Japanese page) |
Sub Title (in Japanese) |
(See Japanese page) |
Title (in English) |
Computational Complexity of Whitelist Constructing |
Sub Title (in English) |
|
Keyword(1) |
packet classification |
Keyword(2) |
decision list |
Keyword(3) |
NP-hard |
Keyword(4) |
|
Keyword(5) |
|
Keyword(6) |
|
Keyword(7) |
|
Keyword(8) |
|
1st Author's Name |
Takashi Harada |
1st Author's Affiliation |
Kochi University of Technology (Kochi Univ. of Tech.) |
2nd Author's Name |
Ken Tanaka |
2nd Author's Affiliation |
Kanagawa University (Kanagawa Univ.) |
3rd Author's Name |
|
3rd Author's Affiliation |
() |
4th Author's Name |
|
4th Author's Affiliation |
() |
5th Author's Name |
|
5th Author's Affiliation |
() |
6th Author's Name |
|
6th Author's Affiliation |
() |
7th Author's Name |
|
7th Author's Affiliation |
() |
8th Author's Name |
|
8th Author's Affiliation |
() |
9th Author's Name |
|
9th Author's Affiliation |
() |
10th Author's Name |
|
10th Author's Affiliation |
() |
11th Author's Name |
|
11th Author's Affiliation |
() |
12th Author's Name |
|
12th Author's Affiliation |
() |
13th Author's Name |
|
13th Author's Affiliation |
() |
14th Author's Name |
|
14th Author's Affiliation |
() |
15th Author's Name |
|
15th Author's Affiliation |
() |
16th Author's Name |
|
16th Author's Affiliation |
() |
17th Author's Name |
|
17th Author's Affiliation |
() |
18th Author's Name |
|
18th Author's Affiliation |
() |
19th Author's Name |
|
19th Author's Affiliation |
() |
20th Author's Name |
|
20th Author's Affiliation |
() |
Speaker |
Author-1 |
Date Time |
2019-10-25 14:15:00 |
Presentation Time |
25 minutes |
Registration for |
COMP |
Paper # |
COMP2019-23 |
Volume (vol) |
vol.119 |
Number (no) |
no.249 |
Page |
pp.39-46 |
#Pages |
8 |
Date of Issue |
2019-10-18 (COMP) |
|