$$\texttt{{SPi}}$$ Service Placement Algorithms

In this chapter, we present two service placement algorithms, one for centralized and one for distributed services. Both are specifically designed to implement the placement intelligence within the SPi framework. The Graph Cost/Single Instance ( GCSI ) algorithm places the single service instance of centralized services, and the Graph Cost/Multiple Instances ( GCMI ) algorithm handles distributed services with multiple instances. For the latter case, we employ a dynamically assigned coordinator node to make placement decisions, rather than relying on more distributed approaches that incur the drawbacks of either higher signaling overhead or lower quality placement decisions.