Laying Pheromone Trails for Balanced and Dependable Component Mappings

Authors:
Máté J. Csorba;Hein Meling;Poul E. Heegaard
Affiliations:
Department of Telematics, Norwegian University of Science and Technology, Trondheim, Norway N-7491;Department of Electrical Engineering and Computer Science, University of Stavanger, Stavanger, Norway N-4036;Department of Telematics, Norwegian University of Science and Technology, Trondheim, Norway N-7491
Venue:
IWSOS '09 Proceedings of the 4th IFIP TC 6 International Workshop on Self-Organizing Systems
Year:
2009

Citing 8
Cited 0

Allocating Modules to Processors in a Distributed System

IEEE Transactions on Software Engineering
Using the Cross-Entropy Method to Guide/Govern Mobile Agent's Path Finding in Networks

MATA '01 Proceedings of the Third International Workshop on Mobile Agents for Telecommunication Applications
A Distributed Approach to Autonomous Fault Treatment in Spread

EDCC-7 '08 Proceedings of the 2008 Seventh European Dependable Computing Conference
An Approach to Autonomic Deployment Decision Making

IWSOS '08 Proceedings of the 3rd International Workshop on Self-Organizing Systems
Adaptable model-based component deployment guided by artificial ants

Autonomics '08 Proceedings of the 2nd International Conference on Autonomic Computing and Communication Systems
Foraging for Better Deployment of Replicated Service Components

DAIS '09 Proceedings of the 9th IFIP WG 6.1 International Conference on Distributed Applications and Interoperable Systems
Component deployment using parallel ant-nests

International Journal of Autonomous and Adaptive Communications Systems
Ant system: optimization by a colony of cooperating agents

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents an optimization framework for finding efficient deployment mappings of replicated service components (to nodes), while accounting for multiple services simultaneously and adhering to non-functional requirements. Currently, we consider load-balancing and dependability requirements. Our approach is based on a variant of Ant Colony Optimization and is completely decentralized, where ants communicate indirectly through pheromone tables in nodes. In this paper, we target scalability; however, existing encoding schemes for the pheromone tables did not scale. Hence, we propose and evaluate three different pheromone encodings. Using the most scalable encoding, we evaluate our approach in a significantly larger system than our previous work. We also evaluate the approach in terms of robustness to network partition failures.