---
_id: '370'
abstract:
- lang: eng
text: 'Max-min fairness (MMF) is a widely known approach to a fair allocation of
bandwidth to each of the users in a network. This allocation can be computed by
uniformly raising the bandwidths of all users without violating capacity constraints.
We consider an extension of these allocations by raising the bandwidth with arbitrary
and not necessarily uniform time-depending velocities (allocation rates). These
allocations are used in a game-theoretic context for routing choices, which we
formalize in progressive filling games (PFGs).We present a variety of results
for equilibria in PFGs. We show that these games possess pure Nash and strong
equilibria. While computation in general is NP-hard, there are polynomial-time
algorithms for prominent classes of Max-Min-Fair Games (MMFG), including the case
when all users have the same source-destination pair. We characterize prices of
anarchy and stability for pure Nash and strong equilibria in PFGs and MMFGs when
players have different or the same source-destination pairs. In addition, we show
that when a designer can adjust allocation rates, it is possible to design games
with optimal strong equilibria. Some initial results on polynomial-time algorithms
in this direction are also derived. '
author:
- first_name: Tobias
full_name: Harks, Tobias
last_name: Harks
- first_name: Martin
full_name: Höfer, Martin
last_name: Höfer
- first_name: Kevin
full_name: Schewior, Kevin
last_name: Schewior
- first_name: Alexander
full_name: Skopalik, Alexander
id: '40384'
last_name: Skopalik
citation:
ama: 'Harks T, Höfer M, Schewior K, Skopalik A. Routing Games with Progressive Filling.
In: Proceedings of the 33rd Annual IEEE International Conference on Computer
Communications (INFOCOM’14). ; 2014:352-360. doi:10.1109/TNET.2015.2468571'
apa: Harks, T., Höfer, M., Schewior, K., & Skopalik, A. (2014). Routing Games
with Progressive Filling. In Proceedings of the 33rd Annual IEEE International
Conference on Computer Communications (INFOCOM’14) (pp. 352–360). https://doi.org/10.1109/TNET.2015.2468571
bibtex: '@inproceedings{Harks_Höfer_Schewior_Skopalik_2014, title={Routing Games
with Progressive Filling}, DOI={10.1109/TNET.2015.2468571},
booktitle={Proceedings of the 33rd Annual IEEE International Conference on Computer
Communications (INFOCOM’14)}, author={Harks, Tobias and Höfer, Martin and Schewior,
Kevin and Skopalik, Alexander}, year={2014}, pages={352–360} }'
chicago: Harks, Tobias, Martin Höfer, Kevin Schewior, and Alexander Skopalik. “Routing
Games with Progressive Filling.” In Proceedings of the 33rd Annual IEEE International
Conference on Computer Communications (INFOCOM’14), 352–60, 2014. https://doi.org/10.1109/TNET.2015.2468571.
ieee: T. Harks, M. Höfer, K. Schewior, and A. Skopalik, “Routing Games with Progressive
Filling,” in Proceedings of the 33rd Annual IEEE International Conference on
Computer Communications (INFOCOM’14), 2014, pp. 352–360.
mla: Harks, Tobias, et al. “Routing Games with Progressive Filling.” Proceedings
of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM’14),
2014, pp. 352–60, doi:10.1109/TNET.2015.2468571.
short: 'T. Harks, M. Höfer, K. Schewior, A. Skopalik, in: Proceedings of the 33rd
Annual IEEE International Conference on Computer Communications (INFOCOM’14),
2014, pp. 352–360.'
date_created: 2017-10-17T12:42:04Z
date_updated: 2022-01-06T06:59:30Z
ddc:
- '040'
department:
- _id: '63'
- _id: '541'
doi: 10.1109/TNET.2015.2468571
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:17:04Z
date_updated: 2018-03-20T07:17:04Z
file_id: '1402'
file_name: 370-HHSS14.pdf
file_size: 179583
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:17:04Z
has_accepted_license: '1'
language:
- iso: eng
page: 352-360
project:
- _id: '1'
name: SFB 901
- _id: '7'
name: SFB 901 - Subprojekt A3
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 33rd Annual IEEE International Conference on Computer
Communications (INFOCOM'14)
status: public
title: Routing Games with Progressive Filling
type: conference
user_id: '477'
year: '2014'
...
---
_id: '371'
abstract:
- lang: eng
text: In this work we present the first distributed storage system that is provably
robust against crash failures issued by an adaptive adversary, i.e., for each
batch of requests the adversary can decide based on the entire system state which
servers will be unavailable for that batch of requests. Despite up to \gamma n^{1/\log\log
n} crashed servers, with \gamma>0 constant and n denoting the number of servers,
our system can correctly process any batch of lookup and write requests (with
at most a polylogarithmic number of requests issued at each non-crashed server)
in at most a polylogarithmic number of communication rounds, with at most polylogarithmic
time and work at each server and only a logarithmic storage overhead. Our system
is based on previous work by Eikel and Scheideler (SPAA 2013), who presented IRIS,
a distributed information system that is provably robust against the same kind
of crash failures. However, IRIS is only able to serve lookup requests. Handling
both lookup and write requests has turned out to require major changes in the
design of IRIS.
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: Martina
full_name: Eikel, Martina
last_name: Eikel
citation:
ama: 'Scheideler C, Setzer A, Eikel M. RoBuSt: A Crash-Failure-Resistant Distributed
Storage System. In: Proceedings of the 18th International Conference on Principles
of Distributed Systems (OPODIS). LNCS. ; 2014:107--122. doi:10.1007/978-3-319-14472-6_8'
apa: 'Scheideler, C., Setzer, A., & Eikel, M. (2014). RoBuSt: A Crash-Failure-Resistant
Distributed Storage System. In Proceedings of the 18th International Conference
on Principles of Distributed Systems (OPODIS) (pp. 107--122). https://doi.org/10.1007/978-3-319-14472-6_8'
bibtex: '@inproceedings{Scheideler_Setzer_Eikel_2014, series={LNCS}, title={RoBuSt:
A Crash-Failure-Resistant Distributed Storage System}, DOI={10.1007/978-3-319-14472-6_8},
booktitle={Proceedings of the 18th International Conference on Principles of Distributed
Systems (OPODIS)}, author={Scheideler, Christian and Setzer, Alexander and Eikel,
Martina}, year={2014}, pages={107--122}, collection={LNCS} }'
chicago: 'Scheideler, Christian, Alexander Setzer, and Martina Eikel. “RoBuSt: A
Crash-Failure-Resistant Distributed Storage System.” In Proceedings of the
18th International Conference on Principles of Distributed Systems (OPODIS),
107--122. LNCS, 2014. https://doi.org/10.1007/978-3-319-14472-6_8.'
ieee: 'C. Scheideler, A. Setzer, and M. Eikel, “RoBuSt: A Crash-Failure-Resistant
Distributed Storage System,” in Proceedings of the 18th International Conference
on Principles of Distributed Systems (OPODIS), 2014, pp. 107--122.'
mla: 'Scheideler, Christian, et al. “RoBuSt: A Crash-Failure-Resistant Distributed
Storage System.” Proceedings of the 18th International Conference on Principles
of Distributed Systems (OPODIS), 2014, pp. 107--122, doi:10.1007/978-3-319-14472-6_8.'
short: 'C. Scheideler, A. Setzer, M. Eikel, in: Proceedings of the 18th International
Conference on Principles of Distributed Systems (OPODIS), 2014, pp. 107--122.'
date_created: 2017-10-17T12:42:04Z
date_updated: 2022-01-06T06:59:31Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/978-3-319-14472-6_8
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:16:32Z
date_updated: 2018-03-20T07:16:32Z
file_id: '1401'
file_name: 371-RoBuSt-OPODIS.pdf
file_size: 269941
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:16:32Z
has_accepted_license: '1'
page: 107--122
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 18th International Conference on Principles of Distributed
Systems (OPODIS)
series_title: LNCS
status: public
title: 'RoBuSt: A Crash-Failure-Resistant Distributed Storage System'
type: conference
user_id: '15504'
year: '2014'
...
---
_id: '372'
abstract:
- lang: eng
text: 'In the near future many more compute resources will be available at different
geographical locations. To minimize the response time of requests, application
servers closer to the user can hence be used to shorten network round trip times.
However, this advantage is neutralized if the used data centre is highly loaded
as the processing time of re- quests is important as well. We model the request
response time as the network round trip time plus the processing time at a data
centre.We present a capacitated facility location problem formal- ization where
the processing time is modelled as the sojourn time of a queueing model. We discuss
the Pareto trade-off between the number of used data centres and the resulting
response time. For example, using fewer data centres could cut expenses but results
in high utilization, high response time, and smaller revenues.Previous work presented
a non-linear cost function. We prove its convexity and exploit this property in
two ways: First, we transform the convex model into a linear model while controlling
the maximum approximation error. Sec- ond, we used a convex solver instead of
a slower non-linear solver. Numerical results on network topologies exemplify
our work.'
author:
- first_name: Matthias
full_name: Keller, Matthias
last_name: Keller
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: 'Keller M, Karl H. Response Time-Optimized Distributed Cloud Resource Allocation.
In: Proceedings of the SIGCOMM Workshop on Distributed Cloud Computing.
; 2014:47--52. doi:10.1145/2627566.2627570'
apa: Keller, M., & Karl, H. (2014). Response Time-Optimized Distributed Cloud
Resource Allocation. In Proceedings of the SIGCOMM workshop on Distributed
cloud computing (pp. 47--52). https://doi.org/10.1145/2627566.2627570
bibtex: '@inproceedings{Keller_Karl_2014, title={Response Time-Optimized Distributed
Cloud Resource Allocation}, DOI={10.1145/2627566.2627570},
booktitle={Proceedings of the SIGCOMM workshop on Distributed cloud computing},
author={Keller, Matthias and Karl, Holger}, year={2014}, pages={47--52} }'
chicago: Keller, Matthias, and Holger Karl. “Response Time-Optimized Distributed
Cloud Resource Allocation.” In Proceedings of the SIGCOMM Workshop on Distributed
Cloud Computing, 47--52, 2014. https://doi.org/10.1145/2627566.2627570.
ieee: M. Keller and H. Karl, “Response Time-Optimized Distributed Cloud Resource
Allocation,” in Proceedings of the SIGCOMM workshop on Distributed cloud computing,
2014, pp. 47--52.
mla: Keller, Matthias, and Holger Karl. “Response Time-Optimized Distributed Cloud
Resource Allocation.” Proceedings of the SIGCOMM Workshop on Distributed Cloud
Computing, 2014, pp. 47--52, doi:10.1145/2627566.2627570.
short: 'M. Keller, H. Karl, in: Proceedings of the SIGCOMM Workshop on Distributed
Cloud Computing, 2014, pp. 47--52.'
date_created: 2017-10-17T12:42:04Z
date_updated: 2022-01-06T06:59:31Z
ddc:
- '000'
department:
- _id: '75'
doi: 10.1145/2627566.2627570
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T14:00:54Z
date_updated: 2018-11-02T14:00:54Z
file_id: '5259'
file_name: p47-keller.pdf
file_size: 804240
relation: main_file
success: 1
file_date_updated: 2018-11-02T14:00:54Z
has_accepted_license: '1'
language:
- iso: eng
page: 47--52
project:
- _id: '1'
name: SFB 901
- _id: '6'
name: SFB 901 - Subprojekt A2
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the SIGCOMM workshop on Distributed cloud computing
status: public
title: Response Time-Optimized Distributed Cloud Resource Allocation
type: conference
user_id: '477'
year: '2014'
...
---
_id: '373'
author:
- first_name: David
full_name: Pahl, David
last_name: Pahl
citation:
ama: Pahl D. Reputationssysteme für zusammengesetzte Dienstleistungen. Universität
Paderborn; 2014.
apa: Pahl, D. (2014). Reputationssysteme für zusammengesetzte Dienstleistungen.
Universität Paderborn.
bibtex: '@book{Pahl_2014, title={Reputationssysteme für zusammengesetzte Dienstleistungen},
publisher={Universität Paderborn}, author={Pahl, David}, year={2014} }'
chicago: Pahl, David. Reputationssysteme für zusammengesetzte Dienstleistungen.
Universität Paderborn, 2014.
ieee: D. Pahl, Reputationssysteme für zusammengesetzte Dienstleistungen.
Universität Paderborn, 2014.
mla: Pahl, David. Reputationssysteme für zusammengesetzte Dienstleistungen.
Universität Paderborn, 2014.
short: D. Pahl, Reputationssysteme für zusammengesetzte Dienstleistungen, Universität
Paderborn, 2014.
date_created: 2017-10-17T12:42:04Z
date_updated: 2022-01-06T06:59:31Z
department:
- _id: '63'
- _id: '541'
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '7'
name: SFB 901 - Subprojekt A3
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Alexander
full_name: Skopalik, Alexander
id: '40384'
last_name: Skopalik
title: Reputationssysteme für zusammengesetzte Dienstleistungen
type: bachelorsthesis
user_id: '14052'
year: '2014'
...
---
_id: '376'
abstract:
- lang: eng
text: Radio access networks (RANs) have become one of the largest energy consumers
of communication technology [LLH+13] and their energy consumption is predicted
to increase [FFMB11]. To reduce the energy consumption of RANs different techniques
have been proposed. One of the most promising techniques is the use of a low-power
sleep mode. However, a sleep mode can also reduce the performance. In this dissertation,
I quantify how much energy can be conserved with a sleep mode and which negative
effects it has on the performance of RANs. Additionally, I analyze how a sleep
mode can be enabled more often and how the performance can be kept high. First,
I quantify the effect of power-cycle durations on energy consumption and latency
in an abstract queuing system. This results in a trade-off between energy consumption
and latency for a single base station (BS). Second, I show that considering a
network as a whole (instead of each BS individually) allows the energy consumption
to be reduced even further. After these analyses, which are not specific for RANs,
I study RANs for the rest of the dissertation. RANs need to both detect and execute
the requests of users. Because detection and execution of requests have different
requirements, I analyze them independently. I quantify how the number of active
BSs can be reduced if the detection ranges of BSs are increased by cooperative
transmissions. Next, I analyze how more BSs can be deactivated if the remaining
active BSs cooperate to transmit data to the users. However, in addition to increasing
the range, cooperative transmissions also radiate more power. This results in
higher interference for other users which slows their transmissions down and,
thus, increases energy consumption. Therefore, I describe how the radiated power
of cooperative transmissions can be reduced if instantaneous channel knowledge
is available. Because the implementation in real hardware is impractical for demonstration
purposes, I show the results of a simulation that incorporates all effects I studied
analytically earlier. In conclusion, I show that a sleep mode can reduce the energy
consumption of RANs if applied correctly. To apply a sleep mode correctly, it
is necessary to consider power-cycle durations, power profiles, and the interaction
of BSs. When this knowledge is combined the energy consumption of RANs can be
reduced with only a slight loss of performance. Because this results in a trade-off
between energy consumption and performance, each RAN operator has to decide which
trade-off is preferred.
author:
- first_name: Matthias
full_name: Herlich, Matthias
last_name: Herlich
citation:
ama: Herlich M. Reducing Energy Consumption of Radio Access Networks. Universität
Paderborn; 2014.
apa: Herlich, M. (2014). Reducing Energy Consumption of Radio Access Networks.
Universität Paderborn.
bibtex: '@book{Herlich_2014, title={Reducing Energy Consumption of Radio Access
Networks}, publisher={Universität Paderborn}, author={Herlich, Matthias}, year={2014}
}'
chicago: Herlich, Matthias. Reducing Energy Consumption of Radio Access Networks.
Universität Paderborn, 2014.
ieee: M. Herlich, Reducing Energy Consumption of Radio Access Networks. Universität
Paderborn, 2014.
mla: Herlich, Matthias. Reducing Energy Consumption of Radio Access Networks.
Universität Paderborn, 2014.
short: M. Herlich, Reducing Energy Consumption of Radio Access Networks, Universität
Paderborn, 2014.
date_created: 2017-10-17T12:42:05Z
date_updated: 2022-01-06T06:59:35Z
ddc:
- '040'
department:
- _id: '75'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:14:52Z
date_updated: 2018-03-20T07:14:52Z
file_id: '1398'
file_name: 376-Herlich-Dissertation.pdf
file_size: 1476366
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:14:52Z
has_accepted_license: '1'
project:
- _id: '1'
name: SFB 901
- _id: '6'
name: SFB 901 - Subprojekt A2
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
title: Reducing Energy Consumption of Radio Access Networks
type: dissertation
user_id: '477'
year: '2014'
...
---
_id: '378'
abstract:
- lang: eng
text: The Chord peer-to-peer system is considered, together with CAN, Tapestry and
Pastry, as one of the pioneering works on peer-to-peer distributed hash tables
(DHT) that inspired a large volume of papers and projects on DHTs as well as peer-to-peer
systems in general. Chord, in particular, has been studied thoroughly, and many
variants of Chord have been presented that optimize various criteria. Also, several
implementations of Chord are available on various platforms. Though Chord is known
to be very efficient and scalable and it can handle churn quite well, no protocol
is known yet that guarantees that Chord is self-stabilizing, i.e., the Chord network
can be recovered from any initial state in which the network is still weakly connected.
This is not too surprising since it is known that the Chord network is not locally
checkable for its current topology. We present a slight extension of the Chord
network, called Re-Chord (reactive Chord), that turns out to be locally checkable,
and we present a self-stabilizing distributed protocol for it that can recover
the Re-Chord network from any initial state, in which the n peers are weakly connected,
in O(nlogn) communication rounds. We also show that our protocol allows a new
peer to join or an old peer to leave an already stable Re-Chord network so that
within O(logn)^2) communication rounds the Re-Chord network is stable again.
author:
- first_name: Sebastian
full_name: Kniesburges, Sebastian
last_name: Kniesburges
- first_name: Andreas
full_name: Koutsopoulos, Andreas
last_name: Koutsopoulos
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Kniesburges S, Koutsopoulos A, Scheideler C. Re-Chord: A Self-stabilizing
Chord Overlay Network. Theory of Computing Systems. 2014;(3):591-612. doi:10.1007/s00224-012-9431-2'
apa: 'Kniesburges, S., Koutsopoulos, A., & Scheideler, C. (2014). Re-Chord:
A Self-stabilizing Chord Overlay Network. Theory of Computing Systems,
(3), 591–612. https://doi.org/10.1007/s00224-012-9431-2'
bibtex: '@article{Kniesburges_Koutsopoulos_Scheideler_2014, title={Re-Chord: A Self-stabilizing
Chord Overlay Network}, DOI={10.1007/s00224-012-9431-2},
number={3}, journal={Theory of Computing Systems}, publisher={Springer}, author={Kniesburges,
Sebastian and Koutsopoulos, Andreas and Scheideler, Christian}, year={2014}, pages={591–612}
}'
chicago: 'Kniesburges, Sebastian, Andreas Koutsopoulos, and Christian Scheideler.
“Re-Chord: A Self-Stabilizing Chord Overlay Network.” Theory of Computing Systems,
no. 3 (2014): 591–612. https://doi.org/10.1007/s00224-012-9431-2.'
ieee: 'S. Kniesburges, A. Koutsopoulos, and C. Scheideler, “Re-Chord: A Self-stabilizing
Chord Overlay Network,” Theory of Computing Systems, no. 3, pp. 591–612,
2014.'
mla: 'Kniesburges, Sebastian, et al. “Re-Chord: A Self-Stabilizing Chord Overlay
Network.” Theory of Computing Systems, no. 3, Springer, 2014, pp. 591–612,
doi:10.1007/s00224-012-9431-2.'
short: S. Kniesburges, A. Koutsopoulos, C. Scheideler, Theory of Computing Systems
(2014) 591–612.
date_created: 2017-10-17T12:42:05Z
date_updated: 2022-01-06T06:59:35Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/s00224-012-9431-2
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:13:36Z
date_updated: 2018-03-20T07:13:36Z
file_id: '1396'
file_name: 378-re-chord_journal.pdf
file_size: 310961
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:13:36Z
has_accepted_license: '1'
issue: '3'
page: 591-612
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '4'
name: SFB 901 - Project Area C
- _id: '13'
name: SFB 901 - Subproject C1
- _id: '2'
name: SFB 901 - Project Area A
publication: Theory of Computing Systems
publisher: Springer
status: public
title: 'Re-Chord: A Self-stabilizing Chord Overlay Network'
type: journal_article
user_id: '477'
year: '2014'
...
---
_id: '379'
abstract:
- lang: eng
text: In the leasing variant of Set Cover presented by Anthony et al.[1], elements
U arrive over time and must be covered by sets from a familyF of subsets of U.
Each set can be leased for K different periods of time.Let |U| = n and |F| = m.
Leasing a set S for a period k incurs a cost ckS and allows S to cover its elements
for the next lk time steps. The objectiveis to minimize the total cost of the
sets leased, such that elements arrivingat any time t are covered by sets which
contain them and are leased duringtime t. Anthony et al. [1] gave an optimal O(log
n)-approximation forthe problem in the offline setting, unless P = NP [22]. In
this paper, wegive randomized algorithms for variants of Set Cover Leasing in
the onlinesetting, including a generalization of Online Set Cover with Repetitionspresented
by Alon et al. [2], where elements appear multiple times andmust be covered by
a different set at each arrival. Our results improve theO(log2(mn)) competitive
factor of Online Set Cover with Repetitions [2]to O(log d log(dn)) = O(logmlog(mn)),
where d is the maximum numberof sets an element belongs to.
author:
- first_name: Sebastian
full_name: Abshoff, Sebastian
last_name: Abshoff
- 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: 'Abshoff S, Markarian C, Meyer auf der Heide F. Randomized Online Algorithms
for Set Cover Leasing Problems. In: Proceedings of the 8th Annual International
Conference on Combinatorial Optimization and Applications (COCOA). LNCS. ;
2014:25-34. doi:10.1007/978-3-319-12691-3_3'
apa: Abshoff, S., Markarian, C., & Meyer auf der Heide, F. (2014). Randomized
Online Algorithms for Set Cover Leasing Problems. In Proceedings of the 8th
Annual International Conference on Combinatorial Optimization and Applications
(COCOA) (pp. 25–34). https://doi.org/10.1007/978-3-319-12691-3_3
bibtex: '@inproceedings{Abshoff_Markarian_Meyer auf der Heide_2014, series={LNCS},
title={Randomized Online Algorithms for Set Cover Leasing Problems}, DOI={10.1007/978-3-319-12691-3_3},
booktitle={Proceedings of the 8th Annual International Conference on Combinatorial
Optimization and Applications (COCOA)}, author={Abshoff, Sebastian and Markarian,
Christine and Meyer auf der Heide, Friedhelm}, year={2014}, pages={25–34}, collection={LNCS}
}'
chicago: Abshoff, Sebastian, Christine Markarian, and Friedhelm Meyer auf der Heide.
“Randomized Online Algorithms for Set Cover Leasing Problems.” In Proceedings
of the 8th Annual International Conference on Combinatorial Optimization and Applications
(COCOA), 25–34. LNCS, 2014. https://doi.org/10.1007/978-3-319-12691-3_3.
ieee: S. Abshoff, C. Markarian, and F. Meyer auf der Heide, “Randomized Online Algorithms
for Set Cover Leasing Problems,” in Proceedings of the 8th Annual International
Conference on Combinatorial Optimization and Applications (COCOA), 2014, pp.
25–34.
mla: Abshoff, Sebastian, et al. “Randomized Online Algorithms for Set Cover Leasing
Problems.” Proceedings of the 8th Annual International Conference on Combinatorial
Optimization and Applications (COCOA), 2014, pp. 25–34, doi:10.1007/978-3-319-12691-3_3.
short: 'S. Abshoff, C. Markarian, F. Meyer auf der Heide, in: Proceedings of the
8th Annual International Conference on Combinatorial Optimization and Applications
(COCOA), 2014, pp. 25–34.'
date_created: 2017-10-17T12:42:06Z
date_updated: 2022-01-06T06:59:36Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1007/978-3-319-12691-3_3
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:12:57Z
date_updated: 2018-03-20T07:12:57Z
file_id: '1395'
file_name: 379-COCOA14.pdf
file_size: 214299
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:12:57Z
has_accepted_license: '1'
page: 25-34
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 8th Annual International Conference on Combinatorial
Optimization and Applications (COCOA)
series_title: LNCS
status: public
title: Randomized Online Algorithms for Set Cover Leasing Problems
type: conference
user_id: '15504'
year: '2014'
...
---
_id: '380'
abstract:
- lang: eng
text: 'Network creation games model the creation and usage costs of networks formed
by n selfish nodes. Each node v can buy a set of edges, each for a fixed price
α > 0. Its goal is to minimize its private costs, i.e., the sum (SUM-game, Fabrikant
et al., PODC 2003) or maximum (MAX-game, Demaine et al., PODC 2007) of distances
from v to all other nodes plus the prices of the bought edges. The above papers
show the existence of Nash equilibria as well as upper and lower bounds for the
prices of anarchy and stability. In several subsequent papers, these bounds were
improved for a wide range of prices α. In this paper, we extend these models by
incorporating quality-of-service aspects: Each edge cannot only be bought at a
fixed quality (edge length one) for a fixed price α. Instead, we assume that quality
levels (i.e., edge lengths) are varying in a fixed interval [βˇ,β^] , 0 series
= {LNCS}'
author:
- first_name: Andreas
full_name: Cord-Landwehr, Andreas
last_name: Cord-Landwehr
- first_name: Alexander
full_name: Mäcker, Alexander
id: '13536'
last_name: Mäcker
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Cord-Landwehr A, Mäcker A, Meyer auf der Heide F. Quality of Service in Network
Creation Games. In: Proceedings of the 10th International Conference on Web
and Internet Economics (WINE). ; 2014:423-428. doi:10.1007/978-3-319-13129-0_34'
apa: Cord-Landwehr, A., Mäcker, A., & Meyer auf der Heide, F. (2014). Quality
of Service in Network Creation Games. In Proceedings of the 10th International
Conference on Web and Internet Economics (WINE) (pp. 423–428). https://doi.org/10.1007/978-3-319-13129-0_34
bibtex: '@inproceedings{Cord-Landwehr_Mäcker_Meyer auf der Heide_2014, title={Quality
of Service in Network Creation Games}, DOI={10.1007/978-3-319-13129-0_34},
booktitle={Proceedings of the 10th International Conference on Web and Internet
Economics (WINE)}, author={Cord-Landwehr, Andreas and Mäcker, Alexander and Meyer
auf der Heide, Friedhelm}, year={2014}, pages={423–428} }'
chicago: Cord-Landwehr, Andreas, Alexander Mäcker, and Friedhelm Meyer auf der Heide.
“Quality of Service in Network Creation Games.” In Proceedings of the 10th
International Conference on Web and Internet Economics (WINE), 423–28, 2014.
https://doi.org/10.1007/978-3-319-13129-0_34.
ieee: A. Cord-Landwehr, A. Mäcker, and F. Meyer auf der Heide, “Quality of Service
in Network Creation Games,” in Proceedings of the 10th International Conference
on Web and Internet Economics (WINE), 2014, pp. 423–428.
mla: Cord-Landwehr, Andreas, et al. “Quality of Service in Network Creation Games.”
Proceedings of the 10th International Conference on Web and Internet Economics
(WINE), 2014, pp. 423–28, doi:10.1007/978-3-319-13129-0_34.
short: 'A. Cord-Landwehr, A. Mäcker, F. Meyer auf der Heide, in: Proceedings of
the 10th International Conference on Web and Internet Economics (WINE), 2014,
pp. 423–428.'
date_created: 2017-10-17T12:42:06Z
date_updated: 2022-01-06T06:59:36Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1007/978-3-319-13129-0_34
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:05:59Z
date_updated: 2018-03-20T07:05:59Z
file_id: '1394'
file_name: 380-WINE2014.pdf
file_size: 166640
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:05:59Z
has_accepted_license: '1'
page: 423-428
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
publication: Proceedings of the 10th International Conference on Web and Internet
Economics (WINE)
status: public
title: Quality of Service in Network Creation Games
type: conference
user_id: '15504'
year: '2014'
...
---
_id: '3805'
author:
- first_name: Frank
full_name: Brüseke, Frank
last_name: Brüseke
- first_name: Henning
full_name: Wachsmuth, Henning
id: '3900'
last_name: Wachsmuth
- first_name: Gregor
full_name: Engels, Gregor
last_name: Engels
- first_name: Steffen
full_name: Becker, Steffen
last_name: Becker
citation:
ama: 'Brüseke F, Wachsmuth H, Engels G, Becker S. PBlaman: performance blame analysis
based on Palladio contracts. In: Proceedings of the 4th International Symposium
on Autonomous Minirobots for Research and Edutainment. ; 2014:1975-2004.'
apa: 'Brüseke, F., Wachsmuth, H., Engels, G., & Becker, S. (2014). PBlaman:
performance blame analysis based on Palladio contracts. In Proceedings of the
4th International Symposium on Autonomous Minirobots for Research and Edutainment
(pp. 1975–2004).'
bibtex: '@inproceedings{Brüseke_Wachsmuth_Engels_Becker_2014, title={PBlaman: performance
blame analysis based on Palladio contracts}, number={12}, booktitle={Proceedings
of the 4th International Symposium on Autonomous Minirobots for Research and Edutainment},
author={Brüseke, Frank and Wachsmuth, Henning and Engels, Gregor and Becker, Steffen},
year={2014}, pages={1975–2004} }'
chicago: 'Brüseke, Frank, Henning Wachsmuth, Gregor Engels, and Steffen Becker.
“PBlaman: Performance Blame Analysis Based on Palladio Contracts.” In Proceedings
of the 4th International Symposium on Autonomous Minirobots for Research and Edutainment,
1975–2004, 2014.'
ieee: 'F. Brüseke, H. Wachsmuth, G. Engels, and S. Becker, “PBlaman: performance
blame analysis based on Palladio contracts,” in Proceedings of the 4th International
Symposium on Autonomous Minirobots for Research and Edutainment, 2014, no.
12, pp. 1975–2004.'
mla: 'Brüseke, Frank, et al. “PBlaman: Performance Blame Analysis Based on Palladio
Contracts.” Proceedings of the 4th International Symposium on Autonomous Minirobots
for Research and Edutainment, no. 12, 2014, pp. 1975–2004.'
short: 'F. Brüseke, H. Wachsmuth, G. Engels, S. Becker, in: Proceedings of the 4th
International Symposium on Autonomous Minirobots for Research and Edutainment,
2014, pp. 1975–2004.'
date_created: 2018-08-02T13:38:28Z
date_updated: 2022-01-06T06:59:36Z
department:
- _id: '600'
issue: '12'
language:
- iso: eng
page: 1975-2004
publication: Proceedings of the 4th International Symposium on Autonomous Minirobots
for Research and Edutainment
status: public
title: 'PBlaman: performance blame analysis based on Palladio contracts'
type: conference
user_id: '82920'
year: '2014'
...
---
_id: '382'
abstract:
- lang: eng
text: This paper explores how cloud provider competition influences instance pricing
in an IaaS (Infrastructure-as-a-Service) market. When reserved instance pricing
includes an on-demand price component in addition to a reservation fee (two-part
tariffs), different providers might offer different price combinations, where
the client’s choice depends on its load profile. We investigate a duopoly of providers
and analyze stable market prices in two-part tariffs. Further, we study offers
that allow a specified amount of included usage (three-part tariffs). Neither two-part
nor three-part tariffs produce an equilibrium market outcome other than a service
pricing that equals production cost, i.e., complex price structures do not significantly
affect the results from ordinary Bertrand competition.
author:
- first_name: Jörn
full_name: Künsemöller, Jörn
last_name: Künsemöller
- first_name: Sonja
full_name: Brangewitz, Sonja
last_name: Brangewitz
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
- first_name: Claus-Jochen
full_name: Haake, Claus-Jochen
id: '20801'
last_name: Haake
citation:
ama: 'Künsemöller J, Brangewitz S, Karl H, Haake C-J. Provider Competition in Infrastructure-as-a-Service.
In: Proceedings of the 2014 IEEE International Conference on Services Computing
(SCC). ; 2014:203-210. doi:10.1109/SCC.2014.35'
apa: Künsemöller, J., Brangewitz, S., Karl, H., & Haake, C.-J. (2014). Provider
Competition in Infrastructure-as-a-Service. In Proceedings of the 2014 IEEE
International Conference on Services Computing (SCC) (pp. 203–210). https://doi.org/10.1109/SCC.2014.35
bibtex: '@inproceedings{Künsemöller_Brangewitz_Karl_Haake_2014, title={Provider
Competition in Infrastructure-as-a-Service}, DOI={10.1109/SCC.2014.35},
booktitle={Proceedings of the 2014 IEEE International Conference on Services Computing
(SCC)}, author={Künsemöller, Jörn and Brangewitz, Sonja and Karl, Holger and Haake,
Claus-Jochen}, year={2014}, pages={203–210} }'
chicago: Künsemöller, Jörn, Sonja Brangewitz, Holger Karl, and Claus-Jochen Haake.
“Provider Competition in Infrastructure-as-a-Service.” In Proceedings of the
2014 IEEE International Conference on Services Computing (SCC), 203–10, 2014.
https://doi.org/10.1109/SCC.2014.35.
ieee: J. Künsemöller, S. Brangewitz, H. Karl, and C.-J. Haake, “Provider Competition
in Infrastructure-as-a-Service,” in Proceedings of the 2014 IEEE International
Conference on Services Computing (SCC), 2014, pp. 203–210.
mla: Künsemöller, Jörn, et al. “Provider Competition in Infrastructure-as-a-Service.”
Proceedings of the 2014 IEEE International Conference on Services Computing
(SCC), 2014, pp. 203–10, doi:10.1109/SCC.2014.35.
short: 'J. Künsemöller, S. Brangewitz, H. Karl, C.-J. Haake, in: Proceedings of
the 2014 IEEE International Conference on Services Computing (SCC), 2014, pp.
203–210.'
date_created: 2017-10-17T12:42:06Z
date_updated: 2022-01-06T06:59:37Z
ddc:
- '004'
department:
- _id: '75'
- _id: '205'
doi: 10.1109/SCC.2014.35
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T13:34:46Z
date_updated: 2018-11-02T13:34:46Z
file_id: '5250'
file_name: 06930535.pdf
file_size: 228172
relation: main_file
success: 1
file_date_updated: 2018-11-02T13:34:46Z
has_accepted_license: '1'
language:
- iso: eng
page: 203-210
project:
- _id: '1'
name: SFB 901
- _id: '6'
name: SFB 901 - Subprojekt A2
- _id: '7'
name: SFB 901 - Subproject A3
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 2014 IEEE International Conference on Services Computing
(SCC)
status: public
title: Provider Competition in Infrastructure-as-a-Service
type: conference
user_id: '477'
year: '2014'
...
---
_id: '383'
abstract:
- lang: eng
text: Proof-carrying code approaches aim at safe execution of untrusted code by
having the code producer attach a safety proof to the code which the code consumer
only has to validate. Depending on the type of safety property, proofs can however
become quite large and their validation - though faster than their construction
- still time consuming. In this paper we introduce a new concept for safe execution
of untrusted code. It keeps the idea of putting the time consuming part of proving
on the side of the code producer, however, attaches no proofs to code anymore
but instead uses the proof to transform the program into an equivalent but more
efficiently verifiable program. Code consumers thus still do proving themselves,
however, on a computationally inexpensive level only. Experimental results show
that the proof effort can be reduced by several orders of magnitude, both with
respect to time and space.
author:
- first_name: Daniel
full_name: Wonisch, Daniel
last_name: Wonisch
- first_name: Alexander
full_name: Schremmer, Alexander
last_name: Schremmer
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Wonisch D, Schremmer A, Wehrheim H. Programs from Proofs -- Approach and Applications.
In: Proceedings of the Software Engineering Conference (SE). Lecture Notes
in Informatics (LNI). ; 2014:67-68.'
apa: Wonisch, D., Schremmer, A., & Wehrheim, H. (2014). Programs from Proofs
-- Approach and Applications. In Proceedings of the Software Engineering Conference
(SE) (pp. 67–68).
bibtex: '@inproceedings{Wonisch_Schremmer_Wehrheim_2014, series={Lecture Notes in
Informatics (LNI)}, title={Programs from Proofs -- Approach and Applications},
booktitle={Proceedings of the Software Engineering Conference (SE)}, author={Wonisch,
Daniel and Schremmer, Alexander and Wehrheim, Heike}, year={2014}, pages={67–68},
collection={Lecture Notes in Informatics (LNI)} }'
chicago: Wonisch, Daniel, Alexander Schremmer, and Heike Wehrheim. “Programs from
Proofs -- Approach and Applications.” In Proceedings of the Software Engineering
Conference (SE), 67–68. Lecture Notes in Informatics (LNI), 2014.
ieee: D. Wonisch, A. Schremmer, and H. Wehrheim, “Programs from Proofs -- Approach
and Applications,” in Proceedings of the Software Engineering Conference (SE),
2014, pp. 67–68.
mla: Wonisch, Daniel, et al. “Programs from Proofs -- Approach and Applications.”
Proceedings of the Software Engineering Conference (SE), 2014, pp. 67–68.
short: 'D. Wonisch, A. Schremmer, H. Wehrheim, in: Proceedings of the Software Engineering
Conference (SE), 2014, pp. 67–68.'
date_created: 2017-10-17T12:42:06Z
date_updated: 2022-01-06T06:59:38Z
ddc:
- '040'
department:
- _id: '77'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:04:52Z
date_updated: 2018-03-20T07:04:52Z
file_id: '1392'
file_name: 383-programmsFromProofsSE.pdf
file_size: 66474
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:04:52Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- url: http://eprints.uni-kiel.de/23752/
page: 67-68
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 Software Engineering Conference (SE)
series_title: Lecture Notes in Informatics (LNI)
status: public
title: Programs from Proofs -- Approach and Applications
type: conference
user_id: '477'
year: '2014'
...
---
_id: '387'
abstract:
- lang: eng
text: This article studies the design of medium access control (MAC) protocols for
wireless networks that are provably robust against arbitrary and unpredictable
disruptions (e.g., due to unintentional external interference from co-existing
networks or due to jamming). We consider a wireless network consisting of a set
of n honest and reliable nodes within transmission (and interference) range of
each other, and we model the external disruptions with a powerful adaptive adversary.
This adversary may know the protocol and its entire history and can use this knowledge
to jam the wireless channel at will at any time. It is allowed to jam a (1 − )-fraction
of the timesteps, for an arbitrary constant > 0 unknown to the nodes. The nodes
cannot distinguish between the adversarial jamming or a collision of two or more
messages that are sent at the same time. We demonstrate, for the first time, that
there is a local-control MAC protocol requiring only very limited knowledge about
the adversary and the network that achieves a constant (asymptotically optimal)
throughput for the nonjammed time periods under any of the aforementioned adversarial
strategies. The derived principles are also useful to build robust applications
on top of the MAC layer, and we present an exemplary study for leader election,
one of the most fundamental tasks in distributed computing.
author:
- first_name: Baruch
full_name: Awerbuch, Baruch
last_name: Awerbuch
- first_name: Andrea W.
full_name: Richa, Andrea W.
last_name: Richa
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
- first_name: Jin
full_name: Zhang, Jin
last_name: Zhang
citation:
ama: Awerbuch B, Richa AW, Scheideler C, Schmid S, Zhang J. Principles of Robust
Medium Access and an Application to Leader Election. Transactions on Algorithms.
2014;(4). doi:10.1145/2635818
apa: Awerbuch, B., Richa, A. W., Scheideler, C., Schmid, S., & Zhang, J. (2014).
Principles of Robust Medium Access and an Application to Leader Election. Transactions
on Algorithms, (4). https://doi.org/10.1145/2635818
bibtex: '@article{Awerbuch_Richa_Scheideler_Schmid_Zhang_2014, title={Principles
of Robust Medium Access and an Application to Leader Election}, DOI={10.1145/2635818},
number={4}, journal={Transactions on Algorithms}, publisher={ACM}, author={Awerbuch,
Baruch and Richa, Andrea W. and Scheideler, Christian and Schmid, Stefan and Zhang,
Jin}, year={2014} }'
chicago: Awerbuch, Baruch, Andrea W. Richa, Christian Scheideler, Stefan Schmid,
and Jin Zhang. “Principles of Robust Medium Access and an Application to Leader
Election.” Transactions on Algorithms, no. 4 (2014). https://doi.org/10.1145/2635818.
ieee: B. Awerbuch, A. W. Richa, C. Scheideler, S. Schmid, and J. Zhang, “Principles
of Robust Medium Access and an Application to Leader Election,” Transactions
on Algorithms, no. 4, 2014.
mla: Awerbuch, Baruch, et al. “Principles of Robust Medium Access and an Application
to Leader Election.” Transactions on Algorithms, no. 4, ACM, 2014, doi:10.1145/2635818.
short: B. Awerbuch, A.W. Richa, C. Scheideler, S. Schmid, J. Zhang, Transactions
on Algorithms (2014).
date_created: 2017-10-17T12:42:07Z
date_updated: 2022-01-06T06:59:47Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1145/2635818
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:02:33Z
date_updated: 2018-03-20T07:02:33Z
file_id: '1388'
file_name: 387-a24-awerbuch_2_.pdf
file_size: 521454
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:02:33Z
has_accepted_license: '1'
issue: '4'
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
publication: Transactions on Algorithms
publisher: ACM
status: public
title: Principles of Robust Medium Access and an Application to Leader Election
type: journal_article
user_id: '477'
year: '2014'
...
---
_id: '3877'
author:
- first_name: Henning
full_name: Wachsmuth, Henning
id: '3900'
last_name: Wachsmuth
- first_name: Martin
full_name: Trenkmann, Martin
last_name: Trenkmann
- first_name: Benno
full_name: Stein, Benno
last_name: Stein
- first_name: Gregor
full_name: Engels, Gregor
last_name: Engels
citation:
ama: 'Wachsmuth H, Trenkmann M, Stein B, Engels G. Modeling Review Argumentation
for Robust Sentiment Analysis. In: Proceedings of COLING 2014, the 25th International
Conference on Computational Linguistics: Technical Papers. ; 2014:553-564.'
apa: 'Wachsmuth, H., Trenkmann, M., Stein, B., & Engels, G. (2014). Modeling
Review Argumentation for Robust Sentiment Analysis. In Proceedings of COLING
2014, the 25th International Conference on Computational Linguistics: Technical
Papers (pp. 553–564).'
bibtex: '@inproceedings{Wachsmuth_Trenkmann_Stein_Engels_2014, title={Modeling Review
Argumentation for Robust Sentiment Analysis}, booktitle={Proceedings of COLING
2014, the 25th International Conference on Computational Linguistics: Technical
Papers}, author={Wachsmuth, Henning and Trenkmann, Martin and Stein, Benno and
Engels, Gregor}, year={2014}, pages={553–564} }'
chicago: 'Wachsmuth, Henning, Martin Trenkmann, Benno Stein, and Gregor Engels.
“Modeling Review Argumentation for Robust Sentiment Analysis.” In Proceedings
of COLING 2014, the 25th International Conference on Computational Linguistics:
Technical Papers, 553–64, 2014.'
ieee: 'H. Wachsmuth, M. Trenkmann, B. Stein, and G. Engels, “Modeling Review Argumentation
for Robust Sentiment Analysis,” in Proceedings of COLING 2014, the 25th International
Conference on Computational Linguistics: Technical Papers, 2014, pp. 553–564.'
mla: 'Wachsmuth, Henning, et al. “Modeling Review Argumentation for Robust Sentiment
Analysis.” Proceedings of COLING 2014, the 25th International Conference on
Computational Linguistics: Technical Papers, 2014, pp. 553–64.'
short: 'H. Wachsmuth, M. Trenkmann, B. Stein, G. Engels, in: Proceedings of COLING
2014, the 25th International Conference on Computational Linguistics: Technical
Papers, 2014, pp. 553–564.'
date_created: 2018-08-11T16:13:24Z
date_updated: 2022-01-06T06:59:47Z
department:
- _id: '600'
language:
- iso: eng
main_file_link:
- url: https://www.aclweb.org/anthology/C14-1053.pdf
page: 553-564
publication: 'Proceedings of COLING 2014, the 25th International Conference on Computational
Linguistics: Technical Papers'
status: public
title: Modeling Review Argumentation for Robust Sentiment Analysis
type: conference
user_id: '82920'
year: '2014'
...
---
_id: '390'
abstract:
- lang: eng
text: 'In software markets of the future, customer-specific software will be developed
on demand based on distributed software and hardware services. Based on a customer-specific
request, available service offers have to be discovered and composed into sophisticated
IT services that fulfill the customer''s request.A prerequisite of this vision
are rich service descriptions, which comprise structural as well as behavioral
aspects of the services, otherwise an accurate service discovery and composition
is not possible. However, automatic matching of service requests and offers specified
in rich service descriptions for the purpose of service discovery is a complex
task, due to the multifaceted heterogeneity of the service partners. This heterogeneity
includes the use of different specification languages, different underlying ontologies,
or different levels of granularity in the specification itself.In this article,
we present a comprehensive approach for service discovery and composition, which
overcomes the underlying heterogeneity of the service partners. Based on a realistic
case study of our industrial partner from the e-tourism domain, we first introduce
an automatic matching mechanism for service requests and offers specified in a
rich service description language. In addition, we propose an automatic service
composition approach, which determines possible service compositions by composing
the service protocols through a composition strategy based on labeled transition
systems. '
author:
- first_name: Zille
full_name: Huma, Zille
last_name: Huma
- first_name: Christian
full_name: Gerth, Christian
last_name: Gerth
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
citation:
ama: 'Huma Z, Gerth C, Engels G. On-the-Fly Computing: Automatic Service Discovery
and Composition in Heterogeneous Domains. Computer Science - Research and Development.
2014;(3-4):333-361. doi:10.1007/s00450-014-0254-z'
apa: 'Huma, Z., Gerth, C., & Engels, G. (2014). On-the-Fly Computing: Automatic
Service Discovery and Composition in Heterogeneous Domains. Computer Science
- Research and Development, (3–4), 333–361. https://doi.org/10.1007/s00450-014-0254-z'
bibtex: '@article{Huma_Gerth_Engels_2014, title={On-the-Fly Computing: Automatic
Service Discovery and Composition in Heterogeneous Domains}, DOI={10.1007/s00450-014-0254-z},
number={3–4}, journal={Computer Science - Research and Development}, publisher={Springer},
author={Huma, Zille and Gerth, Christian and Engels, Gregor}, year={2014}, pages={333–361}
}'
chicago: 'Huma, Zille, Christian Gerth, and Gregor Engels. “On-the-Fly Computing:
Automatic Service Discovery and Composition in Heterogeneous Domains.” Computer
Science - Research and Development, no. 3–4 (2014): 333–61. https://doi.org/10.1007/s00450-014-0254-z.'
ieee: 'Z. Huma, C. Gerth, and G. Engels, “On-the-Fly Computing: Automatic Service
Discovery and Composition in Heterogeneous Domains,” Computer Science - Research
and Development, no. 3–4, pp. 333–361, 2014.'
mla: 'Huma, Zille, et al. “On-the-Fly Computing: Automatic Service Discovery and
Composition in Heterogeneous Domains.” Computer Science - Research and Development,
no. 3–4, Springer, 2014, pp. 333–61, doi:10.1007/s00450-014-0254-z.'
short: Z. Huma, C. Gerth, G. Engels, Computer Science - Research and Development
(2014) 333–361.
date_created: 2017-10-17T12:42:08Z
date_updated: 2022-01-06T06:59:52Z
ddc:
- '040'
department:
- _id: '66'
doi: 10.1007/s00450-014-0254-z
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:00:58Z
date_updated: 2018-03-20T07:00:58Z
file_id: '1385'
file_name: 390-HGE14.pdf
file_size: 4644980
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:00:58Z
has_accepted_license: '1'
issue: 3-4
language:
- iso: eng
page: 333-361
project:
- _id: '1'
name: SFB 901
- _id: '9'
name: SFB 901 - Subprojekt B1
- _id: '3'
name: SFB 901 - Project Area B
publication: Computer Science - Research and Development
publisher: Springer
status: public
title: 'On-the-Fly Computing: Automatic Service Discovery and Composition in Heterogeneous
Domains'
type: journal_article
user_id: '477'
year: '2014'
...
---
_id: '3905'
author:
- first_name: Chamsi
full_name: Abu Quba Rana, Chamsi
last_name: Abu Quba Rana
- first_name: Salima
full_name: Hassas, Salima
last_name: Hassas
- first_name: Fayyad
full_name: Usama, Fayyad
last_name: Usama
- first_name: Milad
full_name: Alshomary, Milad
id: '73059'
last_name: Alshomary
- first_name: Christine
full_name: Gertosio, Christine
last_name: Gertosio
citation:
ama: 'Abu Quba Rana C, Hassas S, Usama F, Alshomary M, Gertosio C. iSoNTRE: The
Social Network Transformer into Recommendation Engine. 2014 IEEE/ACS 11th International
Conference on Computer Systems and Applications (AICCSA). 2014:169-175.'
apa: 'Abu Quba Rana, C., Hassas, S., Usama, F., Alshomary, M., & Gertosio, C.
(2014). iSoNTRE: The Social Network Transformer into Recommendation Engine. 2014
IEEE/ACS 11th International Conference on Computer Systems and Applications (AICCSA),
169–175.'
bibtex: '@article{Abu Quba Rana_Hassas_Usama_Alshomary_Gertosio_2014, title={iSoNTRE:
The Social Network Transformer into Recommendation Engine}, journal={2014 IEEE/ACS
11th International Conference on Computer Systems and Applications (AICCSA)},
author={Abu Quba Rana, Chamsi and Hassas, Salima and Usama, Fayyad and Alshomary,
Milad and Gertosio, Christine}, year={2014}, pages={169–175} }'
chicago: 'Abu Quba Rana, Chamsi, Salima Hassas, Fayyad Usama, Milad Alshomary, and
Christine Gertosio. “ISoNTRE: The Social Network Transformer into Recommendation
Engine.” 2014 IEEE/ACS 11th International Conference on Computer Systems and
Applications (AICCSA), 2014, 169–75.'
ieee: 'C. Abu Quba Rana, S. Hassas, F. Usama, M. Alshomary, and C. Gertosio, “iSoNTRE:
The Social Network Transformer into Recommendation Engine,” 2014 IEEE/ACS 11th
International Conference on Computer Systems and Applications (AICCSA), pp.
169–175, 2014.'
mla: 'Abu Quba Rana, Chamsi, et al. “ISoNTRE: The Social Network Transformer into
Recommendation Engine.” 2014 IEEE/ACS 11th International Conference on Computer
Systems and Applications (AICCSA), 2014, pp. 169–75.'
short: C. Abu Quba Rana, S. Hassas, F. Usama, M. Alshomary, C. Gertosio, 2014 IEEE/ACS
11th International Conference on Computer Systems and Applications (AICCSA) (2014)
169–175.
date_created: 2018-08-14T13:35:39Z
date_updated: 2022-01-06T06:59:54Z
department:
- _id: '600'
language:
- iso: eng
main_file_link:
- url: https://ieeexplore.ieee.org/document/7073195
page: 169-175
publication: 2014 IEEE/ACS 11th International Conference on Computer Systems and Applications
(AICCSA)
status: public
title: 'iSoNTRE: The Social Network Transformer into Recommendation Engine'
type: journal_article
user_id: '73059'
year: '2014'
...
---
_id: '2900'
author:
- first_name: Sascha
full_name: Brauer, Sascha
id: '13291'
last_name: Brauer
citation:
ama: Brauer S. A Probabilistic Expectation Maximization Algorithm for Multivariate
Laplacian Mixtures.; 2014.
apa: Brauer, S. (2014). A Probabilistic Expectation Maximization Algorithm for
Multivariate Laplacian Mixtures.
bibtex: '@book{Brauer_2014, title={A Probabilistic Expectation Maximization Algorithm
for Multivariate Laplacian Mixtures}, author={Brauer, Sascha}, year={2014} }'
chicago: Brauer, Sascha. A Probabilistic Expectation Maximization Algorithm for
Multivariate Laplacian Mixtures, 2014.
ieee: S. Brauer, A Probabilistic Expectation Maximization Algorithm for Multivariate
Laplacian Mixtures. 2014.
mla: Brauer, Sascha. A Probabilistic Expectation Maximization Algorithm for Multivariate
Laplacian Mixtures. 2014.
short: S. Brauer, A Probabilistic Expectation Maximization Algorithm for Multivariate
Laplacian Mixtures, 2014.
date_created: 2018-05-25T09:45:38Z
date_updated: 2022-01-06T06:58:44Z
ddc:
- '000'
department:
- _id: '64'
file:
- access_level: closed
content_type: application/pdf
creator: feidens
date_created: 2018-05-25T09:45:33Z
date_updated: 2018-05-25T09:45:33Z
file_id: '2901'
file_name: 2014_Brauer_AProbabilisticExpectationMaximizationAlgorithmForMultivariateLaplacianMixtures.pdf
file_size: 971935
relation: main_file
success: 1
file_date_updated: 2018-05-25T09:45:33Z
has_accepted_license: '1'
status: public
supervisor:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
title: A Probabilistic Expectation Maximization Algorithm for Multivariate Laplacian
Mixtures
type: mastersthesis
user_id: '25078'
year: '2014'
...
---
_id: '2976'
author:
- first_name: Marcel Rudolf
full_name: Ackermann, Marcel Rudolf
last_name: Ackermann
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
- first_name: Daniel
full_name: Kuntze, Daniel
last_name: Kuntze
- first_name: Christian
full_name: Sohler, Christian
last_name: Sohler
citation:
ama: Ackermann MR, Blömer J, Kuntze D, Sohler C. Analysis of Agglomerative Clustering.
Algorithmica. 2014;69. doi:10.1007/s00453-012-9717-4
apa: Ackermann, M. R., Blömer, J., Kuntze, D., & Sohler, C. (2014). Analysis
of Agglomerative Clustering. Algorithmica, 69. https://doi.org/10.1007/s00453-012-9717-4
bibtex: '@article{Ackermann_Blömer_Kuntze_Sohler_2014, title={Analysis of Agglomerative
Clustering}, volume={69}, DOI={10.1007/s00453-012-9717-4},
journal={Algorithmica}, publisher={Springer US}, author={Ackermann, Marcel Rudolf
and Blömer, Johannes and Kuntze, Daniel and Sohler, Christian}, year={2014} }'
chicago: Ackermann, Marcel Rudolf, Johannes Blömer, Daniel Kuntze, and Christian
Sohler. “Analysis of Agglomerative Clustering.” Algorithmica 69 (2014).
https://doi.org/10.1007/s00453-012-9717-4.
ieee: M. R. Ackermann, J. Blömer, D. Kuntze, and C. Sohler, “Analysis of Agglomerative
Clustering,” Algorithmica, vol. 69, 2014.
mla: Ackermann, Marcel Rudolf, et al. “Analysis of Agglomerative Clustering.” Algorithmica,
vol. 69, Springer US, 2014, doi:10.1007/s00453-012-9717-4.
short: M.R. Ackermann, J. Blömer, D. Kuntze, C. Sohler, Algorithmica 69 (2014).
date_created: 2018-06-05T07:28:52Z
date_updated: 2022-01-06T06:58:49Z
department:
- _id: '64'
doi: 10.1007/s00453-012-9717-4
intvolume: ' 69'
publication: Algorithmica
publication_identifier:
eissn:
- 0178-4617
publication_status: published
publisher: Springer US
status: public
title: Analysis of Agglomerative Clustering
type: journal_article
user_id: '25078'
volume: 69
year: '2014'
...
---
_id: '2977'
author:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
- first_name: Kathrin
full_name: Bujna, Kathrin
last_name: Bujna
- first_name: Daniel
full_name: Kuntze, Daniel
last_name: Kuntze
citation:
ama: 'Blömer J, Bujna K, Kuntze D. A Theoretical and Experimental Comparison of
the EM and SEM Algorithm. In: 2014 22nd International Conference on Pattern
Recognition. IEEE; 2014. doi:10.1109/icpr.2014.253'
apa: Blömer, J., Bujna, K., & Kuntze, D. (2014). A Theoretical and Experimental
Comparison of the EM and SEM Algorithm. In 2014 22nd International Conference
on Pattern Recognition. IEEE. https://doi.org/10.1109/icpr.2014.253
bibtex: '@inproceedings{Blömer_Bujna_Kuntze_2014, title={A Theoretical and Experimental
Comparison of the EM and SEM Algorithm}, DOI={10.1109/icpr.2014.253},
booktitle={2014 22nd International Conference on Pattern Recognition}, publisher={IEEE},
author={Blömer, Johannes and Bujna, Kathrin and Kuntze, Daniel}, year={2014} }'
chicago: Blömer, Johannes, Kathrin Bujna, and Daniel Kuntze. “A Theoretical and
Experimental Comparison of the EM and SEM Algorithm.” In 2014 22nd International
Conference on Pattern Recognition. IEEE, 2014. https://doi.org/10.1109/icpr.2014.253.
ieee: J. Blömer, K. Bujna, and D. Kuntze, “A Theoretical and Experimental Comparison
of the EM and SEM Algorithm,” in 2014 22nd International Conference on Pattern
Recognition, 2014.
mla: Blömer, Johannes, et al. “A Theoretical and Experimental Comparison of the
EM and SEM Algorithm.” 2014 22nd International Conference on Pattern Recognition,
IEEE, 2014, doi:10.1109/icpr.2014.253.
short: 'J. Blömer, K. Bujna, D. Kuntze, in: 2014 22nd International Conference on
Pattern Recognition, IEEE, 2014.'
date_created: 2018-06-05T07:29:15Z
date_updated: 2022-01-06T06:58:49Z
department:
- _id: '64'
doi: 10.1109/icpr.2014.253
publication: 2014 22nd International Conference on Pattern Recognition
publication_identifier:
isbn:
- '9781479952090'
publication_status: published
publisher: IEEE
status: public
title: A Theoretical and Experimental Comparison of the EM and SEM Algorithm
type: conference
user_id: '25078'
year: '2014'
...
---
_id: '3127'
author:
- first_name: Tibor
full_name: Jager, Tibor
id: '64669'
last_name: Jager
citation:
ama: Jager T. Die Zukunft der Kryptographie. Datenschutz und Datensicherheit.
2014;(7):445--451. doi:10.1007/s11623-014-0204-8
apa: Jager, T. (2014). Die Zukunft der Kryptographie. Datenschutz Und Datensicherheit,
(7), 445--451. https://doi.org/10.1007/s11623-014-0204-8
bibtex: '@article{Jager_2014, title={Die Zukunft der Kryptographie}, DOI={10.1007/s11623-014-0204-8},
number={7}, journal={Datenschutz und Datensicherheit}, author={Jager, Tibor},
year={2014}, pages={445--451} }'
chicago: 'Jager, Tibor. “Die Zukunft Der Kryptographie.” Datenschutz Und Datensicherheit,
no. 7 (2014): 445--451. https://doi.org/10.1007/s11623-014-0204-8.'
ieee: T. Jager, “Die Zukunft der Kryptographie,” Datenschutz und Datensicherheit,
no. 7, pp. 445--451, 2014.
mla: Jager, Tibor. “Die Zukunft Der Kryptographie.” Datenschutz Und Datensicherheit,
no. 7, 2014, pp. 445--451, doi:10.1007/s11623-014-0204-8.
short: T. Jager, Datenschutz Und Datensicherheit (2014) 445--451.
date_created: 2018-06-07T09:21:18Z
date_updated: 2022-01-06T06:58:57Z
department:
- _id: '558'
doi: 10.1007/s11623-014-0204-8
extern: '1'
issue: '7'
page: 445--451
publication: Datenschutz und Datensicherheit
status: public
title: Die Zukunft der Kryptographie
type: journal_article
user_id: '38235'
year: '2014'
...
---
_id: '3128'
author:
- first_name: Nils
full_name: Fleischhacker, Nils
last_name: Fleischhacker
- first_name: Tibor
full_name: Jager, Tibor
id: '64669'
last_name: Jager
- first_name: Dominique
full_name: Schröder, Dominique
last_name: Schröder
citation:
ama: 'Fleischhacker N, Jager T, Schröder D. On Tight Security Proofs for Schnorr
Signatures. In: Advances in Cryptology - ASIACRYPT 2014 - 20th International
Conference on the Theory and Application of Cryptology and Information Security,
Kaoshiung, Taiwan, R.O.C., December 7-11, 2014. Proceedings, Part I. ; 2014:512--531.
doi:10.1007/978-3-662-45611-8_27'
apa: Fleischhacker, N., Jager, T., & Schröder, D. (2014). On Tight Security
Proofs for Schnorr Signatures. In Advances in Cryptology - ASIACRYPT 2014 -
20th International Conference on the Theory and Application of Cryptology and
Information Security, Kaoshiung, Taiwan, R.O.C., December 7-11, 2014. Proceedings,
Part I (pp. 512--531). https://doi.org/10.1007/978-3-662-45611-8_27
bibtex: '@inproceedings{Fleischhacker_Jager_Schröder_2014, title={On Tight Security
Proofs for Schnorr Signatures}, DOI={10.1007/978-3-662-45611-8_27},
booktitle={Advances in Cryptology - ASIACRYPT 2014 - 20th International Conference
on the Theory and Application of Cryptology and Information Security, Kaoshiung,
Taiwan, R.O.C., December 7-11, 2014. Proceedings, Part I}, author={Fleischhacker,
Nils and Jager, Tibor and Schröder, Dominique}, year={2014}, pages={512--531}
}'
chicago: Fleischhacker, Nils, Tibor Jager, and Dominique Schröder. “On Tight Security
Proofs for Schnorr Signatures.” In Advances in Cryptology - ASIACRYPT 2014
- 20th International Conference on the Theory and Application of Cryptology and
Information Security, Kaoshiung, Taiwan, R.O.C., December 7-11, 2014. Proceedings,
Part I, 512--531, 2014. https://doi.org/10.1007/978-3-662-45611-8_27.
ieee: N. Fleischhacker, T. Jager, and D. Schröder, “On Tight Security Proofs for
Schnorr Signatures,” in Advances in Cryptology - ASIACRYPT 2014 - 20th International
Conference on the Theory and Application of Cryptology and Information Security,
Kaoshiung, Taiwan, R.O.C., December 7-11, 2014. Proceedings, Part I, 2014,
pp. 512--531.
mla: Fleischhacker, Nils, et al. “On Tight Security Proofs for Schnorr Signatures.”
Advances in Cryptology - ASIACRYPT 2014 - 20th International Conference on
the Theory and Application of Cryptology and Information Security, Kaoshiung,
Taiwan, R.O.C., December 7-11, 2014. Proceedings, Part I, 2014, pp. 512--531,
doi:10.1007/978-3-662-45611-8_27.
short: 'N. Fleischhacker, T. Jager, D. Schröder, in: Advances in Cryptology - ASIACRYPT
2014 - 20th International Conference on the Theory and Application of Cryptology
and Information Security, Kaoshiung, Taiwan, R.O.C., December 7-11, 2014. Proceedings,
Part I, 2014, pp. 512--531.'
date_created: 2018-06-07T09:21:46Z
date_updated: 2022-01-06T06:58:57Z
department:
- _id: '558'
doi: 10.1007/978-3-662-45611-8_27
extern: '1'
page: 512--531
publication: Advances in Cryptology - ASIACRYPT 2014 - 20th International Conference
on the Theory and Application of Cryptology and Information Security, Kaoshiung,
Taiwan, R.O.C., December 7-11, 2014. Proceedings, Part I
status: public
title: On Tight Security Proofs for Schnorr Signatures
type: conference
user_id: '38235'
year: '2014'
...