2016
DOI: 10.1007/978-3-319-44482-6_4
|View full text |Cite
|
Sign up to set email alerts
|

Reinforcement Learning Techniques for Decentralized Self-adaptive Service Assembly

Abstract: This paper proposes a self-organizing fully decentralized solution for the service assembly problem, whose goal is to guarantee a good overall quality for the delivered services, ensuring at the same time fairness among the participating peers. The main features of our solution are: (i) the use of a gossip protocol to support decentralized information dissemination and decision making, and (ii) the use of a reinforcement learning approach to make each peer able to learn from its experience the service selectio… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
9
0

Year Published

2016
2016
2022
2022

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 13 publications
(9 citation statements)
references
References 17 publications
0
9
0
Order By: Relevance
“…To facilitate reproducibility and replicability, our code, the used data and our experimental results are available online. 7…”
Section: Resultsmentioning
confidence: 99%
“…To facilitate reproducibility and replicability, our code, the used data and our experimental results are available online. 7…”
Section: Resultsmentioning
confidence: 99%
“…IETF's Autonomic Networking Integrated Model and Approach (ANIMA) [28] working group explores autonomic networking of managed devices with the goal to provide the self-x properties, however, control loops are currently not covered. Some proposals include learning ( [22], [29]- [33]), for example [22] uses agents to implement cognitive control loops, and [33] proposes a multi-agent network automation architecture that follows the Generic Autonomic Network Architecture (GANA) reference model from the European Telecommunication Standards Institution (ETSI) [34]. The failure to deploy autonomic network management in the past is discussed and reconsidered in light of new enabler technologies in [24].…”
Section: B Autonomic Network Managementmentioning
confidence: 99%
“…When 7−2 is enforced in line 19, the monitorData method (line 23) is called. This method uses the populated link utilization category and iterates over each pair of resource and metric to collect the monitoring data (lines [25][26][27][28][29][30][31]. In use-case, each resource is a link with a metric type that is either core or edge, hence the output is a key-value data structure separated by metric type, where each key is a link name and the value is the link utilization.…”
Section: Use-casementioning
confidence: 99%
“…To realize the service choreography, each peer needs to discover the services offered by other peers, together with their utilization level, so to determine the best mapping that satisfy the workflow requirements (e.g., minimum response time, maximum throughput). Similarly to the approach presented in [15], the system can employ the information sharing pattern to share, among peers, knowledge about the services offered by peers and their utilization state. Relying on this information, at run-time, the service choreography can be adapted so to automatically scale the number of concrete services to be used to run the workflow.…”
Section: Patternmentioning
confidence: 99%