Service Placement in Ad Hoc Networks (Record no. 16061)

MARC details
000 -LEADER
fixed length control field 05857nam a22004455i 4500
001 - CONTROL NUMBER
control field 978-1-4471-2363-7
003 - CONTROL NUMBER IDENTIFIER
control field DE-He213
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20170628033624.0
007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION
fixed length control field cr nn 008mamaa
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 120103s2012 xxk| s |||| 0|eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9781447123637
-- 978-1-4471-2363-7
024 7# - OTHER STANDARD IDENTIFIER
Standard number or code 10.1007/978-1-4471-2363-7
Source of number or code doi
050 #4 - LIBRARY OF CONGRESS CALL NUMBER
Classification number QA76.9.E94
072 #7 - SUBJECT CATEGORY CODE
Subject category code UYD
Source bicssc
072 #7 - SUBJECT CATEGORY CODE
Subject category code COM074000
Source bisacsh
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 004.24
Edition number 23
100 1# - MAIN ENTRY--PERSONAL NAME
Personal name Wittenburg, Georg.
Relator term author.
245 10 - TITLE STATEMENT
Title Service Placement in Ad Hoc Networks
Medium [electronic resource] /
Statement of responsibility, etc by Georg Wittenburg, Jochen Schiller.
264 #1 -
-- London :
-- Springer London,
-- 2012.
300 ## - PHYSICAL DESCRIPTION
Extent IX, 116p. 28 illus.
Other physical details online resource.
336 ## -
-- text
-- txt
-- rdacontent
337 ## -
-- computer
-- c
-- rdamedia
338 ## -
-- online resource
-- cr
-- rdacarrier
347 ## -
-- text file
-- PDF
-- rda
490 1# - SERIES STATEMENT
Series statement SpringerBriefs in Computer Science,
International Standard Serial Number 2191-5768
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note Introduction -- Background -- The SPi Service Placement Framework -- SPi Service Placement Algorithms -- Evaluation -- Conclusion.
520 ## - SUMMARY, ETC.
Summary, etc Service 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 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer science.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer system performance.
650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer Science.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element System Performance and Evaluation.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Schiller, Jochen.
Relator term author.
710 2# - ADDED ENTRY--CORPORATE NAME
Corporate name or jurisdiction name as entry element SpringerLink (Online service)
773 0# - HOST ITEM ENTRY
Title Springer eBooks
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Display text Printed edition:
International Standard Book Number 9781447123620
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
Uniform title SpringerBriefs in Computer Science,
-- 2191-5768
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier <a href="http://dx.doi.org/10.1007/978-1-4471-2363-7">http://dx.doi.org/10.1007/978-1-4471-2363-7</a>
912 ## -
-- ZDB-2-SCS
Holdings
Withdrawn status Lost status Source of classification or shelving scheme Damaged status Not for loan Home library Current library Date acquired Source of acquisition Total Checkouts Barcode Date last seen Price effective from Koha item type
    Dewey Decimal Classification     Central Library Central Library 28/06/2017 Springer EBook   E-39240 28/06/2017 28/06/2017 E-Book

Maintained by VTU Library