Online edition: ISSN 2432-6380
[TOP] | [2015] | [2016] | [2017] | [2018] | [2019] | [2020] | [2021] | [Japanese] / [English]
ICM2018-49
[Encouragement Talk]
Operational-Flow Smart-Contract to Support Inter-Organizational Cooparative System Operations for Permissioned Blockchain
Tatsuya Sato, Yosuke Himura, Jun Nemoto (Hitachi)
pp. 1 - 6
ICM2018-50
[Encouragement Talk]
Proposal of relation display system between bases In a system deployed in multiple bases
Toru Shoji, Shinsaku Numata, Naoki Sahashi, Kensuke Mochinaga, Toshiaki Komahashiri, Osamu Nakazawa (NTTCom)
pp. 7 - 12
ICM2018-51
Study on Method of Identifying Service Influence Occurred by Network Fault
Kimihiko Fukami, Kenji Musase, Masataka Sato, Kenichi Tayama (NTT)
pp. 13 - 18
ICM2018-52
Dynamic deployment of virtual cache function for content delivery services with minimum network cost
Kakeru Shibuya, Shin-ichi Kuribayashi (Seikei Univ.)
pp. 19 - 24
ICM2018-53
[Invited Talk]
Research and development on network control for large urban disasters
Takuya Asaka (TMU)
pp. 25 - 26
ICM2018-54
[Invited Talk]
[Invited Talk] DRS: Auto-Scaling for Real-Time Stream Analytics
Richard T. B. Ma (NUS)
pp. 27 - 31
ICM2018-55
[Invited Talk]
The status of the 3GPP 5G System Architecture and the Network Slicing standardization
Daisuke Yokota (SoftBank)
pp. 33 - 36
ICM2018-56
Proposal of Distributed VDI System using VDI Proxy for Cloud Era
Naoki Oguchi, Yosuke Takano (Fujitsu Lab), Shunji Abe (NII)
pp. 37 - 42
ICM2018-57
Pricing and Resource Allocation on Hadoop Data Centers Using Auction Mechanisms
Yu Manabe, Jun Kawahara, Shoji Kasahara (NAIST)
pp. 43 - 48
ICM2018-58
A Task Offloading Method Considering Mobility and Turning Behavior in Mobile-Edge Computing Architectures
Hiroya Matsumoto, Osamu mizuno, Bo Gu (Kogakuin Univ)
pp. 49 - 54
ICM2018-59
Optimam Design Method of Virtualized CDN Maximizing Profit of Content Providers
Yutaro Hosokawa, Noriaki Kamiyama (Fukuoka Univ.)
pp. 55 - 60
ICM2018-60
[Invited Talk]
A Survey of Recent Trends in Multi-access Edge Computing
-- Matching-based Approaches --
Bo GU (Kogakuin Univ.)
pp. 61 - 65
ICM2018-61
[Invited Talk]
AI and the network slicing trends discussed in TM Forum
Sosuke Izumida (NTT COMWARE)
pp. 67 - 69
ICM2018-62
High Resilient Caching Method in Information-CentrICNetworking
Rin Hamada, Noriaki Kamiyama (Fukuoka Univ.)
pp. 71 - 76
ICM2018-63
Measurement Analysis of Co-occurrence Degree of Web Objects
Kouki Sakurai, Noriaki Kamiyama (Fukuoka Univ.), Akihiro Nakao (Tokyo Univ.)
pp. 77 - 82
ICM2018-64
Study of Business Process Visualization Method using Operation Log
Yuki Urabe, Sayaka Yagi, Kimio Tsuchikawa, Takeshi Masuda (NTT)
pp. 83 - 88
ICM2018-65
Finding data field values and their names in forms for automatically processing data in forms of various formats
Ikuko Takagi, Shiro Ogasawara, Kohji Tsuji (former NTT)
pp. 89 - 94
ICM2018-66
A Study on data collection and accumulation method for business visualization and evaluations
Yoshiaki Shoji, Masateru Inoue, Hiroshi Yoshida, Tomoko Shibata (NTT)
pp. 95 - 100
ICM2018-67
A Proposal of Similar Operation Extraction Method for Preventing Operational Error
Naoto Takeda (KDDI), Keisuke Onishi (KKE), Keiji Okada, Akira Sakatoku, Atsuo Tachibana, Shigehiro Ano (KDDI)
pp. 101 - 104
ICM2018-68
A study on extension of network equipment management data model to building equipment management
Ikuo Sakanashi, Kenta Konishi, Kenta Oonoki, Eguchi Hideaki (NTTCW)
pp. 105 - 109
ICM2018-69
A Study of Requirements for Services Fault Management in Big Data Management System
Atsushi Takada, Naoyuki Tanji, Toshihiko Seki, Kyoko Yamagoe (NTT)
pp. 111 - 116
ICM2018-70
[Encouragement Talk]
Detecting Dependency between Modules of Deployment Automation Tool Using Reinforcement Learning Exploration Log
Manabu Nakanoya (NEC)
pp. 117 - 122
ICM2018-71
Accelerated Search for Search-Based Network Design Generation Scheme with Reinforcement Learning
Takashi Maruyama, Takuya Kuwahara, Yutaka Yakuwa, Takayuki Kuroda, Yoichi Sato (NEC)
pp. 123 - 128
Note: Each article is a technical report without peer review, and its polished version will be published elsewhere.