IEICE TRANSACTIONS on Information
Constructing Overlay Networks with Short Paths and Low Communication Cost
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Information Vol.E93-D No.6 pp.1540-1548
- Publication Date
- 2010/06/01
- Publicized
- Online ISSN
- 1745-1361
- DOI
- 10.1587/transinf.E93.D.1540
- Type of Manuscript
- PAPER
- Category
- Information Network
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Fuminori MAKIKAWA, Tatsuhiro TSUCHIYA, Tohru KIKUNO, "Constructing Overlay Networks with Short Paths and Low Communication Cost" in IEICE TRANSACTIONS on Information,
vol. E93-D, no. 6, pp. 1540-1548, June 2010, doi: 10.1587/transinf.E93.D.1540.
Abstract: 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.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.E93.D.1540/_p
Copy
@ARTICLE{e93-d_6_1540,
author={Fuminori MAKIKAWA, Tatsuhiro TSUCHIYA, Tohru KIKUNO, },
journal={IEICE TRANSACTIONS on Information},
title={Constructing Overlay Networks with Short Paths and Low Communication Cost},
year={2010},
volume={E93-D},
number={6},
pages={1540-1548},
abstract={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.},
keywords={},
doi={10.1587/transinf.E93.D.1540},
ISSN={1745-1361},
month={June},}
Copy
TY - JOUR
TI - Constructing Overlay Networks with Short Paths and Low Communication Cost
T2 - IEICE TRANSACTIONS on Information
SP - 1540
EP - 1548
AU - Fuminori MAKIKAWA
AU - Tatsuhiro TSUCHIYA
AU - Tohru KIKUNO
PY - 2010
DO - 10.1587/transinf.E93.D.1540
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E93-D
IS - 6
JA - IEICE TRANSACTIONS on Information
Y1 - June 2010
AB - 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.
ER -
English
