Laying pheromone trails for balanced and dependable component mappings

Máté J. Csorba, Hein Meling, Poul E. Heegaard

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

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.

Original languageEnglish
Title of host publicationSelf-Organizing Systems - 4th IFIP TC 6 International Workshop, IWSOS 2009, Proceedings
Pages50-64
Number of pages15
DOIs
StatePublished - 2009
Externally publishedYes
Event4th IFIP TC 6 International Workshop on Self-Organizing Systems, IWSOS 2009 - Zurich, Switzerland
Duration: 9 Dec 200911 Dec 2009

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5918 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference4th IFIP TC 6 International Workshop on Self-Organizing Systems, IWSOS 2009
Country/TerritorySwitzerland
CityZurich
Period9/12/0911/12/09

Fingerprint

Dive into the research topics of 'Laying pheromone trails for balanced and dependable component mappings'. Together they form a unique fingerprint.

Cite this