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 2015-11-06 09:50
A Pruning Method for the Decision Tree constructed on Run-Based Trie.
Takashi Harada, Ken Tanaka (Kanagawa Univ.), Kenji Mikawa (Niigata Univ.) ISEC2015-38 SITE2015-25 LOIS2015-32
Abstract (in Japanese) (See Japanese page) 
(in English) Packet classification is a fundamental process in the control of network traffic that protects inner net- works from cyber threats. It determines whether to permit or discard incoming packets by comparing their headers with every rule of a rulelists. In implementation of packet classification, since linear search to a given rule lists is inefficient, many packets classification algorithms have been proposed. Srinivasan et al. proposed a novel lookup scheme using a hierarchical trie, which realizes faster packet classification with time complexity propotional to rule length rather than the number of rules. However, the hierarchical trie and its various improved algorithms can treat only single prefix rules. Since it is necessary for layer 4 and higher packet classifications to deal with arbitrary bitmask rulese, we proposed a Run-Based Trie based on the hierarchical trie. However the decision tree constructed on Run-Based Trie contains a lot of unnecessary paths and need to a large amount of memory. In this paper, we propose a pruning method for the decision tree. This method focus on 5 points that cause the decision tree redundancies. Our proposed method reduce the memory to construct the decision tree up to 16 bits length.
Keyword (in Japanese) (See Japanese page) 
(in English) packet classification / trie / decision tree / arbitrary bitmask / / / /  
Reference Info. IEICE Tech. Rep., vol. 115, no. 294, SITE2015-25, pp. 11-17, Nov. 2015.
Paper # SITE2015-25 
Date of Issue 2015-10-30 (ISEC, SITE, LOIS) 
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. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)
Download PDF ISEC2015-38 SITE2015-25 LOIS2015-32

Conference Information
Committee LOIS ISEC SITE  
Conference Date 2015-11-06 - 2015-11-07 
Place (in Japanese) (See Japanese page) 
Place (in English) Kanagawa Univ. 
Topics (in Japanese) (See Japanese page) 
Topics (in English)  
Paper Information
Registration To SITE 
Conference Code 2015-11-LOIS-ISEC-SITE 
Language Japanese 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) A Pruning Method for the Decision Tree constructed on Run-Based Trie. 
Sub Title (in English)  
Keyword(1) packet classification  
Keyword(2) trie  
Keyword(3) decision tree  
Keyword(4) arbitrary bitmask  
Keyword(5)  
Keyword(6)  
Keyword(7)  
Keyword(8)  
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 ()
21st Author's Name  
21st Author's Affiliation ()
22nd Author's Name  
22nd Author's Affiliation ()
23rd Author's Name  
23rd Author's Affiliation ()
24th Author's Name  
24th Author's Affiliation ()
25th Author's Name  
25th Author's Affiliation ()
26th Author's Name / /
26th Author's Affiliation ()
()
27th Author's Name / /
27th Author's Affiliation ()
()
28th Author's Name / /
28th Author's Affiliation ()
()
29th Author's Name / /
29th Author's Affiliation ()
()
30th Author's Name / /
30th Author's Affiliation ()
()
31st Author's Name / /
31st Author's Affiliation ()
()
32nd Author's Name / /
32nd Author's Affiliation ()
()
33rd Author's Name / /
33rd Author's Affiliation ()
()
34th Author's Name / /
34th Author's Affiliation ()
()
35th Author's Name / /
35th Author's Affiliation ()
()
36th Author's Name / /
36th Author's Affiliation ()
()
Speaker Author-1 
Date Time 2015-11-06 09:50:00 
Presentation Time 25 minutes 
Registration for SITE 
Paper # ISEC2015-38, SITE2015-25, LOIS2015-32 
Volume (vol) vol.115 
Number (no) no.293(ISEC), no.294(SITE), no.295(LOIS) 
Page pp.11-17 
#Pages 7 
Date of Issue 2015-10-30 (ISEC, SITE, LOIS) 

[Return to Top Page]

[Return to IEICE Web Page]
The Institute of Electronics, Information and Communication Engineers (IEICE), Japan