Constructing Overlay Networks with Short Paths and Low Communication Cost
スポンサーリンク
概要
- 論文の詳細を見る
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.
- (社)電子情報通信学会の論文
- 2010-06-01
著者
-
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 Engineering Science Osaka University
-
Makikawa Fuminori
Graduate School Of Information Science And Technology Osaka University
関連論文
- Constructing Overlay Networks with Short Paths and Low Communication Cost
- Feature Interaction Verification Using Unbounded Model Checking with Interpolation
- Prediction of Fault-Prone Software Modules Using a Generic Text Discriminator
- Probabilistic Model Checking of the One-Dimensional Ising Model
- An Effective Testing Method for Hardware Related Fault in Embedded Software(Software Engineering for Embedded Systems)
- Feature Interaction Detection by Bounded Model Checking(Dependable Communication)(Dependable Computing)
- Software Project Simulator for Effective Process Improvement (特集 〔情報処理学会〕創立40周年記念論文)
- Three-Mode Failure Model for Reliability Analysis of Distributed Programs (Special Issue on Fault-Tolerant Computing)
- Verifying Fault Tolerance of Concurrent Systems by Model Checking(Special Section on Concurrent System Technology and Its Application to Multiple Agent Systems)
- A Hierarchical Approach to Dependability Evaluation of Distributed Systems with Replicated Resources
- Computing the Stabilization Times of SElf-Stabilizing Systems (Special Section on Concurrent Systems Technology)
- New Constructions for Nondominated k-Coteries
- New System Model Based on Autonomous Decentralized System for Highly Productive Processing Equipment (IEICE/IEEE Joint Special Issue on Autonomous Decentralized Systems)
- Constructing a Bayesian Belief Network to Predict Final Quality in Embedded System Development(Software Engineering for Embedded Systems)
- Test Item Prioritizing Metrics for Selective Software Testing(Software Engineering)
- New 2-Factor Covering Designs for Software Testing(Regular Section)
- A BDD-based approach to reliability-optimal module allocation in networks (信頼性)
- SAT and SMT based model checking of concurrent systems (コンカレント工学)
- Parallelizing SDP(Sum of Disjoint Products)Algorithms for Fast Reliability Analysis
- An Energy-Efficient Broadcast Scheme for Multihop Wireless Ad Hoc Networks Using Variable-Range Transmission Power(Networks)
- Effective Scheduling of Duplicated Tasks for Fault Tolerance in Multiprocessor Systems
- Error Models and Fault-Secure Scheduling in Multiprocessor Systems
- Constructing Overlay Networks with Short Paths and Low Communication Cost
- A Distributed Routing Protocol for Finding Two Node-Disjoint Paths in Computer Networks (Special Issue on Distributed Processing for Controlling Telecommunications Systems)