---
_id: '494'
abstract:
- lang: eng
text: The maintenance of component-based software systems requires up-to-date models
of their concrete architecture, i.e. the architecture that is realised in the
source code. These models help in systematically planning, analysing and executing
typical reengineering activities. Often no or only outdated architectural models
of such systems exist. Therefore, various reverse engineering methods have been
developed which try to recover a system's components, subsystems and connectors.
However, these reverse engineering methods are severely impacted by design deciencies
in the system's code base, especially violations of the component encapsulation.
As long as design deciencies are not considered in the reverse engineering process,
they reduce the quality of the recovered component structures. Despite this impact
of design deciencies, no existing architecture reconstruction approach explicitly
integrates a systematic deciency detection and removal into the recovery process.
Therefore, I have developed Archimetrix. Archimetrix is a tool-supported architecture
reconstruction process. It enhances a clustering-based architecture recovery approach
with an extensible, pattern-based deciency detection. After the detection of deciencies,
Archimetrix supports the software architect in removing the de ciencies and provides
the means to preview the architectural consequences of such a removal. I also
provide a process to identify and formalise additional deciencies. I validated
the approach on three case studies which show that Archimetrix is able to identify
relevant deciencies and that the removal of these deciencies leads to an increased
quality of the recovered architectures, i.e. they are closer to the corresponding
conceptual architectures.
author:
- first_name: Markus
full_name: von Detten, Markus
last_name: von Detten
citation:
ama: von Detten M. Reengineering of Component-Based Software Systems in the Presence
of Design Deficiencies. Universität Paderborn; 2013.
apa: von Detten, M. (2013). Reengineering of Component-Based Software Systems
in the Presence of Design Deficiencies. Universität Paderborn.
bibtex: '@book{von Detten_2013, title={Reengineering of Component-Based Software
Systems in the Presence of Design Deficiencies}, publisher={Universität Paderborn},
author={von Detten, Markus}, year={2013} }'
chicago: Detten, Markus von. Reengineering of Component-Based Software Systems
in the Presence of Design Deficiencies. Universität Paderborn, 2013.
ieee: M. von Detten, Reengineering of Component-Based Software Systems in the
Presence of Design Deficiencies. Universität Paderborn, 2013.
mla: von Detten, Markus. Reengineering of Component-Based Software Systems in
the Presence of Design Deficiencies. Universität Paderborn, 2013.
short: M. von Detten, Reengineering of Component-Based Software Systems in the Presence
of Design Deficiencies, Universität Paderborn, 2013.
date_created: 2017-10-17T12:42:28Z
date_updated: 2022-01-06T07:01:30Z
ddc:
- '040'
department:
- _id: '76'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T13:43:42Z
date_updated: 2018-03-15T13:43:42Z
file_id: '1315'
file_name: 494-Dissertation-vonDetten.pdf
file_size: 11101635
relation: main_file
success: 1
file_date_updated: 2018-03-15T13:43:42Z
has_accepted_license: '1'
project:
- _id: '1'
name: SFB 901
- _id: '9'
name: SFB 901 - Subprojekt B1
- _id: '3'
name: SFB 901 - Project Area B
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Wilhelm
full_name: Schäfer, Wilhelm
last_name: Schäfer
title: Reengineering of Component-Based Software Systems in the Presence of Design
Deficiencies
type: dissertation
user_id: '477'
year: '2013'
...
---
_id: '495'
abstract:
- lang: eng
text: Automated service composition has been studied as a subject of state based
planning for a decade. A great deal of service composition tasks can only be solved
if concrete output values of the services are considered in the composition process.
However, the fact that those values are not known before runtime leads to nondeterministic
planning problems, which have proven to be notoriously difficult in practical
automated service composition applications. Even though this problem is frequently
recognized, it has still received remarkably few attention and remains unsolved.This
paper shows how nondeterminism in automated service composition can be reduced.
We introduce context rules as a means to derive semantic knowledge from output
values of services. These rules enable us to replace nondeterministic composition
operations by less nondeterministic or even completely deterministic ones. We
show the validity of our solutions not only theoretically but also have evaluated
them practically through implementation.
author:
- first_name: Felix
full_name: Mohr, Felix
last_name: Mohr
- first_name: Theodor
full_name: Lettmann, Theodor
id: '315'
last_name: Lettmann
orcid: 0000-0001-5859-2457
- first_name: Hans
full_name: Kleine Büning, Hans
last_name: Kleine Büning
citation:
ama: 'Mohr F, Lettmann T, Kleine Büning H. Reducing Nondeterminism in Automated
Service Composition. In: Proceedings of the 6th International Conference on
Service Oriented Computing and Applications (SOCA). ; 2013:154-161. doi:10.1109/SOCA.2013.25'
apa: Mohr, F., Lettmann, T., & Kleine Büning, H. (2013). Reducing Nondeterminism
in Automated Service Composition. In Proceedings of the 6th International Conference
on Service Oriented Computing and Applications (SOCA) (pp. 154–161). https://doi.org/10.1109/SOCA.2013.25
bibtex: '@inproceedings{Mohr_Lettmann_Kleine Büning_2013, title={Reducing Nondeterminism
in Automated Service Composition}, DOI={10.1109/SOCA.2013.25},
booktitle={Proceedings of the 6th International Conference on Service Oriented
Computing and Applications (SOCA)}, author={Mohr, Felix and Lettmann, Theodor
and Kleine Büning, Hans}, year={2013}, pages={154–161} }'
chicago: Mohr, Felix, Theodor Lettmann, and Hans Kleine Büning. “Reducing Nondeterminism
in Automated Service Composition.” In Proceedings of the 6th International
Conference on Service Oriented Computing and Applications (SOCA), 154–61,
2013. https://doi.org/10.1109/SOCA.2013.25.
ieee: F. Mohr, T. Lettmann, and H. Kleine Büning, “Reducing Nondeterminism in Automated
Service Composition,” in Proceedings of the 6th International Conference on
Service Oriented Computing and Applications (SOCA), 2013, pp. 154–161.
mla: Mohr, Felix, et al. “Reducing Nondeterminism in Automated Service Composition.”
Proceedings of the 6th International Conference on Service Oriented Computing
and Applications (SOCA), 2013, pp. 154–61, doi:10.1109/SOCA.2013.25.
short: 'F. Mohr, T. Lettmann, H. Kleine Büning, in: Proceedings of the 6th International
Conference on Service Oriented Computing and Applications (SOCA), 2013, pp. 154–161.'
date_created: 2017-10-17T12:42:28Z
date_updated: 2022-01-06T07:01:30Z
ddc:
- '040'
department:
- _id: '355'
doi: 10.1109/SOCA.2013.25
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T13:43:08Z
date_updated: 2018-03-15T13:43:08Z
file_id: '1314'
file_name: 495-paper52_mohr.pdf
file_size: 603822
relation: main_file
success: 1
file_date_updated: 2018-03-15T13:43:08Z
has_accepted_license: '1'
language:
- iso: eng
page: 154-161
project:
- _id: '1'
name: SFB 901
- _id: '10'
name: SFB 901 - Subprojekt B2
- _id: '3'
name: SFB 901 - Project Area B
publication: Proceedings of the 6th International Conference on Service Oriented Computing
and Applications (SOCA)
status: public
title: Reducing Nondeterminism in Automated Service Composition
type: conference
user_id: '477'
year: '2013'
...
---
_id: '496'
abstract:
- lang: eng
text: Within reactive topology control, a node determines its adjacent edges of
a network subgraph without prior knowledge of its neighborhood. The goal is to
construct a local view on a topology which provides certain desired properties
such as planarity. During algorithm execution, a node, in general, is not allowed
to determine all its neighbors of the network graph. There are well-known reactive
algorithms for computing planar subgraphs. However, the subgraphs obtained do
not have constant Euclidean spanning ratio. This means that routing along these
subgraphs may result in potentially long detours. So far, it has been unknown
if planar spanners can be constructed reactively. In this work, we show that at
least under the unit disk network model, this is indeed possible, by proposing
an algorithm for reactive construction of the partial Delaunay triangulation,
which recently turned out to be a spanner. Furthermore, we show that our algorithm
is message-optimal as a node will only exchange messages with nodes that are also
neighbors in the spanner. The algorithm’s presentation is complemented by a rigorous
proof of correctness.
author:
- first_name: Markus
full_name: Benter, Markus
last_name: Benter
- first_name: Florentin
full_name: Neumann, Florentin
last_name: Neumann
- first_name: Hannes
full_name: Frey, Hannes
last_name: Frey
citation:
ama: 'Benter M, Neumann F, Frey H. Reactive Planar Spanner Construction in Wireless
Ad Hoc and Sensor Networks. In: Proceedings of the 32nd IEEE International
Conference on Computer Communications (INFOCOM). ; 2013:2193-2201. doi:10.1109/INFCOM.2013.6567022'
apa: Benter, M., Neumann, F., & Frey, H. (2013). Reactive Planar Spanner Construction
in Wireless Ad Hoc and Sensor Networks. In Proceedings of the 32nd IEEE International
Conference on Computer Communications (INFOCOM) (pp. 2193–2201). https://doi.org/10.1109/INFCOM.2013.6567022
bibtex: '@inproceedings{Benter_Neumann_Frey_2013, title={Reactive Planar Spanner
Construction in Wireless Ad Hoc and Sensor Networks}, DOI={10.1109/INFCOM.2013.6567022},
booktitle={Proceedings of the 32nd IEEE International Conference on Computer Communications
(INFOCOM)}, author={Benter, Markus and Neumann, Florentin and Frey, Hannes}, year={2013},
pages={2193–2201} }'
chicago: Benter, Markus, Florentin Neumann, and Hannes Frey. “Reactive Planar Spanner
Construction in Wireless Ad Hoc and Sensor Networks.” In Proceedings of the
32nd IEEE International Conference on Computer Communications (INFOCOM), 2193–2201,
2013. https://doi.org/10.1109/INFCOM.2013.6567022.
ieee: M. Benter, F. Neumann, and H. Frey, “Reactive Planar Spanner Construction
in Wireless Ad Hoc and Sensor Networks,” in Proceedings of the 32nd IEEE International
Conference on Computer Communications (INFOCOM), 2013, pp. 2193–2201.
mla: Benter, Markus, et al. “Reactive Planar Spanner Construction in Wireless Ad
Hoc and Sensor Networks.” Proceedings of the 32nd IEEE International Conference
on Computer Communications (INFOCOM), 2013, pp. 2193–201, doi:10.1109/INFCOM.2013.6567022.
short: 'M. Benter, F. Neumann, H. Frey, in: Proceedings of the 32nd IEEE International
Conference on Computer Communications (INFOCOM), 2013, pp. 2193–2201.'
date_created: 2017-10-17T12:42:29Z
date_updated: 2022-01-06T07:01:31Z
ddc:
- '040'
department:
- _id: '75'
doi: 10.1109/INFCOM.2013.6567022
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T13:41:34Z
date_updated: 2018-03-15T13:41:34Z
file_id: '1312'
file_name: 496-reactivePDT-copyright.pdf
file_size: 352571
relation: main_file
success: 1
file_date_updated: 2018-03-15T13:41:34Z
has_accepted_license: '1'
page: 2193-2201
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: Reactive Planar Spanner Construction in Wireless Ad Hoc and Sensor Networks
type: conference
user_id: '15504'
year: '2013'
...
---
_id: '498'
abstract:
- lang: eng
text: Proof-carrying code approaches aim at safe execution of untrusted code by
having the code producer attach a safety proof to the code which the code consumer
only has to validate. Depending on the type of safety property, proofs can however
become quite large and their validation - though faster than their construction
- still time consuming. In this paper we introduce a new concept for safe execution
of untrusted code. It keeps the idea of putting the time consuming part of proving
on the side of the code producer, however, attaches no proofs to code anymore
but instead uses the proof to transform the program into an equivalent but more
efficiently verifiable program. Code consumers thus still do proving themselves,
however, on a computationally inexpensive level only. Experimental results show
that the proof effort can be reduced by several orders of magnitude, both with
respect to time and space.
author:
- first_name: Daniel
full_name: Wonisch, Daniel
last_name: Wonisch
- first_name: Alexander
full_name: Schremmer, Alexander
last_name: Schremmer
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Wonisch D, Schremmer A, Wehrheim H. Programs from Proofs – A PCC Alternative.
In: Proceedings of the 25th International Conference on Computer Aided Verification
(CAV). LNCS. ; 2013:912-927. doi:10.1007/978-3-642-39799-8_65'
apa: Wonisch, D., Schremmer, A., & Wehrheim, H. (2013). Programs from Proofs
– A PCC Alternative. In Proceedings of the 25th International Conference on
Computer Aided Verification (CAV) (pp. 912–927). https://doi.org/10.1007/978-3-642-39799-8_65
bibtex: '@inproceedings{Wonisch_Schremmer_Wehrheim_2013, series={LNCS}, title={Programs
from Proofs – A PCC Alternative}, DOI={10.1007/978-3-642-39799-8_65},
booktitle={Proceedings of the 25th International Conference on Computer Aided
Verification (CAV)}, author={Wonisch, Daniel and Schremmer, Alexander and Wehrheim,
Heike}, year={2013}, pages={912–927}, collection={LNCS} }'
chicago: Wonisch, Daniel, Alexander Schremmer, and Heike Wehrheim. “Programs from
Proofs – A PCC Alternative.” In Proceedings of the 25th International Conference
on Computer Aided Verification (CAV), 912–27. LNCS, 2013. https://doi.org/10.1007/978-3-642-39799-8_65.
ieee: D. Wonisch, A. Schremmer, and H. Wehrheim, “Programs from Proofs – A PCC Alternative,”
in Proceedings of the 25th International Conference on Computer Aided Verification
(CAV), 2013, pp. 912–927.
mla: Wonisch, Daniel, et al. “Programs from Proofs – A PCC Alternative.” Proceedings
of the 25th International Conference on Computer Aided Verification (CAV),
2013, pp. 912–27, doi:10.1007/978-3-642-39799-8_65.
short: 'D. Wonisch, A. Schremmer, H. Wehrheim, in: Proceedings of the 25th International
Conference on Computer Aided Verification (CAV), 2013, pp. 912–927.'
date_created: 2017-10-17T12:42:29Z
date_updated: 2022-01-06T07:01:32Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1007/978-3-642-39799-8_65
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T13:42:30Z
date_updated: 2018-03-15T13:42:30Z
file_id: '1313'
file_name: 498-WonischSchremmerWehrheim2013.pdf
file_size: 487617
relation: main_file
success: 1
file_date_updated: 2018-03-15T13:42:30Z
has_accepted_license: '1'
language:
- iso: eng
page: 912-927
project:
- _id: '1'
name: SFB 901
- _id: '12'
name: SFB 901 - Subprojekt B4
- _id: '3'
name: SFB 901 - Project Area B
publication: Proceedings of the 25th International Conference on Computer Aided Verification
(CAV)
series_title: LNCS
status: public
title: Programs from Proofs – A PCC Alternative
type: conference
user_id: '477'
year: '2013'
...
---
_id: '499'
abstract:
- lang: eng
text: We present a new online algorithm for profit-oriented scheduling on multiple
speed-scalable processors.Moreover, we provide a tight analysis of the algorithm's
competitiveness.Our results generalize and improve upon work by \citet{Chan:2010},
which considers a single speed-scalable processor.Using significantly different
techniques, we can not only extend their model to multiprocessors but also prove
an enhanced and tight competitive ratio for our algorithm.In our scheduling problem,
jobs arrive over time and are preemptable.They have different workloads, values,
and deadlines.The scheduler may decide not to finish a job but instead to suffer
a loss equaling the job's value.However, to process a job's workload until its
deadline the scheduler must invest a certain amount of energy.The cost of a schedule
is the sum of lost values and invested energy.In order to finish a job the scheduler
has to determine which processors to use and set their speeds accordingly.A processor's
energy consumption is power $\Power{s}$ integrated over time, where $\Power{s}=s^{\alpha}$
is the power consumption when running at speed $s$.Since we consider the online
variant of the problem, the scheduler has no knowledge about future jobs.This
problem was introduced by~\citet{Chan:2010} for the case of a single processor.They
presented an online algorithm which is $\alpha^{\alpha}+2e\alpha$-competitive.We
provide an online algorithm for the case of multiple processors with an improved
competitive ratio of $\alpha^{\alpha}$.
author:
- first_name: Peter
full_name: Kling, Peter
last_name: Kling
- first_name: Peter
full_name: Pietrzyk, Peter
last_name: Pietrzyk
citation:
ama: 'Kling P, Pietrzyk P. Profitable Scheduling on Multiple Speed-Scalable Processors.
In: Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and
Architectures (SPAA). ; 2013:251-260. doi:10.1145/2486159.2486183'
apa: Kling, P., & Pietrzyk, P. (2013). Profitable Scheduling on Multiple Speed-Scalable
Processors. In Proceedings of the 25th ACM Symposium on Parallelism in Algorithms
and Architectures (SPAA) (pp. 251–260). https://doi.org/10.1145/2486159.2486183
bibtex: '@inproceedings{Kling_Pietrzyk_2013, title={Profitable Scheduling on Multiple
Speed-Scalable Processors}, DOI={10.1145/2486159.2486183},
booktitle={Proceedings of the 25th ACM Symposium on Parallelism in Algorithms
and Architectures (SPAA)}, author={Kling, Peter and Pietrzyk, Peter}, year={2013},
pages={251–260} }'
chicago: Kling, Peter, and Peter Pietrzyk. “Profitable Scheduling on Multiple Speed-Scalable
Processors.” In Proceedings of the 25th ACM Symposium on Parallelism in Algorithms
and Architectures (SPAA), 251–60, 2013. https://doi.org/10.1145/2486159.2486183.
ieee: P. Kling and P. Pietrzyk, “Profitable Scheduling on Multiple Speed-Scalable
Processors,” in Proceedings of the 25th ACM Symposium on Parallelism in Algorithms
and Architectures (SPAA), 2013, pp. 251–260.
mla: Kling, Peter, and Peter Pietrzyk. “Profitable Scheduling on Multiple Speed-Scalable
Processors.” Proceedings of the 25th ACM Symposium on Parallelism in Algorithms
and Architectures (SPAA), 2013, pp. 251–60, doi:10.1145/2486159.2486183.
short: 'P. Kling, P. Pietrzyk, in: Proceedings of the 25th ACM Symposium on Parallelism
in Algorithms and Architectures (SPAA), 2013, pp. 251–260.'
date_created: 2017-10-17T12:42:29Z
date_updated: 2022-01-06T07:01:34Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1145/2486159.2486183
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T13:40:02Z
date_updated: 2018-03-15T13:40:02Z
file_id: '1310'
file_name: 499-P._Kling__P._Pietryzk_-_Profitable_Scheduling_on_Multiple_Speed-scalable_Processors__2013_.pdf
file_size: 558661
relation: main_file
success: 1
file_date_updated: 2018-03-15T13:40:02Z
has_accepted_license: '1'
language:
- iso: eng
page: '251-260 '
project:
- _id: '1'
name: SFB 901
- _id: '16'
name: SFB 901 - Subproject C4
- _id: '14'
name: SFB 901 - Subproject C2
- _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: Profitable Scheduling on Multiple Speed-Scalable Processors
type: conference
user_id: '477'
year: '2013'
...
---
_id: '7569'
abstract:
- lang: eng
text: 'Dynamic Meta Modeling (DMM) is a semantics specification technique targeted
at MOF-based modeling languages, where a language''s behavior is defined by means
of graphical operational rules which change runtime models. The DMM approach has
first been suggested by Engels et al. in 2000; Hausmann has then defined the DMM
language on a conceptual level within his PhD thesis in 2006. Consequently, the
next step was to bring the existing DMM concepts alive, and then to apply them
to different modeling languages, making use of the lessons learned to improve
the DMM concepts as well as the DMM tooling. The result of this process is the
DMM++ method, which is presented within this thesis. Our contributions are three-fold:
First, and according to our experiences with the DMM language, we have introduced
new concepts such as refinement by means of rule overriding, and we have strengthened
existing concepts such as the dealing with universally quantified structures or
attributes. Second, we have developed a test-driven process for semantics specification:
A set of test models is created, and their expected behavior is fixed. Then, the
DMM rules are created incrementally, finally resulting in a DMM ruleset realizing
at least the expected behavior of the test models. Additionally, we have defined
a set of coverage criteria for DMM rulesets which allow to measure the quality
of a set of test models. Third, we have shown how functional as well as non-functional
requirements can be formulated against models and their DMM specifications. The
former is achieved by providing a visual language for formulating temporal logic
properties, which are then verified with model checking techniques, and by allowing
for visual debugging of models failing a requirement. For the latter, the modeler
can add performance information to models and analyze their performance properties,
e.g. average throughput.'
author:
- first_name: Christian
full_name: Soltenborn, Christian
id: '1737'
last_name: Soltenborn
orcid: 0000-0002-0342-8227
citation:
ama: Soltenborn C. Quality Assurance with Dynamic Meta Modeling. Universität
Paderborn; 2013. doi:http://nbn-resolving.de/urn:nbn:de:hbz:466:2-12420
apa: Soltenborn, C. (2013). Quality Assurance with Dynamic Meta Modeling.
Universität Paderborn. http://nbn-resolving.de/urn:nbn:de:hbz:466:2-12420
bibtex: '@book{Soltenborn_2013, title={Quality Assurance with Dynamic Meta Modeling},
DOI={http://nbn-resolving.de/urn:nbn:de:hbz:466:2-12420},
publisher={Universität Paderborn}, author={Soltenborn, Christian}, year={2013}
}'
chicago: Soltenborn, Christian. Quality Assurance with Dynamic Meta Modeling.
Universität Paderborn, 2013. http://nbn-resolving.de/urn:nbn:de:hbz:466:2-12420.
ieee: C. Soltenborn, Quality Assurance with Dynamic Meta Modeling. Universität
Paderborn, 2013.
mla: Soltenborn, Christian. Quality Assurance with Dynamic Meta Modeling.
Universität Paderborn, 2013, doi:http://nbn-resolving.de/urn:nbn:de:hbz:466:2-12420.
short: C. Soltenborn, Quality Assurance with Dynamic Meta Modeling, Universität
Paderborn, 2013.
date_created: 2019-02-06T14:15:58Z
date_updated: 2022-01-06T07:03:39Z
department:
- _id: '66'
doi: http://nbn-resolving.de/urn:nbn:de:hbz:466:2-12420
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '9'
name: SFB 901 - Subproject B1
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
title: Quality Assurance with Dynamic Meta Modeling
type: dissertation
user_id: '477'
year: '2013'
...
---
_id: '500'
author:
- first_name: Margarita
full_name: Staschewski, Margarita
last_name: Staschewski
citation:
ama: Staschewski M. Price Formation in the Restaurant Industry - An Empirical
Analysis. Universität Paderborn; 2013.
apa: Staschewski, M. (2013). Price Formation in the Restaurant Industry - An
Empirical Analysis. Universität Paderborn.
bibtex: '@book{Staschewski_2013, title={Price Formation in the Restaurant Industry
- An Empirical Analysis}, publisher={Universität Paderborn}, author={Staschewski,
Margarita}, year={2013} }'
chicago: Staschewski, Margarita. Price Formation in the Restaurant Industry -
An Empirical Analysis. Universität Paderborn, 2013.
ieee: M. Staschewski, Price Formation in the Restaurant Industry - An Empirical
Analysis. Universität Paderborn, 2013.
mla: Staschewski, Margarita. Price Formation in the Restaurant Industry - An
Empirical Analysis. Universität Paderborn, 2013.
short: M. Staschewski, Price Formation in the Restaurant Industry - An Empirical
Analysis, Universität Paderborn, 2013.
date_created: 2017-10-17T12:42:30Z
date_updated: 2022-01-06T07:01:34Z
project:
- _id: '1'
name: SFB 901
- _id: '7'
name: SFB 901 - Subprojekt A3
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: Price Formation in the Restaurant Industry - An Empirical Analysis
type: bachelorsthesis
user_id: '15504'
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: '502'
abstract:
- lang: eng
text: Self-adaptation allows continuously running software systems to operate in
changing and uncertain contexts while meeting their requirements in a broad range
of contexts, e.g., from low to high load situations. As a consequence, requirementsfor
self-adaptive systems are more complex than requirements for static systems as
they have to explicitly address properties of the self-adaptation layer.While
approaches exist in the literature to capture this new type of requirements formally,
their achievement cannot be analyzed in early design phases yet. In this paper,
we apply RELAX to formally specify non-functional requirements for self-adaptive
systems. We then apply our model-based SimuLizar approach for a semi-automatic
analysis to test whether the self-adaptation layer ensures that these non-functional
requirements are met. We evaluate our approach on the design of a proof-of-concept
load balancer system. As this evaluation demonstrates, we can iteratively improve
our system design by improving unsatisfactory self-adaption rules.
author:
- first_name: Matthias
full_name: Becker, Matthias
last_name: Becker
- first_name: Markus
full_name: Luckey, Markus
last_name: Luckey
- first_name: Steffen
full_name: Becker, Steffen
last_name: Becker
citation:
ama: 'Becker M, Luckey M, Becker S. Performance Analysis of Self-Adaptive Systems
for Requirements Validation at Design-Time. In: Proceedings of the 9th ACM
SigSoft International Conference on Quality of Software Architectures (QoSA’13).
; 2013:43-52. doi:10.1145/2465478.2465489'
apa: Becker, M., Luckey, M., & Becker, S. (2013). Performance Analysis of Self-Adaptive
Systems for Requirements Validation at Design-Time. In Proceedings of the 9th
ACM SigSoft International Conference on Quality of Software Architectures (QoSA’13)
(pp. 43–52). https://doi.org/10.1145/2465478.2465489
bibtex: '@inproceedings{Becker_Luckey_Becker_2013, title={Performance Analysis of
Self-Adaptive Systems for Requirements Validation at Design-Time}, DOI={10.1145/2465478.2465489},
booktitle={Proceedings of the 9th ACM SigSoft International Conference on Quality
of Software Architectures (QoSA’13)}, author={Becker, Matthias and Luckey, Markus
and Becker, Steffen}, year={2013}, pages={43–52} }'
chicago: Becker, Matthias, Markus Luckey, and Steffen Becker. “Performance Analysis
of Self-Adaptive Systems for Requirements Validation at Design-Time.” In Proceedings
of the 9th ACM SigSoft International Conference on Quality of Software Architectures
(QoSA’13), 43–52, 2013. https://doi.org/10.1145/2465478.2465489.
ieee: M. Becker, M. Luckey, and S. Becker, “Performance Analysis of Self-Adaptive
Systems for Requirements Validation at Design-Time,” in Proceedings of the
9th ACM SigSoft International Conference on Quality of Software Architectures
(QoSA’13), 2013, pp. 43–52.
mla: Becker, Matthias, et al. “Performance Analysis of Self-Adaptive Systems for
Requirements Validation at Design-Time.” Proceedings of the 9th ACM SigSoft
International Conference on Quality of Software Architectures (QoSA’13), 2013,
pp. 43–52, doi:10.1145/2465478.2465489.
short: 'M. Becker, M. Luckey, S. Becker, in: Proceedings of the 9th ACM SigSoft
International Conference on Quality of Software Architectures (QoSA’13), 2013,
pp. 43–52.'
date_created: 2017-10-17T12:42:30Z
date_updated: 2022-01-06T07:01:35Z
ddc:
- '040'
doi: 10.1145/2465478.2465489
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T13:39:29Z
date_updated: 2018-03-15T13:39:29Z
file_id: '1309'
file_name: 502-qosa33f.pdf
file_size: 320384
relation: main_file
success: 1
file_date_updated: 2018-03-15T13:39:29Z
has_accepted_license: '1'
page: '43-52 '
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 9th ACM SigSoft International Conference on Quality
of Software Architectures (QoSA'13)
status: public
title: Performance Analysis of Self-Adaptive Systems for Requirements Validation at
Design-Time
type: conference
user_id: '15504'
year: '2013'
...
---
_id: '503'
author:
- first_name: Andreas
full_name: Blix, Andreas
last_name: Blix
citation:
ama: Blix A. Optimale und adaptive binäre Bäume in Netzwerken. Universität
Paderborn; 2013.
apa: Blix, A. (2013). Optimale und adaptive binäre Bäume in Netzwerken. Universität
Paderborn.
bibtex: '@book{Blix_2013, title={Optimale und adaptive binäre Bäume in Netzwerken},
publisher={Universität Paderborn}, author={Blix, Andreas}, year={2013} }'
chicago: Blix, Andreas. Optimale und adaptive binäre Bäume in Netzwerken.
Universität Paderborn, 2013.
ieee: A. Blix, Optimale und adaptive binäre Bäume in Netzwerken. Universität
Paderborn, 2013.
mla: Blix, Andreas. Optimale und adaptive binäre Bäume in Netzwerken. Universität
Paderborn, 2013.
short: A. Blix, Optimale und adaptive binäre Bäume in Netzwerken, Universität Paderborn,
2013.
date_created: 2017-10-17T12:42:30Z
date_updated: 2022-01-06T07:01:35Z
language:
- iso: ger
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
title: Optimale und adaptive binäre Bäume in Netzwerken
type: bachelorsthesis
user_id: '477'
year: '2013'
...
---
_id: '504'
author:
- first_name: Simon
full_name: Schwichtenberg, Simon
id: '13235'
last_name: Schwichtenberg
citation:
ama: Schwichtenberg S. Ontology-Based Normalization and Matching of Rich Service
Descriptions. Universität Paderborn; 2013.
apa: Schwichtenberg, S. (2013). Ontology-based Normalization and Matching of
Rich Service Descriptions. Universität Paderborn.
bibtex: '@book{Schwichtenberg_2013, title={Ontology-based Normalization and Matching
of Rich Service Descriptions}, publisher={Universität Paderborn}, author={Schwichtenberg,
Simon}, year={2013} }'
chicago: Schwichtenberg, Simon. Ontology-Based Normalization and Matching of
Rich Service Descriptions. Universität Paderborn, 2013.
ieee: S. Schwichtenberg, Ontology-based Normalization and Matching of Rich Service
Descriptions. Universität Paderborn, 2013.
mla: Schwichtenberg, Simon. Ontology-Based Normalization and Matching of Rich
Service Descriptions. Universität Paderborn, 2013.
short: S. Schwichtenberg, Ontology-Based Normalization and Matching of Rich Service
Descriptions, Universität Paderborn, 2013.
date_created: 2017-10-17T12:42:30Z
date_updated: 2022-01-06T07:01:35Z
project:
- _id: '1'
name: SFB 901
- _id: '9'
name: SFB 901 - Subprojekt B1
- _id: '3'
name: SFB 901 - Project Area B
publisher: Universität Paderborn
status: public
title: Ontology-based Normalization and Matching of Rich Service Descriptions
type: mastersthesis
user_id: '15504'
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: '510'
author:
- first_name: Chintan
full_name: Jayesh Parekh, Chintan
last_name: Jayesh Parekh
citation:
ama: Jayesh Parekh C. Meta-Data Based Search in Structured Peer-to-Peer Networks.
Universität Paderborn; 2013.
apa: Jayesh Parekh, C. (2013). Meta-data based Search in Structured Peer-to-Peer
Networks. Universität Paderborn.
bibtex: '@book{Jayesh Parekh_2013, title={Meta-data based Search in Structured Peer-to-Peer
Networks}, publisher={Universität Paderborn}, author={Jayesh Parekh, Chintan},
year={2013} }'
chicago: Jayesh Parekh, Chintan. Meta-Data Based Search in Structured Peer-to-Peer
Networks. Universität Paderborn, 2013.
ieee: C. Jayesh Parekh, Meta-data based Search in Structured Peer-to-Peer Networks.
Universität Paderborn, 2013.
mla: Jayesh Parekh, Chintan. Meta-Data Based Search in Structured Peer-to-Peer
Networks. Universität Paderborn, 2013.
short: C. Jayesh Parekh, Meta-Data Based Search in Structured Peer-to-Peer Networks,
Universität Paderborn, 2013.
date_created: 2017-10-17T12:42:31Z
date_updated: 2022-01-06T07:01:37Z
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
title: Meta-data based Search in Structured Peer-to-Peer Networks
type: mastersthesis
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: '512'
author:
- first_name: Elvira
full_name: Herzog, Elvira
last_name: Herzog
citation:
ama: Herzog E. Lösungsverfahren für das many-to-one Matching Problem. Universität
Paderborn; 2013.
apa: Herzog, E. (2013). Lösungsverfahren für das many-to-one Matching Problem.
Universität Paderborn.
bibtex: '@book{Herzog_2013, title={Lösungsverfahren für das many-to-one Matching
Problem}, publisher={Universität Paderborn}, author={Herzog, Elvira}, year={2013}
}'
chicago: Herzog, Elvira. Lösungsverfahren für das many-to-one Matching Problem.
Universität Paderborn, 2013.
ieee: E. Herzog, Lösungsverfahren für das many-to-one Matching Problem. Universität
Paderborn, 2013.
mla: Herzog, Elvira. Lösungsverfahren für das many-to-one Matching Problem.
Universität Paderborn, 2013.
short: E. Herzog, Lösungsverfahren für das many-to-one Matching Problem, Universität
Paderborn, 2013.
date_created: 2017-10-17T12:42:32Z
date_updated: 2022-01-06T07:01:38Z
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '7'
name: SFB 901 - Subprojekt A3
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: Lösungsverfahren für das many-to-one Matching Problem
type: bachelorsthesis
user_id: '477'
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'
...