Print edition: ISSN 0913-5685 Online edition: ISSN 2432-6380
[TOP] | [2010] | [2011] | [2012] | [2013] | [2014] | [2015] | [2016] | [Japanese] / [English]
IN2013-36
BlackSmith: Pack-based Virtual Node Control System for Network Experiment Environment
Yuki Kaji, Tomoya Inoue, Ken-ichi Chinen, Yoichi Shinoda (JAIST)
pp. 1 - 6
IN2013-37
Design and Implementation of an Experimental Network Construction Framework Considering the Internet Characteristics.
Kunio Akashi, Tomoya Inoue, Yoichi Shinoda (JAIST)
pp. 7 - 12
IN2013-38
Analysis of Blacklist Update Frequency for Monitoring Malware Infection Attacks on Websites
Takeshi Yagi, Takeo Hariu (NTT), Hiroyuki Ohsaki (Kwansei Gakuin Univ.), Masayuki Murata (Osaka Univ.)
pp. 13 - 18
IN2013-39
A Load Distribution Method Considering the Number of Hops on P2P Sensor Data Stream Delivery System
Tomoya Kawakami (Kobe Univ.), Yoshimasa Ishi, Tomoki Yoshihisa (Osaka Univ.), Yuuichi Teranishi (NICT/Osaka Univ.)
pp. 19 - 24
IN2013-40
Reliability of Connecting Structures for Inter-connected Networks
Yuka Takeshita, Shin'ichi Arakawa, Masayuki Murata (Osaka Univ.)
pp. 25 - 30
IN2013-41
Optical Path Scheduling Method Considering Host Bandwidth in Data Center Networks
Yukihiro Kunishige, Ken-ichi Baba, Shinji Shimojo (Osaka Univ.)
pp. 31 - 36
IN2013-42
About an application domain of Actively, Adaptively controlled queuing
Keita Yamanaka, Shinya Nogami (Tokyo Univ. of Science)
pp. 37 - 42
IN2013-43
[Invited Talk]
Graphillion: Software Library for Very Large Sets of Graphs
Takeru Inoue (JST ERATO)
pp. 43 - 47
IN2013-44
[Invited Talk]
Fast Algorithms for Counting the Number of Paths in a Grid Graph
Hiroaki Iwashita (JST)
pp. 49 - 54
IN2013-45
A study of network architecture for virtualized network service functions
Hiroyuki Kitada, Hisashi Kojima, Naoki Takaya, Yasunori Matsubayashi (NTT)
pp. 55 - 58
IN2013-46
Requrements for SDN Switch Platform
Hiroaki Hata (NTTCom)
pp. 59 - 63
IN2013-47
Report on a Basic Evaluation Method of Software L3FW in SDN
Takaaki Koyama, Toshiharu Kishi, Tomoko Inoue, Yukio Nagafuchi, Hideo Kitazume (NTT)
pp. 65 - 70
IN2013-48
Proposal of a routing control method to avoid redundant routes in the live migration environment between datacenters
Yukio Nagafuchi, Yasuhiro Teramoto, Takaaki Koyama, Hideo Kitazume (NTT)
pp. 71 - 76
IN2013-49
A Frame Collision Reduction Method to Achieve Airtime Fairness in IEEE 802.11 Wireless LANs
Atsuki Suwashita, Hiroshi Inai (Okayama Pref. Univ.)
pp. 77 - 81
IN2013-50
A Proposal of Estimation of Human Action using Multiple Sensors in Portable Devices
Ayaka Suzuki, Toru Abe, Takuo Suganuma (Tohoku Univ.)
pp. 83 - 87
IN2013-51
A Study of Throughput Prediction Method for Access Point in Multi-rate Wireless LAN Environment Based on Target Problem
Ryo Hamamoto, Chisa Takano (Hiroshima City Univ.), Masaki Aida (Tokyo Metropolitan Univ.), Kenji Ishida (Hiroshima City Univ.)
pp. 89 - 94
IN2013-52
Throughput Evaluation of UDP and TCP in Densely Placed APs
Kenji Takahashi, Hiroyasu Obata (HIroshima City Univ.), Tutomu Murase (NEC), Kenji Ishida (HIroshima City Univ.)
pp. 95 - 100
IN2013-53
Characteristics Evaluation of Flow QoS Guarantee Method Using Both TCP Congestion Control and MAC Frame Priority Control over Wireless LAN
Hiroki Matsumoto, Hiroyasu Obata, Kenji Ishida (Hiroshima City Univ.)
pp. 101 - 106
IN2013-54
Model Checking of OpenFlow Network with Abstraction of Packets Based on Symbolic Execution
Yutaka Yakuwa, Nobuyuki Tomizawa, Toshio Tonouchi (NEC)
pp. 107 - 112
IN2013-55
Service Expansible LabelFlow/SDN and Information Centric Operation
Hiroshi Shimizu, Masahiro Jibiki, Hitoshi Asaeda, Nozomu Nishinaga (NICT)
pp. 113 - 118
IN2013-56
Proposal of Multi-path Connection Method for Wide Area Layer 2 Networks
Kazuaki Akashi, Akiyuki Takeda (NTT)
pp. 119 - 124
IN2013-57
Evaluation of reducing service edge equipment by sharing standby machines in edge cloud architecture
Hirofumi Yamazaki, Konomi Mochizuki, Akira Misawa (NTT)
pp. 125 - 130
Note: Each article is a technical report without peer review, and its polished version will be published elsewhere.