Configuration Management for Proactive Adaptation in Pervasive Environments


VanSyckel, Sebastian ; Schäfer, Dominik ; Schiele, Gregor ; Becker, Christian



DOI: https://doi.org/10.1109/SASO.2013.28
URL: https://www.insight-centre.org/sites/default/files...
Additional URL: http://dl.acm.org/citation.cfm?id=2552639.2552644
Document Type: Conference or workshop publication
Year of publication: 2013
Book title: 2013 IEEE 7th International Conference on Self-Adaptive and Self-Organizing Systems (SASO 2013) : Philadelphia, Pennsylvania, USA, 9 - 13 September 2013
Page range: 131-140
Conference title: IEEE 7th International Conference on Self-Adaptive and Self-Organizing Systems (SASO 2013)
Location of the conference venue: Philadelphia, Pa.
Date of the conference: 9-13 September 2013
Place of publication: Piscataway, NJ
Publishing house: IEEE Computer Soc.
ISBN: 978-0-7695-5129-6 , 978-1-4799-1452-4
ISSN: 1949-3673
Publication language: English
Institution: Business School > Wirtschaftsinformatik II (Becker 2006-2021)
Subject: 004 Computer science, internet
Keywords (English): configuration management , constraint satisfaction problems , biquitous computing , CSP adaption delay reduction application model , configuration management , constraint satisfaction problem , cost functions , cost metrics
Abstract: Pervasive computing applications have to adapt in order to cope with changes in their environment. Proactive adaptation allows to change the application and/ or the context based on prediction of context and user behavior, in order to reduce adaption delay and provide a seamless service to the user. Thus, such applications are self-organizing systems. Ideally, self-organizing systems adapt by changing their structure or behavior without requiring the user's intervention. A prerequisite to that is the knowledge of the possible configurations and their order with respect to the suitability. We introduce a comprehensive framework based on an application model with suitability and cost metrics. Based on the application model, we construct a CSP and develop an algorithm with two heuristics that finds all configurations. We rate the configurations depending on their expected instantiation using novel utility and cost functions. In the evaluation, we show the feasibility of our approach.




Dieser Eintrag ist Teil der Universitätsbibliographie.




Metadata export


Citation


+ Search Authors in

+ Page Views

Hits per month over past year

Detailed information



You have found an error? Please let us know about your desired correction here: E-Mail


Actions (login required)

Show item Show item