---
_id: '7571'
abstract:
- lang: eng
text: Driven by the need for a closer alignment of business and IT requirements,
the role of business process models in the development of enterprise software
systems has increased continuously. Similar to other software artifacts, process
models are developed and refined in team environments by several stakeholders,
resulting in different versions. These versions need to be merged in order to
obtain an integrated process model. Existing solutions to this basic problem in
the field of software configuration management are mainly limited to textual documents,
e.g., source code. This monograph presents a generally applicable framework for
process model change management, which provides easy-to-use comparison and merging
capabilities for the integration of different process model versions. The framework
supports popular modeling languages such as BPMN, BPEL, or UML Activity Diagrams.
Differences between process models are represented in terms of intuitive, high-level
change operations. Equipped with a sophisticated analysis of dependencies and
a semantic-aware computation of conflicts between differences, the framework constitutes
a comprehensive and practically usable solution for process model change management
in the model-driven development of enterprise software systems.
author:
- first_name: Christian
full_name: Gerth, Christian
last_name: Gerth
citation:
ama: Gerth C. Business Process Models - Change Management.; 2013.
apa: Gerth, C. (2013). Business Process Models - Change Management.
bibtex: '@book{Gerth_2013, title={Business Process Models - Change Management},
author={Gerth, Christian}, year={2013} }'
chicago: Gerth, Christian. Business Process Models - Change Management, 2013.
ieee: C. Gerth, Business Process Models - Change Management. 2013.
mla: Gerth, Christian. Business Process Models - Change Management. 2013.
short: C. Gerth, Business Process Models - Change Management, 2013.
date_created: 2019-02-06T14:18:12Z
date_updated: 2022-01-06T07:03:40Z
department:
- _id: '66'
language:
- iso: eng
related_material:
link:
- relation: confirmation
url: http://www.springer.com/computer/database+management+%26+information+retrieval/book/978-3-642-38603-9
status: public
title: Business Process Models - Change Management
type: dissertation
user_id: '52534'
year: '2013'
...
---
_id: '769'
author:
- first_name: Thorsten
full_name: Biermann, Thorsten
last_name: Biermann
- first_name: Luca
full_name: Scalia, Luca
last_name: Scalia
- first_name: Changsoon
full_name: Choi, Changsoon
last_name: Choi
- first_name: Wolfgang
full_name: Kellerer, Wolfgang
last_name: Kellerer
- first_name: Holger
full_name: Karl, Holger
last_name: Karl
citation:
ama: Biermann T, Scalia L, Choi C, Kellerer W, Karl H. How backhaul networks influence
the feasibility of coordinated multipoint in cellular networks. {IEEE} Communications
Magazine. 2013;(8). doi:10.1109/MCOM.2013.6576356
apa: Biermann, T., Scalia, L., Choi, C., Kellerer, W., & Karl, H. (2013). How
backhaul networks influence the feasibility of coordinated multipoint in cellular
networks. {IEEE} Communications Magazine, (8). https://doi.org/10.1109/MCOM.2013.6576356
bibtex: '@article{Biermann_Scalia_Choi_Kellerer_Karl_2013, title={How backhaul networks
influence the feasibility of coordinated multipoint in cellular networks}, DOI={10.1109/MCOM.2013.6576356},
number={8}, journal={{IEEE} Communications Magazine}, author={Biermann, Thorsten
and Scalia, Luca and Choi, Changsoon and Kellerer, Wolfgang and Karl, Holger},
year={2013} }'
chicago: Biermann, Thorsten, Luca Scalia, Changsoon Choi, Wolfgang Kellerer, and
Holger Karl. “How Backhaul Networks Influence the Feasibility of Coordinated Multipoint
in Cellular Networks.” {IEEE} Communications Magazine, no. 8 (2013). https://doi.org/10.1109/MCOM.2013.6576356.
ieee: T. Biermann, L. Scalia, C. Choi, W. Kellerer, and H. Karl, “How backhaul networks
influence the feasibility of coordinated multipoint in cellular networks,” {IEEE}
Communications Magazine, no. 8, 2013.
mla: Biermann, Thorsten, et al. “How Backhaul Networks Influence the Feasibility
of Coordinated Multipoint in Cellular Networks.” {IEEE} Communications Magazine,
no. 8, 2013, doi:10.1109/MCOM.2013.6576356.
short: T. Biermann, L. Scalia, C. Choi, W. Kellerer, H. Karl, {IEEE} Communications
Magazine (2013).
date_created: 2017-11-27T10:22:26Z
date_updated: 2022-01-06T07:03:44Z
department:
- _id: '75'
doi: 10.1109/MCOM.2013.6576356
issue: '8'
publication: '{IEEE} Communications Magazine'
status: public
title: How backhaul networks influence the feasibility of coordinated multipoint in
cellular networks
type: journal_article
user_id: '15572'
year: '2013'
...
---
_id: '8485'
author:
- first_name: 'Michael '
full_name: 'Spijkerman, Michael '
last_name: Spijkerman
citation:
ama: 'Spijkerman M. Ein pragmatischer Ansatz zur Entwicklung situationsgerechter
Entwicklungsmethoden. In: Software Engineering 2013 - Workshopband (Inkl. Doktorandensymposium)
SE 2013 (to Appear). Vol 215. LNI. GI; 2013:425--434.'
apa: Spijkerman, M. (2013). Ein pragmatischer Ansatz zur Entwicklung situationsgerechter
Entwicklungsmethoden. In Software Engineering 2013 - Workshopband (inkl. Doktorandensymposium)
SE 2013 (to appear) (Vol. 215, pp. 425--434). GI.
bibtex: '@inproceedings{Spijkerman_2013, series={LNI}, title={Ein pragmatischer
Ansatz zur Entwicklung situationsgerechter Entwicklungsmethoden}, volume={215},
booktitle={Software Engineering 2013 - Workshopband (inkl. Doktorandensymposium)
SE 2013 (to appear)}, publisher={GI}, author={Spijkerman, Michael }, year={2013},
pages={425--434}, collection={LNI} }'
chicago: Spijkerman, Michael . “Ein Pragmatischer Ansatz Zur Entwicklung Situationsgerechter
Entwicklungsmethoden.” In Software Engineering 2013 - Workshopband (Inkl. Doktorandensymposium)
SE 2013 (to Appear), 215:425--434. LNI. GI, 2013.
ieee: M. Spijkerman, “Ein pragmatischer Ansatz zur Entwicklung situationsgerechter
Entwicklungsmethoden,” in Software Engineering 2013 - Workshopband (inkl. Doktorandensymposium)
SE 2013 (to appear), 2013, vol. 215, pp. 425--434.
mla: Spijkerman, Michael. “Ein Pragmatischer Ansatz Zur Entwicklung Situationsgerechter
Entwicklungsmethoden.” Software Engineering 2013 - Workshopband (Inkl. Doktorandensymposium)
SE 2013 (to Appear), vol. 215, GI, 2013, pp. 425--434.
short: 'M. Spijkerman, in: Software Engineering 2013 - Workshopband (Inkl. Doktorandensymposium)
SE 2013 (to Appear), GI, 2013, pp. 425--434.'
date_created: 2019-03-08T13:53:50Z
date_updated: 2022-01-06T07:03:55Z
department:
- _id: '66'
intvolume: ' 215'
language:
- iso: eng
page: 425--434
publication: Software Engineering 2013 - Workshopband (inkl. Doktorandensymposium)
SE 2013 (to appear)
publisher: GI
series_title: LNI
status: public
title: Ein pragmatischer Ansatz zur Entwicklung situationsgerechter Entwicklungsmethoden
type: conference
user_id: '52534'
volume: 215
year: '2013'
...
---
_id: '8486'
author:
- first_name: 'Benjamin '
full_name: 'Nagel , Benjamin '
last_name: 'Nagel '
- first_name: 'Christian '
full_name: 'Gerth , Christian '
last_name: 'Gerth '
- first_name: 'Jennifer '
full_name: 'Post, Jennifer '
last_name: Post
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
citation:
ama: 'Nagel B, Gerth C, Post J, Engels G. Kaos4SOA - Extending KAOS Models with
Temporal and Logical Dependencies. In: Proceedings of the CAiSE’13 Forum at
the 25th International Conference on Advanced Information Systems Engineering
(CAiSE’13). Vol 998. CEUR Workshop Proceedings. CEUR-WS.org; 2013:9--16.'
apa: Nagel , B., Gerth , C., Post, J., & Engels, G. (2013). Kaos4SOA - Extending
KAOS Models with Temporal and Logical Dependencies. In Proceedings of the CAiSE’13
Forum at the 25th International Conference on Advanced Information Systems Engineering
(CAiSE’13) (Vol. 998, pp. 9--16). CEUR-WS.org.
bibtex: '@inproceedings{Nagel _Gerth _Post_Engels_2013, series={CEUR Workshop Proceedings},
title={Kaos4SOA - Extending KAOS Models with Temporal and Logical Dependencies},
volume={998}, booktitle={Proceedings of the CAiSE’13 Forum at the 25th International
Conference on Advanced Information Systems Engineering (CAiSE’13)}, publisher={CEUR-WS.org},
author={Nagel , Benjamin and Gerth , Christian and Post, Jennifer and Engels,
Gregor}, year={2013}, pages={9--16}, collection={CEUR Workshop Proceedings} }'
chicago: Nagel , Benjamin , Christian Gerth , Jennifer Post, and Gregor Engels.
“Kaos4SOA - Extending KAOS Models with Temporal and Logical Dependencies.” In
Proceedings of the CAiSE’13 Forum at the 25th International Conference on Advanced
Information Systems Engineering (CAiSE’13), 998:9--16. CEUR Workshop Proceedings.
CEUR-WS.org, 2013.
ieee: B. Nagel , C. Gerth , J. Post, and G. Engels, “Kaos4SOA - Extending KAOS Models
with Temporal and Logical Dependencies,” in Proceedings of the CAiSE’13 Forum
at the 25th International Conference on Advanced Information Systems Engineering
(CAiSE’13), 2013, vol. 998, pp. 9--16.
mla: Nagel , Benjamin, et al. “Kaos4SOA - Extending KAOS Models with Temporal and
Logical Dependencies.” Proceedings of the CAiSE’13 Forum at the 25th International
Conference on Advanced Information Systems Engineering (CAiSE’13), vol. 998,
CEUR-WS.org, 2013, pp. 9--16.
short: 'B. Nagel , C. Gerth , J. Post, G. Engels, in: Proceedings of the CAiSE’13
Forum at the 25th International Conference on Advanced Information Systems Engineering
(CAiSE’13), CEUR-WS.org, 2013, pp. 9--16.'
date_created: 2019-03-08T13:55:30Z
date_updated: 2022-01-06T07:03:55Z
department:
- _id: '66'
intvolume: ' 998'
language:
- iso: eng
page: 9--16
publication: Proceedings of the CAiSE'13 Forum at the 25th International Conference
on Advanced Information Systems Engineering (CAiSE'13)
publisher: CEUR-WS.org
series_title: CEUR Workshop Proceedings
status: public
title: Kaos4SOA - Extending KAOS Models with Temporal and Logical Dependencies
type: conference
user_id: '52534'
volume: 998
year: '2013'
...
---
_id: '8487'
author:
- first_name: 'Timo '
full_name: 'Kehrer , Timo '
last_name: 'Kehrer '
- first_name: 'Christian '
full_name: 'Gerth, Christian '
last_name: Gerth
citation:
ama: 'Kehrer T, Gerth C. CVSM 2013 Challenge: Recognizing High-level Edit Operations
in Evolving Models. In: Proceedings of the Workshop on Comparison and Versioning
of Software Models (CVSM’13). Vol 33. Softwaretechnik-Trends. FG Softwaretechnik,
Gesellschaft für Informatik e.v. (GI); 2013:32-34.'
apa: 'Kehrer , T., & Gerth, C. (2013). CVSM 2013 Challenge: Recognizing High-level
Edit Operations in Evolving Models. In Proceedings of the Workshop on Comparison
and Versioning of Software Models (CVSM’13) (Vol. 33, pp. 32–34). FG Softwaretechnik,
Gesellschaft für Informatik e.v. (GI).'
bibtex: '@inproceedings{Kehrer _Gerth_2013, series={Softwaretechnik-Trends}, title={CVSM
2013 Challenge: Recognizing High-level Edit Operations in Evolving Models.}, volume={33},
number={2}, booktitle={Proceedings of the Workshop on Comparison and Versioning
of Software Models (CVSM’13)}, publisher={FG Softwaretechnik, Gesellschaft für
Informatik e.v. (GI)}, author={Kehrer , Timo and Gerth, Christian }, year={2013},
pages={32–34}, collection={Softwaretechnik-Trends} }'
chicago: 'Kehrer , Timo , and Christian Gerth. “CVSM 2013 Challenge: Recognizing
High-Level Edit Operations in Evolving Models.” In Proceedings of the Workshop
on Comparison and Versioning of Software Models (CVSM’13), 33:32–34. Softwaretechnik-Trends.
FG Softwaretechnik, Gesellschaft für Informatik e.v. (GI), 2013.'
ieee: 'T. Kehrer and C. Gerth, “CVSM 2013 Challenge: Recognizing High-level Edit
Operations in Evolving Models.,” in Proceedings of the Workshop on Comparison
and Versioning of Software Models (CVSM’13), 2013, vol. 33, no. 2, pp. 32–34.'
mla: 'Kehrer , Timo, and Christian Gerth. “CVSM 2013 Challenge: Recognizing High-Level
Edit Operations in Evolving Models.” Proceedings of the Workshop on Comparison
and Versioning of Software Models (CVSM’13), vol. 33, no. 2, FG Softwaretechnik,
Gesellschaft für Informatik e.v. (GI), 2013, pp. 32–34.'
short: 'T. Kehrer , C. Gerth, in: Proceedings of the Workshop on Comparison and
Versioning of Software Models (CVSM’13), FG Softwaretechnik, Gesellschaft für
Informatik e.v. (GI), 2013, pp. 32–34.'
date_created: 2019-03-08T13:57:51Z
date_updated: 2022-01-06T07:03:55Z
department:
- _id: '66'
intvolume: ' 33'
issue: '2'
language:
- iso: eng
page: 32-34
publication: Proceedings of the Workshop on Comparison and Versioning of Software
Models (CVSM'13)
publisher: FG Softwaretechnik, Gesellschaft für Informatik e.v. (GI)
series_title: Softwaretechnik-Trends
status: public
title: 'CVSM 2013 Challenge: Recognizing High-level Edit Operations in Evolving Models.'
type: conference
user_id: '52534'
volume: 33
year: '2013'
...
---
_id: '8488'
author:
- first_name: 'Marvin '
full_name: 'Grieger , Marvin '
last_name: 'Grieger '
- first_name: Stefan
full_name: Sauer, Stefan
id: '447'
last_name: Sauer
citation:
ama: 'Grieger M, Sauer S. Wiederverwendbarkeit von Migrationswissen durch Techniken
der modellgetriebenen Softwareentwicklung. In: Software Engineering 2013 Workshopband.
GI, Köllen Druck+Verlag GmbH, Bonn; 2013:189-200.'
apa: Grieger , M., & Sauer, S. (2013). Wiederverwendbarkeit von Migrationswissen
durch Techniken der modellgetriebenen Softwareentwicklung. In Software Engineering
2013 Workshopband (pp. 189–200). GI, Köllen Druck+Verlag GmbH, Bonn.
bibtex: '@inproceedings{Grieger _Sauer_2013, title={Wiederverwendbarkeit von Migrationswissen
durch Techniken der modellgetriebenen Softwareentwicklung}, booktitle={Software
Engineering 2013 Workshopband}, publisher={GI, Köllen Druck+Verlag GmbH, Bonn},
author={Grieger , Marvin and Sauer, Stefan}, year={2013}, pages={189–200} }'
chicago: Grieger , Marvin , and Stefan Sauer. “Wiederverwendbarkeit von Migrationswissen
Durch Techniken Der Modellgetriebenen Softwareentwicklung.” In Software Engineering
2013 Workshopband, 189–200. GI, Köllen Druck+Verlag GmbH, Bonn, 2013.
ieee: M. Grieger and S. Sauer, “Wiederverwendbarkeit von Migrationswissen durch
Techniken der modellgetriebenen Softwareentwicklung,” in Software Engineering
2013 Workshopband, 2013, pp. 189–200.
mla: Grieger , Marvin, and Stefan Sauer. “Wiederverwendbarkeit von Migrationswissen
Durch Techniken Der Modellgetriebenen Softwareentwicklung.” Software Engineering
2013 Workshopband, GI, Köllen Druck+Verlag GmbH, Bonn, 2013, pp. 189–200.
short: 'M. Grieger , S. Sauer, in: Software Engineering 2013 Workshopband, GI, Köllen
Druck+Verlag GmbH, Bonn, 2013, pp. 189–200.'
date_created: 2019-03-08T13:59:14Z
date_updated: 2022-01-06T07:03:55Z
department:
- _id: '66'
language:
- iso: eng
page: 189-200
publication: Software Engineering 2013 Workshopband
publisher: GI, Köllen Druck+Verlag GmbH, Bonn
status: public
title: Wiederverwendbarkeit von Migrationswissen durch Techniken der modellgetriebenen
Softwareentwicklung
type: conference
user_id: '52534'
year: '2013'
...
---
_id: '8489'
author:
- first_name: 'Benjamin '
full_name: 'Nagel , Benjamin '
last_name: 'Nagel '
- first_name: 'Christian '
full_name: 'Gerth , Christian '
last_name: 'Gerth '
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
citation:
ama: 'Nagel B, Gerth C, Engels G. Goal-driven Composition of Business Process
Models. In: Proceedings of the 9th Workshop on Engineering Service-Oriented
Applications (WESOA 2013) (Accepted for Application). ; 2013.'
apa: Nagel , B., Gerth , C., & Engels, G. (2013). Goal-driven Composition of
Business Process Models. In Proceedings of the 9th Workshop on Engineering
Service-Oriented Applications (WESOA 2013) (accepted for application).
bibtex: '@inproceedings{Nagel _Gerth _Engels_2013, title={Goal-driven Composition
of Business Process Models}, booktitle={Proceedings of the 9th Workshop on Engineering
Service-Oriented Applications (WESOA 2013) (accepted for application)}, author={Nagel
, Benjamin and Gerth , Christian and Engels, Gregor}, year={2013} }'
chicago: Nagel , Benjamin , Christian Gerth , and Gregor Engels. “Goal-Driven Composition
of Business Process Models.” In Proceedings of the 9th Workshop on Engineering
Service-Oriented Applications (WESOA 2013) (Accepted for Application), 2013.
ieee: B. Nagel , C. Gerth , and G. Engels, “Goal-driven Composition of Business
Process Models,” in Proceedings of the 9th Workshop on Engineering Service-Oriented
Applications (WESOA 2013) (accepted for application), 2013.
mla: Nagel , Benjamin, et al. “Goal-Driven Composition of Business Process Models.”
Proceedings of the 9th Workshop on Engineering Service-Oriented Applications
(WESOA 2013) (Accepted for Application), 2013.
short: 'B. Nagel , C. Gerth , G. Engels, in: Proceedings of the 9th Workshop on
Engineering Service-Oriented Applications (WESOA 2013) (Accepted for Application),
2013.'
date_created: 2019-03-08T14:02:17Z
date_updated: 2022-01-06T07:03:55Z
department:
- _id: '66'
language:
- iso: eng
publication: Proceedings of the 9th Workshop on Engineering Service-Oriented Applications
(WESOA 2013) (accepted for application)
status: public
title: Goal-driven Composition of Business Process Models
type: conference
user_id: '52534'
year: '2013'
...
---
_id: '8490'
author:
- first_name: 'Masud '
full_name: 'Fazal-Baqaie , Masud '
last_name: 'Fazal-Baqaie '
- first_name: 'Markus '
full_name: 'Luckey , Markus '
last_name: 'Luckey '
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
citation:
ama: 'Fazal-Baqaie M, Luckey M, Engels G. Assembly-based Method Engineering with
Method Patterns. In: Software Engineering 2013 Workshopband. GI, Köllen
Druck+Verlag GmbH, Bonn; 2013:435-444.'
apa: Fazal-Baqaie , M., Luckey , M., & Engels, G. (2013). Assembly-based Method
Engineering with Method Patterns. In Software Engineering 2013 Workshopband
(pp. 435–444). GI, Köllen Druck+Verlag GmbH, Bonn.
bibtex: '@inproceedings{Fazal-Baqaie _Luckey _Engels_2013, title={Assembly-based
Method Engineering with Method Patterns}, booktitle={Software Engineering 2013
Workshopband}, publisher={GI, Köllen Druck+Verlag GmbH, Bonn}, author={Fazal-Baqaie
, Masud and Luckey , Markus and Engels, Gregor}, year={2013}, pages={435–444}
}'
chicago: Fazal-Baqaie , Masud , Markus Luckey , and Gregor Engels. “Assembly-Based
Method Engineering with Method Patterns.” In Software Engineering 2013 Workshopband,
435–44. GI, Köllen Druck+Verlag GmbH, Bonn, 2013.
ieee: M. Fazal-Baqaie , M. Luckey , and G. Engels, “Assembly-based Method Engineering
with Method Patterns,” in Software Engineering 2013 Workshopband, 2013,
pp. 435–444.
mla: Fazal-Baqaie , Masud, et al. “Assembly-Based Method Engineering with Method
Patterns.” Software Engineering 2013 Workshopband, GI, Köllen Druck+Verlag
GmbH, Bonn, 2013, pp. 435–44.
short: 'M. Fazal-Baqaie , M. Luckey , G. Engels, in: Software Engineering 2013 Workshopband,
GI, Köllen Druck+Verlag GmbH, Bonn, 2013, pp. 435–444.'
date_created: 2019-03-08T14:03:48Z
date_updated: 2022-01-06T07:03:56Z
department:
- _id: '66'
language:
- iso: eng
page: 435-444
publication: Software Engineering 2013 Workshopband
publisher: GI, Köllen Druck+Verlag GmbH, Bonn
status: public
title: Assembly-based Method Engineering with Method Patterns
type: conference
user_id: '52534'
year: '2013'
...
---
_id: '501'
abstract:
- lang: eng
text: 'Handling run-time dynamics on embedded system-on-chip architectures has become
more challenging over the years. On the one hand, the impact of workload and physical
dynamics on the system behavior has dramatically increased. On the other hand,
embedded architectures have become more complex as they have evolved from single-processor
systems over multi-processor systems to hybrid multi-core platforms.Static design-time
techniques no longer provide suitable solutions to deal with the run-time dynamics
of today''s embedded systems. Therefore, system designers have to apply run-time
solutions, which have hardly been investigated for hybrid multi-core platforms.In
this thesis, we present fundamental work in the new area of run-time management
on hybrid multi-core platforms. We propose a novel architecture, a self-adaptive
hybrid multi-core system, that combines heterogeneous processors, reconfigurable
hardware cores, and monitoring cores on a single chip. Using self-adaptation on
thread-level, our hybrid multi-core systems can effectively perform performance
and thermal management autonomously at run-time. '
author:
- first_name: Markus
full_name: Happe, Markus
last_name: Happe
citation:
ama: 'Happe M. Performance and Thermal Management on Self-Adaptive Hybrid Multi-Cores.
Berlin: Logos Verlag Berlin GmbH; 2013.'
apa: 'Happe, M. (2013). Performance and thermal management on self-adaptive hybrid
multi-cores. Berlin: Logos Verlag Berlin GmbH.'
bibtex: '@book{Happe_2013, place={Berlin}, title={Performance and thermal management
on self-adaptive hybrid multi-cores}, publisher={Logos Verlag Berlin GmbH}, author={Happe,
Markus}, year={2013} }'
chicago: 'Happe, Markus. Performance and Thermal Management on Self-Adaptive
Hybrid Multi-Cores. Berlin: Logos Verlag Berlin GmbH, 2013.'
ieee: 'M. Happe, Performance and thermal management on self-adaptive hybrid multi-cores.
Berlin: Logos Verlag Berlin GmbH, 2013.'
mla: Happe, Markus. Performance and Thermal Management on Self-Adaptive Hybrid
Multi-Cores. Logos Verlag Berlin GmbH, 2013.
short: M. Happe, Performance and Thermal Management on Self-Adaptive Hybrid Multi-Cores,
Logos Verlag Berlin GmbH, Berlin, 2013.
date_created: 2017-10-17T12:42:30Z
date_updated: 2022-01-06T07:01:34Z
department:
- _id: '78'
language:
- iso: eng
page: '220'
place: Berlin
project:
- _id: '14'
name: SFB 901 - Subprojekt C2
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
publication_identifier:
isbn:
- 978-3-8325-3425-7
publication_status: published
publisher: Logos Verlag Berlin GmbH
related_material:
link:
- relation: confirmation
url: https://www.logos-verlag.de/cgi-bin/engbuchmid?isbn=3425&lng=deu&id=
status: public
supervisor:
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
title: Performance and thermal management on self-adaptive hybrid multi-cores
type: dissertation
user_id: '477'
year: '2013'
...
---
_id: '506'
abstract:
- lang: eng
text: Alle Dom{\"a}nen und Branchen der heutigen Wirtschaft sind auf eine effiziente
und effektive Entwicklung von ben{\"o}tigten Softwaresystemen angewiesen. Das
40 Jahre alte Prinzip der Beschaffung von Softwaresystemen durch den Einkauf von
teuren, relativ unflexiblen Standardl{\"o}sungen beziehungsweise der noch teureren
Erstellung durch Softwareh{\"a}user oder eigene Softwareabteilungen muss deshalb
in Frage gestellt werden. Mit dem Einsatz von Cloud Computing-Techniken wird es
m{\"o}glich, Softwaresysteme und die f{\"u}r den Betrieb ben{\"o}tigten Ressourcen
nur bei Bedarf und nur in der ben{\"o}tigten Form einzukaufen. Mit dem Ansatz
der service-orientierten Architekturen stehen Methoden zur Verf{\"u}gung, Software
zumindest unternehmensintern flexibel zusammenzustellen. Diese ersten Ans{\"a}tze
f{\"u}r eine neue Art der Entwicklung und des Betriebs von Softwaresystemen bilden
den Ausgangspunkt f{\"u}r die Forschungen in dem seit 2011 laufenden DFG Sonderforschungsbereich
(SFB) 901 „On-The-Fly Computing“ an der Universit{\"a}t Paderborn. Die Vision
des On-The-Fly Computing ist, dass die Softwaresysteme der Zukunft aus individuell
und automatisch konfigurierten und zur Ausf{\"u}hrung gebrachten Softwarebausteinen
bestehen, die auf M{\"a}rkten frei gehandelt werden und flexibel kombinierbar
sind. Um zu erforschen, in wie weit diese Vision realisierbar ist, werden Konzepte,
Methoden und Techniken entwickelt, die eine weitestgehend automatische Konfiguration,
Ausf{\"u}hrung und Adaption von Softwaresystemen aus auf weltweiten M{\"a}rkten
verf{\"u}gbaren Services erm{\"o}glichen. Um diese Ziele zu erreichen, arbeiten
an der Universit{\"a}t Paderborn Informatiker aus unterschiedlichen Disziplinen
wie Softwaretechnik, Algorithmik, Rechnernetze, Systementwurf, Sicherheit und
Kryptographie mit Wirtschaftswissenschaftlern zusammen, die ihre spezifische Expertise
einbringen, mit der die Organisation und Weiterentwicklung des Marktes vorangetrieben
werden kann.
author:
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
citation:
ama: 'Engels G. On-The-Fly Computing -- Das Entwicklungs- und Betriebsparadigma
fürSoftwaresysteme der Zukunft. In: Proceedings of the Multikonferenz Sofware
Engineering 2013 (SE 2013). LNI. ; 2013:17-18.'
apa: Engels, G. (2013). On-The-Fly Computing -- Das Entwicklungs- und Betriebsparadigma
fürSoftwaresysteme der Zukunft. In Proceedings of the Multikonferenz Sofware
Engineering 2013 (SE 2013) (pp. 17–18).
bibtex: '@inproceedings{Engels_2013, series={LNI}, title={On-The-Fly Computing --
Das Entwicklungs- und Betriebsparadigma fürSoftwaresysteme der Zukunft}, booktitle={Proceedings
of the Multikonferenz Sofware Engineering 2013 (SE 2013)}, author={Engels, Gregor},
year={2013}, pages={17–18}, collection={LNI} }'
chicago: Engels, Gregor. “On-The-Fly Computing -- Das Entwicklungs- Und Betriebsparadigma
FürSoftwaresysteme Der Zukunft.” In Proceedings of the Multikonferenz Sofware
Engineering 2013 (SE 2013), 17–18. LNI, 2013.
ieee: G. Engels, “On-The-Fly Computing -- Das Entwicklungs- und Betriebsparadigma
fürSoftwaresysteme der Zukunft,” in Proceedings of the Multikonferenz Sofware
Engineering 2013 (SE 2013), 2013, pp. 17–18.
mla: Engels, Gregor. “On-The-Fly Computing -- Das Entwicklungs- Und Betriebsparadigma
FürSoftwaresysteme Der Zukunft.” Proceedings of the Multikonferenz Sofware
Engineering 2013 (SE 2013), 2013, pp. 17–18.
short: 'G. Engels, in: Proceedings of the Multikonferenz Sofware Engineering 2013
(SE 2013), 2013, pp. 17–18.'
date_created: 2017-10-17T12:42:31Z
date_updated: 2022-01-06T07:01:36Z
ddc:
- '040'
department:
- _id: '66'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T10:48:11Z
date_updated: 2018-03-15T10:48:11Z
file_id: '1306'
file_name: 506-SE2013-OntheFlyComputing-GE.pdf
file_size: 175876
relation: main_file
success: 1
file_date_updated: 2018-03-15T10:48:11Z
has_accepted_license: '1'
language:
- iso: eng
page: 17-18
project:
- _id: '1'
name: SFB 901
- _id: '9'
name: SFB 901 - Subprojekt B1
- _id: '3'
name: SFB 901 - Project Area B
publication: Proceedings of the Multikonferenz Sofware Engineering 2013 (SE 2013)
series_title: LNI
status: public
title: On-The-Fly Computing -- Das Entwicklungs- und Betriebsparadigma fürSoftwaresysteme
der Zukunft
type: conference
user_id: '477'
year: '2013'
...
---
_id: '507'
abstract:
- lang: eng
text: We study two-party communication in the context of directed dynamic networks
that are controlled by an adaptive adversary. This adversary is able to change
all edges as long as the networks stay strongly-connected in each round. In this
work, we establish a relation between counting the total number of nodes in the
network and the problem of exchanging tokens between two communication partners
which communicate through a dynamic network. We show that the communication problem
for a constant fraction of n tokens in a dynamic network with n nodes is at most
as hard as counting the number of nodes in a dynamic network with at most 4n+3
nodes. For the proof, we construct a family of directed dynamic networks and apply
a lower bound from two-party communication complexity.
author:
- first_name: Sebastian
full_name: Abshoff, Sebastian
last_name: Abshoff
- first_name: Markus
full_name: Benter, Markus
last_name: Benter
- first_name: Manuel
full_name: Malatyali, Manuel
last_name: Malatyali
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Abshoff S, Benter M, Malatyali M, Meyer auf der Heide F. On Two-Party Communication
Through Dynamic Networks. In: Proceedings of the 17th International Conference
on Principles of Distributed Systems (OPODIS). LNCS. ; 2013:11-22. doi:10.1007/978-3-319-03850-6_2'
apa: Abshoff, S., Benter, M., Malatyali, M., & Meyer auf der Heide, F. (2013).
On Two-Party Communication Through Dynamic Networks. In Proceedings of the
17th International Conference on Principles of Distributed Systems (OPODIS)
(pp. 11–22). https://doi.org/10.1007/978-3-319-03850-6_2
bibtex: '@inproceedings{Abshoff_Benter_Malatyali_Meyer auf der Heide_2013, series={LNCS},
title={On Two-Party Communication Through Dynamic Networks}, DOI={10.1007/978-3-319-03850-6_2},
booktitle={Proceedings of the 17th International Conference on Principles of Distributed
Systems (OPODIS)}, author={Abshoff, Sebastian and Benter, Markus and Malatyali,
Manuel and Meyer auf der Heide, Friedhelm}, year={2013}, pages={11–22}, collection={LNCS}
}'
chicago: Abshoff, Sebastian, Markus Benter, Manuel Malatyali, and Friedhelm Meyer
auf der Heide. “On Two-Party Communication Through Dynamic Networks.” In Proceedings
of the 17th International Conference on Principles of Distributed Systems (OPODIS),
11–22. LNCS, 2013. https://doi.org/10.1007/978-3-319-03850-6_2.
ieee: S. Abshoff, M. Benter, M. Malatyali, and F. Meyer auf der Heide, “On Two-Party
Communication Through Dynamic Networks,” in Proceedings of the 17th International
Conference on Principles of Distributed Systems (OPODIS), 2013, pp. 11–22.
mla: Abshoff, Sebastian, et al. “On Two-Party Communication Through Dynamic Networks.”
Proceedings of the 17th International Conference on Principles of Distributed
Systems (OPODIS), 2013, pp. 11–22, doi:10.1007/978-3-319-03850-6_2.
short: 'S. Abshoff, M. Benter, M. Malatyali, F. Meyer auf der Heide, in: Proceedings
of the 17th International Conference on Principles of Distributed Systems (OPODIS),
2013, pp. 11–22.'
date_created: 2017-10-17T12:42:31Z
date_updated: 2022-01-06T07:01:36Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1007/978-3-319-03850-6_2
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T10:47:31Z
date_updated: 2018-03-15T10:47:31Z
file_id: '1305'
file_name: 507-on-two-party-communication-through-dynamic-networks_01.pdf
file_size: 181398
relation: main_file
success: 1
file_date_updated: 2018-03-15T10:47:31Z
has_accepted_license: '1'
page: 11-22
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 17th International Conference on Principles of Distributed
Systems (OPODIS)
series_title: LNCS
status: public
title: On Two-Party Communication Through Dynamic Networks
type: conference
user_id: '15504'
year: '2013'
...
---
_id: '508'
abstract:
- lang: eng
text: The process of planning a virtual topology for a Wavelength Devision Multiplexing
(WDM) network is called Virtual Topology Design (VTD). The goal of VTD is to find
a virtual topology that supports forwarding the expected traffic without congestion.
In networks with fluctuating, high traffic demands, it can happen that no single
topology fits all changing traffic demands occurring over a longer time. Thus,
during operation, the virtual topology has to be reconfigured. Since modern networks
tend to be large, VTD algorithms have to scale well with increasing network size,
requiring distributed algorithms. Existing distributed VTD algorithms, however,
react too slowly on congestion for the real-time reconfiguration of large networks.
We propose Selfish Virtual Topology Reconfiguration (SVTR) as a new algorithm
for distributed VTD. It combines reconfiguring the virtual topology and routing
through a Software Defined Network (SDN). SVTR is used for online, on-the-fly
network reconfiguration. Its integrated routing and WDM reconfiguration keeps
connection disruption due to network reconfiguration to a minimum and is able
to react very quickly to traffic pattern changes. SVTR works by iteratively adapting
the virtual topology to the observed traffic patterns without global traffic information
and without future traffic estimations. We evaluated SVTR by simulation and found
that it significantly lowers congestion in realistic networks and high load scenarios.
author:
- first_name: Philip
full_name: Wette, Philip
last_name: Wette
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: 'Wette P, Karl H. On the Quality of Selfish Virtual Topology Reconfiguration
in IP-over-WDM Networks. In: Proceedings of the 19th IEEE International Workshop
on Local and Metropolitan Area Networks (IEEE LANMAN). ; 2013:1-6. doi:10.1109/LANMAN.2013.6528271'
apa: Wette, P., & Karl, H. (2013). On the Quality of Selfish Virtual Topology
Reconfiguration in IP-over-WDM Networks. In Proceedings of the 19th IEEE International
Workshop on Local and Metropolitan Area Networks (IEEE LANMAN) (pp. 1–6).
https://doi.org/10.1109/LANMAN.2013.6528271
bibtex: '@inproceedings{Wette_Karl_2013, title={On the Quality of Selfish Virtual
Topology Reconfiguration in IP-over-WDM Networks}, DOI={10.1109/LANMAN.2013.6528271},
booktitle={Proceedings of the 19th IEEE International Workshop on Local and Metropolitan
Area Networks (IEEE LANMAN)}, author={Wette, Philip and Karl, Holger}, year={2013},
pages={1–6} }'
chicago: Wette, Philip, and Holger Karl. “On the Quality of Selfish Virtual Topology
Reconfiguration in IP-over-WDM Networks.” In Proceedings of the 19th IEEE International
Workshop on Local and Metropolitan Area Networks (IEEE LANMAN), 1–6, 2013.
https://doi.org/10.1109/LANMAN.2013.6528271.
ieee: P. Wette and H. Karl, “On the Quality of Selfish Virtual Topology Reconfiguration
in IP-over-WDM Networks,” in Proceedings of the 19th IEEE International Workshop
on Local and Metropolitan Area Networks (IEEE LANMAN), 2013, pp. 1–6.
mla: Wette, Philip, and Holger Karl. “On the Quality of Selfish Virtual Topology
Reconfiguration in IP-over-WDM Networks.” Proceedings of the 19th IEEE International
Workshop on Local and Metropolitan Area Networks (IEEE LANMAN), 2013, pp.
1–6, doi:10.1109/LANMAN.2013.6528271.
short: 'P. Wette, H. Karl, in: Proceedings of the 19th IEEE International Workshop
on Local and Metropolitan Area Networks (IEEE LANMAN), 2013, pp. 1–6.'
date_created: 2017-10-17T12:42:31Z
date_updated: 2022-01-06T07:01:37Z
ddc:
- '040'
department:
- _id: '75'
doi: 10.1109/LANMAN.2013.6528271
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T10:50:19Z
date_updated: 2018-03-15T10:50:19Z
file_id: '1307'
file_name: 508-06528271.pdf
file_size: 219902
relation: main_file
success: 1
file_date_updated: 2018-03-15T10:50:19Z
has_accepted_license: '1'
page: '1 - 6 '
project:
- _id: '1'
name: SFB 901
- _id: '6'
name: SFB 901 - Subprojekt A2
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 19th IEEE International Workshop on Local and Metropolitan
Area Networks (IEEE LANMAN)
status: public
title: On the Quality of Selfish Virtual Topology Reconfiguration in IP-over-WDM Networks
type: conference
user_id: '15572'
year: '2013'
...
---
_id: '509'
abstract:
- lang: eng
text: In this paper we will introduce a new d-dimensional graph for constructing
geometric application layer overlay net-works. Our approach will use internet
coordinates, embedded using the L∞ -metric. After describing the graph structure,
we will show how it limits maintenance overhead by bounding each node’s out-degree
and how it supports greedy routing using one-hop neighbourhood information in
each routing step. We will further show that greedy routing can always compute
a path in our graph and we will also prove that in each forwarding step the next
hop is closer to the destination than the current node.
author:
- first_name: Marcus
full_name: Autenrieth, Marcus
last_name: Autenrieth
- first_name: Hannes
full_name: Frey, Hannes
last_name: Frey
citation:
ama: 'Autenrieth M, Frey H. On Greedy Routing in Degree-bounded Graphs over d-Dimensional
Internet Coordinate Embeddings. In: Proceedings of the Conference on Networked
Systems (NetSys). ; 2013:126-131. doi:10.1109/NetSys.2013.10'
apa: Autenrieth, M., & Frey, H. (2013). On Greedy Routing in Degree-bounded
Graphs over d-Dimensional Internet Coordinate Embeddings. In Proceedings of
the Conference on Networked Systems (NetSys) (pp. 126–131). https://doi.org/10.1109/NetSys.2013.10
bibtex: '@inproceedings{Autenrieth_Frey_2013, title={On Greedy Routing in Degree-bounded
Graphs over d-Dimensional Internet Coordinate Embeddings}, DOI={10.1109/NetSys.2013.10},
booktitle={Proceedings of the Conference on Networked Systems (NetSys)}, author={Autenrieth,
Marcus and Frey, Hannes}, year={2013}, pages={126–131} }'
chicago: Autenrieth, Marcus, and Hannes Frey. “On Greedy Routing in Degree-Bounded
Graphs over d-Dimensional Internet Coordinate Embeddings.” In Proceedings of
the Conference on Networked Systems (NetSys), 126–31, 2013. https://doi.org/10.1109/NetSys.2013.10.
ieee: M. Autenrieth and H. Frey, “On Greedy Routing in Degree-bounded Graphs over
d-Dimensional Internet Coordinate Embeddings,” in Proceedings of the Conference
on Networked Systems (NetSys), 2013, pp. 126–131.
mla: Autenrieth, Marcus, and Hannes Frey. “On Greedy Routing in Degree-Bounded Graphs
over d-Dimensional Internet Coordinate Embeddings.” Proceedings of the Conference
on Networked Systems (NetSys), 2013, pp. 126–31, doi:10.1109/NetSys.2013.10.
short: 'M. Autenrieth, H. Frey, in: Proceedings of the Conference on Networked Systems
(NetSys), 2013, pp. 126–131.'
date_created: 2017-10-17T12:42:31Z
date_updated: 2022-01-06T07:01:37Z
ddc:
- '040'
department:
- _id: '75'
doi: 10.1109/NetSys.2013.10
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T10:46:51Z
date_updated: 2018-03-15T10:46:51Z
file_id: '1304'
file_name: 509-06529245.pdf
file_size: 197048
relation: main_file
success: 1
file_date_updated: 2018-03-15T10:46:51Z
has_accepted_license: '1'
page: 126-131
project:
- _id: '1'
name: SFB 901
- _id: '6'
name: SFB 901 - Subprojekt A2
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the Conference on Networked Systems (NetSys)
status: public
title: On Greedy Routing in Degree-bounded Graphs over d-Dimensional Internet Coordinate
Embeddings
type: conference
user_id: '15504'
year: '2013'
...
---
_id: '511'
author:
- first_name: Malte
full_name: Splietker, Malte
last_name: Splietker
citation:
ama: Splietker M. MapReduce in Software Defined Networks. Universität Paderborn;
2013.
apa: Splietker, M. (2013). MapReduce in Software Defined Networks. Universität
Paderborn.
bibtex: '@book{Splietker_2013, title={MapReduce in Software Defined Networks}, publisher={Universität
Paderborn}, author={Splietker, Malte}, year={2013} }'
chicago: Splietker, Malte. MapReduce in Software Defined Networks. Universität
Paderborn, 2013.
ieee: M. Splietker, MapReduce in Software Defined Networks. Universität Paderborn,
2013.
mla: Splietker, Malte. MapReduce in Software Defined Networks. Universität
Paderborn, 2013.
short: M. Splietker, MapReduce in Software Defined Networks, Universität Paderborn,
2013.
date_created: 2017-10-17T12:42:32Z
date_updated: 2022-01-06T07:01:38Z
department:
- _id: '75'
project:
- _id: '1'
name: SFB 901
- _id: '6'
name: SFB 901 - Subprojekt A2
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: MapReduce in Software Defined Networks
type: bachelorsthesis
user_id: '15504'
year: '2013'
...
---
_id: '513'
abstract:
- lang: eng
text: This paper initiates the study of self-adjusting networks (or distributed
data structures) whose topologies dynamically adapt to a communication pattern
$\sigma$. We present a fully decentralized self-adjusting solution called SplayNet.
A SplayNet is a distributed generalization of the classic splay tree concept.
It ensures short paths (which can be found using local-greedy routing) between
communication partners while minimizing topological rearrangements. We derive
an upper bound for the amortized communication cost of a SplayNet based on empirical
entropies of $\sigma$, and show that SplayNets have several interesting convergence
properties. For instance, SplayNets features a provable online optimality under
special requests scenarios. We also investigate the optimal static network and
prove different lower bounds for the average communication cost based on graph
cuts and on the empirical entropy of the communication pattern $\sigma$. From
these lower bounds it follows, e.g., that SplayNets are optimal in scenarios where
the requests follow a product distribution as well. Finally, this paper shows
that in contrast to the Minimum Linear Arrangement problem which is generally
NP-hard, the optimal static tree network can be computed in polynomial time for
any guest graph, despite the exponentially large graph family. We complement our
formal analysis with a small simulation study on a Facebook graph.
author:
- first_name: Chen
full_name: Avin, Chen
last_name: Avin
- first_name: Bernhard
full_name: Häupler, Bernhard
last_name: Häupler
- first_name: Zvi
full_name: Lotker, Zvi
last_name: Lotker
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
citation:
ama: 'Avin C, Häupler B, Lotker Z, Scheideler C, Schmid S. Locally Self-Adjusting
Tree Networks. In: Proceedings of the 27th IEEE International Parallel and
Distributed Processing Symposium (IPDPS). ; 2013:395-406. doi:10.1109/IPDPS.2013.40'
apa: Avin, C., Häupler, B., Lotker, Z., Scheideler, C., & Schmid, S. (2013).
Locally Self-Adjusting Tree Networks. In Proceedings of the 27th IEEE International
Parallel and Distributed Processing Symposium (IPDPS) (pp. 395–406). https://doi.org/10.1109/IPDPS.2013.40
bibtex: '@inproceedings{Avin_Häupler_Lotker_Scheideler_Schmid_2013, title={Locally
Self-Adjusting Tree Networks}, DOI={10.1109/IPDPS.2013.40},
booktitle={Proceedings of the 27th IEEE International Parallel and Distributed
Processing Symposium (IPDPS)}, author={Avin, Chen and Häupler, Bernhard and Lotker,
Zvi and Scheideler, Christian and Schmid, Stefan}, year={2013}, pages={395–406}
}'
chicago: Avin, Chen, Bernhard Häupler, Zvi Lotker, Christian Scheideler, and Stefan
Schmid. “Locally Self-Adjusting Tree Networks.” In Proceedings of the 27th
IEEE International Parallel and Distributed Processing Symposium (IPDPS),
395–406, 2013. https://doi.org/10.1109/IPDPS.2013.40.
ieee: C. Avin, B. Häupler, Z. Lotker, C. Scheideler, and S. Schmid, “Locally Self-Adjusting
Tree Networks,” in Proceedings of the 27th IEEE International Parallel and
Distributed Processing Symposium (IPDPS), 2013, pp. 395–406.
mla: Avin, Chen, et al. “Locally Self-Adjusting Tree Networks.” Proceedings of
the 27th IEEE International Parallel and Distributed Processing Symposium (IPDPS),
2013, pp. 395–406, doi:10.1109/IPDPS.2013.40.
short: 'C. Avin, B. Häupler, Z. Lotker, C. Scheideler, S. Schmid, in: Proceedings
of the 27th IEEE International Parallel and Distributed Processing Symposium (IPDPS),
2013, pp. 395–406.'
date_created: 2017-10-17T12:42:32Z
date_updated: 2022-01-06T07:01:38Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1109/IPDPS.2013.40
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T10:45:15Z
date_updated: 2018-03-15T10:45:15Z
file_id: '1303'
file_name: 513-ipdps13_01.pdf
file_size: 518804
relation: main_file
success: 1
file_date_updated: 2018-03-15T10:45:15Z
has_accepted_license: '1'
page: 395-406
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 27th IEEE International Parallel and Distributed Processing
Symposium (IPDPS)
status: public
title: Locally Self-Adjusting Tree Networks
type: conference
user_id: '15504'
year: '2013'
...
---
_id: '514'
abstract:
- lang: eng
text: Diese Arbeit besch{\"a}ftigt sich mit dem Facility Location Problem. Dies
ist ein Optimierungsproblem, bei dem festgelegt werden muss an welchen Positionen
Ressourcen zur Verf{\"u}gung gestellt werden, so dass diese von Nutzern gut erreicht
werden k{\"o}nnen. Es sollen dabei Kosten minimiert werden, die zum einen durch
Bereitstellung von Ressourcen und zum anderen durch Verbindungskosten zwischen
Nutzern und Ressourcen entstehen. Die Schwierigkeit des Problems liegt darin,
dass man einerseits m{\"o}glichst wenige Ressourcen zur Verf{\"u}gung stellen
m{\"o}chte, andererseits daf{\"u}r sorgen muss, dass sich Nutzer nicht all zu
weit weg von Ressourcen befinden. Dies w{\"u}rde n{\"a}mlich hohe Verbindungskosten
nach sich ziehen. Das Facility Location Problem wurde bereits sehr intensiv in
vielen unterschiedlichen Varianten untersucht. In dieser Arbeit werden drei Varianten
des Problems modelliert und neue Algorithmen f{\"u}r sie entwickelt und bez{\"u}glich
ihres Approximationsfaktors und ihrer Laufzeit analysiert. Jede dieser drei untersuchten
Varianten hat einen besonderen Schwerpunkt. Bei der ersten Varianten handelt es
sich um ein Online Problem, da hier die Eingabe nicht von Anfang an bekannt ist,
sondern Schritt f{\"u}r Schritt enth{\"u}llt wird. Die Schwierigkeit hierbei besteht
darin unwiderrufliche Entscheidungen treffen zu m{\"u}ssen ohne dabei die Zukunft
zu kennen und trotzdem eine zu jeder Zeit gute L{\"o}sung angeben zu k{\"o}nnen.
Der Schwerpunkt der zweiten Variante liegt auf Lokalit{\"a}t, die z.B. in Sensornetzwerken
von großer Bedeutung ist. Hier soll eine L{\"o}sung verteilt und nur mit Hilfe
von lokalen Information berechnet werden. Schließlich besch{\"a}ftigt sich die
dritte Variante mit einer verteilten Berechnung, bei welcher nur eine stark beschr{\"a}nkte
Datenmenge verschickt werden darf und dabei trotzdem ein sehr guter Approximationsfaktor
erreicht werden muss. Die bei der Analyse der Approximationsfaktoren bzw. der
Kompetitivit{\"a}t verwendeten Techniken basieren zum großen Teil auf Absch{\"a}tzung
der primalen L{\"o}sung mit Hilfe einer L{\"o}sung des zugeh{\"o}rigen dualen
Problems. F{\"u}r die Modellierung von Lokalit{\"a}t wird das weitverbreitete
LOCAL Modell verwendet. In diesem Modell werden f{\"u}r die Algorithmen subpolynomielle
obere Laufzeitschranken gezeigt.
author:
- first_name: Peter
full_name: Pietrzyk, Peter
last_name: Pietrzyk
citation:
ama: Pietrzyk P. Local and Online Algorithms for Facility Location. Universität
Paderborn; 2013.
apa: Pietrzyk, P. (2013). Local and Online Algorithms for Facility Location.
Universität Paderborn.
bibtex: '@book{Pietrzyk_2013, title={Local and Online Algorithms for Facility Location},
publisher={Universität Paderborn}, author={Pietrzyk, Peter}, year={2013} }'
chicago: Pietrzyk, Peter. Local and Online Algorithms for Facility Location.
Universität Paderborn, 2013.
ieee: P. Pietrzyk, Local and Online Algorithms for Facility Location. Universität
Paderborn, 2013.
mla: Pietrzyk, Peter. Local and Online Algorithms for Facility Location.
Universität Paderborn, 2013.
short: P. Pietrzyk, Local and Online Algorithms for Facility Location, Universität
Paderborn, 2013.
date_created: 2017-10-17T12:42:32Z
date_updated: 2022-01-06T07:01:38Z
ddc:
- '040'
department:
- _id: '63'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T10:44:13Z
date_updated: 2018-03-15T10:44:13Z
file_id: '1302'
file_name: 514-DissertationPietrzyk.pdf
file_size: 790821
relation: main_file
success: 1
file_date_updated: 2018-03-15T10:44:13Z
has_accepted_license: '1'
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
title: Local and Online Algorithms for Facility Location
type: dissertation
user_id: '477'
year: '2013'
...
---
_id: '517'
abstract:
- lang: eng
text: In the Semantic (Web) Services area, services are considered black boxes with
a semantic description of their interfaces as to allow for precise service selection
and configuration. The semantic description is usually grounded on domain-specific
concepts as modeled in ontologies. This accounts for types used in service signatures,
but also predicates occurring in preconditions and effects of services. Ontologies,
in particular those enhanced with rules, capture the knowledge of domain experts
on properties of and relations between domain concepts. In this paper, we present
a verification technique for service compositions which makes use of this domain
knowledge. We consider a service composition to be an assembly of services of
which we just know signatures, preconditions, and effects. We aim at proving that
a composition satisfies a (user-defined) requirement, specified in terms of guaranteed
preconditions and required postconditions. As an underlying verification engine
we use an SMT solver. To take advantage of the domain knowledge (and often, to
enable verification at all), the knowledge is fed into the solver in the form of
sorts, uninterpreted functions and in particular assertions as to enhance the
solver’s reasoning capabilities. Thereby, we allow for deductions within a domain
previously unknown to the solver. We exemplify our technique on a case study from
the area of water network optimization software.
author:
- first_name: Sven
full_name: Walther, Sven
last_name: Walther
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Walther S, Wehrheim H. Knowledge-Based Verification of Service Compositions
- An SMT approach. In: Proceedings of the 18th IEEE International Conference
on Engineering of Complex Computer Systems (ICECCS). ; 2013:24-32. doi:10.1109/ICECCS.2013.14'
apa: Walther, S., & Wehrheim, H. (2013). Knowledge-Based Verification of Service
Compositions - An SMT approach. In Proceedings of the 18th IEEE International
Conference on Engineering of Complex Computer Systems (ICECCS) (pp. 24–32).
https://doi.org/10.1109/ICECCS.2013.14
bibtex: '@inproceedings{Walther_Wehrheim_2013, title={Knowledge-Based Verification
of Service Compositions - An SMT approach}, DOI={10.1109/ICECCS.2013.14},
booktitle={Proceedings of the 18th IEEE International Conference on Engineering
of Complex Computer Systems (ICECCS)}, author={Walther, Sven and Wehrheim, Heike},
year={2013}, pages={24–32} }'
chicago: Walther, Sven, and Heike Wehrheim. “Knowledge-Based Verification of Service
Compositions - An SMT Approach.” In Proceedings of the 18th IEEE International
Conference on Engineering of Complex Computer Systems (ICECCS), 24–32, 2013.
https://doi.org/10.1109/ICECCS.2013.14.
ieee: S. Walther and H. Wehrheim, “Knowledge-Based Verification of Service Compositions
- An SMT approach,” in Proceedings of the 18th IEEE International Conference
on Engineering of Complex Computer Systems (ICECCS), 2013, pp. 24–32.
mla: Walther, Sven, and Heike Wehrheim. “Knowledge-Based Verification of Service
Compositions - An SMT Approach.” Proceedings of the 18th IEEE International
Conference on Engineering of Complex Computer Systems (ICECCS), 2013, pp.
24–32, doi:10.1109/ICECCS.2013.14.
short: 'S. Walther, H. Wehrheim, in: Proceedings of the 18th IEEE International
Conference on Engineering of Complex Computer Systems (ICECCS), 2013, pp. 24–32.'
date_created: 2017-10-17T12:42:33Z
date_updated: 2022-01-06T07:01:41Z
ddc:
- '000'
department:
- _id: '77'
doi: 10.1109/ICECCS.2013.14
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T13:26:08Z
date_updated: 2018-11-02T13:26:08Z
file_id: '5248'
file_name: 06601801.pdf
file_size: 217085
relation: main_file
file_date_updated: 2018-11-02T13:26:08Z
has_accepted_license: '1'
language:
- iso: eng
page: '24 - 32 '
project:
- _id: '1'
name: SFB 901
- _id: '11'
name: SFB 901 - Subprojekt B3
- _id: '3'
name: SFB 901 - Project Area B
publication: Proceedings of the 18th IEEE International Conference on Engineering
of Complex Computer Systems (ICECCS)
status: public
title: Knowledge-Based Verification of Service Compositions - An SMT approach
type: conference
user_id: '477'
year: '2013'
...
---
_id: '519'
abstract:
- lang: eng
text: In this work we present the first scalable distributed information system,i.e.,
a system with low storage overhead, that is provably robust againstDenial-of-Service
(DoS) attacks by a current insider. We allow acurrent insider to have complete
knowledge about the information systemand to have the power to block any \epsilon-fraction
of its serversby a DoS-attack, where \epsilon can be chosen up to a constant.
The taskof the system is to serve any collection of lookup requests with at most
oneper non-blocked server in an efficient way despite this attack. Previously,scalable
solutions were only known for DoS-attacks of past insiders, where apast insider
only has complete knowledge about some past time pointt_0 of the information system.
Scheideler et al. (DISC 2007, SPAA 2009) showedthat in this case it is possible
to design an information system so that anyinformation that was inserted or last
updated after t_0 is safe against a DoS-attack. But their constructions would
not work at all for a current insider. The key idea behindour IRIS system is to
make extensive use of coding. More precisely, we presenttwo alternative distributed
coding strategies with an at most logarithmicstorage overhead that can handle
up to a constant fraction of blocked servers.
author:
- first_name: Martina
full_name: Eikel, Martina
last_name: Eikel
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Eikel M, Scheideler C. IRIS: A Robust Information System Against Insider DoS-Attacks.
In: Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and
Architectures (SPAA). ; 2013:119-129. doi:10.1145/2486159.2486186'
apa: 'Eikel, M., & Scheideler, C. (2013). IRIS: A Robust Information System
Against Insider DoS-Attacks. In Proceedings of the 25th ACM Symposium on Parallelism
in Algorithms and Architectures (SPAA) (pp. 119–129). https://doi.org/10.1145/2486159.2486186'
bibtex: '@inproceedings{Eikel_Scheideler_2013, title={IRIS: A Robust Information
System Against Insider DoS-Attacks}, DOI={10.1145/2486159.2486186},
booktitle={Proceedings of the 25th ACM Symposium on Parallelism in Algorithms
and Architectures (SPAA)}, author={Eikel, Martina and Scheideler, Christian},
year={2013}, pages={119–129} }'
chicago: 'Eikel, Martina, and Christian Scheideler. “IRIS: A Robust Information
System Against Insider DoS-Attacks.” In Proceedings of the 25th ACM Symposium
on Parallelism in Algorithms and Architectures (SPAA), 119–29, 2013. https://doi.org/10.1145/2486159.2486186.'
ieee: 'M. Eikel and C. Scheideler, “IRIS: A Robust Information System Against Insider
DoS-Attacks,” in Proceedings of the 25th ACM Symposium on Parallelism in Algorithms
and Architectures (SPAA), 2013, pp. 119–129.'
mla: 'Eikel, Martina, and Christian Scheideler. “IRIS: A Robust Information System
Against Insider DoS-Attacks.” Proceedings of the 25th ACM Symposium on Parallelism
in Algorithms and Architectures (SPAA), 2013, pp. 119–29, doi:10.1145/2486159.2486186.'
short: 'M. Eikel, C. Scheideler, in: Proceedings of the 25th ACM Symposium on Parallelism
in Algorithms and Architectures (SPAA), 2013, pp. 119–129.'
date_created: 2017-10-17T12:42:33Z
date_updated: 2022-01-06T07:01:42Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1145/2486159.2486186
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T10:38:34Z
date_updated: 2018-03-15T10:38:34Z
file_id: '1299'
file_name: 519-iris-spaa2013_01.pdf
file_size: 554618
relation: main_file
success: 1
file_date_updated: 2018-03-15T10:38:34Z
has_accepted_license: '1'
page: 119-129
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and
Architectures (SPAA)
status: public
title: 'IRIS: A Robust Information System Against Insider DoS-Attacks'
type: conference
user_id: '15504'
year: '2013'
...
---
_id: '520'
abstract:
- lang: eng
text: Preemptive Routing and Wavelength Assignment (RWA) algorithms preempt established
lightpaths in case not enough resources are available to set up a new lightpath
in a Wavelength Division Multiplexing (WDM) network. The selection of lightpaths
to be preempted relies on internal decisions of the RWA algorithm. Thus, if dedicated
properties of the network topology are required by the applications running on
the network, these requirements have to be known to the RWA algorithm.Otherwise
it might happen that by preempting a particular lightpath these requirements are
violated. If, however, these requirements include parametersknown only at the
nodes running the application, the RWA algorithm cannot evaluate the requirements.
For this reason an RWA algorithm is needed which incorporates feedback from the
application layer in the preemption decisions.This work proposes a simple interface
along with an algorithm for computing and selecting preemption candidates in case
a lightpath cannot be established. We reason about the necessity of using information
from the application layer in the RWA and present two example applications which
benefit from this idea.
author:
- first_name: Philip
full_name: Wette, Philip
last_name: Wette
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: 'Wette P, Karl H. Incorporating feedback from application layer into routing
and wavelength assignment algorithms. In: Proceedings of the 32nd IEEE International
Conference on Computer Communications (INFOCOM). ; 2013:51-52. doi:10.1109/INFCOMW.2013.6970733'
apa: Wette, P., & Karl, H. (2013). Incorporating feedback from application layer
into routing and wavelength assignment algorithms. In Proceedings of the 32nd
IEEE International Conference on Computer Communications (INFOCOM) (pp. 51–52).
https://doi.org/10.1109/INFCOMW.2013.6970733
bibtex: '@inproceedings{Wette_Karl_2013, title={Incorporating feedback from application
layer into routing and wavelength assignment algorithms}, DOI={10.1109/INFCOMW.2013.6970733},
booktitle={Proceedings of the 32nd IEEE International Conference on Computer Communications
(INFOCOM)}, author={Wette, Philip and Karl, Holger}, year={2013}, pages={51–52}
}'
chicago: Wette, Philip, and Holger Karl. “Incorporating Feedback from Application
Layer into Routing and Wavelength Assignment Algorithms.” In Proceedings of
the 32nd IEEE International Conference on Computer Communications (INFOCOM),
51–52, 2013. https://doi.org/10.1109/INFCOMW.2013.6970733.
ieee: P. Wette and H. Karl, “Incorporating feedback from application layer into
routing and wavelength assignment algorithms,” in Proceedings of the 32nd IEEE
International Conference on Computer Communications (INFOCOM), 2013, pp. 51–52.
mla: Wette, Philip, and Holger Karl. “Incorporating Feedback from Application Layer
into Routing and Wavelength Assignment Algorithms.” Proceedings of the 32nd
IEEE International Conference on Computer Communications (INFOCOM), 2013,
pp. 51–52, doi:10.1109/INFCOMW.2013.6970733.
short: 'P. Wette, H. Karl, in: Proceedings of the 32nd IEEE International Conference
on Computer Communications (INFOCOM), 2013, pp. 51–52.'
date_created: 2017-10-17T12:42:33Z
date_updated: 2022-01-06T07:01:43Z
ddc:
- '040'
department:
- _id: '75'
doi: 10.1109/INFCOMW.2013.6970733
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T10:38:04Z
date_updated: 2018-03-15T10:38:04Z
file_id: '1298'
file_name: 520-wetteinfocom2013.pdf
file_size: 131502
relation: main_file
success: 1
file_date_updated: 2018-03-15T10:38:04Z
has_accepted_license: '1'
main_file_link:
- url: http://ieeexplore.ieee.org/document/6970733/
page: 51-52
project:
- _id: '1'
name: SFB 901
- _id: '6'
name: SFB 901 - Subprojekt A2
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 32nd IEEE International Conference on Computer Communications
(INFOCOM)
status: public
title: Incorporating feedback from application layer into routing and wavelength assignment
algorithms
type: conference
user_id: '15504'
year: '2013'
...
---
_id: '521'
author:
- first_name: Heinrich
full_name: Riebler, Heinrich
id: '8961'
last_name: Riebler
citation:
ama: Riebler H. Identifikation und Wiederherstellung von kryptographischen Schlüsseln
mit FPGAs. Universität Paderborn; 2013.
apa: Riebler, H. (2013). Identifikation und Wiederherstellung von kryptographischen
Schlüsseln mit FPGAs. Universität Paderborn.
bibtex: '@book{Riebler_2013, title={Identifikation und Wiederherstellung von kryptographischen
Schlüsseln mit FPGAs}, publisher={Universität Paderborn}, author={Riebler, Heinrich},
year={2013} }'
chicago: Riebler, Heinrich. Identifikation und Wiederherstellung von kryptographischen
Schlüsseln mit FPGAs. Universität Paderborn, 2013.
ieee: H. Riebler, Identifikation und Wiederherstellung von kryptographischen
Schlüsseln mit FPGAs. Universität Paderborn, 2013.
mla: Riebler, Heinrich. Identifikation und Wiederherstellung von kryptographischen
Schlüsseln mit FPGAs. Universität Paderborn, 2013.
short: H. Riebler, Identifikation und Wiederherstellung von kryptographischen Schlüsseln
mit FPGAs, Universität Paderborn, 2013.
date_created: 2017-10-17T12:42:34Z
date_updated: 2022-01-06T07:01:46Z
department:
- _id: '27'
- _id: '518'
keyword:
- coldboot
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '14'
name: SFB 901 - Subprojekt C2
- _id: '4'
name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
title: Identifikation und Wiederherstellung von kryptographischen Schlüsseln mit FPGAs
type: mastersthesis
user_id: '477'
year: '2013'
...