Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
IN |
2007-12-13 13:30 |
Hiroshima |
Hiroshima City University |
On the effectiveness of large scale module netwrok Takanori Komatsu, Akira Namatame (NDA) IN2007-99 |
Large network usually has module architecture. We propose a method for making large network which consits of module netw... [more] |
IN2007-99 pp.1-6 |
IN |
2007-12-13 13:55 |
Hiroshima |
Hiroshima City University |
A proposal of communication link model based on resonance frequency of network users Masato Uwajima, Toru Sasaki, Chisa Takano, Masaki Aida (Tokyo Metropolitan Univ.) IN2007-100 |
[more] |
IN2007-100 pp.7-12 |
IN |
2007-12-13 14:20 |
Hiroshima |
Hiroshima City University |
A new moderate UDT improving throughput fairness with other high-speed transport protocols Shinya Kawano, Hisashi Koga, Toshinori Watanabe (UEC) IN2007-101 |
Recently, the application that needs the long distance high speed communications between Grid and the
network storage s... [more] |
IN2007-101 pp.13-18 |
IN |
2007-12-13 14:45 |
Hiroshima |
Hiroshima City University |
A Two-way Anonymous Communication Method without Routing Information Kosuke Matsubara, Masaaki Niimura, Yasushi Fuwa (Shinshu Univ.) IN2007-102 |
In Web communication, encrypted communication technology such as SSL has used to provide protection of privacy. But, in ... [more] |
IN2007-102 pp.19-23 |
IN |
2007-12-13 15:25 |
Hiroshima |
Hiroshima City University |
Tele-traffic Analysis of a Single-server Queuing System with Time-out Scheme Kentaro Hoshi, Sumito Iijima, Yoshitaka Takahashi, Naohisa Komatsu (Waseda Univ) IN2007-103 |
We consider a renewal input, general service time, single-server, infinite-capacity queuing system with generally distri... [more] |
IN2007-103 pp.25-30 |
IN |
2007-12-13 15:50 |
Hiroshima |
Hiroshima City University |
Estimation of Larger Quantiles Based on the r Largest Traffic Data Hirofumi Yokoi, Isami Nakajima, Katsunori Ori (NTT), Katsunori Yamaoka (Tokyo Tech) IN2007-104 |
In the design of a public communication network, it is general to make a constant quality filled when a constant value i... [more] |
IN2007-104 pp.31-36 |
IN |
2007-12-13 16:15 |
Hiroshima |
Hiroshima City University |
Efficient Management of Access Control List by Combining Prefix Expansion and Range Matching Devices Haesung Hwang (Osaka Univ.), Koji Yamamoto (Renesas Technology), Shingo Ata (Osaka City Uni.), Kazunari Inoue (Renesas Technology), Masayuki Murata (Osaka Univ.) IN2007-105 |
TCAM (Ternary Content Addressable Memory) is a special type of memory used in routers in order to achieve high speed pac... [more] |
IN2007-105 pp.37-42 |
IN |
2007-12-13 16:40 |
Hiroshima |
Hiroshima City University |
Proposal on wireless LAN MAC Frame Contorl in Receive Opportunity for Flow QoS Tutomu Murase, Yumi Hirano (NEC), Shigeo Shioda, Shiro Sakata (Univercity of Chiba) IN2007-106 |
QoS(Quality of Service) control in WLAN(IEEE802.11 Wireless LAN) is getting important since WLAN is widely deployed as a... [more] |
IN2007-106 pp.43-48 |
IN |
2007-12-13 17:20 |
Hiroshima |
Hiroshima City University |
[Invited Talk]
Network-wide Internet Traffic Measurement/Analysis and Anomolous Traffic Detection Keisuke Ishibashi (NTT) IN2007-107 |
In this paper, we survey current status on Internet traffic measurement,
especailly on spatial characteristics of Inter... [more] |
IN2007-107 pp.49-54 |
IN |
2007-12-14 10:00 |
Hiroshima |
Hiroshima City University |
A Heuristic Algorithm for Access Point Allocation in Indoor Environments for Wireless Mesh Networks Tamer Farag, Nobuo Funabiki, Toru Nakanishi (Okayama Univ.) IN2007-108 |
We have studied WIMNET (Wireless Internet-access Mesh NETwork) as a flexible and inexpensive large-scale access network ... [more] |
IN2007-108 pp.55-60 |
IN |
2007-12-14 10:25 |
Hiroshima |
Hiroshima City University |
Simulation of selecting a connection point for communications between heterogeneous wireless networks Masato Fukui, Xuejun Tian, Tetsuo Ideguchi, Takashi Okuda (Aichi-Pre Univ.) IN2007-109 |
Different terminals with different functions and capacities are assumed to be used in ad hoc networks where the use scen... [more] |
IN2007-109 pp.61-66 |
IN |
2007-12-14 10:50 |
Hiroshima |
Hiroshima City University |
A Clustering Method to Improve Data Aggregation in Wireless Sensor Networks Naotaka Tsutsumi, Shinji Inoue, Yoshiaki Kakuda (Hiroshima City Univ.) IN2007-110 |
Because the power resource is limited for a long-term observation in the sensor network,
the information gathering wit... [more] |
IN2007-110 pp.67-72 |
IN |
2007-12-14 11:15 |
Hiroshima |
Hiroshima City University |
Proposal of Time Synchronization for Intermittent Communication Considering Paths in Wireless Sensor Networks Satoshi Kuwatsuka, Shinji Inoue, Yoshiaki Kakuda (Hiroshima City Univ.) IN2007-111 |
Recently sensor networks are paid to attention.
Generally a sensor network consists of small sensor nodes which can sen... [more] |
IN2007-111 pp.73-77 |
IN |
2007-12-14 12:40 |
Hiroshima |
Hiroshima City University |
Evaluation of hardware-based IPsec processing method for embedded devices Yasuhiro Fukuju, Keisuke Mera, Takeshi Ishihara (Toshiba Corp.) IN2007-112 |
Cryptographic offload engine is a solution to reduce the CPU load and improve the throughput of IPsec. However, since us... [more] |
IN2007-112 pp.79-84 |
IN |
2007-12-14 13:05 |
Hiroshima |
Hiroshima City University |
Entropy-based Analysis of User IP Space Zhenxing Lu, Marat Zhanikeev, Yoshiaki Tanaka (Waseda Univ.) IN2007-113 |
Although the concept of entropy was originally a thermodynamic construct, it has been adapted in other fields of study, ... [more] |
IN2007-113 pp.85-90 |
IN |
2007-12-14 13:30 |
Hiroshima |
Hiroshima City University |
A Multi-stage Worm Detection System by Flow-wise and Packet-wise Analysis on the Similarity of Payloads Youhei Suzuki, Yuji Waizumi, Hiroshi Tsunoda, Yoshiaki Nemoto (Tohoku Univ) IN2007-114 |
Internet worms are one of the most serious threats in the Internet. For accurately detecting newly created worms, we hav... [more] |
IN2007-114 pp.91-96 |
IN |
2007-12-14 13:55 |
Hiroshima |
Hiroshima City University |
Classifying Network Anomaly Events Using the Occurence Probability of Correlation Coefficients Hiroaki Meguro, Yuji Waizumi, Hiroshi Tsunoda, Yoshiaki Nemoto (Tohoku Univ) IN2007-115 |
For taking effective countermeasures against network anomaly events,the classification of detected anomaly events is req... [more] |
IN2007-115 pp.97-102 |
IN |
2007-12-14 14:35 |
Hiroshima |
Hiroshima City University |
A study of contents discovery methods applying user relationship on ad-hoc network Naoyuki Hirata (Tokai Univ), Yoshiko Sueda, Osamu Mizuno (NTT), Hiroshi Ishii (Tokai Univ) IN2007-116 |
This paper proposes an effective node discovery with objective contents (named “target node”) method over wireless ad ho... [more] |
IN2007-116 pp.103-108 |
IN |
2007-12-14 15:00 |
Hiroshima |
Hiroshima City University |
A File Fetching Method to Reduce the Redundant Traffic on P2P Networks Akihiko Ishidu, Junichi Funasaka, Kenji Ishida (Hiroshima City Univ.) IN2007-117 |
When dividing a file into many pieces and fetching different pieces from many peers on P2P systems, if the piece is requ... [more] |
IN2007-117 pp.109-114 |
IN |
2007-12-14 15:25 |
Hiroshima |
Hiroshima City University |
An Evaluation of the Most Suitable Server Selection by Remote Observation over the Testbed Keisuke Utsu, Masaki Shioda, Hiroshi Ishii (Tokai Univ.) IN2007-118 |
In order to select the most suitable server from the user’s side, a method have been proposed to use both the round trip... [more] |
IN2007-118 pp.115-120 |