Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Service Placement in Ad Hoc NetworksThe \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\texttt{SP{\!\it{\textsf{i}}}}$$\end{document} Service Placement Framework

Service Placement in Ad Hoc Networks: The \documentclass[12pt]{minimal} \usepackage{amsmath}... [In this chapter, we present the \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\texttt{SP{\!\it{\textsf{i}}}}$$\end{document} 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.] http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png

Service Placement in Ad Hoc NetworksThe \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\texttt{SP{\!\it{\textsf{i}}}}$$\end{document} Service Placement Framework

Loading next page...
 
/lp/springer-journals/service-placement-in-ad-hoc-networks-the-documentclass-12pt-minimal-2NiIUkJC1n
Publisher
Springer London
Copyright
© The Author(s) 2012
ISBN
978-1-4471-2362-0
Pages
31 –61
DOI
10.1007/978-1-4471-2363-7_3
Publisher site
See Chapter on Publisher Site

Abstract

[In this chapter, we present the \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\texttt{SP{\!\it{\textsf{i}}}}$$\end{document} 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.]

Published: Jan 4, 2012

Keywords: \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\texttt{SP{\!\it{\textsf{i}}}}$$\end{document}; Service placement framework; Service discovery; Routing

There are no references for this article.