Distributed Construction Protocols of Probabilistic Degree-Weighted Peer-to-Peer Overlays
スポンサーリンク
概要
- 論文の詳細を見る
Unstructured overlay networks are widely adopted in large-scale and heterogeneous peer-to-peer (P2P) systems for their scalability and flexibility. A distinct feature of such systems is that they randomly route messages e.g., by flooding or random walk. In such systems, the number of messages and tasks carrying by those messages each peer receives is greatly affected by the number of the peers incoming links. The objective of this paper is to build controllable degree-weighted networks in which the expected number of incoming links of each peer is proportional to its weight which is a local parameter. In such a network, a peer can control the number of those randomly disseminated messages and tasks it receives by adjust it weight. In addition, in order to bound the construction overhead for highly biased networks, we restrict all peers to have the same number of outgoing links. The objective network is constructed by local topology transformations that peers periodically exchange outgoing links with each other. A framework, which includes 81 different protocols by combination of exchange rules, is presented and evaluated by simulation. The simulation result shows that two of them can generate the networks having similar properties with the objective network. This work first achieves the weight-proportional degree control under the out-regular network model.
- (社)電子情報通信学会の論文
- 2009-04-01
著者
-
OOSHITA Fukuhito
Graduate School of Information Science and Technology, Osaka University
-
KAKUGAWA Hirotsugu
Graduate School of Information Science and Technology, Osaka University
-
MASUZAWA Toshimitsu
Graduate School of Information Science and Technology, Osaka University
-
WU Yu
Graduate School of Information Science and Technology, Osaka University
-
Masuzawa Toshimitsu
Graduate School Of Engineering Science Osaka University
-
Wu Yu
Graduate School Of Information Science And Technology Osaka University
-
Masuzawa Toshimitsu
Osaka Univ. Toyonaka‐shi Jpn
-
Ooshita Fukuhito
Graduate School Of Information Science And Technology Osaka University
-
Kakugawa Hirotsugu
Graduate School Of Information Science And Technology Osaka University
関連論文
- A Self-Adaptive Routing Protocol in Wireless LANs Based on Attractor Selection
- A Biologically Inspired Self-Adaptation of Replica Density Control
- A Message-Efficient Peer-to-Peer Search Protocol Based on Adaptive Index Dissemination
- An Efficient Index Dissemination in Unstructured Peer-to-Peer Networks
- Self-Adaptive Mobile Agent Population Control in Dynamic Networks Based on the Single Species Population Model(Distributed Cooperation and Agents)
- A Simple Parallel Algorithm for the Medial Axis Transform (Special Issue on Architectures Algorithms and Networks for Massively parallel Computing)
- Timed Atomic Broadcast Resiliet to Multiple Timing Faults
- Timed Atomic Broadcast Resiliet to Multiple Timing Faults
- Scheduling for Independent-Task Applications on Heterogeneous Parallel Computing Environments under the Unidirectional One-Port Model(Parallel and Distributed Computing,Foundations of Computer Science)
- Scheduling for Gather Operation in Heterogeneous Parallel Computing Environments
- Hierarchical Composition of Self-Stabilizing Protocols Preserving the Fault-Containment Property
- Distributed Construction Protocols of Probabilistic Degree-Weighted Peer-to-Peer Overlays
- Self-Stabilization in Dynamic Networks
- Parallel Selection Algorithms for CGM and BSP Models with Application to Sorting (特集 並列処理) -- (並列・分散アルゴリズム)
- Self-Stabilizing Agent Traversal on Tree Networks(Distributed Cooperation and Agents)
- A Self-Stabilizing Approximation Algorithm for the Distributed Minimum k-Domination(Discrete Mathematics and Its Applications)
- Time-Optimal Gathering Algorithm of Mobile Robots with Local Weak Multiplicity Detection in Rings
- A Method of Parallelizing Consensuses for Accelerating Byzantine Fault Tolerance