WEKO3
-
RootNode
アイテム
Low Overhead TCP/UDP Socket-based Tracing for Discovering Network Services Dependencies
https://ipsj.ixsq.nii.ac.jp/records/217594
https://ipsj.ixsq.nii.ac.jp/records/21759472578a26-eb70-45f5-bfa6-7fd142335bc3
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
IPSJ-JNL6303021.pdf (851.6 kB)
|
Copyright (c) 2022 by the Information Processing Society of Japan
|
|
| オープンアクセス | ||
| Item type | Journal(1) | |||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 公開日 | 2022-03-15 | |||||||||||
| タイトル | ||||||||||||
| タイトル | Low Overhead TCP/UDP Socket-based Tracing for Discovering Network Services Dependencies | |||||||||||
| タイトル | ||||||||||||
| 言語 | en | |||||||||||
| タイトル | Low Overhead TCP/UDP Socket-based Tracing for Discovering Network Services Dependencies | |||||||||||
| 言語 | ||||||||||||
| 言語 | eng | |||||||||||
| キーワード | ||||||||||||
| 主題Scheme | Other | |||||||||||
| 主題 | [特集:新しい生活様式を見据えたインターネットと運用技術] tcp/udp, ebpf, kernel, monitoring, site reliability engineering | |||||||||||
| 資源タイプ | ||||||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||||||
| 資源タイプ | journal article | |||||||||||
| 著者所属 | ||||||||||||
| SAKURA Internet Research Center, SAKURA Internet Inc.／Graduate School of Infomatics, Kyoto University | ||||||||||||
| 著者所属 | ||||||||||||
| Hatena Co., Ltd. | ||||||||||||
| 著者所属 | ||||||||||||
| SAKURA Internet Research Center, SAKURA Internet Inc. | ||||||||||||
| 著者所属(英) | ||||||||||||
| en | ||||||||||||
| SAKURA Internet Research Center, SAKURA Internet Inc. / Graduate School of Infomatics, Kyoto University | ||||||||||||
| 著者所属(英) | ||||||||||||
| en | ||||||||||||
| Hatena Co., Ltd. | ||||||||||||
| 著者所属(英) | ||||||||||||
| en | ||||||||||||
| SAKURA Internet Research Center, SAKURA Internet Inc. | ||||||||||||
| 著者名 |
Yuuki, Tsubouchi
× Yuuki, Tsubouchi
× Masahiro, Furukawa
× Ryosuke, Matsumoto
|
|||||||||||
| 著者名(英) |
Yuuki, Tsubouchi
× Yuuki, Tsubouchi
× Masahiro, Furukawa
× Ryosuke, Matsumoto
|
|||||||||||
| 論文抄録 | ||||||||||||
| 内容記述タイプ | Other | |||||||||||
| 内容記述 | The widespread use of cloud computing has made it easier for service providers to develop new features and handle increased access. However, the network dependencies among components in distributed applications deployed in the cloud are becoming more complex because the number and types of components are increasing. When system administrators make changes to a system, they cannot specify the impact of the changes, which may lead to larger failures than expected. Current methods of automatically discovering dependencies trace network flows included in TCP/UDP sockets in the Linux kernel on all hosts deployed in distributed applications. However, as the rate of communication increases, the number of flows transferred from the kernel space to user space increases, which increases CPU usage for tracing. We propose a low-overhead method of bundling multiple flows with the same network service into a single flow in a kernel to discover dependencies. The proposed method reduces the number of transferred flows to the user space, thus reducing CPU usage. Experimental results from evaluating our method indicate that the method maintains a CPU overhead below 2.2% when the number of flows increases. ------------------------------ This is a preprint of an article intended for publication Journal of Information Processing(JIP). This preprint should not be cited. This article should be cited as: Journal of Information Processing Vol.30(2022) (online) DOI http://dx.doi.org/10.2197/ipsjjip.30.260 ------------------------------ |
|||||||||||
| 論文抄録(英) | ||||||||||||
| 内容記述タイプ | Other | |||||||||||
| 内容記述 | The widespread use of cloud computing has made it easier for service providers to develop new features and handle increased access. However, the network dependencies among components in distributed applications deployed in the cloud are becoming more complex because the number and types of components are increasing. When system administrators make changes to a system, they cannot specify the impact of the changes, which may lead to larger failures than expected. Current methods of automatically discovering dependencies trace network flows included in TCP/UDP sockets in the Linux kernel on all hosts deployed in distributed applications. However, as the rate of communication increases, the number of flows transferred from the kernel space to user space increases, which increases CPU usage for tracing. We propose a low-overhead method of bundling multiple flows with the same network service into a single flow in a kernel to discover dependencies. The proposed method reduces the number of transferred flows to the user space, thus reducing CPU usage. Experimental results from evaluating our method indicate that the method maintains a CPU overhead below 2.2% when the number of flows increases. ------------------------------ This is a preprint of an article intended for publication Journal of Information Processing(JIP). This preprint should not be cited. This article should be cited as: Journal of Information Processing Vol.30(2022) (online) DOI http://dx.doi.org/10.2197/ipsjjip.30.260 ------------------------------ |
|||||||||||
| 書誌レコードID | ||||||||||||
| 収録物識別子タイプ | NCID | |||||||||||
| 収録物識別子 | AN00116647 | |||||||||||
| 書誌情報 |
情報処理学会論文誌 巻 63, 号 3, 発行日 2022-03-15 |
|||||||||||
| ISSN | ||||||||||||
| 収録物識別子タイプ | ISSN | |||||||||||
| 収録物識別子 | 1882-7764 | |||||||||||
