Laying Pheromone Trails for Balanced and Dependable Component Mappings

Autor:	Poul E. Heegaard, Máté J. Csorba, Hein Meling
Rok vydání:	2009
Předmět:	Cross entropy Robustness (computer science) Software deployment Computer science Distributed computing Ant colony optimization algorithms Scalability Network partition Dependability Pheromone ComputingMethodologies_ARTIFICIALINTELLIGENCE
Zdroj:	Self-Organizing Systems ISBN: 9783642108648 IWSOS
DOI:	10.1007/978-3-642-10865-5_5
Popis:	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.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::bb44f8629e59b0c72aadd3b043ab6fe8 https://doi.org/10.1007/978-3-642-10865-5_5 Zobrazit plný text záznamu