IEICE Technical Committee Submission System
Conference Paper's Information
Online Proceedings
[Sign in]
... (for ESS/CS/ES/ISS)
Tech. Rep. Archives
... (for ES/CS)
 Go Top Page Go Previous   [Japanese] / [English] 

Paper Abstract and Keywords
Presentation 2019-12-13 14:10
Computational Complexity of Relaxed Optimal Rule Ordering
Takashi Harada (Kochi Univ. of Tech.), Ken Tanaka (Kanagawa Univ.), Kenji Mikawa (Niigata Univ.) COMP2019-36
Abstract (in Japanese) (See Japanese page) 
(in English) The packet classification aims to determine the behavior of the incoming packets of network devices. The linear search classification algorithm assigns prior action to each packet according to the classification policy. This is accomplished by comparing the packet header with classification rules until a match is found. As the processing latency of packet classification is proportional to the number of rules, a large number of rules can result in serious communication latency. To resolve this problem, the packet classification is generalized as optimal rule ordering (ORO), which aims to identify the rule ordering that minimizes the latency caused as a result of packet classification. If two different rules in the rule list match the same packet, interchanging those rules may cause policy violation. Thus, most studies on ORO do not allow the posterior rule to be placed at a position higher than that of the prior rule. However, there exist cases wherein interchanging such rules do not violate the policy. Herein, we will consider the relaxed ORO (RORO) problem wherein some rules that are not interchangeable in conventional ORO can still be interchanged. We prove that the decision problem corresponding to RORO is NP-hard. This result demonstrates the difficulties associated with optimal packet classification and the requirements of heuristics for RORO.
Keyword (in Japanese) (See Japanese page) 
(in English) packet classification / dependent rules / rule ordering / NP-hard / / / /  
Reference Info. IEICE Tech. Rep., vol. 119, no. 340, COMP2019-36, pp. 47-54, Dec. 2019.
Paper # COMP2019-36 
Date of Issue 2019-12-06 (COMP) 
ISSN Print edition: ISSN 0913-5685  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. (No. 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)
Download PDF COMP2019-36

Conference Information
Committee COMP  
Conference Date 2019-12-13 - 2019-12-13 
Place (in Japanese) (See Japanese page) 
Place (in English) Ikaho Seminar House, Gunma University 
Topics (in Japanese) (See Japanese page) 
Topics (in English)  
Paper Information
Registration To COMP 
Conference Code 2019-12-COMP 
Language English 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) Computational Complexity of Relaxed Optimal Rule Ordering 
Sub Title (in English)  
Keyword(1) packet classification  
Keyword(2) dependent rules  
Keyword(3) rule ordering  
Keyword(4) NP-hard  
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 Kenji Mikawa  
3rd Author's Affiliation Niigata University (Niigata Univ.)
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
Date Time 2019-12-13 14:10:00 
Presentation Time 25 
Registration for COMP 
Paper # IEICE-COMP2019-36 
Volume (vol) IEICE-119 
Number (no) no.340 
Page pp.47-54 
#Pages IEICE-8 
Date of Issue IEICE-COMP-2019-12-06 


[Return to Top Page]

[Return to IEICE Web Page]


The Institute of Electronics, Information and Communication Engineers (IEICE), Japan