Constructing Overlay Networks with Short Paths and Low Communication Cost
-
- MAKIKAWA Fuminori
- Graduate School of Information Science and Technology, Osaka University
-
- TSUCHIYA Tatsuhiro
- Graduate School of Information Science and Technology, Osaka University
-
- KIKUNO Tohru
- Graduate School of Information Science and Technology, Osaka University
この論文をさがす
抄録
A Peer-To-Peer (P2P) application uses an overlay network which is a virtual network constructed over the physical network. Traditional overlay construction methods do not take physical location of nodes into consideration, resulting in a large amount of redundant traffic. Some proximity-aware construction methods have been proposed to address this problem. These methods typically connect nearby nodes in the physical network. However, as the number of nodes increases, the path length of a route between two distant nodes rapidly increases. To alleviate this problem, we propose a technique which can be incorporated in existing overlay construction methods. The idea behind this technique is to employ long links to directly connect distant nodes. Through simulation experiments, we show that using our proposed technique, networks can achieve small path length and low communication cost while maintaining high resiliency to failures.
収録刊行物
-
- IEICE Transactions on Information and Systems
-
IEICE Transactions on Information and Systems E93-D (6), 1540-1548, 2010
一般社団法人 電子情報通信学会
- Tweet
詳細情報 詳細情報について
-
- CRID
- 1390282679356324352
-
- NII論文ID
- 10027987879
-
- NII書誌ID
- AA10826272
-
- ISSN
- 17451361
- 09168532
-
- HANDLE
- 11094/27257
-
- 本文言語コード
- en
-
- データソース種別
-
- JaLC
- IRDB
- Crossref
- CiNii Articles
-
- 抄録ライセンスフラグ
- 使用不可