---
_id: '280'
abstract:
- lang: eng
text: The Collaborative Research Centre "On-The-Fly Computing" works on foundations
and principles for the vision of the Future Internet. It proposes the paradigm
of On-The-Fly Computing, which tackles emerging worldwide service markets. In
these markets, service providers trade software, platform, and infrastructure
as a service. Service requesters state requirements on services. To satisfy these
requirements, the new role of brokers, who are (human) actors building service
compositions on the fly, is introduced. Brokers have to specify service compositions
formally and comprehensively using a domain-specific language (DSL), and to use
service matching for the discovery of the constituent services available in the
market. The broker's choice of the DSL and matching approaches influences her
success of building compositions as distinctive properties of different service
markets play a significant role. In this paper, we propose a new approach of engineering
a situation-specific DSL by customizing a comprehensive, modular DSL and its matching
for given service market properties. This enables the broker to create market-specific
composition specifications and to perform market-specific service matching. As
a result, the broker builds service compositions satisfying the requester's requirements
more accurately. We evaluated the presented concepts using case studies in service
markets for tourism and university management.
author:
- first_name: Svetlana
full_name: Arifulina, Svetlana
last_name: Arifulina
- first_name: Marie Christin
full_name: Platenius, Marie Christin
last_name: Platenius
- first_name: Felix
full_name: Mohr, Felix
last_name: Mohr
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
- first_name: Wilhelm
full_name: Schäfer, Wilhelm
last_name: Schäfer
citation:
ama: 'Arifulina S, Platenius MC, Mohr F, Engels G, Schäfer W. Market-Specific Service
Compositions: Specification and Matching. In: Proceedings of the IEEE 11th
World Congress on Services (SERVICES), Visionary Track: Service Composition for
the Future Internet. ; 2015:333--340. doi:10.1109/SERVICES.2015.58'
apa: 'Arifulina, S., Platenius, M. C., Mohr, F., Engels, G., & Schäfer, W. (2015).
Market-Specific Service Compositions: Specification and Matching. In Proceedings
of the IEEE 11th World Congress on Services (SERVICES), Visionary Track: Service
Composition for the Future Internet (pp. 333--340). https://doi.org/10.1109/SERVICES.2015.58'
bibtex: '@inproceedings{Arifulina_Platenius_Mohr_Engels_Schäfer_2015, title={Market-Specific
Service Compositions: Specification and Matching}, DOI={10.1109/SERVICES.2015.58},
booktitle={Proceedings of the IEEE 11th World Congress on Services (SERVICES),
Visionary Track: Service Composition for the Future Internet}, author={Arifulina,
Svetlana and Platenius, Marie Christin and Mohr, Felix and Engels, Gregor and
Schäfer, Wilhelm}, year={2015}, pages={333--340} }'
chicago: 'Arifulina, Svetlana, Marie Christin Platenius, Felix Mohr, Gregor Engels,
and Wilhelm Schäfer. “Market-Specific Service Compositions: Specification and
Matching.” In Proceedings of the IEEE 11th World Congress on Services (SERVICES),
Visionary Track: Service Composition for the Future Internet, 333--340, 2015.
https://doi.org/10.1109/SERVICES.2015.58.'
ieee: 'S. Arifulina, M. C. Platenius, F. Mohr, G. Engels, and W. Schäfer, “Market-Specific
Service Compositions: Specification and Matching,” in Proceedings of the IEEE
11th World Congress on Services (SERVICES), Visionary Track: Service Composition
for the Future Internet, 2015, pp. 333--340.'
mla: 'Arifulina, Svetlana, et al. “Market-Specific Service Compositions: Specification
and Matching.” Proceedings of the IEEE 11th World Congress on Services (SERVICES),
Visionary Track: Service Composition for the Future Internet, 2015, pp. 333--340,
doi:10.1109/SERVICES.2015.58.'
short: 'S. Arifulina, M.C. Platenius, F. Mohr, G. Engels, W. Schäfer, in: Proceedings
of the IEEE 11th World Congress on Services (SERVICES), Visionary Track: Service
Composition for the Future Internet, 2015, pp. 333--340.'
date_created: 2017-10-17T12:41:46Z
date_updated: 2022-01-06T06:57:49Z
ddc:
- '040'
department:
- _id: '66'
- _id: '76'
- _id: '355'
doi: 10.1109/SERVICES.2015.58
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:26:04Z
date_updated: 2018-03-21T09:26:04Z
file_id: '1470'
file_name: 280-07196546.pdf
file_size: 234260
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:26:04Z
has_accepted_license: '1'
language:
- iso: eng
page: 333--340
project:
- _id: '1'
name: SFB 901
- _id: '9'
name: SFB 901 - Subprojekt B1
- _id: '10'
name: SFB 901 - Subproject B2
- _id: '3'
name: SFB 901 - Project Area B
publication: 'Proceedings of the IEEE 11th World Congress on Services (SERVICES),
Visionary Track: Service Composition for the Future Internet'
status: public
title: 'Market-Specific Service Compositions: Specification and Matching'
type: conference
user_id: '477'
year: '2015'
...
---
_id: '283'
abstract:
- lang: eng
text: Today, software verification is an established analysis method which can provide
high guarantees for software safety. However, the resources (time and/or memory)
for an exhaustive verification are not always available, and analysis then has
to resort to other techniques, like testing. Most often, the already achieved
partial verification results arediscarded in this case, and testing has to start
from scratch.In this paper, we propose a method for combining verification and
testing in which testing only needs to check the residual fraction of an uncompleted
verification. To this end, the partial results of a verification run are used
to construct a residual program (and residual assertions to be checked on it).
The residual program can afterwards be fed into standardtesting tools. The proposed
technique is sound modulo the soundness of the testing procedure. Experimental
results show that this combinedusage of verification and testing can significantly
reduce the effort for the subsequent testing.
author:
- first_name: Mike
full_name: Czech, Mike
last_name: Czech
- 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: 'Czech M, Jakobs M-C, Wehrheim H. Just test what you cannot verify! In: Egyed
A, Schaefer I, eds. Fundamental Approaches to Software Engineering. Lecture
Notes in Computer Science. ; 2015:100-114. doi:10.1007/978-3-662-46675-9_7'
apa: Czech, M., Jakobs, M.-C., & Wehrheim, H. (2015). Just test what you cannot
verify! In A. Egyed & I. Schaefer (Eds.), Fundamental Approaches to Software
Engineering (pp. 100–114). https://doi.org/10.1007/978-3-662-46675-9_7
bibtex: '@inproceedings{Czech_Jakobs_Wehrheim_2015, series={Lecture Notes in Computer
Science}, title={Just test what you cannot verify!}, DOI={10.1007/978-3-662-46675-9_7},
booktitle={Fundamental Approaches to Software Engineering}, author={Czech, Mike
and Jakobs, Marie-Christine and Wehrheim, Heike}, editor={Egyed, Alexander and
Schaefer, InaEditors}, year={2015}, pages={100–114}, collection={Lecture Notes
in Computer Science} }'
chicago: Czech, Mike, Marie-Christine Jakobs, and Heike Wehrheim. “Just Test What
You Cannot Verify!” In Fundamental Approaches to Software Engineering,
edited by Alexander Egyed and Ina Schaefer, 100–114. Lecture Notes in Computer
Science, 2015. https://doi.org/10.1007/978-3-662-46675-9_7.
ieee: M. Czech, M.-C. Jakobs, and H. Wehrheim, “Just test what you cannot verify!,”
in Fundamental Approaches to Software Engineering, 2015, pp. 100–114.
mla: Czech, Mike, et al. “Just Test What You Cannot Verify!” Fundamental Approaches
to Software Engineering, edited by Alexander Egyed and Ina Schaefer, 2015,
pp. 100–14, doi:10.1007/978-3-662-46675-9_7.
short: 'M. Czech, M.-C. Jakobs, H. Wehrheim, in: A. Egyed, I. Schaefer (Eds.), Fundamental
Approaches to Software Engineering, 2015, pp. 100–114.'
date_created: 2017-10-17T12:41:47Z
date_updated: 2022-01-06T06:58:00Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1007/978-3-662-46675-9_7
editor:
- first_name: Alexander
full_name: Egyed, Alexander
last_name: Egyed
- first_name: Ina
full_name: Schaefer, Ina
last_name: Schaefer
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:25:36Z
date_updated: 2018-03-21T09:25:36Z
file_id: '1469'
file_name: 283-FASEsubmission38_01.pdf
file_size: 391253
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:25:36Z
has_accepted_license: '1'
language:
- iso: eng
page: 100-114
project:
- _id: '1'
name: SFB 901
- _id: '12'
name: SFB 901 - Subprojekt B4
- _id: '3'
name: SFB 901 - Project Area B
publication: Fundamental Approaches to Software Engineering
series_title: Lecture Notes in Computer Science
status: public
title: Just test what you cannot verify!
type: conference
user_id: '477'
year: '2015'
...
---
_id: '284'
abstract:
- lang: eng
text: In this work, we present the first scalable distributed information system,
that is, a system with low storage overhead, that is provably robust against denial-of-service
(DoS) attacks by a current insider. We allow a current insider to have complete
knowledge about the information system and to have the power to block any ϵ-fraction
of its servers by a DoS attack, where ϵ can be chosen up to a constant. The task
of the system is to serve any collection of lookup requests with at most one per
nonblocked server in an efficient way despite this attack. Previously, scalable
solutions were only known for DoS attacks of past insiders, where a past insider
only has complete knowledge about some past time point t0 of the information system.
Scheideler et al. [Awerbuch and Scheideler 2007; Baumgart et al. 2009] showed
that in this case, it is possible to design an information system so that any
information that was inserted or last updated after t0 is safe against a DoS attack.
But their constructions would not work at all for a current insider. The key idea
behind our IRIS system is to make extensive use of coding. More precisely, we
present two alternative distributed coding strategies with an at most logarithmic
storage overhead that can handle up to a constant fraction of blocked servers.
author:
- first_name: Martina
full_name: Eikel, Martina
last_name: Eikel
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Eikel M, Scheideler C. IRIS: A Robust Information System Against Insider DoS
Attacks. Transactions on Parallel Computing. 2015;(3):18:1--18:33. doi:10.1145/2809806'
apa: 'Eikel, M., & Scheideler, C. (2015). IRIS: A Robust Information System
Against Insider DoS Attacks. Transactions on Parallel Computing, (3), 18:1--18:33.
https://doi.org/10.1145/2809806'
bibtex: '@article{Eikel_Scheideler_2015, title={IRIS: A Robust Information System
Against Insider DoS Attacks}, DOI={10.1145/2809806},
number={3}, journal={Transactions on Parallel Computing}, publisher={ACM}, author={Eikel,
Martina and Scheideler, Christian}, year={2015}, pages={18:1--18:33} }'
chicago: 'Eikel, Martina, and Christian Scheideler. “IRIS: A Robust Information
System Against Insider DoS Attacks.” Transactions on Parallel Computing,
no. 3 (2015): 18:1--18:33. https://doi.org/10.1145/2809806.'
ieee: 'M. Eikel and C. Scheideler, “IRIS: A Robust Information System Against Insider
DoS Attacks,” Transactions on Parallel Computing, no. 3, pp. 18:1--18:33,
2015.'
mla: 'Eikel, Martina, and Christian Scheideler. “IRIS: A Robust Information System
Against Insider DoS Attacks.” Transactions on Parallel Computing, no. 3,
ACM, 2015, pp. 18:1--18:33, doi:10.1145/2809806.'
short: M. Eikel, C. Scheideler, Transactions on Parallel Computing (2015) 18:1--18:33.
date_created: 2017-10-17T12:41:47Z
date_updated: 2022-01-06T06:58:03Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1145/2809806
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:25:04Z
date_updated: 2018-03-21T09:25:04Z
file_id: '1468'
file_name: 284-Eikel-Scheideler-ACM2015.pdf
file_size: 651726
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:25:04Z
has_accepted_license: '1'
issue: '3'
page: 18:1--18:33
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
publication: Transactions on Parallel Computing
publisher: ACM
status: public
title: 'IRIS: A Robust Information System Against Insider DoS Attacks'
type: journal_article
user_id: '477'
year: '2015'
...
---
_id: '285'
abstract:
- lang: eng
text: We propose an incremental workflow for the verification of parameterized systems
modeled as symmetric networks of timed automata. Starting with a small number
of timed automata in the network, a safety property is verified using IC3, a state-of-the-art
algorithm based on induction.The result of the verification, an inductive strengthening,
is reused proposing a candidate inductive strengthening for a larger network.If
the candidate is valid, our main theorem states that the safety property holds
for all sizes of the network of timed automata. Otherwise the number of automata
is increased and the next iteration is started with a new run of IC3.We propose
and thoroughly examine optimizations to our workflow, e.g. Feedback mechanisms
to speed up the run of IC3.
author:
- first_name: Tobias
full_name: Isenberg, Tobias
last_name: Isenberg
citation:
ama: 'Isenberg T. Incremental Inductive Verification of Parameterized Timed Systems.
In: Proceedings of the 15th International Conference on Application of Concurrency
to System Design (ACSD). ; 2015:1-9. doi:10.1109/ACSD.2015.13'
apa: Isenberg, T. (2015). Incremental Inductive Verification of Parameterized Timed
Systems. In Proceedings of the 15th International Conference on Application
of Concurrency to System Design (ACSD) (pp. 1–9). https://doi.org/10.1109/ACSD.2015.13
bibtex: '@inproceedings{Isenberg_2015, title={Incremental Inductive Verification
of Parameterized Timed Systems}, DOI={10.1109/ACSD.2015.13},
booktitle={Proceedings of the 15th International Conference on Application of
Concurrency to System Design (ACSD)}, author={Isenberg, Tobias}, year={2015},
pages={1–9} }'
chicago: Isenberg, Tobias. “Incremental Inductive Verification of Parameterized
Timed Systems.” In Proceedings of the 15th International Conference on Application
of Concurrency to System Design (ACSD), 1–9, 2015. https://doi.org/10.1109/ACSD.2015.13.
ieee: T. Isenberg, “Incremental Inductive Verification of Parameterized Timed Systems,”
in Proceedings of the 15th International Conference on Application of Concurrency
to System Design (ACSD), 2015, pp. 1–9.
mla: Isenberg, Tobias. “Incremental Inductive Verification of Parameterized Timed
Systems.” Proceedings of the 15th International Conference on Application of
Concurrency to System Design (ACSD), 2015, pp. 1–9, doi:10.1109/ACSD.2015.13.
short: 'T. Isenberg, in: Proceedings of the 15th International Conference on Application
of Concurrency to System Design (ACSD), 2015, pp. 1–9.'
date_created: 2017-10-17T12:41:47Z
date_updated: 2022-01-06T06:58:07Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1109/ACSD.2015.13
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:23:45Z
date_updated: 2018-03-21T09:23:45Z
file_id: '1466'
file_name: 285-07352419.pdf
file_size: 479808
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:23:45Z
has_accepted_license: '1'
language:
- iso: eng
page: '1-9 '
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 15th International Conference on Application of Concurrency
to System Design (ACSD)
status: public
title: Incremental Inductive Verification of Parameterized Timed Systems
type: conference
user_id: '477'
year: '2015'
...
---
_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: '2865'
author:
- first_name: Daniela
full_name: Strotmann, Daniela
last_name: Strotmann
citation:
ama: Strotmann D. Singulärwertzerlegung Für μ-Ähnliche Bregman-Divergenzen.;
2015.
apa: Strotmann, D. (2015). Singulärwertzerlegung für μ-ähnliche Bregman-Divergenzen.
bibtex: '@book{Strotmann_2015, title={Singulärwertzerlegung für μ-ähnliche Bregman-Divergenzen},
author={Strotmann, Daniela}, year={2015} }'
chicago: Strotmann, Daniela. Singulärwertzerlegung Für μ-Ähnliche Bregman-Divergenzen,
2015.
ieee: D. Strotmann, Singulärwertzerlegung für μ-ähnliche Bregman-Divergenzen.
2015.
mla: Strotmann, Daniela. Singulärwertzerlegung Für μ-Ähnliche Bregman-Divergenzen.
2015.
short: D. Strotmann, Singulärwertzerlegung Für μ-Ähnliche Bregman-Divergenzen, 2015.
date_created: 2018-05-24T13:05:41Z
date_updated: 2022-01-06T06:58:12Z
department:
- _id: '64'
status: public
supervisor:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
title: Singulärwertzerlegung für μ-ähnliche Bregman-Divergenzen
type: bachelorsthesis
user_id: '25078'
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: '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: '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: '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: '26446'
author:
- first_name: Hans
full_name: Pongratz, Hans
last_name: Pongratz
- first_name: Reinhard
full_name: Keil, Reinhard
last_name: Keil
citation:
ama: Pongratz H, Keil R. DeLFI 2015 - The 13th e-Learning Conference on Computer
Science of the E-Learning Section of the Society for Computer Science EV.
Koellen Druck + Verlag GmbH; 2015.
apa: Pongratz, H., & Keil, R. (2015). DeLFI 2015 - The 13th e-Learning Conference
on Computer Science of the E-Learning Section of the Society for Computer Science
eV. Koellen Druck + Verlag GmbH.
bibtex: '@book{Pongratz_Keil_2015, series={GI-Edition Lecture Notes in Informatics
(LNI)}, title={DeLFI 2015 - The 13th e-Learning Conference on Computer Science
of the E-Learning Section of the Society for Computer Science eV}, publisher={Koellen
Druck + Verlag GmbH}, author={Pongratz, Hans and Keil, Reinhard}, year={2015},
collection={GI-Edition Lecture Notes in Informatics (LNI)} }'
chicago: Pongratz, Hans, and Reinhard Keil. DeLFI 2015 - The 13th e-Learning
Conference on Computer Science of the E-Learning Section of the Society for Computer
Science EV. GI-Edition Lecture Notes in Informatics (LNI). Koellen Druck +
Verlag GmbH, 2015.
ieee: H. Pongratz and R. Keil, DeLFI 2015 - The 13th e-Learning Conference on
Computer Science of the E-Learning Section of the Society for Computer Science
eV. Koellen Druck + Verlag GmbH, 2015.
mla: Pongratz, Hans, and Reinhard Keil. DeLFI 2015 - The 13th e-Learning Conference
on Computer Science of the E-Learning Section of the Society for Computer Science
EV. Koellen Druck + Verlag GmbH, 2015.
short: H. Pongratz, R. Keil, DeLFI 2015 - The 13th e-Learning Conference on Computer
Science of the E-Learning Section of the Society for Computer Science EV, Koellen
Druck + Verlag GmbH, 2015.
date_created: 2021-10-18T20:52:45Z
date_updated: 2022-01-06T06:57:21Z
department:
- _id: '71'
language:
- iso: eng
publication_status: published
publisher: Koellen Druck + Verlag GmbH
series_title: GI-Edition Lecture Notes in Informatics (LNI)
status: public
title: DeLFI 2015 - The 13th e-Learning Conference on Computer Science of the E-Learning
Section of the Society for Computer Science eV
type: book
user_id: '71124'
year: '2015'
...
---
_id: '26449'
alternative_title:
- 20 years of learning with the World Wide Web - technology and education in dialogue
author:
- first_name: Felix
full_name: Winkelnkemper, Felix
id: '3117'
last_name: Winkelnkemper
- first_name: Andreas
full_name: Oberhoff, Andreas
last_name: Oberhoff
citation:
ama: 'Winkelnkemper F, Oberhoff A. WebArena - R {\ “a} spacious structures for {\”
u} r the learning locations of the future. In: wedge R, Selke H, eds. Vol 330.
Publication series of the Heinz Nixdorf Institute, Paderborn; 2015:103-117.'
apa: Winkelnkemper, F., & Oberhoff, A. (2015). WebArena - R {\ “a} spacious
structures for {\” u} r the learning locations of the future (R. wedge &
H. Selke, Eds.; Vol. 330, pp. 103–117). Publication series of the Heinz Nixdorf
Institute, Paderborn.
bibtex: '@inproceedings{Winkelnkemper_Oberhoff_2015, title={WebArena - R {\ “a}
spacious structures for {\” u} r the learning locations of the future}, volume={330},
publisher={Publication series of the Heinz Nixdorf Institute, Paderborn}, author={Winkelnkemper,
Felix and Oberhoff, Andreas}, editor={wedge, Reinhard and Selke, Harald}, year={2015},
pages={103–117} }'
chicago: Winkelnkemper, Felix, and Andreas Oberhoff. “WebArena - R {\ ‘A} Spacious
Structures for {\’ U} r the Learning Locations of the Future.” edited by Reinhard wedge
and Harald Selke, 330:103–17. Publication series of the Heinz Nixdorf Institute,
Paderborn, 2015.
ieee: F. Winkelnkemper and A. Oberhoff, “WebArena - R {\ ‘a} spacious structures
for {\’ u} r the learning locations of the future,” 2015, vol. 330, pp. 103–117.
mla: Winkelnkemper, Felix, and Andreas Oberhoff. WebArena - R {\ “A} Spacious
Structures for {\” U} r the Learning Locations of the Future. Edited by Reinhard wedge
and Harald Selke, vol. 330, Publication series of the Heinz Nixdorf Institute,
Paderborn, 2015, pp. 103–17.
short: 'F. Winkelnkemper, A. Oberhoff, in: R. wedge, H. Selke (Eds.), Publication
series of the Heinz Nixdorf Institute, Paderborn, 2015, pp. 103–117.'
date_created: 2021-10-18T20:56:42Z
date_updated: 2022-01-06T06:57:21Z
department:
- _id: '71'
editor:
- first_name: 'Reinhard '
full_name: 'wedge, Reinhard '
last_name: wedge
- first_name: Harald
full_name: Selke, Harald
last_name: Selke
intvolume: ' 330'
language:
- iso: eng
page: 103-117
publication_status: published
publisher: Publication series of the Heinz Nixdorf Institute, Paderborn
status: public
title: WebArena - R {\ "a} spacious structures for {\" u} r the learning locations
of the future
type: conference
user_id: '71124'
volume: 330
year: '2015'
...
---
_id: '26531'
citation:
ama: Keil R, Selke H, eds. 20 Years of Learning with the World Wide Web - Technology
and Education in Dialogue. Vol 330. publishing series of the Heinz Nixdorf
Institute, Paderborn; 2015.
apa: Keil, R., & Selke, H. (Eds.). (2015). 20 years of learning with the
World Wide Web - technology and education in dialogue (Vol. 330). publishing
series of the Heinz Nixdorf Institute, Paderborn.
bibtex: '@book{Keil_Selke_2015, series={Heinz publishing house series Nixdorf Institute,
Paderborn}, title={20 years of learning with the World Wide Web - technology and
education in dialogue}, volume={330}, publisher={publishing series of the Heinz
Nixdorf Institute, Paderborn}, year={2015}, collection={Heinz publishing house
series Nixdorf Institute, Paderborn} }'
chicago: Keil, Reinhard, and Harald Selke, eds. 20 Years of Learning with the
World Wide Web - Technology and Education in Dialogue. Vol. 330. Heinz Publishing
House Series Nixdorf Institute, Paderborn. publishing series of the Heinz Nixdorf
Institute, Paderborn, 2015.
ieee: R. Keil and H. Selke, Eds., 20 years of learning with the World Wide Web
- technology and education in dialogue, vol. 330. publishing series of the
Heinz Nixdorf Institute, Paderborn, 2015.
mla: Keil, Reinhard, and Harald Selke, editors. 20 Years of Learning with the
World Wide Web - Technology and Education in Dialogue. publishing series of
the Heinz Nixdorf Institute, Paderborn, 2015.
short: R. Keil, H. Selke, eds., 20 Years of Learning with the World Wide Web - Technology
and Education in Dialogue, publishing series of the Heinz Nixdorf Institute, Paderborn,
2015.
date_created: 2021-10-19T14:09:39Z
date_updated: 2022-01-06T06:57:22Z
department:
- _id: '71'
editor:
- first_name: Reinhard
full_name: Keil, Reinhard
last_name: Keil
- first_name: Harald
full_name: Selke, Harald
id: '497'
last_name: Selke
intvolume: ' 330'
language:
- iso: eng
publication_status: published
publisher: publishing series of the Heinz Nixdorf Institute, Paderborn
series_title: Heinz publishing house series Nixdorf Institute, Paderborn
status: public
title: 20 years of learning with the World Wide Web - technology and education in
dialogue
type: book_editor
user_id: '71124'
volume: 330
year: '2015'
...
---
_id: '26532'
alternative_title:
- 20 years of learning with the World Wide Web - technology and education in dialogue
author:
- first_name: 'Reinhard '
full_name: 'Keil, Reinhard '
last_name: Keil
- first_name: Harald
full_name: Selke, Harald
id: '497'
last_name: Selke
citation:
ama: 'Keil R, Selke H. Learn with, through and {\ "about the WWW. In: Keil R, Selke
H, eds. Vol 330. Publishing series of the Heinz Nixdorf Institute, Paderborn;
2015:1-7.'
apa: Keil, R., & Selke, H. (2015). Learn with, through and {\ "about the
WWW (R. Keil & H. Selke, Eds.; Vol. 330, pp. 1–7). Publishing series
of the Heinz Nixdorf Institute, Paderborn.
bibtex: '@inproceedings{Keil_Selke_2015, title={Learn with, through and {\ "about
the WWW}, volume={330}, publisher={Publishing series of the Heinz Nixdorf Institute,
Paderborn}, author={Keil, Reinhard and Selke, Harald}, editor={Keil, Reinhard
and Selke, Harald}, year={2015}, pages={1–7} }'
chicago: Keil, Reinhard , and Harald Selke. “Learn with, through and {\ "about the
WWW.” edited by Reinhard Keil and Harald Selke, 330:1–7. Publishing series of
the Heinz Nixdorf Institute, Paderborn, 2015.
ieee: R. Keil and H. Selke, “Learn with, through and {\ "about the WWW,” 2015, vol.
330, pp. 1–7.
mla: Keil, Reinhard, and Harald Selke. Learn with, through and {\ "about the
WWW. Edited by Reinhard Keil and Harald Selke, vol. 330, Publishing series
of the Heinz Nixdorf Institute, Paderborn, 2015, pp. 1–7.
short: 'R. Keil, H. Selke, in: R. Keil, H. Selke (Eds.), Publishing series of the
Heinz Nixdorf Institute, Paderborn, 2015, pp. 1–7.'
date_created: 2021-10-19T14:13:08Z
date_updated: 2022-01-06T06:57:22Z
department:
- _id: '71'
editor:
- first_name: Reinhard
full_name: Keil, Reinhard
last_name: Keil
- first_name: Harald
full_name: ' Selke, Harald'
last_name: ' Selke'
intvolume: ' 330'
language:
- iso: eng
page: 1-7
publication_status: published
publisher: Publishing series of the Heinz Nixdorf Institute, Paderborn
status: public
title: Learn with, through and {\ "about the WWW
type: conference
user_id: '71124'
volume: 330
year: '2015'
...
---
_id: '26533'
alternative_title:
- 20 years of learning with the World Wide Web - technology and education in dialogue
author:
- first_name: 'Reinhard '
full_name: 'Keil, Reinhard '
last_name: Keil
- first_name: Harald
full_name: Selke, Harald
id: '497'
last_name: Selke
citation:
ama: 'Keil R, Selke H. Virtual knowledge {\ “a} ume - From the presentation of content
to virtual learning {\” a} tten. In: Keil R, Selke H, eds. Vol 330. publishing
series of the Heinz Nixdorf Institute, Paderborn; 2015:39-53.'
apa: Keil, R., & Selke, H. (2015). Virtual knowledge {\ “a} ume - From the
presentation of content to virtual learning {\” a} tten (R. Keil & H.
Selke, Eds.; Vol. 330, pp. 39–53). publishing series of the Heinz Nixdorf Institute,
Paderborn.
bibtex: '@inproceedings{Keil_Selke_2015, title={Virtual knowledge {\ “a} ume - From
the presentation of content to virtual learning {\” a} tten}, volume={330}, publisher={publishing
series of the Heinz Nixdorf Institute, Paderborn}, author={Keil, Reinhard and
Selke, Harald}, editor={Keil, Reinhard and Selke, Harald}, year={2015}, pages={39–53}
}'
chicago: Keil, Reinhard , and Harald Selke. “Virtual Knowledge {\ ‘A} Ume - From
the Presentation of Content to Virtual Learning {\’ A} Tten.” edited by Reinhard
Keil and Harald Selke, 330:39–53. publishing series of the Heinz Nixdorf Institute,
Paderborn, 2015.
ieee: R. Keil and H. Selke, “Virtual knowledge {\ ‘a} ume - From the presentation
of content to virtual learning {\’ a} tten,” 2015, vol. 330, pp. 39–53.
mla: Keil, Reinhard, and Harald Selke. Virtual Knowledge {\ “A} Ume - From the
Presentation of Content to Virtual Learning {\” A} Tten. Edited by Reinhard
Keil and Harald Selke, vol. 330, publishing series of the Heinz Nixdorf Institute,
Paderborn, 2015, pp. 39–53.
short: 'R. Keil, H. Selke, in: R. Keil, H. Selke (Eds.), publishing series of the
Heinz Nixdorf Institute, Paderborn, 2015, pp. 39–53.'
date_created: 2021-10-19T14:19:23Z
date_updated: 2022-01-06T06:57:22Z
department:
- _id: '71'
editor:
- first_name: Reinhard
full_name: Keil, Reinhard
last_name: Keil
- first_name: Harald
full_name: Selke, Harald
last_name: Selke
intvolume: ' 330'
language:
- iso: eng
page: 39-53
publication_status: published
publisher: publishing series of the Heinz Nixdorf Institute, Paderborn
status: public
title: Virtual knowledge {\ "a} ume - From the presentation of content to virtual
learning {\" a} tten
type: conference
user_id: '71124'
volume: 330
year: '2015'
...