In this area, we deal with the execution of OTF services in multiple OTF Compute Centers. Typically, OTF services are executed on OTF Compute Centers with an advantageous position with respect to inputs and outputs. Accordingly, questions arise where to execute which part of an OTF service. This model assumes cooperating OTF compute centers, e.g. centers that belong to the same OTF provider. In the context of competing compute centers, we will cooperate with subproject A3 by using game-theoretical approaches as they have been considered in the area of selfish scheduling.
Similarly to the prior working area, we will propose an architecture where we can assign requests to a suitable compute center while incorporating workload and network topology. A special focus lies on the repeated execution of similar requests. We are confident that we can build upon our preliminary studies on Distributed Cloud Computing and Network Function Virtualization.
Regarding scheduling in multiple OTF Compute Centers, we will focus on the assignment process of jobs to compute centers, i.e. given a number of jobs arriving at some inputs and being requested at some outputs, we are looking for compute centers such that communication and execution costs are minimized.
For competing compute centers, on the other hand, we examine game theoretic models with a given number of players, each operating some compute centers. They can make offers to different jobs; jobs are executed on the compute center with the best offer.