A coordination model of pervasive service ecosystems

Viroli, Mirko; Pianini, Danilo; Montagna, Sara; Stevenson, Graeme; Zambonelli, Franco

doi:10.1016/j.scico.2015.06.003

Cited by 14 publications

(13 citation statements)

References 46 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…• SAPERE [15][16][17][18][19][20] • CASCADAS [21][22][23] • BIONETS [24][25][26][27] • service reconfiguration for service ecosystems [80]. Figure 5 and Table 3 provide a comparison of these four primary methods.…”

Section: Ac Methods In Service Ecosystemsmentioning

confidence: 99%

“…In [15][16][17][18][19][20], the authors propose a nature-inspired reference architecture called SAPERE (Self-Aware Pervasive Service Ecosystems), which can be a useful guide in the design and implementation of self-adaptive pervasive service ecosystems. They identify several research challenges emerging from the convergence of cyber-physical worlds, such as comprehensive situation-awareness, top-down vs. bottom-up design, power of masses, decentralized control, and diversity and evolvability [19].…”

Section: Saperementioning

confidence: 99%

“…The authors' method has matured and evolved in many research papers [15][16][17][18][19][20]. The middleware implemented has been validated in the context of exemplary use cases on information and guidance services in a smart museum.…”

Section: Saperementioning

confidence: 99%

“…In recent years, several methods and techniques have been proposed to exploit the benefits of the AC initiative in service-oriented ecosystems, for example, SAPERE [15][16][17][18][19][20], CASCADAS [21][22][23] and BIONETS [24][25][26][27]. However, very little work has applied the AC initiative in the DSEs domain [28][29][30].…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

A survey of autonomic computing methods in digital service ecosystems

Abeywickrama

Ovaska

2016

SOCA

View full text Add to dashboard Cite

Service engineering of digital service ecosystems can be associated with several challenges, such as change and evolution of requirements; gathering of quality requirements and assessment; and uncertainty caused by dynamic nature and unknown deployment environment, composition and users. Therefore, the complexity and dynamics in which these digital services are deployed call for solutions to make them autonomic. Until now there has been no upto-date review of the scientific literature on the application of the autonomic computing initiative in the digital service ecosystems domain. This article presents a review and comparison of autonomic computing methods in digital service ecosystems from the perspective of service engineering, i.e., requirements engineering and architecting of services. The review is based on systematic queries in four leading scientific databases and Google Scholar, and it is organized in four thematic research areas. A comparison framework has been defined which can be used as a guide for comparing the different methods selected. The goal is to discover which methods are suitable for the service engineering of digital service ecosystems with autonomic computing capabilities, highlight what the shortcomings of the methods are, and identify which research activities need to be conducted in order to overcome these shortcomings. The comparison reveals that none of the existing methods entirely fulfills the requirements that are defined in the comparison framework.B Dhaminda B. Abeywickrama

show abstract

Section: Ac Methods In Service Ecosystemsmentioning

confidence: 99%

Section: Saperementioning

confidence: 99%

Section: Saperementioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A survey of autonomic computing methods in digital service ecosystems

Abeywickrama

Ovaska

2016

SOCA

View full text Add to dashboard Cite

show abstract

“…Combination of such rules provide spatial coordination patterns (Fernandez‐Marquez, Serugendo, Montagna, Viroli, & Arcos, ). In SAPERE, LSAs are provided with the notion of location, which, however, is tightly bound to the location of the device hosting the annotation (Viroli, Pianini, Montagna, Stevenson, & Zambonelli, ).…”

Section: Background and Related Workmentioning

confidence: 99%

Spatial Tuples: Augmenting reality with tuples

et al. 2018

Self Cite

View full text Add to dashboard Cite

We introduce Spatial Tuples, an extension of the basic tuple‐based model for distributed multi‐agent system coordination where (a) tuples are conceptually placed in regions of the physical world and possibly move anchored to a mobile computational device, (b) the behaviour of standard Linda coordination primitives is extended so as to depend on the spatial properties of the coordinating agents, tuples, and the topology of space, and (c) the tuple space can be conceived as a virtual layer augmenting physical reality. Motivated by the needs of mobile augmented‐reality applications, Spatial Tuples explicitly aims at supporting space‐aware and space‐based coordination in agent‐based pervasive computing scenarios. This paper presents the coordination model, its formalization as a process algebra, a library of patterns of coordination it enables, and a discussion of application scenarios, challenges, and open issues for future works.

show abstract

The share Operator for Field-Based Coordination

Audrito

Beal

Damiani

et al. 2019

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Recent work in the area of coordination models and collective adaptive systems promotes a view of distributed computations as functions manipulating computational fields (data structures spread over space and evolving over time), and introduces the field calculus as a formal foundation for field computations. With the field calculus, evolution (time) and neighbor interaction (space) are handled by separate functional operators: however, this intrinsically limits the speed of information propagation that can be achieved by their combined use. In this paper, we propose a new field-based coordination operator called share, which captures the space-time nature of field computations in a single operator that declaratively achieves: (i) observation of neighbors' values; (ii) reduction to a single local value; and (iii) update and converse sharing to neighbors of a local variable. In addition to conceptual economy, use of the share operator also allows many prior field calculus algorithms to be greatly accelerated, which we validate empirically with simulations of a number of frequently used network propagation and collection algorithms.

show abstract

A coordination model of pervasive service ecosystems

Cited by 14 publications

References 46 publications

A survey of autonomic computing methods in digital service ecosystems

A survey of autonomic computing methods in digital service ecosystems

Spatial Tuples: Augmenting reality with tuples

The share Operator for Field-Based Coordination

Contact Info

Product

Resources

About