Graph-Transformational Swarms with Stationary Members - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2015

Graph-Transformational Swarms with Stationary Members

Larbi Abdenebaoui
  • Function : Author
  • PersonId : 985901
Hans-Jörg Kreowski
  • Function : Author
  • PersonId : 985902
Sabine Kuske
  • Function : Author
  • PersonId : 985903


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.
Fichier principal
Vignette du fichier
336594_1_En_15_Chapter.pdf (4 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01343477 , version 1 (08-07-2016)





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⟩
185 View
82 Download



Gmail Facebook Twitter LinkedIn More