Committee 
Date Time 
Place 
Paper Title / Authors 
Abstract 
Paper # 
CAS, MSS, IPSJAL [detail] 
20191128 13:50 
Fukuoka 

The expected distance sum of random shortestpath intrees over Hamilton path trajectory on grid graph Yoshihiro Kaneko (Gifu Univ.) CAS201950 MSS201929 
The paper deals with shortest pathbased intrees on a grid graph. There root moves among all vertices. As such root mob... [more] 
CAS201950 MSS201929 pp.3338 
ICSS, IA 
20180626 09:50 
Ehime 
Ehime University 
Proposal of SparseModeling based Approach for Betweenness Centrality Estimation Ryotaro Matsuo, Ryo Nakamura, Hiroyuki Ohsaki (Kwansei Gakuin Univ.) IA201810 ICSS201810 
In recent years, a statistical approach for estimating unobserved model parameters from a small number of observations u... [more] 
IA201810 ICSS201810 pp.6166 
NS, IN (Joint) 
20170303 15:30 
Okinawa 
OKINAWA ZANPAMISAKI ROYAL HOTEL 
Selection Algorithm of Links to Aggregate Traffic for Network Greening with considering Transmission Performance Atsushi Yorichika, Kenji Kawahara (KIT) IN2016162 
As the Internet grows explosively and network components such as routers and switches increase, they consume electric po... [more] 
IN2016162 pp.389394 
IN 
20150123 16:10 
Aichi 
Nagoya International Center 
Link Selection Scheme based on Shortest Path Trees from Exporter Routers with considering Traffic Fluctuation for Network Greening Tomohiro Sakamoto, Kenji Kawahara, Yuji Oie (KIT) IN2014117 
As the Internet grows explosively and network components such as routers and switches increase,they consume electric pow... [more] 
IN2014117 pp.113118 
NS 
20130419 14:20 
Ishikawa 
The Wajima Chamber of Commerce and Industry 
Optimal Multiple Shared Multicast Trees for ManytoMany Multicasting Communication Shanming Zhang, Hidetoshi Takeshita (Keio Univ.), Takashi Kurimoto (NTT), Satoru Okamoto, Naoaki Yamanaka (Keio Univ.) NS201310 
Multicast, which provides an efficient way of disseminating data from a source to all the members in a multicast group, ... [more] 
NS201310 pp.4954 
IN 
20130125 13:30 
Kagoshima 
KagoshimaKenSangyoKaikan 
Exporter Router and Transmission Path Selection Scheme in Routing on Shortest Path Trees for Network Greening Kazuki Kawamoto (KIT), Hitomi Tamura (FIT), Kenji Kawahara, Yuji Oie (KIT) IN2012149 
As the Internet grows explosively, power consumption of network components is also increasing, thus network greening bec... [more] 
IN2012149 pp.6368 
COMP 
20110309 13:00 
Tokyo 
Chuo Univ. 
New k shortest simple path algorithm that reduces the average case time complexity Hiroshi Matsuura (NTT) COMP201049 
The author proposed kSPFplus algorithm that realizes to shorten the worst case time complexity for creating k shortest... [more] 
COMP201049 pp.1724 
IN 
20101217 10:25 
Hiroshima 
Hiroshima City Univ. 
A proposal of k shortest simple path algorithm to minimize computational complexity Hiroshi Matsuura (NTT) IN2010107 
k shortest path algorithm is expected to be applied to creating replacement paths and traffic dispersion by using multip... [more] 
IN2010107 pp.5762 
COMP 
20101015 10:05 
Miyagi 
Tohoku Univ. 
ConstantWorkSpace Algorithms for Geometric Problems(2) Tetsuo Asano (JAIST), Wolfgang Mulzer (Princeton Univ.), Gunter Rote (Free Univ.), Yajun Wang (Microsoft) COMP201032 
We present spaceefficient algorithms for geometric problems in a restricted computational model called ``constant wor... [more] 
COMP201032 pp.915 
NS, IN (Joint) 
20100304 09:20 
Miyazaki 
Miyazaki Phoenix Seagaia Resort (Miyazaki) 
Random Walk Search for Unstructured PeertoPeer Overlays Using HopLimited Shortest Path Trees Phouvieng Hieungmany, Shigeo Shioda (Chiba Univ.) IN2009164 
We propose an efficient randomwalkbased file search on unstructured P2P networks. In the proposal, each node keeps tw... [more] 
IN2009164 pp.121126 
CAS 
20080201 10:55 
Okinawa 

A Fast Modification Algorithm for Shortest Path Tree and its Performance Evaluation Tsutomu Ishida, Yukihide Kohira, Atsushi Takahashi (Tokyo Tech) CAS200798 
In VLSI design, circuits are improved by circuit modifications.The minimum feasible clock period of a circuit is one of ... [more] 
CAS200798 pp.2530 
NS, IN (Joint) 
20070309 14:10 
Okinawa 
Okinawa Convention Center 
Performance Evaluation of Ad hoc Multicast Routing Protocol Constructing Shortest Path Tree with One Way Control Message Flow Tsutomu Kozaka, Toshihiko Kato, Shuichi Itoh (UEC), Yoshiyori Urano (Waseda Univ.) NS2006218 
In recent years, ad hoc networks become widely used, and the multicasting type services, such as video/voice streaming a... [more] 
NS2006218 pp.311316 
PN, IN (Joint) 
20051014 16:10 
Kanagawa 
Keio Univ. (Yagami) 
Efficient Flooding Technique Based on Partial ShortestPath Trees Constructed in a Distributed Fashion Kenji Ohtsuka, Shigeo Shioda (Chiba Univ.) 
In this paper, we propose an efficientmessageflooding technique for computer networks. The key idea of our proposal i... [more] 
IN200597 pp.5560 
NS, RCS (Joint) 
20050721 14:00 
Okayama 
Okayama Univ.(Tsushima Campus) 
Design of Ad hoc Multicast Routing Protocol Using Shortest Path Trees Tsutomu Kozaka, Toshihiko Kato, Shuichi Itoh (UEC), Yoshiyori Urano (Waseda Univ.) 
In recent years, an ad hoc network is paid to attention, and many routing protocols are studied actively not only for un... [more] 
NS200564 pp.1316 