| 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 # | |
| CQ, CBE (Joint) |
2022-01-28 11:45 |
Ishikawa | Kanazawa（Ishikawa Pref.） (Primary: On-site, Secondary: Online) |
A Study on Parameter Tuning of a Rendezvous Search Utilizing Random Walks Fumiya Toyoda, Yusuke Sakumoto, Hiroyuki Ohsaki (Kwansei Gakuin Univ)  CQ2021-92 |
Many studies proposed a rendezvous search that multiple searchers existing on different nodes on a network try to find o... [more] | CQ2021-92 pp.88-93 |
| IN, NV (Joint) |
2016-07-15 09:30 |
Hokkaido | Matsumaecho Sougo Center | Dynamic Routing Method Using Available Bandwidth and Degree
-- Evaluation in TCP -- Yuuki Udagawa, Osamu Mizuno (Kogakuin Univ.) IN2016-23 |
Open Shortest Path First (OSPF) is a popular routing protocol for the internet. OSPF tends to concentrate traffic to hig... [more] | IN2016-23 pp.1-6 |
| NLP | 2015-01-26 14:20 |
Oita | Compal Hall | Chaos in Scale-Free Networks of Coupled Oscillators Takuya Kitamura, Seiichiro Moro (Univ. Fukui) NLP2014-121 |
In recent years, various oscillation and synchronization phenomena have been investigated for coupled oscillators. In st... [more] | NLP2014-121 pp.47-52 |
| IN, IA (Joint) |
2013-12-19 11:10 |
Hiroshima | Hiroshima City Univ. | A New Load-Balancing Scheme by Using Betweenness Centrality Applied to Scale-Free Networks Soma Hayashi, Yutaro Nagata, Koichi Asatani (Kogakuin Univ.) IN2013-100 |
The Internet is a scale-free network, where node degree distribution follows a power law. In a scale-free network, OSPF ... [more] | IN2013-100 pp.7-12 |
| IN | 2013-01-24 15:20 |
Kagoshima | Kagoshima-Ken-Sangyo-Kaikan | Building a Diffusion Model across Multiple Communities Seiya Kawaguchi, Marat Zhanikeev, Hitoshi Watanabe (Tokyo Univ. of Science) IN2012-140 |
In conventional social network diffusion models， all people are members of the same social networks. However，in real net... [more] | IN2012-140 pp.11-14 |
| MoNA, AN, USN (Joint) |
2013-01-25 15:50 |
Miyagi | ICHINOBO (Sendai-city) | Performance Evaluation of Relay Peer Selection in P2P multicast considering Physical Network Centrality and Peer Distribution Based on Estimation of Physical Network Characteristics Tatsuya Onishi, Hiroaki Morino (Shibaura Inst. Tech.) MoMuC2012-67 |
(To be available after the conference date) [more] | MoMuC2012-67 pp.125-130 |
| VLD, DC, IPSJ-SLDM, CPSY, RECONF, ICD, CPM (Joint) [detail] |
2012-11-28 09:00 |
Fukuoka | Centennial Hall Kyushu University School of Medicine | A Basic Study of FPGA Routing Architecture Based on Scale Free Network Satoshi Hayama, Motoki Amagasaki, Masahiro Iida, Morihiro Kuga, Toshinori Sueyoshi (Kumamoto Univ.) RECONF2012-50 |
FPGA(Fiele Programmable Gate Array) has many routing resources in order to provide the flexibility. These routing resou... [more] |
RECONF2012-50 pp.17-22 |
| NS, IN (Joint) |
2012-03-09 11:20 |
Miyazaki | Miyazaki Seagia | Visualizing Scale Free Networks for the Analysis of P2P Network Traffic Data Kai Sasaki, Hsiang-Yun Hu, Masahiro Yoshida (Tokyo Univ.), Hiroko Nakamura Miyamura (JAEA), Satoshi Ohzahata (UEC Univ.), Akihiro Nakao, Shigeo Takahashi (Tokyo Univ.) NS2011-223 |
This report presents a method for visualizing scale-free networks including P2P networks as an typical example. Visualiz... [more] | NS2011-223 pp.249-254 |
| NLP | 2011-06-30 13:25 |
Hokkaido | Shari-cho Kohminkan: Yme-hall Shiretoko | Does Parrond Paradox arise in Scale Free Networks I ?
-- Consideration of a Naive Case -- Norihito Toyota (HIU) NLP2011-26 |
In the Parrong game\cite{Parr1}, it has been shown that a paradoxical behavior arises by \cite{Harm1},\cite{Harm2}. P... [more] |
NLP2011-26 pp.7-12 |
| IN, NS (Joint) |
2011-03-03 09:00 |
Okinawa | Okinawa Convention Center | Link Selection Method for distributed Load-Balancing in consideration of Topology Information in OSPF Networks Nozomu Kanezaki, Hitomi Tamura, Kenji Kawahara, Yuji Oie (Kyushu Inst. of Tech.) IN2010-155 |
Load balancing becomes the important factor of traffic engineering (TE) or relieving congestion in the Internet in whi... [more] |
IN2010-155 pp.67-72 |
| IN, NS (Joint) |
2011-03-04 15:30 |
Okinawa | Okinawa Convention Center | Routing Metrics based on Node Degree for Load-Balancing in a Large-Scale Network Hitomi Tamura, Masato Uchida, Masato Tsuru, Yuji Oie (Kyushu Inst. of Tech.) NS2010-241 |
Traffic Engineering (TE) is required for reducing highly-loaded links / nodes in a part of network. For efficient use of... [more] | NS2010-241 pp.433-437 |
| IN, NS (Joint) |
2011-03-04 10:40 |
Okinawa | Okinawa Convention Center | Search Range for Finding Hub Users in Social Networks Shotaro Motomura, Hirokazu Kariya, Kohei Watabe, Masaki Aida (Tokyo Metropolitan Univ.) IN2010-199 |
Recently, the competition for the communication service market has intensified. It can be said that spreading it in a sh... [more] | IN2010-199 pp.331-336 |
| IN | 2010-10-14 15:00 |
Aichi | Nagoya Institute of Technology | [Invited Talk]
Self-Consistent Approach to Reveal a Structure of Social Networks Behind Communication Networks Chisa Takano (Hiroshima City Univ.), Masaki Aida (Tokyo Metropolitan Univ.), Hideyuki Koto, Hajime Nakamura (KDDI Lab.) IN2010-68 |
Communication network data, such as the volume of traffic and the number of users, has been mainly used for facility eng... [more] | IN2010-68 pp.19-24 |
| AI | 2010-09-28 16:25 |
Kyoto | Kyoto Univ. Clock Tower Centennial Hall | A method for generation of complex network based on self-organization Keisuke Terayama, Yukari Yamauchi (NU) AI2010-30 |
In this research, it proposes the method for generating a small world network while developing the network. The restrict... [more] | AI2010-30 pp.49-54 |
| NLP | 2010-07-12 13:55 |
Ishikawa | Ishikawa Prefectural Bunkyo Hall | Analyses of Behaviors of Agents affected by Local Interactions allocated on the Scale-free Networks and their Applications Shozo Tokinaga (Kyushu Univ.), Noboru Takaki (Kyushu Sangyo Univ.) NLP2010-35 |
This paper deals with the analysis of behaviors of agents affected by local interactions where we especially focus ... [more] |
NLP2010-35 pp.33-38 |
| IN | 2010-07-09 11:15 |
Hokkaido | Hokkaido Univ. | Fluid-based Analysis of TCP Flows in a Scale-Free Network Yusuke Sakumoto, Hiroyuki Ohsaki, Makoto Imase (Osaka Univ.) IN2010-36 |
In this paper, we derive distributions of throughput, round-trip time, and packet loss probability of TCP flows in a sc... [more] |
IN2010-36 pp.79-84 |
| MoNA, IN (Joint) |
2009-11-13 13:30 |
Fukuoka | Fukuoka Institute of Technology | Analysis of routing for reducing flow convergence on bottleneck nodes Toshihiro Yokoi, Takamichi Miyata, Katsunori Yamaoka (Tokyo Inst. of Tech) IN2009-83 |
Flow convergence on particular node causes various problems such as degradation of QoS. Then, we proposed a new routing ... [more] | IN2009-83 pp.89-94 |
| IN, NS (Joint) |
2009-03-04 11:10 |
Okinawa | Okinawa-Zanpamisaki Royal Hotel | Path Selection Scheme for Load Distribution the Considering Characteristics of Network Topology Nobumasa Natsui, Junichi Shimada, Hitomi Tamura, Takeshi Ikenaga, Masato Uchida, Yuji Oie (Kyushu Inst. of Tech.) NS2008-192 |
Congestion inherently occurs on the network that are shared among several autonomous users due to traffic concentration ... [more] | NS2008-192 pp.277-282 |
| IN, PN (Joint) |
2008-10-09 13:55 |
Tokyo | Tokyo Univ. | Analysis and simulation of the network bandwidth depending on network structures Norihiro Imanaka, Masato Kawahara (OKI) IN2008-68 |
(To be available after the conference date) [more] | IN2008-68 pp.7-12 |
| ICM | 2008-03-13 10:50 |
Okinawa | Impacts of Strategies based on Social Behavior Dynamics on Topology Reorganization Yasuhiro Sato, Shingo Ata, Ikuo Oka (Osaka City Univ.) TM2007-55 |
Recent studies have shown that the topology of the Internet is categorized as a scale-free network. However, previous st... [more] | TM2007-55 pp.13-18 |
|
[Return to Top Page]