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...
Weitere URL: http://dl.acm.org/citation.cfm?id=2552639.2552644
Dokumenttyp: Konferenzveröffentlichung
Erscheinungsjahr: 2013
Buchtitel: 2013 IEEE 7th International Conference on Self-Adaptive and Self-Organizing Systems (SASO 2013) : Philadelphia, Pennsylvania, USA, 9 - 13 September 2013
Seitenbereich: 131-140
Veranstaltungstitel: IEEE 7th International Conference on Self-Adaptive and Self-Organizing Systems (SASO 2013)
Veranstaltungsort: Philadelphia, Pa.
Veranstaltungsdatum: 9-13 September 2013
Ort der Veröffentlichung: Piscataway, NJ
Verlag: IEEE Computer Soc.
ISBN: 978-0-7695-5129-6 , 978-1-4799-1452-4
ISSN: 1949-3673
Sprache der Veröffentlichung: Englisch
Einrichtung: Fakultät für Betriebswirtschaftslehre > Wirtschaftsinformatik II (Becker 2006-2021)
Fachgebiet: 004 Informatik
Freie Schlagwörter (Englisch): 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.




Metadaten-Export


Zitation


+ Suche Autoren in

+ Aufruf-Statistik

Aufrufe im letzten Jahr

Detaillierte Angaben



Sie haben einen Fehler gefunden? Teilen Sie uns Ihren Korrekturwunsch bitte hier mit: E-Mail


Actions (login required)

Eintrag anzeigen Eintrag anzeigen