Kenji MIKAWA

Simulated Annealing Method for Relaxed Optimal Rule Ordering
Takashi HARADA Ken TANAKA Kenji MIKAWA 
Publication:   
Publication Date: 2020/03/01
Vol. E103-D  No. 3  pp. 509-515
Type of Manuscript:  Special Section PAPER (Special Section on Foundations of Computer Science — Frontiers of Theory of Computation and Algorithm —)
Category: 
Keyword: 
packet classification, relaxed optimal rule ordering, NP-hard, simulated annealing, zero-suppressed binary decision diagram, 
 Summary | Full Text:PDF
A Packet Classification Method via Cascaded Circular-Run-Based Trie
Takashi HARADA Yuki ISHIKAWA Ken TANAKA Kenji MIKAWA 
Publication:   
Publication Date: 2019/09/01
Vol. E102-A  No. 9  pp. 1171-1178
Type of Manuscript:  Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category: Classification
Keyword: 
packet classification, trie, consecutive ones property, circular ones property, 
 Summary | Full Text:PDF
Run-Based Trie Involving the Structure of Arbitrary Bitmask Rules
Kenji MIKAWA Ken TANAKA 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2015/06/01
Vol. E98-D  No. 6  pp. 1206-1212
Type of Manuscript:  PAPER
Category: Information Network
Keyword: 
packet classification, hierarchical trie, decision tree, arbitrary bitmask, theoretical analysis, 
 Summary | Full Text:PDF
A Heuristic Algorithm for Reconstructing a Packet Filter with Dependent Rules
Ken TANAKA Kenji MIKAWA Manabu HIKIN 
Publication:   IEICE TRANSACTIONS on Communications
Publication Date: 2013/01/01
Vol. E96-B  No. 1  pp. 155-162
Type of Manuscript:  PAPER
Category: Network Management/Operation
Keyword: 
packet filtering, dependent rules, filtering load reduction, 
 Summary | Full Text:PDF