---
_id: '286'
author:
- first_name: Benedikt
full_name: Kalde, Benedikt
last_name: Kalde
citation:
ama: Kalde B. Implementierung eines hybriden Verschlüsselungsverfahrens nach
Cramer und Shoup. Universität Paderborn; 2015.
apa: Kalde, B. (2015). Implementierung eines hybriden Verschlüsselungsverfahrens
nach Cramer und Shoup. Universität Paderborn.
bibtex: '@book{Kalde_2015, title={Implementierung eines hybriden Verschlüsselungsverfahrens
nach Cramer und Shoup}, publisher={Universität Paderborn}, author={Kalde, Benedikt},
year={2015} }'
chicago: Kalde, Benedikt. Implementierung eines hybriden Verschlüsselungsverfahrens
nach Cramer und Shoup. Universität Paderborn, 2015.
ieee: B. Kalde, Implementierung eines hybriden Verschlüsselungsverfahrens nach
Cramer und Shoup. Universität Paderborn, 2015.
mla: Kalde, Benedikt. Implementierung eines hybriden Verschlüsselungsverfahrens
nach Cramer und Shoup. Universität Paderborn, 2015.
short: B. Kalde, Implementierung eines hybriden Verschlüsselungsverfahrens nach
Cramer und Shoup, Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:47Z
date_updated: 2022-01-06T06:58:10Z
department:
- _id: '64'
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
title: Implementierung eines hybriden Verschlüsselungsverfahrens nach Cramer und Shoup
type: bachelorsthesis
user_id: '477'
year: '2015'
...
---
_id: '287'
abstract:
- lang: eng
text: The size of modern data centers is constantly increasing. As it is not economic
to interconnect all machines in the data center using a full-bisection-bandwidth
network, techniques have to be developed to increase the efficiency of data-center
networks. The Software-Defined Network paradigm opened the door for centralized
traffic engineering (TE) in such environments. Up to now, there were already a
number of TE proposals for SDN-controlled data centers that all work very well.
However, these techniques either use a high amount of flow table entries or a
high flow installation rate that overwhelms available switching hardware, or they
require custom or very expensive end-of-line equipment to be usable in practice.
We present HybridTE, a TE technique that uses (uncertain) information about large
flows. Using this extra information, our technique has very low hardware requirements
while maintaining better performance than existing TE techniques. This enables
us to build very low-cost, high performance data-center networks.
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. HybridTE: Traffic Engineering for Very Low-Cost Software-Defined
Data-Center Networks. In: Proceedings of the 4th European Workshop on Software
Defined Networks (EWSDN 2015). ; 2015:1--7. doi:10.1109/EWSDN.2015.57'
apa: 'Wette, P., & Karl, H. (2015). HybridTE: Traffic Engineering for Very Low-Cost
Software-Defined Data-Center Networks. In Proceedings of the 4th European Workshop
on Software Defined Networks (EWSDN 2015) (pp. 1--7). https://doi.org/10.1109/EWSDN.2015.57'
bibtex: '@inproceedings{Wette_Karl_2015, title={HybridTE: Traffic Engineering for
Very Low-Cost Software-Defined Data-Center Networks}, DOI={10.1109/EWSDN.2015.57},
booktitle={Proceedings of the 4th European Workshop on Software Defined Networks
(EWSDN 2015)}, author={Wette, Philip and Karl, Holger}, year={2015}, pages={1--7}
}'
chicago: 'Wette, Philip, and Holger Karl. “HybridTE: Traffic Engineering for Very
Low-Cost Software-Defined Data-Center Networks.” In Proceedings of the 4th
European Workshop on Software Defined Networks (EWSDN 2015), 1--7, 2015. https://doi.org/10.1109/EWSDN.2015.57.'
ieee: 'P. Wette and H. Karl, “HybridTE: Traffic Engineering for Very Low-Cost Software-Defined
Data-Center Networks,” in Proceedings of the 4th European Workshop on Software
Defined Networks (EWSDN 2015), 2015, pp. 1--7.'
mla: 'Wette, Philip, and Holger Karl. “HybridTE: Traffic Engineering for Very Low-Cost
Software-Defined Data-Center Networks.” Proceedings of the 4th European Workshop
on Software Defined Networks (EWSDN 2015), 2015, pp. 1--7, doi:10.1109/EWSDN.2015.57.'
short: 'P. Wette, H. Karl, in: Proceedings of the 4th European Workshop on Software
Defined Networks (EWSDN 2015), 2015, pp. 1--7.'
date_created: 2017-10-17T12:41:48Z
date_updated: 2022-01-06T06:58:17Z
ddc:
- '040'
department:
- _id: '75'
doi: 10.1109/EWSDN.2015.57
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-08T09:55:30Z
date_updated: 2018-03-08T09:59:05Z
file_id: '1203'
file_name: 287-1503.04317v1.pdf
file_size: 1625732
relation: main_file
file_date_updated: 2018-03-08T09:59:05Z
has_accepted_license: '1'
page: 1--7
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 4th European Workshop on Software Defined Networks
(EWSDN 2015)
quality_controlled: '1'
status: public
title: 'HybridTE: Traffic Engineering for Very Low-Cost Software-Defined Data-Center
Networks'
type: conference
urn: '2875'
user_id: '15572'
year: '2015'
...
---
_id: '241'
abstract:
- lang: eng
text: Distributed applications are commonly based on overlay networks interconnecting
their sites so that they can exchange information. For these overlay networks
to preserve their functionality, they should be able to recover from various problems
like membership changes or faults. Various self-stabilizing overlay networks have
already been proposed in recent years, which have the advantage of being able
to recover from any illegal state, but none of these networks can give any guarantees
on its functionality while the recovery process is going on. We initiate research
on overlay networks that are not only self-stabilizing but that also ensure that
searchability is maintained while the recovery process is going on, as long as
there are no corrupted messages in the system. More precisely, once a search message
from node u to another node v is successfully delivered, all future search messages
from u to v succeed as well. We call this property monotonic searchability. We
show that in general it is impossible to provide monotonic searchability if corrupted
messages are present in the system, which justifies the restriction to system
states without corrupted messages. Furthermore, we provide a self-stabilizing
protocol for the line for which we can also show monotonic searchability. It turns
out that even for the line it is non-trivial to achieve this property. Additionally,
we extend our protocol to deal with node departures in terms of the Finite Departure
Problem of Foreback et. al (SSS 2014). This makes our protocol even capable of
handling node dynamics.
author:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Alexander
full_name: Setzer, Alexander
id: '11108'
last_name: Setzer
- first_name: Thim Frederik
full_name: Strothmann, Thim Frederik
id: '11319'
last_name: Strothmann
citation:
ama: 'Scheideler C, Setzer A, Strothmann TF. Towards Establishing Monotonic Searchability
in Self-Stabilizing Data Structures. In: Proceedings of the 19th International
Conference on Principles of Distributed Systems (OPODIS). Leibniz International
Proceedings in Informatics (LIPIcs). ; 2015. doi:10.4230/LIPIcs.OPODIS.2015.24'
apa: Scheideler, C., Setzer, A., & Strothmann, T. F. (2015). Towards Establishing
Monotonic Searchability in Self-Stabilizing Data Structures. In Proceedings
of the 19th International Conference on Principles of Distributed Systems (OPODIS).
https://doi.org/10.4230/LIPIcs.OPODIS.2015.24
bibtex: '@inproceedings{Scheideler_Setzer_Strothmann_2015, series={Leibniz International
Proceedings in Informatics (LIPIcs)}, title={Towards Establishing Monotonic Searchability
in Self-Stabilizing Data Structures}, DOI={10.4230/LIPIcs.OPODIS.2015.24},
booktitle={Proceedings of the 19th International Conference on Principles of Distributed
Systems (OPODIS)}, author={Scheideler, Christian and Setzer, Alexander and Strothmann,
Thim Frederik}, year={2015}, collection={Leibniz International Proceedings in
Informatics (LIPIcs)} }'
chicago: Scheideler, Christian, Alexander Setzer, and Thim Frederik Strothmann.
“Towards Establishing Monotonic Searchability in Self-Stabilizing Data Structures.”
In Proceedings of the 19th International Conference on Principles of Distributed
Systems (OPODIS). Leibniz International Proceedings in Informatics (LIPIcs),
2015. https://doi.org/10.4230/LIPIcs.OPODIS.2015.24.
ieee: C. Scheideler, A. Setzer, and T. F. Strothmann, “Towards Establishing Monotonic
Searchability in Self-Stabilizing Data Structures,” in Proceedings of the 19th
International Conference on Principles of Distributed Systems (OPODIS), 2015.
mla: Scheideler, Christian, et al. “Towards Establishing Monotonic Searchability
in Self-Stabilizing Data Structures.” Proceedings of the 19th International
Conference on Principles of Distributed Systems (OPODIS), 2015, doi:10.4230/LIPIcs.OPODIS.2015.24.
short: 'C. Scheideler, A. Setzer, T.F. Strothmann, in: Proceedings of the 19th International
Conference on Principles of Distributed Systems (OPODIS), 2015.'
date_created: 2017-10-17T12:41:39Z
date_updated: 2022-01-06T06:56:07Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.4230/LIPIcs.OPODIS.2015.24
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T10:28:21Z
date_updated: 2018-03-21T10:28:21Z
file_id: '1497'
file_name: 241-ScheidelerSetzerStrothmann2015.pdf
file_size: 692363
relation: main_file
success: 1
file_date_updated: 2018-03-21T10:28:21Z
has_accepted_license: '1'
language:
- iso: eng
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 19th International Conference on Principles of Distributed
Systems (OPODIS)
series_title: Leibniz International Proceedings in Informatics (LIPIcs)
status: public
title: Towards Establishing Monotonic Searchability in Self-Stabilizing Data Structures
type: conference
user_id: '477'
year: '2015'
...
---
_id: '242'
abstract:
- lang: eng
text: 'A fundamental problem for overlay networks is to safely exclude leaving nodes,
i.e., the nodes requesting to leave the overlay network are excluded from it without
affecting its connectivity. There are a number of studies for safe node exclusion
if the overlay is in a well-defined state, but almost no formal results are known
for the case in which the overlay network is in an arbitrary initial state, i.e.,
when looking for a self-stabilizing solution for excluding leaving nodes. We study
this problem in two variants: the Finite Departure Problem (FDP) and the Finite
Sleep Problem (FSP). In the FDP the leaving nodes have to irrevocably decide when
it is safe to leave the network, whereas in the FSP, this leaving decision does
not have to be final: the nodes may resume computation when woken up by an incoming
message. We are the first to present a self-stabilizing protocol for the FDP and
the FSP that can be combined with a large class of overlay maintenance protocols
so that these are then guaranteed to safely exclude leaving nodes from the system
from any initial state while operating as specified for the staying nodes. In
order to formally define the properties these overlay maintenance protocols have
to satisfy, we identify four basic primitives for manipulating edges in an overlay
network that might be of independent interest.'
author:
- first_name: Andreas
full_name: Koutsopoulos, Andreas
last_name: Koutsopoulos
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Thim Frederik
full_name: Strothmann, Thim Frederik
id: '11319'
last_name: Strothmann
citation:
ama: 'Koutsopoulos A, Scheideler C, Strothmann TF. Towards a Universal Approach
for the Finite Departure Problem in Overlay Networks. In: Proceedings of the
17th International Symposium on Stabilization, Safety, and Security of Distributed
Systems (SSS). Lecture Notes in Computer Science. ; 2015:201-216. doi:10.1007/978-3-319-21741-3_14'
apa: Koutsopoulos, A., Scheideler, C., & Strothmann, T. F. (2015). Towards a
Universal Approach for the Finite Departure Problem in Overlay Networks. In Proceedings
of the 17th International Symposium on Stabilization, Safety, and Security of
Distributed Systems (SSS) (pp. 201–216). https://doi.org/10.1007/978-3-319-21741-3_14
bibtex: '@inproceedings{Koutsopoulos_Scheideler_Strothmann_2015, series={Lecture
Notes in Computer Science}, title={Towards a Universal Approach for the Finite
Departure Problem in Overlay Networks}, DOI={10.1007/978-3-319-21741-3_14},
booktitle={Proceedings of the 17th International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS)}, author={Koutsopoulos, Andreas and
Scheideler, Christian and Strothmann, Thim Frederik}, year={2015}, pages={201–216},
collection={Lecture Notes in Computer Science} }'
chicago: Koutsopoulos, Andreas, Christian Scheideler, and Thim Frederik Strothmann.
“Towards a Universal Approach for the Finite Departure Problem in Overlay Networks.”
In Proceedings of the 17th International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS), 201–16. Lecture Notes in Computer
Science, 2015. https://doi.org/10.1007/978-3-319-21741-3_14.
ieee: A. Koutsopoulos, C. Scheideler, and T. F. Strothmann, “Towards a Universal
Approach for the Finite Departure Problem in Overlay Networks,” in Proceedings
of the 17th International Symposium on Stabilization, Safety, and Security of
Distributed Systems (SSS), 2015, pp. 201–216.
mla: Koutsopoulos, Andreas, et al. “Towards a Universal Approach for the Finite
Departure Problem in Overlay Networks.” Proceedings of the 17th International
Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS),
2015, pp. 201–16, doi:10.1007/978-3-319-21741-3_14.
short: 'A. Koutsopoulos, C. Scheideler, T.F. Strothmann, in: Proceedings of the
17th International Symposium on Stabilization, Safety, and Security of Distributed
Systems (SSS), 2015, pp. 201–216.'
date_created: 2017-10-17T12:41:39Z
date_updated: 2022-01-06T06:56:10Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/978-3-319-21741-3_14
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:59:32Z
date_updated: 2018-03-21T09:59:32Z
file_id: '1496'
file_name: 242-KSS-SSS2015.pdf
file_size: 532792
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:59:32Z
has_accepted_license: '1'
language:
- iso: eng
page: 201-216
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 Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS)
series_title: Lecture Notes in Computer Science
status: public
title: Towards a Universal Approach for the Finite Departure Problem in Overlay Networks
type: conference
user_id: '477'
year: '2015'
...
---
_id: '243'
abstract:
- lang: eng
text: This paper introduces the problem of communication pattern adaption for a
distributed self-adjusting binary search tree. We propose a simple local algorithm,
which is closely related to the nearly thirty-year-old idea of splay trees and
evaluate its adaption performance in the distributed scenario if different communication
patterns are provided.To do so, the process of self-adjustment is modeled similarly
to a basic network creation game, in which the nodes want to communicate with
only a certain subset of all nodes. We show that, in general, the game (i.e.,
the process of local adjustments) does not converge, and convergence is related
to certain structures of the communication interests, which we call conflicts.We
classify conflicts and show that for two communication scenarios in which convergence
is guaranteed, the self-adjusting tree performs well.Furthermore, we investigate
the different classes of conflicts separately and show that, for a certain class
of conflicts, the performance of the tree network is asymptotically as good as
the performance for converging instances. However, for the other conflict classes,
a distributed self-adjusting binary search tree adapts poorly.
author:
- first_name: Thim Frederik
full_name: Strothmann, Thim Frederik
id: '11319'
last_name: Strothmann
citation:
ama: 'Strothmann TF. The impact of communication patterns on distributed locally
self-adjusting binary search trees. In: Proceedings of the 9th International
Workshop on Algorithms and Computation (WALCOM). LNCS. ; 2015:175--186. doi:10.1007/978-3-319-15612-5_16'
apa: Strothmann, T. F. (2015). The impact of communication patterns on distributed
locally self-adjusting binary search trees. In Proceedings of the 9th International
Workshop on Algorithms and Computation (WALCOM) (pp. 175--186). https://doi.org/10.1007/978-3-319-15612-5_16
bibtex: '@inproceedings{Strothmann_2015, series={LNCS}, title={The impact of communication
patterns on distributed locally self-adjusting binary search trees}, DOI={10.1007/978-3-319-15612-5_16},
booktitle={Proceedings of the 9th International Workshop on Algorithms and Computation
(WALCOM)}, author={Strothmann, Thim Frederik}, year={2015}, pages={175--186},
collection={LNCS} }'
chicago: Strothmann, Thim Frederik. “The Impact of Communication Patterns on Distributed
Locally Self-Adjusting Binary Search Trees.” In Proceedings of the 9th International
Workshop on Algorithms and Computation (WALCOM), 175--186. LNCS, 2015. https://doi.org/10.1007/978-3-319-15612-5_16.
ieee: T. F. Strothmann, “The impact of communication patterns on distributed locally
self-adjusting binary search trees,” in Proceedings of the 9th International
Workshop on Algorithms and Computation (WALCOM), 2015, pp. 175--186.
mla: Strothmann, Thim Frederik. “The Impact of Communication Patterns on Distributed
Locally Self-Adjusting Binary Search Trees.” Proceedings of the 9th International
Workshop on Algorithms and Computation (WALCOM), 2015, pp. 175--186, doi:10.1007/978-3-319-15612-5_16.
short: 'T.F. Strothmann, in: Proceedings of the 9th International Workshop on Algorithms
and Computation (WALCOM), 2015, pp. 175--186.'
date_created: 2017-10-17T12:41:39Z
date_updated: 2022-01-06T06:56:17Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/978-3-319-15612-5_16
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:59:00Z
date_updated: 2018-03-21T09:59:00Z
file_id: '1495'
file_name: 243-Strothmann-Walcom2015.pdf
file_size: 1003113
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:59:00Z
has_accepted_license: '1'
language:
- iso: eng
page: 175--186
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 9th International Workshop on Algorithms and Computation
(WALCOM)
series_title: LNCS
status: public
title: The impact of communication patterns on distributed locally self-adjusting
binary search trees
type: conference
user_id: '477'
year: '2015'
...
---
_id: '244'
abstract:
- lang: eng
text: We revisit the simple class of weighted congestion games on parallel links
[10], where each player has a non-negative weight and her cost on the link she
chooses is the sum of the weights of all players choosing the link. We extend
this class to mix-weighted congestion games on parallel links, where weights may
as well be negative. For the resulting simple class, we study the complexity of
deciding the existence of a pure equilibrium, where no player could unilaterally
improve her cost by switching to another link.We show that even for a singlenegative
weight, this decision problem is strongly NP-complete when the number of links
is part of the input; the problem is NP-complete already for two links. When the
number of links is a fixed constant, we show, through a pseudopolynomial, dynamic
programming algorithm, that the problem is not strongly NP-complete unless P =
NP; the algorithm works for any number of negative weights.
author:
- first_name: Burkhard
full_name: Monien, Burkhard
last_name: Monien
- first_name: Marios
full_name: Mavronicolas, Marios
last_name: Mavronicolas
citation:
ama: Monien B, Mavronicolas M. The complexity of pure equilibria in mix-weighted
congestion games on parallel links. Information Processing Letters. 2015;115(12):927-931.
doi:10.1016/j.ipl.2015.07.012
apa: Monien, B., & Mavronicolas, M. (2015). The complexity of pure equilibria
in mix-weighted congestion games on parallel links. Information Processing
Letters, 115(12), 927–931. https://doi.org/10.1016/j.ipl.2015.07.012
bibtex: '@article{Monien_Mavronicolas_2015, title={The complexity of pure equilibria
in mix-weighted congestion games on parallel links}, volume={115}, DOI={10.1016/j.ipl.2015.07.012},
number={12}, journal={Information Processing Letters}, publisher={Elsevier}, author={Monien,
Burkhard and Mavronicolas, Marios}, year={2015}, pages={927–931} }'
chicago: 'Monien, Burkhard, and Marios Mavronicolas. “The Complexity of Pure Equilibria
in Mix-Weighted Congestion Games on Parallel Links.” Information Processing
Letters 115, no. 12 (2015): 927–31. https://doi.org/10.1016/j.ipl.2015.07.012.'
ieee: B. Monien and M. Mavronicolas, “The complexity of pure equilibria in mix-weighted
congestion games on parallel links,” Information Processing Letters, vol.
115, no. 12, pp. 927–931, 2015.
mla: Monien, Burkhard, and Marios Mavronicolas. “The Complexity of Pure Equilibria
in Mix-Weighted Congestion Games on Parallel Links.” Information Processing
Letters, vol. 115, no. 12, Elsevier, 2015, pp. 927–31, doi:10.1016/j.ipl.2015.07.012.
short: B. Monien, M. Mavronicolas, Information Processing Letters 115 (2015) 927–931.
date_created: 2017-10-17T12:41:39Z
date_updated: 2022-01-06T06:56:20Z
ddc:
- '040'
doi: 10.1016/j.ipl.2015.07.012
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:48:16Z
date_updated: 2018-03-21T09:48:16Z
file_id: '1494'
file_name: 244-Mavronic_Monien2015_01.pdf
file_size: 239984
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:48:16Z
has_accepted_license: '1'
intvolume: ' 115'
issue: '12'
language:
- iso: eng
main_file_link:
- url: http://www.sciencedirect.com/journal/information-processing-letters/vol/115/issue/12
page: 927-931
project:
- _id: '1'
name: SFB 901
- _id: '7'
name: SFB 901 - Subprojekt A3
- _id: '2'
name: SFB 901 - Project Area A
publication: Information Processing Letters
publisher: Elsevier
status: public
title: The complexity of pure equilibria in mix-weighted congestion games on parallel
links
type: journal_article
user_id: '42447'
volume: 115
year: '2015'
...
---
_id: '245'
abstract:
- lang: eng
text: In cloud computing, software architects develop systems for virtually unlimited
resources that cloud providers account on a pay-per-use basis. Elasticity management
systems provision these resources autonomously to deal with changing workload.
Such changing workloads call for new objective metrics allowing architects to
quantify quality properties like scalability, elasticity, and efficiency, e.g.,
for requirements/SLO engineering and software design analysis. In literature,
initial metrics for these properties have been proposed. However, current metrics
lack a systematic derivation and assume knowledge of implementation details like
resource handling. Therefore, these metrics are inapplicable where such knowledge
is unavailable.To cope with these lacks, this short paper derives metrics for
scalability, elasticity, and efficiency properties of cloud computing systems
using the goal question metric (GQM) method. Our derivation uses a running example
that outlines characteristics of cloud computing systems. Eventually, this example
allows us to set up a systematic GQM plan and to derive an initial set of six
new metrics. We particularly show that our GQM plan allows to classify existing
metrics.
author:
- first_name: Matthias
full_name: Becker, Matthias
last_name: Becker
- first_name: Sebastian
full_name: Lehrig, Sebastian
last_name: Lehrig
- first_name: Steffen
full_name: Becker, Steffen
last_name: Becker
citation:
ama: 'Becker M, Lehrig S, Becker S. Systematically Deriving Quality Metrics for
Cloud Computing Systems. In: Proceedings of the 6th ACM/SPEC International
Conference on Performance Engineering. ICPE ’15. New York, NY, USA; 2015:169--174.
doi:10.1145/2668930.2688043'
apa: Becker, M., Lehrig, S., & Becker, S. (2015). Systematically Deriving Quality
Metrics for Cloud Computing Systems. In Proceedings of the 6th ACM/SPEC International
Conference on Performance Engineering (pp. 169--174). New York, NY, USA. https://doi.org/10.1145/2668930.2688043
bibtex: '@inproceedings{Becker_Lehrig_Becker_2015, place={New York, NY, USA}, series={ICPE
’15}, title={Systematically Deriving Quality Metrics for Cloud Computing Systems},
DOI={10.1145/2668930.2688043},
booktitle={Proceedings of the 6th ACM/SPEC International Conference on Performance
Engineering}, author={Becker, Matthias and Lehrig, Sebastian and Becker, Steffen},
year={2015}, pages={169--174}, collection={ICPE ’15} }'
chicago: Becker, Matthias, Sebastian Lehrig, and Steffen Becker. “Systematically
Deriving Quality Metrics for Cloud Computing Systems.” In Proceedings of the
6th ACM/SPEC International Conference on Performance Engineering, 169--174.
ICPE ’15. New York, NY, USA, 2015. https://doi.org/10.1145/2668930.2688043.
ieee: M. Becker, S. Lehrig, and S. Becker, “Systematically Deriving Quality Metrics
for Cloud Computing Systems,” in Proceedings of the 6th ACM/SPEC International
Conference on Performance Engineering, 2015, pp. 169--174.
mla: Becker, Matthias, et al. “Systematically Deriving Quality Metrics for Cloud
Computing Systems.” Proceedings of the 6th ACM/SPEC International Conference
on Performance Engineering, 2015, pp. 169--174, doi:10.1145/2668930.2688043.
short: 'M. Becker, S. Lehrig, S. Becker, in: Proceedings of the 6th ACM/SPEC International
Conference on Performance Engineering, New York, NY, USA, 2015, pp. 169--174.'
date_created: 2017-10-17T12:41:39Z
date_updated: 2022-01-06T06:56:26Z
ddc:
- '040'
doi: 10.1145/2668930.2688043
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:47:47Z
date_updated: 2018-03-21T09:47:47Z
file_id: '1493'
file_name: 245-paper_02.pdf
file_size: 462675
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:47:47Z
has_accepted_license: '1'
language:
- iso: eng
page: 169--174
place: New York, NY, USA
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 ACM/SPEC International Conference on Performance
Engineering
series_title: ICPE '15
status: public
title: Systematically Deriving Quality Metrics for Cloud Computing Systems
type: conference
user_id: '477'
year: '2015'
...
---
_id: '246'
author:
- first_name: Galina
full_name: Besova, Galina
last_name: Besova
citation:
ama: Besova G. Systematic Development and Re-Use of Model Tranformations.
Universität Paderborn; 2015.
apa: Besova, G. (2015). Systematic Development and Re-Use of Model Tranformations.
Universität Paderborn.
bibtex: '@book{Besova_2015, title={Systematic Development and Re-Use of Model Tranformations},
publisher={Universität Paderborn}, author={Besova, Galina}, year={2015} }'
chicago: Besova, Galina. Systematic Development and Re-Use of Model Tranformations.
Universität Paderborn, 2015.
ieee: G. Besova, Systematic Development and Re-Use of Model Tranformations.
Universität Paderborn, 2015.
mla: Besova, Galina. Systematic Development and Re-Use of Model Tranformations.
Universität Paderborn, 2015.
short: G. Besova, Systematic Development and Re-Use of Model Tranformations, Universität
Paderborn, 2015.
date_created: 2017-10-17T12:41:40Z
date_updated: 2022-01-06T06:56:30Z
ddc:
- '040'
department:
- _id: '77'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:47:14Z
date_updated: 2018-03-21T09:47:14Z
file_id: '1492'
file_name: 246-Dissertation_-_Besova.pdf
file_size: 10091866
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:47:14Z
has_accepted_license: '1'
project:
- _id: '1'
name: SFB 901
- _id: '11'
name: SFB 901 - Subprojekt B3
- _id: '3'
name: SFB 901 - Project Area B
publisher: Universität Paderborn
related_material:
link:
- relation: confirmation
url: http://digital.ub.uni-paderborn.de/hsx/content/titleinfo/1705899
status: public
supervisor:
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
title: Systematic Development and Re-Use of Model Tranformations
type: dissertation
user_id: '477'
year: '2015'
...
---
_id: '247'
abstract:
- lang: eng
text: 'Multi-rooted trees are becoming the norm for modern data-center networks.
In these networks, scalable flow routing is challenging owing to vast number of
flows. Current approaches either employ a central controller that can have scalability
issues or a scalable decentralized algorithm only considering local information.
In this paper we present a new decentralized approach to least-congested path
routing in software-defined data center networks that has neither of these issues:
By duplicating the initial (or SYN) packet of a flow and estimating the data rate
of multiple flows in parallel, we exploit TCP’s habit to fill buffers to find
the least congested path. We show that our algorithm significantly improves flow
completion time without the need for a central controller or specialized hardware.'
author:
- first_name: Arne
full_name: Schwabe, Arne
last_name: Schwabe
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: 'Schwabe A, Karl H. SynRace: Decentralized Load-Adaptive Multi-path Routing
without Collecting Statistics. In: Proceedings of the 4th European Workshop
on Software Defined Networks (EWSDN 2015). ; 2015:37-42. doi:10.1109/EWSDN.2015.58'
apa: 'Schwabe, A., & Karl, H. (2015). SynRace: Decentralized Load-Adaptive Multi-path
Routing without Collecting Statistics. In Proceedings of the 4th European Workshop
on Software Defined Networks (EWSDN 2015) (pp. 37–42). https://doi.org/10.1109/EWSDN.2015.58'
bibtex: '@inproceedings{Schwabe_Karl_2015, title={SynRace: Decentralized Load-Adaptive
Multi-path Routing without Collecting Statistics}, DOI={10.1109/EWSDN.2015.58},
booktitle={Proceedings of the 4th European Workshop on Software Defined Networks
(EWSDN 2015)}, author={Schwabe, Arne and Karl, Holger}, year={2015}, pages={37–42}
}'
chicago: 'Schwabe, Arne, and Holger Karl. “SynRace: Decentralized Load-Adaptive
Multi-Path Routing without Collecting Statistics.” In Proceedings of the 4th
European Workshop on Software Defined Networks (EWSDN 2015), 37–42, 2015.
https://doi.org/10.1109/EWSDN.2015.58.'
ieee: 'A. Schwabe and H. Karl, “SynRace: Decentralized Load-Adaptive Multi-path
Routing without Collecting Statistics,” in Proceedings of the 4th European
Workshop on Software Defined Networks (EWSDN 2015), 2015, pp. 37–42.'
mla: 'Schwabe, Arne, and Holger Karl. “SynRace: Decentralized Load-Adaptive Multi-Path
Routing without Collecting Statistics.” Proceedings of the 4th European Workshop
on Software Defined Networks (EWSDN 2015), 2015, pp. 37–42, doi:10.1109/EWSDN.2015.58.'
short: 'A. Schwabe, H. Karl, in: Proceedings of the 4th European Workshop on Software
Defined Networks (EWSDN 2015), 2015, pp. 37–42.'
date_created: 2017-10-17T12:41:40Z
date_updated: 2022-01-06T06:56:32Z
ddc:
- '040'
department:
- _id: '75'
doi: 10.1109/EWSDN.2015.58
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:46:21Z
date_updated: 2018-03-21T09:46:21Z
file_id: '1491'
file_name: 247-07313613.pdf
file_size: 277574
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:46:21Z
has_accepted_license: '1'
page: 37-42
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 4th European Workshop on Software Defined Networks
(EWSDN 2015)
status: public
title: 'SynRace: Decentralized Load-Adaptive Multi-path Routing without Collecting
Statistics'
type: conference
user_id: '15504'
year: '2015'
...
---
_id: '258'
author:
- first_name: Melissa
full_name: Sonntag, Melissa
last_name: Sonntag
citation:
ama: Sonntag M. Reputation und Vertrauen auf Online-Märkten. Universität
Paderborn; 2015.
apa: Sonntag, M. (2015). Reputation und Vertrauen auf Online-Märkten. Universität
Paderborn.
bibtex: '@book{Sonntag_2015, title={Reputation und Vertrauen auf Online-Märkten},
publisher={Universität Paderborn}, author={Sonntag, Melissa}, year={2015} }'
chicago: Sonntag, Melissa. Reputation und Vertrauen auf Online-Märkten. Universität
Paderborn, 2015.
ieee: M. Sonntag, Reputation und Vertrauen auf Online-Märkten. Universität
Paderborn, 2015.
mla: Sonntag, Melissa. Reputation und Vertrauen auf Online-Märkten. Universität
Paderborn, 2015.
short: M. Sonntag, Reputation und Vertrauen auf Online-Märkten, Universität Paderborn,
2015.
date_created: 2017-10-17T12:41:42Z
date_updated: 2022-01-06T06:57:12Z
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '8'
name: SFB 901 - Subprojekt A4
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: Reputation und Vertrauen auf Online-Märkten
type: bachelorsthesis
user_id: '477'
year: '2015'
...
---
_id: '259'
author:
- first_name: Dominik
full_name: Gutt, Dominik
id: '14368'
last_name: Gutt
- first_name: Dennis
full_name: Kundisch, Dennis
id: '21117'
last_name: Kundisch
citation:
ama: 'Gutt D, Kundisch D. Rating Aggregation in Multi-Dimensional Rating Systems:
How Do Reviewers Form Overall Ratings? In: INFORMS Annual Meeting. ; 2015.'
apa: 'Gutt, D., & Kundisch, D. (2015). Rating Aggregation in Multi-Dimensional
Rating Systems: How Do Reviewers Form Overall Ratings? In INFORMS Annual Meeting.
Philadelphia, USA.'
bibtex: '@inproceedings{Gutt_Kundisch_2015, title={Rating Aggregation in Multi-Dimensional
Rating Systems: How Do Reviewers Form Overall Ratings?}, booktitle={INFORMS Annual
Meeting}, author={Gutt, Dominik and Kundisch, Dennis}, year={2015} }'
chicago: 'Gutt, Dominik, and Dennis Kundisch. “Rating Aggregation in Multi-Dimensional
Rating Systems: How Do Reviewers Form Overall Ratings?” In INFORMS Annual Meeting,
2015.'
ieee: 'D. Gutt and D. Kundisch, “Rating Aggregation in Multi-Dimensional Rating
Systems: How Do Reviewers Form Overall Ratings?,” in INFORMS Annual Meeting,
Philadelphia, USA, 2015.'
mla: 'Gutt, Dominik, and Dennis Kundisch. “Rating Aggregation in Multi-Dimensional
Rating Systems: How Do Reviewers Form Overall Ratings?” INFORMS Annual Meeting,
2015.'
short: 'D. Gutt, D. Kundisch, in: INFORMS Annual Meeting, 2015.'
conference:
location: Philadelphia, USA
name: INFORMS Annual Meeting
date_created: 2017-10-17T12:41:42Z
date_updated: 2022-01-06T06:57:13Z
ddc:
- '330'
department:
- _id: '276'
file:
- access_level: closed
content_type: application/pdf
creator: d0mi
date_created: 2019-01-18T14:11:39Z
date_updated: 2019-01-18T14:11:39Z
file_id: '6862'
file_name: Informs_annual_meeting_2015.pdf
file_size: 89877
relation: main_file
success: 1
file_date_updated: 2019-01-18T14:11:39Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '8'
name: SFB 901 - Subprojekt A4
- _id: '2'
name: SFB 901 - Project Area A
publication: INFORMS Annual Meeting
status: public
title: 'Rating Aggregation in Multi-Dimensional Rating Systems: How Do Reviewers Form
Overall Ratings?'
type: conference_abstract
user_id: '477'
year: '2015'
...
---
_id: '260'
abstract:
- lang: eng
text: During the last decade, researchers have proposed a number of model transformations
enabling performance predictions. These transformations map performance-annotated
software architecture models into stochastic models solved by analytical means
or by simulation. However, so far, a detailed quantitative evaluation of the accuracy
and efficiency of different transformations is missing, making it hard to select
an adequate transformation for a given context. This paper provides an in-depth
comparison and quantitative evaluation of representative model transformations
to, e.g., Queueing Petri Nets and Layered Queueing Networks. The semantic gaps
between typical source model abstractions and the different analysis techniques
are revealed. The accuracy and efficiency of each transformation are evaluated
by considering four case studies representing systems of different size and complexity.
The presented results and insights gained from the evaluation help software architects
and performance engineers to select the appropriate transformation for a given
context, thus significantly improving the usability of model transformations for
performance prediction.
author:
- first_name: Fabian
full_name: Brosig, Fabian
last_name: Brosig
- first_name: Philipp
full_name: Meier, Philipp
last_name: Meier
- first_name: Steffen
full_name: Becker, Steffen
last_name: Becker
- first_name: Anne
full_name: Koziolek, Anne
last_name: Koziolek
- first_name: Heiko
full_name: Koziolek, Heiko
last_name: Koziolek
- first_name: Samuel
full_name: Kounev, Samuel
last_name: Kounev
citation:
ama: Brosig F, Meier P, Becker S, Koziolek A, Koziolek H, Kounev S. Quantitative
Evaluation of Model-Driven Performance Analysis and Simulation of Component-based
Architectures. Transactions on Software Engineering. 2015;(2):157--175.
doi:10.1109/TSE.2014.2362755
apa: Brosig, F., Meier, P., Becker, S., Koziolek, A., Koziolek, H., & Kounev,
S. (2015). Quantitative Evaluation of Model-Driven Performance Analysis and Simulation
of Component-based Architectures. Transactions on Software Engineering,
(2), 157--175. https://doi.org/10.1109/TSE.2014.2362755
bibtex: '@article{Brosig_Meier_Becker_Koziolek_Koziolek_Kounev_2015, title={Quantitative
Evaluation of Model-Driven Performance Analysis and Simulation of Component-based
Architectures}, DOI={10.1109/TSE.2014.2362755},
number={2}, journal={Transactions on Software Engineering}, publisher={IEEE},
author={Brosig, Fabian and Meier, Philipp and Becker, Steffen and Koziolek, Anne
and Koziolek, Heiko and Kounev, Samuel}, year={2015}, pages={157--175} }'
chicago: 'Brosig, Fabian, Philipp Meier, Steffen Becker, Anne Koziolek, Heiko Koziolek,
and Samuel Kounev. “Quantitative Evaluation of Model-Driven Performance Analysis
and Simulation of Component-Based Architectures.” Transactions on Software
Engineering, no. 2 (2015): 157--175. https://doi.org/10.1109/TSE.2014.2362755.'
ieee: F. Brosig, P. Meier, S. Becker, A. Koziolek, H. Koziolek, and S. Kounev, “Quantitative
Evaluation of Model-Driven Performance Analysis and Simulation of Component-based
Architectures,” Transactions on Software Engineering, no. 2, pp. 157--175,
2015.
mla: Brosig, Fabian, et al. “Quantitative Evaluation of Model-Driven Performance
Analysis and Simulation of Component-Based Architectures.” Transactions on
Software Engineering, no. 2, IEEE, 2015, pp. 157--175, doi:10.1109/TSE.2014.2362755.
short: F. Brosig, P. Meier, S. Becker, A. Koziolek, H. Koziolek, S. Kounev, Transactions
on Software Engineering (2015) 157--175.
date_created: 2017-10-17T12:41:42Z
date_updated: 2022-01-06T06:57:15Z
ddc:
- '040'
doi: 10.1109/TSE.2014.2362755
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:38:42Z
date_updated: 2018-03-21T09:38:42Z
file_id: '1484'
file_name: 260-TSE_Journal-1.pdf
file_size: 1973471
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:38:42Z
has_accepted_license: '1'
issue: '2'
page: 157--175
project:
- _id: '1'
name: SFB 901
- _id: '11'
name: SFB 901 - Subprojekt B3
- _id: '3'
name: SFB 901 - Project Area B
publication: Transactions on Software Engineering
publisher: IEEE
status: public
title: Quantitative Evaluation of Model-Driven Performance Analysis and Simulation
of Component-based Architectures
type: journal_article
user_id: '477'
year: '2015'
...
---
_id: '261'
author:
- first_name: Thorsten
full_name: Eisenhofer, Thorsten
last_name: Eisenhofer
citation:
ama: Eisenhofer T. Protokolle zur authentifizierten Schüsselvereinbarung.
Universität Paderborn; 2015.
apa: Eisenhofer, T. (2015). Protokolle zur authentifizierten Schüsselvereinbarung.
Universität Paderborn.
bibtex: '@book{Eisenhofer_2015, title={Protokolle zur authentifizierten Schüsselvereinbarung},
publisher={Universität Paderborn}, author={Eisenhofer, Thorsten}, year={2015}
}'
chicago: Eisenhofer, Thorsten. Protokolle zur authentifizierten Schüsselvereinbarung.
Universität Paderborn, 2015.
ieee: T. Eisenhofer, Protokolle zur authentifizierten Schüsselvereinbarung.
Universität Paderborn, 2015.
mla: Eisenhofer, Thorsten. Protokolle zur authentifizierten Schüsselvereinbarung.
Universität Paderborn, 2015.
short: T. Eisenhofer, Protokolle zur authentifizierten Schüsselvereinbarung, Universität
Paderborn, 2015.
date_created: 2017-10-17T12:41:43Z
date_updated: 2022-01-06T06:57:16Z
department:
- _id: '64'
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
title: Protokolle zur authentifizierten Schüsselvereinbarung
type: bachelorsthesis
user_id: '477'
year: '2015'
...
---
_id: '262'
abstract:
- lang: eng
text: Programs from Proofs" is a generic method which generates new programs out
of correctness proofs of given programs. The technique ensures that the new and
given program are behaviorally equivalent and that the new program is easily verifiable,
thus serving as an alternative to proof-carrying code concepts. So far, this generic
method has one instantiation that verifies type-state properties of programs.
In this paper, we present a whole range of new instantiations, all based on data
ow analyses. More precisely, we show how an imprecise but fast data ow analysis
can be enhanced with a predicate analysis as to yield a precise but expensive
analysis. Out of the safety proofs of this analysis, we generate new programs,
again behaviorally equivalent to the given ones, which are easily verifiable"
in the sense that now the data ow analysis alone can yield precise results. An
experimental evaluation practically supports our claim of easy verification.
author:
- first_name: Marie-Christine
full_name: Jakobs, Marie-Christine
last_name: Jakobs
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Jakobs M-C, Wehrheim H. Programs from Proofs of Predicated Dataflow Analyses.
In: Proceedings of the 30th Annual ACM Symposium on Applied Computing.
SAC ’15. ; 2015:1729-1736. doi:10.1145/2695664.2695690'
apa: Jakobs, M.-C., & Wehrheim, H. (2015). Programs from Proofs of Predicated
Dataflow Analyses. In Proceedings of the 30th Annual ACM Symposium on Applied
Computing (pp. 1729–1736). https://doi.org/10.1145/2695664.2695690
bibtex: '@inproceedings{Jakobs_Wehrheim_2015, series={SAC ’15}, title={Programs
from Proofs of Predicated Dataflow Analyses}, DOI={10.1145/2695664.2695690},
booktitle={Proceedings of the 30th Annual ACM Symposium on Applied Computing},
author={Jakobs, Marie-Christine and Wehrheim, Heike}, year={2015}, pages={1729–1736},
collection={SAC ’15} }'
chicago: Jakobs, Marie-Christine, and Heike Wehrheim. “Programs from Proofs of Predicated
Dataflow Analyses.” In Proceedings of the 30th Annual ACM Symposium on Applied
Computing, 1729–36. SAC ’15, 2015. https://doi.org/10.1145/2695664.2695690.
ieee: M.-C. Jakobs and H. Wehrheim, “Programs from Proofs of Predicated Dataflow
Analyses,” in Proceedings of the 30th Annual ACM Symposium on Applied Computing,
2015, pp. 1729–1736.
mla: Jakobs, Marie-Christine, and Heike Wehrheim. “Programs from Proofs of Predicated
Dataflow Analyses.” Proceedings of the 30th Annual ACM Symposium on Applied
Computing, 2015, pp. 1729–36, doi:10.1145/2695664.2695690.
short: 'M.-C. Jakobs, H. Wehrheim, in: Proceedings of the 30th Annual ACM Symposium
on Applied Computing, 2015, pp. 1729–1736.'
date_created: 2017-10-17T12:41:43Z
date_updated: 2022-01-06T06:57:18Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1145/2695664.2695690
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:35:34Z
date_updated: 2018-03-21T09:35:34Z
file_id: '1483'
file_name: 262-mainSACfinal.pdf
file_size: 554583
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:35:34Z
has_accepted_license: '1'
language:
- iso: eng
page: 1729-1736
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 30th Annual ACM Symposium on Applied Computing
series_title: SAC '15
status: public
title: Programs from Proofs of Predicated Dataflow Analyses
type: conference
user_id: '477'
year: '2015'
...
---
_id: '263'
abstract:
- lang: eng
text: In the last two decades, water consumption in Germany has been decreasing,
which causes the water tanks and pipes in water distribution systems to work inefficiently.
This paper proposes a method that supports the planning process for tanks in water
distribution systems. The method uses a combination of network reduction, mathematical
optimization and hydraulic simulation. The mathematical optimization model is
a non-convex Mixed Integer Quadratically Constrained Program (MIQCP) that is solved
by a piecewise linearization. As this may lead to many binary variables and therefore
high computing times, the size of the water distribution system model is reduced
before building the optimization model. After applying several network reduction
techniques and using a piecewise approximation of the original model, there may
be some hydraulic differences between the original network model and the reduced
network model. To make sure that the solution obtained in the optimization process
is feasible in the original water distribution system model, the solution is verified
by a hydraulic simulation. If the solution is not feasible, the reduced model
has to be modified and solved again until the hydraulic simulation verifies a
solution as feasible. In this paper, each of these processes is described and
the results indicate the usefulness of each of them.
author:
- first_name: Corinna
full_name: Hallmann, Corinna
last_name: Hallmann
- first_name: Leena
full_name: Suhl, Leena
last_name: Suhl
citation:
ama: Hallmann C, Suhl L. Optimizing Water Tanks in Water Distribution Systems by
combining Network Reduction, Mathematical Optimization and Hydraulic Simulation.
OR Spectrum. 2015:1-19. doi:10.1007/s00291-015-0403-1
apa: Hallmann, C., & Suhl, L. (2015). Optimizing Water Tanks in Water Distribution
Systems by combining Network Reduction, Mathematical Optimization and Hydraulic
Simulation. OR Spectrum, 1–19. https://doi.org/10.1007/s00291-015-0403-1
bibtex: '@article{Hallmann_Suhl_2015, title={Optimizing Water Tanks in Water Distribution
Systems by combining Network Reduction, Mathematical Optimization and Hydraulic
Simulation}, DOI={10.1007/s00291-015-0403-1},
journal={OR Spectrum}, publisher={Springer}, author={Hallmann, Corinna and Suhl,
Leena}, year={2015}, pages={1–19} }'
chicago: Hallmann, Corinna, and Leena Suhl. “Optimizing Water Tanks in Water Distribution
Systems by Combining Network Reduction, Mathematical Optimization and Hydraulic
Simulation.” OR Spectrum, 2015, 1–19. https://doi.org/10.1007/s00291-015-0403-1.
ieee: C. Hallmann and L. Suhl, “Optimizing Water Tanks in Water Distribution Systems
by combining Network Reduction, Mathematical Optimization and Hydraulic Simulation,”
OR Spectrum, pp. 1–19, 2015.
mla: Hallmann, Corinna, and Leena Suhl. “Optimizing Water Tanks in Water Distribution
Systems by Combining Network Reduction, Mathematical Optimization and Hydraulic
Simulation.” OR Spectrum, Springer, 2015, pp. 1–19, doi:10.1007/s00291-015-0403-1.
short: C. Hallmann, L. Suhl, OR Spectrum (2015) 1–19.
date_created: 2017-10-17T12:41:43Z
date_updated: 2022-01-06T06:57:19Z
ddc:
- '040'
doi: 10.1007/s00291-015-0403-1
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:35:03Z
date_updated: 2018-03-21T09:35:03Z
file_id: '1482'
file_name: 263-Hallmann_-_Optimizing_water_tanks_in_water_distribution_systems.pdf
file_size: 430920
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:35:03Z
has_accepted_license: '1'
page: 1-19
project:
- _id: '1'
name: SFB 901
- _id: '15'
name: SFB 901 - Subprojekt C3
- _id: '4'
name: SFB 901 - Project Area C
publication: OR Spectrum
publisher: Springer
status: public
title: Optimizing Water Tanks in Water Distribution Systems by combining Network Reduction,
Mathematical Optimization and Hydraulic Simulation
type: journal_article
user_id: '477'
year: '2015'
...
---
_id: '264'
author:
- first_name: Philip
full_name: Wette, Philip
last_name: Wette
citation:
ama: Wette P. Optimizing Software-Defined Networks Using Application-Layer Knowledge.
Universität Paderborn; 2015.
apa: Wette, P. (2015). Optimizing Software-Defined Networks using Application-Layer
Knowledge. Universität Paderborn.
bibtex: '@book{Wette_2015, title={Optimizing Software-Defined Networks using Application-Layer
Knowledge}, publisher={Universität Paderborn}, author={Wette, Philip}, year={2015}
}'
chicago: Wette, Philip. Optimizing Software-Defined Networks Using Application-Layer
Knowledge. Universität Paderborn, 2015.
ieee: P. Wette, Optimizing Software-Defined Networks using Application-Layer
Knowledge. Universität Paderborn, 2015.
mla: Wette, Philip. Optimizing Software-Defined Networks Using Application-Layer
Knowledge. Universität Paderborn, 2015.
short: P. Wette, Optimizing Software-Defined Networks Using Application-Layer Knowledge,
Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:43Z
date_updated: 2022-01-06T06:57:20Z
ddc:
- '040'
department:
- _id: '75'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:34:36Z
date_updated: 2018-03-21T09:34:36Z
file_id: '1481'
file_name: 264-Dissertation_-_Wette.pdf
file_size: 8031107
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:34:36Z
has_accepted_license: '1'
project:
- _id: '1'
name: SFB 901
- _id: '6'
name: SFB 901 - Subprojekt A2
- _id: '16'
name: SFB 901 - Subprojekt C4
- _id: '2'
name: SFB 901 - Project Area A
- _id: '4'
name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
title: Optimizing Software-Defined Networks using Application-Layer Knowledge
type: dissertation
user_id: '477'
year: '2015'
...
---
_id: '265'
author:
- first_name: Corinna
full_name: Hallmann, Corinna
last_name: Hallmann
citation:
ama: Hallmann C. Optimierung von Wasserbehältern in einem Wasserversorgungssystem
mittels einer Kombination aus Netzreduktion, mathematischer Optimierung und hydraulischer
Simulation. Universität Paderborn; 2015.
apa: Hallmann, C. (2015). Optimierung von Wasserbehältern in einem Wasserversorgungssystem
mittels einer Kombination aus Netzreduktion, mathematischer Optimierung und hydraulischer
Simulation. Universität Paderborn.
bibtex: '@book{Hallmann_2015, title={Optimierung von Wasserbehältern in einem Wasserversorgungssystem
mittels einer Kombination aus Netzreduktion, mathematischer Optimierung und hydraulischer
Simulation}, publisher={Universität Paderborn}, author={Hallmann, Corinna}, year={2015}
}'
chicago: Hallmann, Corinna. Optimierung von Wasserbehältern in einem Wasserversorgungssystem
mittels einer Kombination aus Netzreduktion, mathematischer Optimierung und hydraulischer
Simulation. Universität Paderborn, 2015.
ieee: C. Hallmann, Optimierung von Wasserbehältern in einem Wasserversorgungssystem
mittels einer Kombination aus Netzreduktion, mathematischer Optimierung und hydraulischer
Simulation. Universität Paderborn, 2015.
mla: Hallmann, Corinna. Optimierung von Wasserbehältern in einem Wasserversorgungssystem
mittels einer Kombination aus Netzreduktion, mathematischer Optimierung und hydraulischer
Simulation. Universität Paderborn, 2015.
short: C. Hallmann, Optimierung von Wasserbehältern in einem Wasserversorgungssystem
mittels einer Kombination aus Netzreduktion, mathematischer Optimierung und hydraulischer
Simulation, Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:43Z
date_updated: 2022-01-06T06:57:21Z
ddc:
- '040'
department:
- _id: '19'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:34:10Z
date_updated: 2018-03-21T09:34:10Z
file_id: '1480'
file_name: 265-Dissertation_-_Corinna_Hallmann.pdf
file_size: 2745774
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:34:10Z
has_accepted_license: '1'
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '15'
name: SFB 901 - Subprojekt C3
- _id: '4'
name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Lena
full_name: Suhl, Lena
last_name: Suhl
title: Optimierung von Wasserbehältern in einem Wasserversorgungssystem mittels einer
Kombination aus Netzreduktion, mathematischer Optimierung und hydraulischer Simulation
type: dissertation
user_id: '477'
year: '2015'
...
---
_id: '266'
abstract:
- lang: eng
text: 'Many markets have seen a shift from the idea of buying and moved to leasing
instead. Arguably, the latter has been the major catalyst for their success. Ten
years ago, research realized this shift and initiated the study of "online leasing
problems" by introducing leasing to online optimization problems. Resources required
to provide a service in an "online leasing problem" are no more bought but leased
for different durations. In this paper, we provide an overview of results that
contribute to the understanding of "online resource leasing problems". '
author:
- first_name: Christine
full_name: Markarian, Christine
id: '37612'
last_name: Markarian
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Markarian C, Meyer auf der Heide F. Online Resource Leasing. In: Proceedings
of the 2015 ACM Symposium on Principles of Distributed Computing (PODC). ;
2015:343-344. doi:10.1145/2767386.2767454'
apa: Markarian, C., & Meyer auf der Heide, F. (2015). Online Resource Leasing.
In Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing
(PODC) (pp. 343–344). https://doi.org/10.1145/2767386.2767454
bibtex: '@inproceedings{Markarian_Meyer auf der Heide_2015, title={Online Resource
Leasing}, DOI={10.1145/2767386.2767454},
booktitle={Proceedings of the 2015 ACM Symposium on Principles of Distributed
Computing (PODC)}, author={Markarian, Christine and Meyer auf der Heide, Friedhelm},
year={2015}, pages={343–344} }'
chicago: Markarian, Christine, and Friedhelm Meyer auf der Heide. “Online Resource
Leasing.” In Proceedings of the 2015 ACM Symposium on Principles of Distributed
Computing (PODC), 343–44, 2015. https://doi.org/10.1145/2767386.2767454.
ieee: C. Markarian and F. Meyer auf der Heide, “Online Resource Leasing,” in Proceedings
of the 2015 ACM Symposium on Principles of Distributed Computing (PODC), 2015,
pp. 343–344.
mla: Markarian, Christine, and Friedhelm Meyer auf der Heide. “Online Resource Leasing.”
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing
(PODC), 2015, pp. 343–44, doi:10.1145/2767386.2767454.
short: 'C. Markarian, F. Meyer auf der Heide, in: Proceedings of the 2015 ACM Symposium
on Principles of Distributed Computing (PODC), 2015, pp. 343–344.'
date_created: 2017-10-17T12:41:44Z
date_updated: 2022-01-06T06:57:22Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1145/2767386.2767454
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:33:11Z
date_updated: 2018-03-21T09:33:11Z
file_id: '1478'
file_name: 266-p343-markarian.pdf
file_size: 679580
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:33:11Z
has_accepted_license: '1'
page: 343-344
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '16'
name: SFB 901 - Subprojekt C4
- _id: '2'
name: SFB 901 - Project Area A
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing
(PODC)
status: public
title: Online Resource Leasing
type: conference
user_id: '15504'
year: '2015'
...
---
_id: '267'
author:
- first_name: Christine
full_name: Markarian, Christine
id: '37612'
last_name: Markarian
citation:
ama: Markarian C. Online Resource Leasing. Universität Paderborn; 2015.
apa: Markarian, C. (2015). Online Resource Leasing. Universität Paderborn.
bibtex: '@book{Markarian_2015, title={Online Resource Leasing}, publisher={Universität
Paderborn}, author={Markarian, Christine}, year={2015} }'
chicago: Markarian, Christine. Online Resource Leasing. Universität Paderborn,
2015.
ieee: C. Markarian, Online Resource Leasing. Universität Paderborn, 2015.
mla: Markarian, Christine. Online Resource Leasing. Universität Paderborn,
2015.
short: C. Markarian, Online Resource Leasing, Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:44Z
date_updated: 2022-01-06T06:57:26Z
ddc:
- '040'
department:
- _id: '63'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:33:41Z
date_updated: 2018-03-21T09:33:41Z
file_id: '1479'
file_name: 267-Dissertation_-_Markarian.pdf
file_size: 1328685
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:33:41Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '16'
name: SFB 901 - Subprojekt C4
- _id: '4'
name: SFB 901 - Project Area C
publisher: Universität Paderborn
related_material:
link:
- relation: confirmation
url: http://nbn-resolving.de/urn:nbn:de:hbz:466:2-16656
status: public
supervisor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
title: Online Resource Leasing
type: dissertation
user_id: '15415'
year: '2015'
...
---
_id: '268'
author:
- first_name: Alexander
full_name: Lange, Alexander
last_name: Lange
citation:
ama: Lange A. Online Bewertungssysteme – Ein systematischer Überblick. Universität
Paderborn; 2015.
apa: Lange, A. (2015). Online Bewertungssysteme – Ein systematischer Überblick.
Universität Paderborn.
bibtex: '@book{Lange_2015, title={Online Bewertungssysteme – Ein systematischer
Überblick}, publisher={Universität Paderborn}, author={Lange, Alexander}, year={2015}
}'
chicago: Lange, Alexander. Online Bewertungssysteme – Ein systematischer Überblick.
Universität Paderborn, 2015.
ieee: A. Lange, Online Bewertungssysteme – Ein systematischer Überblick.
Universität Paderborn, 2015.
mla: Lange, Alexander. Online Bewertungssysteme – Ein systematischer Überblick.
Universität Paderborn, 2015.
short: A. Lange, Online Bewertungssysteme – Ein systematischer Überblick, Universität
Paderborn, 2015.
date_created: 2017-10-17T12:41:44Z
date_updated: 2022-01-06T06:57:28Z
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '8'
name: SFB 901 - Subprojekt A4
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: Online Bewertungssysteme – Ein systematischer Überblick
type: bachelorsthesis
user_id: '477'
year: '2015'
...