| 000 | 05857nam a22004455i 4500 | ||
|---|---|---|---|
| 001 | 978-1-4471-2363-7 | ||
| 003 | DE-He213 | ||
| 005 | 20170628033624.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 120103s2012 xxk| s |||| 0|eng d | ||
| 020 |
_a9781447123637 _9978-1-4471-2363-7 |
||
| 024 | 7 |
_a10.1007/978-1-4471-2363-7 _2doi |
|
| 050 | 4 | _aQA76.9.E94 | |
| 072 | 7 |
_aUYD _2bicssc |
|
| 072 | 7 |
_aCOM074000 _2bisacsh |
|
| 082 | 0 | 4 |
_a004.24 _223 |
| 100 | 1 |
_aWittenburg, Georg. _eauthor. |
|
| 245 | 1 | 0 |
_aService Placement in Ad Hoc Networks _h[electronic resource] / _cby Georg Wittenburg, Jochen Schiller. |
| 264 | 1 |
_aLondon : _bSpringer London, _c2012. |
|
| 300 |
_aIX, 116p. 28 illus. _bonline resource. |
||
| 336 |
_atext _btxt _2rdacontent |
||
| 337 |
_acomputer _bc _2rdamedia |
||
| 338 |
_aonline resource _bcr _2rdacarrier |
||
| 347 |
_atext file _bPDF _2rda |
||
| 490 | 1 |
_aSpringerBriefs in Computer Science, _x2191-5768 |
|
| 505 | 0 | _aIntroduction -- Background -- The SPi Service Placement Framework -- SPi Service Placement Algorithms -- Evaluation -- Conclusion. | |
| 520 | _aService provisioning in ad hoc networks is challenging given the difficulties of communicating over a wireless channel and the potential heterogeneity and mobility of the devices that form the network. In order to optimize the performance of the network over which a service host provides a service to client nodes, it is necessary to continuously adapt the logical network topology to both external (e.g., wireless connectivity, mobility, churn) and internal (e.g., communication patterns, service demand) factors. Recent proposals advocate that nodes should dynamically choose which nodes in the network are to provide application-level services to other nodes. Services in this context range from infrastructural services such as the Domain Name System (DNS) to user-oriented services such as the World Wide Web (WWW). Service placement is the process of selecting an optimal set of nodes to host the implementation of a service in light of a given service demand and network topology. The main questions addressed by service placement are: How many instances of the same service should be available in the network and cooperate to process clients’ service requests; where these service instances should be placed, i.e., which nodes are best suited for hosting them; and when to adapt the current service configuration. The service instances of a distributively operating service are exact copies of the software component that provides the service, including both the executable binary and the application-level data. The set of nodes that host a service instance is referred to as the service configuration. A good service configuration increases the performance of a service according to application-specific quality metrics, while at the same time potentially reducing the overall network load. The key advantage of active service placement in ad hoc networks is that it allows for the service configuration to be adapted continuously at run time. Service Placement in Ad Hoc Networks proposes the SPi service placement framework as a novel approach to service placement in ad hoc networks. The SPi framework takes advantage of the 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 (GCSI) and the Graph Cost / Multiple Instances (GCMI) placement algorithms. The SPi framework employs these algorithms to optimize the number and the location of service instances based on usage statistics and a partial network topology derived from routing information. The GCSI and GCMI placement algorithms only require minimal knowledge about the service they are tasked with placing in the network. They are novel in that they take the communication between service instances into account which is required to synchronize the global state of the service. Furthermore, when calculating the optimal timing of their placement decisions, the two algorithms explicitly consider the overhead of the actions required for implementing changes to the current service configuration. Implementation of the SPi framework on top of a special low-level API allows the framework to be run on a variety of evaluation platforms including major operating systems and network simulation tools. The work examines the properties of this approach to service placement and compares it with other recent proposals in simulations using the network simulator ns-2. The results of this evaluation show that the SPi service placement framework and the placement algorithms, in particular GCMI, are able to find service configurations that are superior across a variety of scenarios to those found by other approaches. As a consequence, service provisioning improves significantly with regard to its reliability and timeliness, while at the same time causing less network traffic. Furthermore, the results show that distributed service provisioning with active service placement – as implemented in SPi – generally outperforms services that are implemented in a traditional client/server architecture. The results suggest that this approach to service provisioning in ad hoc networks is a viable alternative to established architectures. | ||
| 650 | 0 | _aComputer science. | |
| 650 | 0 | _aComputer system performance. | |
| 650 | 1 | 4 | _aComputer Science. |
| 650 | 2 | 4 | _aSystem Performance and Evaluation. |
| 700 | 1 |
_aSchiller, Jochen. _eauthor. |
|
| 710 | 2 | _aSpringerLink (Online service) | |
| 773 | 0 | _tSpringer eBooks | |
| 776 | 0 | 8 |
_iPrinted edition: _z9781447123620 |
| 830 | 0 |
_aSpringerBriefs in Computer Science, _x2191-5768 |
|
| 856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/978-1-4471-2363-7 |
| 912 | _aZDB-2-SCS | ||
| 999 |
_c16061 _d16061 |
||