| Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
| IN |
2005-12-15
13:00 |
Hiroshima |
Hiroshima City Univ. |
A study for the difference between catalogue spec and actual failure with IP nodes
Hiroyuki Funakoshi, Tatsuya Matsukawa, Hitoshi Watanabe (NTT) |
There is a main issue for inconsistency of the reliability between catalogue spec and actual failure in a viewpoint of ... [more] |
IN2005-110
pp.1-5 |
| IN |
2005-12-15
13:25 |
Hiroshima |
Hiroshima City Univ. |
Evaluation of Robustness of Soft State for Data Management in Distributed Environment
Toru Yamaguchi, Harumasa Tada, Makoto Imase (Osaka Univ.) |
Soft state is widely used as the technique for the maintenance of state and is known to have robustness against the fail... [more] |
IN2005-111
pp.7-12 |
| IN |
2005-12-15
13:50 |
Hiroshima |
Hiroshima City Univ. |
Basic examination concerning system configuration in video contents distribution service
Makoto Kikuchi (Polytechnic Univ.), Masami Kihara (Nihon Univ.) |
[more] |
IN2005-112
pp.13-18 |
| IN |
2005-12-15
14:15 |
Hiroshima |
Hiroshima City Univ. |
GridFTP-APT: Automatic Parallelism Tuning Mechanism for Data Transfer Protocol GridFTP
Takeshi Ito, Hiroyuki Ohsaki, Makoto Imase (Osaka Univ.) |
GridFTP has been used as a data transfer protocol to effectively transfer a large volume of data in Grid computing. Gri... [more] |
IN2005-113
pp.19-24 |
| IN |
2005-12-15
14:40 |
Hiroshima |
Hiroshima City Univ. |
Characteristic Analysis of Many-to-Many Multicast Routing Trees Using Multiple Linear Regression Analysis
Hajime Karasawa (Waseda Univ.), Shinsuke Terada (Univ. Tokyo), Takumi Miyoshi (S.I.T.), Kyoko Yamori, Yoshiaki Tanaka (Waseda Univ.) |
If a static multicast tree is used for one-to-many multicast, the most efficient tree depends on the characteristics of ... [more] |
IN2005-114
pp.25-30 |
| IN |
2005-12-15
15:20 |
Hiroshima |
Hiroshima City Univ. |
[Invited Talk]
DNS traffic analysis and anomalies detection on DNS cache servers
Tsuyoshi Toyono, Keisuke Ishibashi (NTT) |
DNS is a indispensable system of the Internet, and we must use DNS name resolution at first of connections. This paper r... [more] |
IN2005-115
pp.31-36 |
| IN |
2005-12-15
16:05 |
Hiroshima |
Hiroshima City Univ. |
[Invited Talk]
Current Status and Future Prospects on Technology of BGP Routing Instability Inference
Tomohiko Ogishi, Shigehiro Ano, Toru Hasegawa (KDDI Lab.) |
[more] |
IN2005-116
pp.37-42 |
| IN |
2005-12-16
09:00 |
Hiroshima |
Hiroshima City Univ. |
A new MAC protocol for wireless ad hoc networks with MSN adaptive array antennas
Naoto Matsushita, Yukihiro Kamiya (TUAT) |
[more] |
IN2005-117
pp.43-48 |
| IN |
2005-12-16
09:25 |
Hiroshima |
Hiroshima City Univ. |
A Hierarchical Routing Scheme using Location and Mobility Information of Nodes for MANET
Hiroshi Nakagawa, Kenji Ishida, Tomoyuki Ohta, Yoshiaki Kakuda (Hiroshima City Univ.) |
[more] |
IN2005-118
pp.49-54 |
| IN |
2005-12-16
09:50 |
Hiroshima |
Hiroshima City Univ. |
An Autonomous Routing for Energy Conservation in Sensor Networks
Noriyuki Masuda, Shinji Inoue, Yoshiaki Kakuda (Hiroshima City Univ.) |
Because wireless sensor networks consist of battery-powered sensor nodes
and wireless communication links,
it is imp... [more] |
IN2005-119
pp.55-60 |
| IN |
2005-12-16
10:30 |
Hiroshima |
Hiroshima City Univ. |
Implementation and evaluation of an inline network measurement algorithm and its application technique
Tomoaki Tsugawa, Go Hasegawa, Masayuki Murata (Osaka Univ) |
In our previous studies, we proposed ImTCP, a novel inline network measurement technique which can obtain available band... [more] |
IN2005-120
pp.61-66 |
| IN |
2005-12-16
10:30 |
Hiroshima |
Hiroshima City Univ. |
Connection availability over ad-hoc networks in shadowing environments
Satoshi Takahashi, Kenji Ishida (Hiroshima City Univ.) |
Various researches on ad-hoc networks have assumed that a terminal perfectly communicates terminals within a certain dis... [more] |
IN2005-121
pp.67-71 |
| IN |
2005-12-16
10:30 |
Hiroshima |
Hiroshima City Univ. |
SPRED: Active queue management mechanism for wide-area networks
Hideyuki Yamamoto, Hiroyuki Ohsaki, Makoto Imase (Osaka Univ.) |
[more] |
IN2005-122
pp.73-78 |
| IN |
2005-12-16
10:30 |
Hiroshima |
Hiroshima City Univ. |
An Inline Network Measurement Mechanism for High-Speed Networks
Cao Le Thanh Man, Go Hasegawa, Masayuki Murata (Osaka Univ.) |
In high-speed networks, such as 1-Gbps or higher networks, bandwidth measurement algorithms that utilize packet transmis... [more] |
IN2005-123
pp.79-84 |
| IN |
2005-12-16
10:30 |
Hiroshima |
Hiroshima City Univ. |
The Statistical Protection for Internet Threat Monitors
Koji Uchida, Yoichi Shinoda (JAIST) |
Viruses and Denial-of-Service(DoS) attacks are important issues. ITM(Internet Threat Monitor) is passively measuring and... [more] |
IN2005-124
pp.85-90 |
| IN |
2005-12-16
13:10 |
Hiroshima |
Hiroshima City Univ. |
Proposal of dynamic grouping method for selecting peers on P2P networks
Hideyuki Yasuoka, Junichi Funasaka, Kenji Ishida (Hiroshima City Univ.) |
When sharing a file on P2P systems that adopt the Tit-For-Tat exchange strategy, the random peer selection has a problem... [more] |
IN2005-125
pp.91-96 |
| IN |
2005-12-16
13:35 |
Hiroshima |
Hiroshima City Univ. |
Simple timeout mechanism in traffic measurement
Noriaki Kamiyama, Tatsuya Mori, Ryoichi Kawahara (NTT) |
In traffic measurement for flows, packet sampling is used to reduce the number of flows captured. Flow statistics are ma... [more] |
IN2005-126
pp.97-102 |
| IN |
2005-12-16
14:00 |
Hiroshima |
Hiroshima City Univ. |
Evaluation of TCP-Westwood Low-Priority in the Internet
Takayuki Hama (NEC), Kazunari Mori (Osaka Univ.), Hideyuki Shimonishi, Tutomu Murase (NEC), Go Hasegawa, Masayuki Murata (Osaka Univ.) |
To differentiate transmission quality of user sessions without any modifications or configurations of network equipment,... [more] |
IN2005-127
pp.103-108 |
| IN |
2005-12-16
14:25 |
Hiroshima |
Hiroshima City Univ. |
A Study on Improving Fairness of TCP-STAR for Satellite Internet
Hiroyasu Obata, Shouta Hanasaki, Kenji Ishida (Hiroshima City Univ.) |
A traditional TCP (such as TCP-NewReno) has a problem that the congestion window control method of TCP has lower through... [more] |
IN2005-128
pp.109-114 |