Skip to Main content Skip to Navigation
Conference papers

Graph-Transformational Swarms with Stationary Members

Abstract : The concept of graph-transformational swarms is a novel approach that offers a rule-based framework to model discrete swarm methods. This paper continues the research on graph-transformational swarms by focusing on a special type of members called stationary members. The stationary members are assigned to particular subgraphs of the considered environment graphs. Every stationary member is responsible for calculations and transformations at the assigned area, and the applicability of the member’s rules depends only on this area and not on the whole environment. A further advantage of stationary members is that it is easier to guarantee that they can act in parallel than for moving members. Cloud computing is an engineering topic where swarms with stationary members can be applied in an adequate way, namely, by modeling the nodes of the server network that forms the cloud as stationary members. We illustrate the proposed concept by means of a case study.
Complete list of metadatas

Cited literature [11 references]  Display  Hide  Download

https://hal.inria.fr/hal-01343477
Contributor : Hal Ifip <>
Submitted on : Friday, July 8, 2016 - 2:57:48 PM
Last modification on : Tuesday, February 13, 2018 - 4:24:03 PM

File

336594_1_En_15_Chapter.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Larbi Abdenebaoui, Hans-Jörg Kreowski, Sabine Kuske. Graph-Transformational Swarms with Stationary Members. 6th Doctoral Conference on Computing, Electrical and Industrial Systems (DoCEIS), Apr 2015, Costa de Caparica, Portugal. pp.137-144, ⟨10.1007/978-3-319-16766-4_15⟩. ⟨hal-01343477⟩

Share

Metrics

Record views

256

Files downloads

180