Self-Adaptive Mobile Agent Population Control in Dynamic Networks Based on the Single Species Population Model(Distributed Cooperation and Agents)
スポンサーリンク
概要
- 論文の詳細を見る
Mobile-agent-based distributed computing is one of the most promising paradigms to support autonomic computing in a large-scale of distributed system with dynamics and diversity: mobile agents traverse the distributed system and carry out a sophisticated task at each node adaptively. In mobile-agent-based systems, a larger number of agents generally require shorter time to complete the whole task but consume more resources (e.g., processing power and network bandwidth). Therefore, it is indispensable to keep an appropriate number of agents for the application on the mobile-agent-based system. This paper considers the mobile agent population control problem in dynamic networks: it requires adjusting the number of agents to a constant fraction of the current network size. This paper proposes algorithms inspired by the single species population model, which is a well-known population ecology model. These two algorithms are different in knowledge of networks each node requires. The first algorithm requires global information at each node, while the second algorithm requires only the local information. This paper shows by simulations that the both algorithms realize self-adaptation of mobile agent population in dynamic networks, but the second algorithm attains slightly lower accuracy than the first one.
- 社団法人電子情報通信学会の論文
- 2007-01-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
-
MASUZAWA Toshimitsu
Graduate School of Information Science and Technology, Osaka University
-
SUZUKI Tomoko
Graduate School of Information Science and Technology, Osaka University
-
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
-
Suzuki Tomoko
Graduate School Of Information Science And Technology Osaka University
-
Oshita Fukuhito
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
- The carbohydrate catabolism of Zostera marina influenced by lower salinity during the pre-germination stage
- The structural and histochemical analyses and chemical characters of the cuticle and epidermal walls cotyledon in ungerminated seeds of Zostera marina L.
- 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)
- Ultrastructural Localization of Hydrogen Peroxide in Host Leaves Treated with AK-toxin I Produced by Alternaria alternata Japanese Pear Pathotype
- 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