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 NetworksEvaluation

Service Placement in Ad Hoc Networks: Evaluation [In this chapter, we present a quantitative evaluation of the SPi service placement framework running the Graph Cost/Single Instance and the Graph Cost/Multiple Instances service placement algorithms. We compare the performance of our approach with both a traditional client/server architecture without active service placement as well as several service placement algorithms proposed in the literature. In this evaluation, we employ the network simulator ns-2 to study the effect of these placement algorithms on the overall scalability of the ad hoc network, both in terms of network size as well as load.] http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png

Service Placement in Ad Hoc NetworksEvaluation

Download PDF
18 pages

Loading next page...
 
/lp/springer-journals/service-placement-in-ad-hoc-networks-evaluation-7aunlWCSGd
Publisher
Springer London
Copyright
© The Author(s) 2012
ISBN
978-1-4471-2362-0
Pages
91 –109
DOI
10.1007/978-1-4471-2363-7_5
Publisher site
See Chapter on Publisher Site

Abstract

[In this chapter, we present a quantitative evaluation of the SPi service placement framework running the Graph Cost/Single Instance and the Graph Cost/Multiple Instances service placement algorithms. We compare the performance of our approach with both a traditional client/server architecture without active service placement as well as several service placement algorithms proposed in the literature. In this evaluation, we employ the network simulator ns-2 to study the effect of these placement algorithms on the overall scalability of the ad hoc network, both in terms of network size as well as load.]

Published: Jan 4, 2012

Keywords: Experimental results; Quantitative comparison; Simulation

There are no references for this article.