The \texttt{SP{\!\it{\textsf{i}}}} Service Placement Framework

In this chapter, we present the \(\texttt{SP{\!\it{\textsf{i}}}}\) service placement framework as our contribution towards enabling service placement in ad hoc networks. Our framework is applicable to the placement of both centralized and distributed services as defined in the introductory chapter. It supports both the Graph Cost/Single Instance and the Graph Cost/Multiple Instances algorithms for the placement of centralized and distributed services as well as several placement algorithms proposed in the literature. Furthermore, we tightly integrate the process of placing service instances with the related problems of service discovery and routing. The overall goal is to reduce the cost of implementing placement decisions, thus making service placement a viable alternative to traditional architectures.