Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
ICTSSL, CAS |
2023-01-26 15:20 |
Tokyo |
TBD (Primary: On-site, Secondary: Online) |
A Packet Classification Method Fusing HyperCuts and Run-Based Tries Taiga Kobayashi, Kenji Mikawa (Maebashi Institute of Tech.) CAS2022-74 ICTSSL2022-38 |
In packet classification, filtering algorithms are required to have both fast filtering processing ability and flexible ... [more] |
CAS2022-74 ICTSSL2022-38 pp.67-72 |
COMP |
2022-10-26 17:00 |
Fukuoka |
Kyusyu Univ. Nishijin Plaza |
Computational Complexity of List Constructing Takashi Harada (Kochi Univ. of Tech.), Takashi Fuchino, Ken Tanaka (Kanagawa Univ.), Kenji Mikawa (MIT) COMP2022-20 |
Packet classification is to classify packets arriving to or leaving from a network device according to the security polic... [more] |
COMP2022-20 pp.32-37 |
COMP, IPSJ-AL |
2020-05-09 17:27 |
Online |
Online |
A Packet Classification Algorithm via Decision Diagram Based on Run-Based Trie with Pointers Takashi Harada, Shogo Takeuchi (Kochi Univ. Tech.), Ken Tanaka (Kanagawa Univ.), Kenji Mikawa (Niigata Univ.) COMP2020-4 |
[more] |
COMP2020-4 pp.25-32 |
COMP |
2019-12-13 14:10 |
Gunma |
Ikaho Seminar House, Gunma University |
Computational Complexity of Relaxed Optimal Rule Ordering Takashi Harada (Kochi Univ. of Tech.), Ken Tanaka (Kanagawa Univ.), Kenji Mikawa (Niigata Univ.) COMP2019-36 |
The packet classification aims to determine the behavior of the incoming packets of network devices. The linear search c... [more] |
COMP2019-36 pp.47-54 |
SITE |
2019-12-06 13:50 |
Kanagawa |
|
Deciding Equivalence of The Rule List Policies via SAT solver Takashi Fuchino (Kanagawa Univ.), Takashi Harada (Kochi Univ. of Tech), Ken Tanaka (Kanagawa Univ.), Kenji Mikawa (Niigata Univ.) SITE2019-82 |
Packet classification is to determine the behaviors of packets incoming to network devices. Since it is achieved using l... [more] |
SITE2019-82 pp.13-19 |
COMP |
2019-10-25 14:40 |
Hokkaido |
Sapporo Campus, Hokkaido University |
A Rule Reordering Method via Deleting 0 Weights Rules Takashi Fuchino (Kanagawa Univ.), Takashi Harada (Kochi Univ. of Tech.), Tanaka Ken (Kanagawa Univ.), Kenji Mikawa (Niigata Univ.) COMP2019-24 |
Packet classification is to determine the behaviors of packets incoming to network devices. Since it is achieved using l... [more] |
COMP2019-24 pp.47-52 |
MSS, CAS, IPSJ-AL [detail] |
2018-11-12 15:15 |
Shizuoka |
|
A Reordering Method via Rules Pairing based on Average Weights Takashi Fuchino, Takashi Harada, Ken Tanaka (Kanagawa Univ.), Kenji Mikawa (Niigata Univ.) CAS2018-63 MSS2018-39 |
[more] |
CAS2018-63 MSS2018-39 pp.31-36 |
CAS, SIP, MSS, VLD |
2018-06-15 09:00 |
Hokkaido |
Hokkaido Univ. (Frontier Research in Applied Sciences Build.) |
Packet Filter Reconstruction by rules encapsulation Takashi Harada, Ken Tanaka (Kanagawa Univ.), Kenji Mikawa (Niigata Univ.) CAS2018-18 VLD2018-21 SIP2018-38 MSS2018-18 |
Packet filtering is achieved by linear search of the rule list denoting a filtering policy. The increase in the number o... [more] |
CAS2018-18 VLD2018-21 SIP2018-38 MSS2018-18 pp.93-98 |
SIP, CAS, MSS, VLD |
2017-06-19 14:10 |
Niigata |
Niigata University, Ikarashi Campus |
Computing the Number of Packets that match A Filtering Rule via MTZDDs Takashi Harada, Ken Tanaka (Kanagawa Univ.), Kenji Mikawa (Niigata Univ.) CAS2017-9 VLD2017-12 SIP2017-33 MSS2017-9 |
A filtering policy is denoted as a filtering rule list and is achieved by linear search of the rule list. The increase i... [more] |
CAS2017-9 VLD2017-12 SIP2017-33 MSS2017-9 pp.45-50 |
COMP, IPSJ-AL |
2017-05-12 14:00 |
Nagasaki |
|
An RBT Decision Tree Construction for Sparse Rules Takashi Harada, Ken Tanaka (Kanagawa Univ.), Kenji Mikawa (Niigata Univ.) COMP2017-2 |
Packet classification problem is to determine the highest priority rule that matches with an incoming packet in a networ... [more] |
COMP2017-2 pp.9-15 |
MSS, CAS, IPSJ-AL [detail] |
2016-11-24 10:50 |
Hyogo |
Kobe Institute of Computing |
A Fast Search Method for Run-Based Tries via Pointers Takashi Harada, Ken Tanaka (Kanagawa Univ.), Kenji Mikawa (Niigata Univ.) CAS2016-60 MSS2016-40 |
(To be available after the conference date) [more] |
CAS2016-60 MSS2016-40 pp.13-18 |
MSS, CAS, IPSJ-AL [detail] |
2015-11-20 16:45 |
Kagoshima |
Ibusuki CityHall |
A Packet Classification Algorithm Based on Trie Considering Matching Orders of Bits Yuto Kobayashi, Toshihiko Takahashi, Kenji Mikawa (Niigata Univ.), Ken Tanaka (Kanagawa Univ.) CAS2015-53 MSS2015-27 |
[more] |
CAS2015-53 MSS2015-27 pp.65-70 |
LOIS, ISEC, SITE |
2015-11-06 09:50 |
Kanagawa |
Kanagawa Univ. |
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 |
Packet classification is a fundamental process in the control of network traffic that protects inner net- works from cyb... [more] |
ISEC2015-38 SITE2015-25 LOIS2015-32 pp.11-17 |
MSS, CAS |
2012-11-02 11:00 |
Iwate |
Iwate University |
Linear time generation of random derangements Kenji Mikawa (Niigata Univ.), Ken Tanaka (Kanagawa Univ.) CAS2012-59 MSS2012-39 |
We present a linear time algorithm for generating random derangements. Several algorithms published in recent papers enh... [more] |
CAS2012-59 MSS2012-39 pp.53-58 |
VLD, CAS, MSS, SIP |
2012-07-03 10:10 |
Kyoto |
Kyoto Research Park |
Lexicographic ranking and unranking of derangements in cycle notation Kenji Mikawa (Niigata Univ.), Ken Tanaka (Kanagawa Univ.) CAS2012-17 VLD2012-27 SIP2012-49 MSS2012-17 |
[more] |
CAS2012-17 VLD2012-27 SIP2012-49 MSS2012-17 pp.93-96 |
IE |
2006-05-19 13:55 |
Kyoto |
Kyoto Institute of Technology |
A Proposal of Position Error Correction Systems for Vein Images Using the Log-Polar Mapping Makoto Hasegawa (Kinki Univ.), Kenji Mikawa (Niigata Univ.), Eizaburo Iwata, Haruto Hirose (Universal Robot Co.) |
In the vein certification systems, a difference of the distance between the hand and the camera, a parallel translation ... [more] |
IE2006-13 pp.7-12 |