IEICE Technical Committee Submission System
Conference Paper's Information
Online Proceedings
[Sign in]
Tech. Rep. Archives
 Go Top Page Go Previous   [Japanese] / [English] 

Paper Abstract and Keywords
Presentation 2017-05-12 14:00
An RBT Decision Tree Construction for Sparse Rules
Takashi Harada, Ken Tanaka (Kanagawa Univ.), Kenji Mikawa (Niigata Univ.) COMP2017-2
Abstract (in Japanese) (See Japanese page) 
(in English) Packet classification problem is to determine the highest priority rule that matches with an incoming packet in a networking equipment among all the filtering rules implementing a packet classification policy. Since the number of rules $n$ in a rule list tends to increase, it is necessary to develop an algorithm to find the highest priority rule independent of $n$. Thus we proposed a data structure Run-Based Trie (RBT) and a classification algorithm using decision tree constructed on RBT[1],[2]. The decision tree classification method is independent of $n$. However, a space complexity of the decision tree is exponential order $O(n^{w})$ with $n$ rules of length $w$. Even for Rules with $w geq 18$ and sparse rules generated by ClassBench[3] the decision tree has not been constructed. In this paper, we propose a novel decision tree construction method that does not construct unnecessary nodes by referencing runs matched through the root node to a node $v$ when constructing a child node of $v$. The proposed method can construct the decision tree for sparse rules generated by ClassBench.
Keyword (in Japanese) (See Japanese page) 
(in English) packet classification / trie / decision tree / arbitrary bitmask / / / /  
Reference Info. IEICE Tech. Rep., vol. 117, no. 28, COMP2017-2, pp. 9-15, May 2017.
Paper # COMP2017-2 
Date of Issue 2017-05-05 (COMP) 
ISSN Print edition: ISSN 0913-5685    Online edition: ISSN 2432-6380
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 COMP2017-2

Conference Information
Committee COMP IPSJ-AL  
Conference Date 2017-05-12 - 2017-05-13 
Place (in Japanese) (See Japanese page) 
Place (in English)  
Topics (in Japanese) (See Japanese page) 
Topics (in English)  
Paper Information
Registration To COMP 
Conference Code 2017-05-COMP-AL 
Language Japanese 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) An RBT Decision Tree Construction for Sparse Rules 
Sub Title (in English)  
Keyword(1) packet classification  
Keyword(2) trie  
Keyword(3) decision tree  
Keyword(4) arbitrary bitmask  
1st Author's Name Takashi Harada  
1st Author's Affiliation Kanagawa University (Kanagawa Univ.)
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 Author-1 
Date Time 2017-05-12 14:00:00 
Presentation Time 30 minutes 
Registration for COMP 
Paper # COMP2017-2 
Volume (vol) vol.117 
Number (no) no.28 
Page pp.9-15 
Date of Issue 2017-05-05 (COMP) 

[Return to Top Page]

[Return to IEICE Web Page]

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