Online Service Placement and Request Routing in Coalition Environments

Abstract This paper presents an online algorithm for placing services and routing data analytics requests in tactical edge net- works. The problem is military relevant because edge networks are highly-dynamic, and offline approaches are not suitable. The algorithm proposed can be seen as combining online gradient descent with primal-dual subgradient methods in optimization.
  • Victor Valls (Yale)
  • Geeth de Mel (IBM UK)
  • Heesung Kwon (ARL)
  • Sebastian Stein (Southampton)
  • Leandros Tassiulas (Yale)
Date Sep-2019
Venue Annual Fall Meeting of the DAIS ITA, 2019