| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
All Technical Committee Conferences (Searched in: All Years)
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| AI, JSAI-SAI, JSAI-DOCMAS, IPSJ-ICS, JSAI-KBS (Joint) |
2024-03-03 18:15 |
Hokkaido | (Primary: On-site, Secondary: Online) |
A Proposal of Route Search Methods Using Road Network Hierarchization for Vehicle Routing Problem Masayuki Shimizu, Soichiro Yokoyama, Tomohisa Yamashita, Hidenori Kawamura (Hokudai)  AI2023-47 |
In this paper, we propose a method of hierarchizing road networks for route search that takes into account drivers' pref... [more] | AI2023-47 pp.18-23 |
| HWS, VLD | 2023-03-03 09:30 |
Okinawa | (Primary: On-site, Secondary: Online) |
Global routing method imitating car path search Yusuke Yamaguchi, Kunihiro Fujiyoshi (TUAT) VLD2022-100 HWS2022-71 |
Routing in LSI layout design is divided into two stages: global routing and detailed routing. In global routing, a path ... [more] | VLD2022-100 HWS2022-71 pp.143-148 |
| NS, IN (Joint) |
2017-03-02 08:50 |
Okinawa | OKINAWA ZANPAMISAKI ROYAL HOTEL | Bottleneck Analysis on Packet Forwarding of an NDN Software Router Junji Takemasa, Kosuke Taniguchi, Yuki Koizumi, Toru Hasegawa (Osaka Univ.) IN2016-113 |
To investigate potential bottlenecks of an Named Data Networking (NDN) router, we highlight how each function consumes c... [more] | IN2016-113 pp.97-102 |
| IA, IN (Joint) |
2016-12-16 13:45 |
Hiroshima | Hiroshima city university | Cache Admission for Improving Forwarding Speed of NDN Software Router Junji Takemasa, Kosuke Taniguchi, Yuki Koizumi, Toru Hasegawa (Osaka Univ.) IN2016-83 |
Wasteful cache computation of unpopular content is one of causes of decreasing forwarding speed of an NDN software route... [more] | IN2016-83 pp.97-102 |
| IE, CS, IPSJ-AVM, ITE-BCT [detail] | 2016-12-08 13:25 |
Ishikawa | An Evaluation of System Latency for Multimedia Data Processing utilizing Edge Computing Kentaro Imagane, Tatsuya Nagashima, Kenji Kanai, Jiro Katto, Toshitaka Tsuda (Waseda Univ.) CS2016-50 IE2016-86 |
In this paper, we propose a latency analysis model of cloud and edge computing platforms and analyze the latency of mult... [more] | CS2016-50 IE2016-86 pp.27-32 |
|
| CS, NS, IN (Joint) |
2014-09-11 10:25 |
Miyagi | Tohoku Univ. Research Institute of Electrical Communication 2gokan | A Proposal of a Power Consumption Model of a Multicore Software ICN Router Kaito Ohsugi, Yuki Koizumi, Toru Hasegawa (Osaka Univ.) IN2014-51 |
ICN (Information Centric Networking) has been gotten much attention due to its built-in functionalities such as caching ... [more] | IN2014-51 pp.7-12 |
| NS, IN (Joint) |
2014-03-07 09:50 |
Miyazaki | Miyazaki Seagia | A proposal of a power consumption model of a CCNx router Yuto Nakai, Keiichiro Tsukamoto, Yuki Koizumi, Toru Hasegawa (Osaka Univ.) IN2013-162 |
CCN (Content-Centric Networking), which caches packets on routers in the network, is expected to reduce power consumptio... [more] | IN2013-162 pp.111-116 |
| PN | 2014-03-03 10:55 |
Kagawa | Tokushima Bunri University | Multi-Tiers Route Design Method for Providing Sustainable Optical Paths with Various QoSs Masashi Takada, Yosuke Tanigawa, Hideki Tode (Osaka Prefecture Univ.) PN2013-91 |
In recent years, many researchers have been engaging in QoS guarantees across inter/intra domain as well as the extensio... [more] | PN2013-91 pp.7-12 |
| NS, OCS, PN (Joint) |
2012-06-22 13:30 |
Yamagata | Yamagata Univ. | A Distributed Control of Virtual Network Topologies by Using Attractor Selection Model Koji Mizumoto, Shin'ichi Arakawa, Yuki Koizumi (Osaka Univ.), Daisaku Shimazaki, Takashi Miyamura, Shohei Kamamura, Kohei Shiomoto, Atsushi Hiramatsu (NTT), Masayuki Murata (Osaka Univ.) PN2012-8 |
Our research group has proposed a VNT control method that is adaptive to traffic changes. The method is based on a dyn... [more] |
PN2012-8 pp.37-42 |
| NS, IN (Joint) |
2012-03-08 10:30 |
Miyazaki | Miyazaki Seagia | A Distributed Control of Virtual Network Topologies by Using Attractor Selection Model Koji Mizumoto, Shin'ichi Arakawa, Yuki Koizumi (Osaka Univ.), Daisaku Shimazaki, Takashi Miyamura, Shohei Kamamura, Kohei Shiomoto, Atsushi Hiramatsu (NTT), Masayuki Murata (Osaka Univ.) NS2011-182 |
Our research group has proposed a VNT control method that is adaptive to traffic changes. The method is based on a dyna... [more] | NS2011-182 pp.17-22 |
| RCS, NS (Joint) |
2010-07-15 15:50 |
Hokkaido | Abashiri Public Auditorium | [Encouragement Talk]
A study of IP Fast Reroute Control Architecture Shohei Kamamura, Takashi Miyamura, Yoshihiko Uematsu, Kohei Shiomoto (NTT) NS2010-40 |
An IP fast reroute control architecture using a centralized control plane where the control plane and data plane are phy... [more] | NS2010-40 pp.13-16 |
| ICM | 2009-05-28 13:50 |
Kagawa | Kagawa University | Evaluation on Optimized Network Topology According to Network Conditions Masayuki Tsujino, Motoi Iwashita (NTT Corp.) ICM2009-3 |
To support the decision making of the desirable network topology, we study the optimization technique for introducing th... [more] | ICM2009-3 pp.11-15 |
| ICM | 2009-03-13 13:55 |
Kagoshima | Study on Optimized Network Topology According to Environmental Conditions Masayuki Tsujino, Ryutaro Matsumura, Motoi Iwashita (NTT Corp.) ICM2008-80 |
It is important for carriers to make a decision about (network) topology when they draw up a design guideline. On this o... [more] | ICM2008-80 pp.127-130 |
|
| NS | 2009-01-22 14:30 |
Saga | Saga University | [Encouragement Talk]
Set-up and Management Schemes of Optical Paths in All-Optical Networks Rie Hayashi, Kaori Shimizu, Ichiro Inoue, Kohei Shiomoto (NTT) NS2008-125 |
We propose route assignment and continuity check schemes for optical paths considering specific problems in an all-optic... [more] | NS2008-125 pp.1-6 |
| COMP | 2008-12-03 15:10 |
Gunma | Gunma Univ. | A 4-competitive strategy for exploring unknown polygons Xuehou Tan (Tokai Univ.) COMP2008-52 |
We present a new, on-line strategy for a mobile robot to explore an unknown simple polygon with $n$ vertices, starti... [more] |
COMP2008-52 pp.41-48 |
| NS | 2008-10-24 09:55 |
Osaka | Kansai University | A delay evaluation of ForCES communication in functionally distributed network architecture Kentaro Ogawa, Michihiro Aoki, Hideaki Iwata, Shinichiro Chaki (NTT) NS2008-83 |
For traditional distributed routing control in large-scale IP networks, there are several problems such as increase of r... [more] | NS2008-83 pp.89-92 |
| IN, PN (Joint) |
2006-10-13 15:50 |
Tokyo | Control plane architecture using router aggregation for a carrier network Takafumi Hamano, Kentaro Ogawa, Koji Sugisono, Michihiro Aoki, Shinichiro Chaki (NTT) IN2006-88 |
For routing using IGP in large scale IP networks such as carrier networks, there are several problems stemming from the ... [more] | IN2006-88 pp.67-72 |
|
| RECONF | 2006-09-15 11:45 |
Kumamoto | Kumamoto Univ. | A Parametric Study of Packet-Switched FPGA Overlay Networks Daihan Wang, Hiroki Matsutani, Masato Yoshimi (Keio Univ.), Michihiro Koibuchi (NII), Hideharu Amano (Keio Univ.) |
The constantly upgrading gate capacity of FPGAs enables us to implement a complex system on a chip. A packet-switched... [more] |
RECONF2006-32 pp.31-36 |
| PN | 2006-08-23 09:25 |
Hokkaido | An OBS Network Design Method based on Iterative Local Minimization of Average Blocking Probability Hidetaka Nagashima, Hiroshi Hasegawa, Ken-ichi Sato (Nagoya Univ.) PN2006-19 |
In this paper, we propose a Routing and Wavelength Assignment (RWA) algorithm, in Optical Burst Switching networks with ... [more] | PN2006-19 pp.51-54 |
|
| CS, OCS, PN (Joint) |
2006-05-25 14:05 |
Shizuoka | Shizuoka Univ. | A GMPLS Path Computing Method with a Tabu Search Algorithm for-the Weighted Constraint Satisfaction Problem Hiroki Furuya, Nagao Ogino, Satoshi Konishi, Hajime Nakamura (KDDI R&D Labs.), Takahito Tanabe, Toshihiro Nitta, Makoto Sato (Mathematical Systems) PN2006-3 |
This paper proposes a route computation method for a GMPLS based survivable network. It is classified as a pre-computed ... [more] | PN2006-3 pp.13-18 |
[Return to Top Page]