WEKO3
アイテム
Fluid-Based Analysis for Understanding TCP Performance on Scale-Free Structure
https://ipsj.ixsq.nii.ac.jp/records/169474
https://ipsj.ixsq.nii.ac.jp/records/169474c9999029-2b9f-4b3b-a2ab-e838ecba326c
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
IPSJ-JNL5707007.pdf (726.0 kB)
|
Copyright (c) 2016 by the Information Processing Society of Japan
|
|
| オープンアクセス | ||
| Item type | Journal(1) | |||||||||
|---|---|---|---|---|---|---|---|---|---|---|
| 公開日 | 2016-07-15 | |||||||||
| タイトル | ||||||||||
| タイトル | Fluid-Based Analysis for Understanding TCP Performance on Scale-Free Structure | |||||||||
| タイトル | ||||||||||
| 言語 | en | |||||||||
| タイトル | Fluid-Based Analysis for Understanding TCP Performance on Scale-Free Structure | |||||||||
| 言語 | ||||||||||
| 言語 | eng | |||||||||
| キーワード | ||||||||||
| 主題Scheme | Other | |||||||||
| 主題 | [特集：Applications and the Internet in Conjunction with Main Topics of COMPSAC 2015] large-scale network, scale-free structure, end-to-end performance, TCP, fluid-based analysis | |||||||||
| 資源タイプ | ||||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||||
| 資源タイプ | journal article | |||||||||
| 著者所属 | ||||||||||
| Graduate School of System Design, Tokyo Metropolitan University | ||||||||||
| 著者所属 | ||||||||||
| Graduate School of Science and Technology, Kwansei Gakuin University | ||||||||||
| 著者所属(英) | ||||||||||
| en | ||||||||||
| Graduate School of System Design, Tokyo Metropolitan University | ||||||||||
| 著者所属(英) | ||||||||||
| en | ||||||||||
| Graduate School of Science and Technology, Kwansei Gakuin University | ||||||||||
| 著者名 |
Yusuke, Sakumoto
× Yusuke, Sakumoto
× Hiroyuki, Ohsaki
|
|||||||||
| 著者名(英) |
Yusuke, Sakumoto
× Yusuke, Sakumoto
× Hiroyuki, Ohsaki
|
|||||||||
| 論文抄録 | ||||||||||
| 内容記述タイプ | Other | |||||||||
| 内容記述 | Scale-free structure is one of the most notable properties of the Internet as a complex network. Many researchers have investigated the end-to-end performance (e.g., throughput, packet loss probability, and round-trip time between source/destination nodes) of TCP congestion control mechanisms, but the impact of the scale-free structure on the TCP performance has not been fully understood. In this paper, we analyze the TCP performance on a scale-free tree whose strength of the scale-free property can be adjusted by a parameter. A scale-free tree represents the communication kernel for investigating a scale-free network since TCP mainly transmits packets on a shortest path between TCP source/destination nodes, and most shortest paths are included in the scale-free tree. Our numerical results show that the scale-free structure of a network improves the TCP performance, and that such performance improvement is caused by a reduction in the average path length and also a reduction of the traffic intensity at the bottleneck link. Furthermore, we confirm the validity of our analysis through a comparison with an optimization-based analysis. ------------------------------ 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.24(2016) No.4 (online) DOI http://dx.doi.org/10.2197/ipsjjip.24.660 ------------------------------ |
|||||||||
| 論文抄録(英) | ||||||||||
| 内容記述タイプ | Other | |||||||||
| 内容記述 | Scale-free structure is one of the most notable properties of the Internet as a complex network. Many researchers have investigated the end-to-end performance (e.g., throughput, packet loss probability, and round-trip time between source/destination nodes) of TCP congestion control mechanisms, but the impact of the scale-free structure on the TCP performance has not been fully understood. In this paper, we analyze the TCP performance on a scale-free tree whose strength of the scale-free property can be adjusted by a parameter. A scale-free tree represents the communication kernel for investigating a scale-free network since TCP mainly transmits packets on a shortest path between TCP source/destination nodes, and most shortest paths are included in the scale-free tree. Our numerical results show that the scale-free structure of a network improves the TCP performance, and that such performance improvement is caused by a reduction in the average path length and also a reduction of the traffic intensity at the bottleneck link. Furthermore, we confirm the validity of our analysis through a comparison with an optimization-based analysis. ------------------------------ 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.24(2016) No.4 (online) DOI http://dx.doi.org/10.2197/ipsjjip.24.660 ------------------------------ |
|||||||||
| 書誌レコードID | ||||||||||
| 収録物識別子タイプ | NCID | |||||||||
| 収録物識別子 | AN00116647 | |||||||||
| 書誌情報 |
情報処理学会論文誌 巻 57, 号 7, 発行日 2016-07-15 |
|||||||||
| ISSN | ||||||||||
| 収録物識別子タイプ | ISSN | |||||||||
| 収録物識別子 | 1882-7764 | |||||||||
