A Biologically Inspired Self-Adaptation of Replica Density Control

スポンサーリンク

概要

• 論文の詳細を見る

• Biologically-inspired approaches are one of the most promising approaches to realize highly-adaptive distributed systems. Biological systems inherently have self-* properties, such as self-stabilization, self-adaptation, self-configuration, self-optimization and self-healing. Thus, the application of biological systems into distributed systems has attracted a lot of attention recently. In this paper, we present one successful result of bio-inspired approach: we propose distributed algorithms for resource replication inspired by the single species population model. Resource replication is a crucial technique for improving system performance of distributed applications with shared resources. In systems using resource replication, generally, a larger number of replicas lead to shorter time to reach a replica of a requested resource but consume more storage of the hosts. Therefore, it is indispensable to adjust the number of replicas appropriately for the resource sharing application. This paper considers the problem for controlling the densities of replicas adaptively in dynamic networks and proposes two bio-inspired distributed algorithms for the problem. In the first algorithm, we try to control the replica density for a single resource. However, in a system where multiple resources coexist, the algorithm needs high network cost and the exact knowledge at each node about all resources in the network. In the second algorithm, the densities of all resources are controlled by the single algorithm without high network cost and the exact knowledge about all resources. This paper shows by simulations that these two algorithms realize self-adaptation of the replica density in dynamic networks.

• （社）電子情報通信学会の論文
• 2009-05-01

著者

• Izumi Taisuke

  Nagoya Inst. Technol. Nagoya‐shi Jpn

• Izumi Tomoko

  Nagoya Inst. Technol. Nagoya‐shi Jpn

• Izumi Taisuke

  Graduate School Of Information Science And Technology Osaka University

• 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

• IZUMI Tomoko

  Center for Social Contribution and Collaboration, Nagoya Institute of Technology

• Masuzawa Toshimitsu

  Graduate School Of Engineering Science Osaka University

• Izumi Taisuke

  Graduate School Of Engineering Nagoya Institute Of Technology

• 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

• Oshita Fukuhito

  Graduate School of Information Science and Technology, Osaka University

• Kakugawa Hirotoshi

  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)
• Complexity of minimum certificate dispersal problem with tree structure (コンピュテーション)
• Time-Optimal Gathering Algorithm of Mobile Robots with Local Weak Multiplicity Detection in Rings
• A Method of Parallelizing Consensuses for Accelerating Byzantine Fault Tolerance

もっと見る 閉じる

スポンサーリンク