Service provisioning in ad hoc networks is challenging given the difficultiesof communicating over a wireless channel and the potential heterogeneity and mobility of the devices that form the network. Service placement is the process of selecting an optimal set of nodes to host the implementation of a servicein light of a given service demand and network topology. The key advantage ofactive service placement in ad hoc networks is that it allows for the serviceconfiguration to be adapted continuously at run time. Service Placement in AdHoc Networks proposes the SPi service placement framework as a novel approachto service placement in ad hoc networks. The SPi framework takes advantage ofthe interdependencies between service placement, service discovery and the routing of service requests to minimize signaling overhead. The work also proposes the Graph Cost. Single Instance and the Graph Cost. Multiple Instances placement algorithms. Describes a SPi service placement framework as a novel approach to serviceplacement in ad hoc networks. Proposes the Graph Cost/Single Instance and theGraph Cost/Multiple Instances placement algorithms. Examines the properties of this approach to service placement and compares it with other recent proposals. INDICE: Introduction. Background. The SPi Service Placement Framework. SPiService Placement Algorithms. Evaluation. Conclusion.
- ISBN: 978-1-4471-2362-0
- Editorial: Springer London
- Encuadernacion: Rústica
- Páginas: 116
- Fecha Publicación: 31/12/2011
- Nº Volúmenes: 1
- Idioma: Inglés