@inproceedings{19607,
  abstract     = {{Modern services consist of modular, interconnected
components, e.g., microservices forming a service mesh. To
dynamically adjust to ever-changing service demands, service
components have to be instantiated on nodes across the network.
Incoming flows requesting a service then need to be routed
through the deployed instances while considering node and link
capacities. Ultimately, the goal is to maximize the successfully
served flows and Quality of Service (QoS) through online service
coordination. Current approaches for service coordination are
usually centralized, assuming up-to-date global knowledge and
making global decisions for all nodes in the network. Such global
knowledge and centralized decisions are not realistic in practical
large-scale networks.

To solve this problem, we propose two algorithms for fully
distributed service coordination. The proposed algorithms can be
executed individually at each node in parallel and require only
very limited global knowledge. We compare and evaluate both
algorithms with a state-of-the-art centralized approach in extensive
simulations on a large-scale, real-world network topology.
Our results indicate that the two algorithms can compete with
centralized approaches in terms of solution quality but require
less global knowledge and are magnitudes faster (more than
100x).}},
  author       = {{Schneider, Stefan Balthasar and Klenner, Lars Dietrich and Karl, Holger}},
  booktitle    = {{IEEE International Conference on Network and Service Management (CNSM)}},
  keywords     = {{distributed management, service coordination, network coordination, nfv, softwarization, orchestration}},
  publisher    = {{IEEE}},
  title        = {{{Every Node for Itself: Fully Distributed Service Coordination}}},
  year         = {{2020}},
}