Dynamic Update of CSP Allocations in Federation Orchestration

Marieke Beke ()

Sammanfattning

This paper discusses the project in which an algorithm was written to dynamically approach federation orchestration. This builds on and is part of the REINDEER project. In an environment with goods and online agents, and in this specific case, Contact Service Points (CSPs) and User Equipments (UEs), where the agents have different applications and make unpredictable changes such as moving around a room, finding a dynamic reallocation algorithm is a significant challenge.
The use of diverse case studies, encompassing both minor and significant adjust- ments to an allocation, has proven to be an effective approach in identifying more optimal solutions. An iterative methodology has been employed, wherein a ran- domly selected case is evaluated in each iteration. Only if a superior utility value is achieved is the new solution accepted. The utility values are calculated by a entity, designated as the oracle, which was not a part of the original project scope.
This approach has yielded higher, yet more consistent utility values compared to random reallocation. This is the case for different numbers of iterations, different numbers of CSPs and different numbers of UEs.
The runtime can become a bottleneck of the algorithm if more iterations have to be chosen. This is due to the fact that the oracle must be called every iteration. Overall, the addition of the dynamic reallocation algorithm is a relevant addition.

Handledare: William Tärneberg (EIT)
Examinator: Christian Nyberg (EIT)