---
_id: '339'
abstract:
- lang: eng
text: 'Preemptive Routing and Wavelength Assignment (RWA) algorithms preempt established
lightpaths in case notenough resources are available to set up a new lightpath
in aWavelength Division Multiplexing (WDM) network. The selectionof lightpaths
to be preempted relies on internal decisions of theRWA algorithm. Thus, if dedicated
properties of the networktopology are required by the applications running on
the network,these requirements have to be known to the RWA algorithm.We present
a family of preemptive RWA algorithms for WDMnetworks. These algorithms have two
distinguishing features: a)they can handle dynamic traffic by on-the-fly reconfiguration,and
b) users can give feedback for reconfiguration decisions andthus influence the
preemption decision of the RWA algorithm,leading to networks which adapt directly
to application needs.This is different from traffic engineering where the network
is(slowly) adapted to observed traffic patterns.Our algorithms handle various
WDM network configurationsincluding networks consisting of heterogeneous WDM hardware.To
this end, we are using the layered graph approach togetherwith a newly developed
graph model that is used to determineconflicting lightpaths.'
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. Using Application Layer Knowledge in Routing and Wavelength
Assignment Algorithms. In: Proceedings of the IEEE International Conference
on Communications 2014. ; 2014:3270-3276. doi:10.1109/ICC.2014.6883825'
apa: Wette, P., & Karl, H. (2014). Using Application Layer Knowledge in Routing
and Wavelength Assignment Algorithms. In Proceedings of the IEEE International
Conference on Communications 2014 (pp. 3270–3276). https://doi.org/10.1109/ICC.2014.6883825
bibtex: '@inproceedings{Wette_Karl_2014, title={Using Application Layer Knowledge
in Routing and Wavelength Assignment Algorithms}, DOI={10.1109/ICC.2014.6883825},
booktitle={Proceedings of the IEEE International Conference on Communications
2014}, author={Wette, Philip and Karl, Holger}, year={2014}, pages={3270–3276}
}'
chicago: Wette, Philip, and Holger Karl. “Using Application Layer Knowledge in Routing
and Wavelength Assignment Algorithms.” In Proceedings of the IEEE International
Conference on Communications 2014, 3270–76, 2014. https://doi.org/10.1109/ICC.2014.6883825.
ieee: P. Wette and H. Karl, “Using Application Layer Knowledge in Routing and Wavelength
Assignment Algorithms,” in Proceedings of the IEEE International Conference
on Communications 2014, 2014, pp. 3270–3276.
mla: Wette, Philip, and Holger Karl. “Using Application Layer Knowledge in Routing
and Wavelength Assignment Algorithms.” Proceedings of the IEEE International
Conference on Communications 2014, 2014, pp. 3270–76, doi:10.1109/ICC.2014.6883825.
short: 'P. Wette, H. Karl, in: Proceedings of the IEEE International Conference
on Communications 2014, 2014, pp. 3270–3276.'
date_created: 2017-10-17T12:41:58Z
date_updated: 2022-01-06T06:59:14Z
ddc:
- '040'
department:
- _id: '75'
doi: 10.1109/ICC.2014.6883825
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:29:00Z
date_updated: 2018-03-20T07:29:00Z
file_id: '1422'
file_name: 339-IEEE-WK-14.pdf
file_size: 138062
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:29:00Z
has_accepted_license: '1'
page: 3270-3276
project:
- _id: '1'
name: SFB 901
- _id: '6'
name: SFB 901 - Subproject A2
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the IEEE International Conference on Communications 2014
status: public
title: Using Application Layer Knowledge in Routing and Wavelength Assignment Algorithms
type: conference
user_id: '15504'
year: '2014'
...
---
_id: '341'
author:
- first_name: Terry
full_name: Fang Cheng, Terry
last_name: Fang Cheng
citation:
ama: Fang Cheng T. Two-Sided Market and Game Console Vendors. Universität
Paderborn; 2014.
apa: Fang Cheng, T. (2014). Two-Sided Market and Game Console Vendors. Universität
Paderborn.
bibtex: '@book{Fang Cheng_2014, title={Two-Sided Market and Game Console Vendors},
publisher={Universität Paderborn}, author={Fang Cheng, Terry}, year={2014} }'
chicago: Fang Cheng, Terry. Two-Sided Market and Game Console Vendors. Universität
Paderborn, 2014.
ieee: T. Fang Cheng, Two-Sided Market and Game Console Vendors. Universität
Paderborn, 2014.
mla: Fang Cheng, Terry. Two-Sided Market and Game Console Vendors. Universität
Paderborn, 2014.
short: T. Fang Cheng, Two-Sided Market and Game Console Vendors, Universität Paderborn,
2014.
date_created: 2017-10-17T12:41:58Z
date_updated: 2022-01-06T06:59:14Z
project:
- _id: '1'
name: SFB 901
- _id: '7'
name: SFB 901 - Subprojekt A3
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: Two-Sided Market and Game Console Vendors
type: bachelorsthesis
user_id: '477'
year: '2014'
...
---
_id: '343'
author:
- first_name: Jörn
full_name: Künsemöller, Jörn
last_name: Künsemöller
citation:
ama: Künsemöller J. Tragedy of the Common Cloud - Game Theory on the Infrastructure-as-a-Service
Market. Universität Paderborn; 2014.
apa: Künsemöller, J. (2014). Tragedy of the Common Cloud - Game Theory on the
Infrastructure-as-a-Service Market. Universität Paderborn.
bibtex: '@book{Künsemöller_2014, title={Tragedy of the Common Cloud - Game Theory
on the Infrastructure-as-a-Service Market}, publisher={Universität Paderborn},
author={Künsemöller, Jörn}, year={2014} }'
chicago: Künsemöller, Jörn. Tragedy of the Common Cloud - Game Theory on the
Infrastructure-as-a-Service Market. Universität Paderborn, 2014.
ieee: J. Künsemöller, Tragedy of the Common Cloud - Game Theory on the Infrastructure-as-a-Service
Market. Universität Paderborn, 2014.
mla: Künsemöller, Jörn. Tragedy of the Common Cloud - Game Theory on the Infrastructure-as-a-Service
Market. Universität Paderborn, 2014.
short: J. Künsemöller, Tragedy of the Common Cloud - Game Theory on the Infrastructure-as-a-Service
Market, Universität Paderborn, 2014.
date_created: 2017-10-17T12:41:58Z
date_updated: 2022-01-06T06:59:16Z
ddc:
- '040'
department:
- _id: '75'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:28:26Z
date_updated: 2018-03-20T07:28:26Z
file_id: '1421'
file_name: 343-2014_Diss_Kuensemoeller.pdf
file_size: 1378657
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:28:26Z
has_accepted_license: '1'
project:
- _id: '1'
name: SFB 901
- _id: '6'
name: SFB 901 - Subprojekt A2
- _id: '7'
name: SFB 901 - Subprojekt A3
- _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: Tragedy of the Common Cloud - Game Theory on the Infrastructure-as-a-Service
Market
type: dissertation
user_id: '477'
year: '2014'
...
---
_id: '346'
abstract:
- lang: eng
text: One future goal of service-oriented computing is to realize global markets
of composed services. On such markets, service providers offer services that can
be flexibly combined with each other. However, most often, market participants
are not able to individually estimate the quality of traded services in advance.
As a consequence, even potentially profitable transactions between customers and
providers might not take place. In the worst case, this can induce a market failure.
To overcome this problem, we propose the incorporation of reputation information
as an indicator for expected service quality. We address On-The-Fly Computing
as a representative environment of markets of composed services. In this environment,
customers provide feedback on transactions. We present a conceptual design of
a reputation system which collects and processes user feedback, and provides it
to participants in the market. Our contribution includes the identification of
requirements for such a reputation system from a technical and an economic perspective.
Based on these requirements, we propose a flexible solution that facilitates the
incorporation of reputation information into markets of composed services while
simultaneously preserving privacy of customers who provide feedback. The requirements
we formulate in this paper have just been partially met in literature. An integrated
approach, however, has not been addressed yet.
author:
- first_name: Sonja
full_name: Brangewitz, Sonja
last_name: Brangewitz
- first_name: Alexander
full_name: Jungmann, Alexander
last_name: Jungmann
- first_name: Ronald
full_name: Petrlic, Ronald
last_name: Petrlic
- first_name: Marie Christin
full_name: Platenius, Marie Christin
last_name: Platenius
citation:
ama: 'Brangewitz S, Jungmann A, Petrlic R, Platenius MC. Towards a Flexible and
Privacy-Preserving Reputation System for Markets of Composed Services. In: Proceedings
of the 6th International Conferences on Advanced Service Computing (SERVICE COMPUTATION).
; 2014:49-57.'
apa: Brangewitz, S., Jungmann, A., Petrlic, R., & Platenius, M. C. (2014). Towards
a Flexible and Privacy-Preserving Reputation System for Markets of Composed Services.
In Proceedings of the 6th International Conferences on Advanced Service Computing
(SERVICE COMPUTATION) (pp. 49–57).
bibtex: '@inproceedings{Brangewitz_Jungmann_Petrlic_Platenius_2014, title={Towards
a Flexible and Privacy-Preserving Reputation System for Markets of Composed Services},
booktitle={Proceedings of the 6th International Conferences on Advanced Service
Computing (SERVICE COMPUTATION)}, author={Brangewitz, Sonja and Jungmann, Alexander
and Petrlic, Ronald and Platenius, Marie Christin}, year={2014}, pages={49–57}
}'
chicago: Brangewitz, Sonja, Alexander Jungmann, Ronald Petrlic, and Marie Christin
Platenius. “Towards a Flexible and Privacy-Preserving Reputation System for Markets
of Composed Services.” In Proceedings of the 6th International Conferences
on Advanced Service Computing (SERVICE COMPUTATION), 49–57, 2014.
ieee: S. Brangewitz, A. Jungmann, R. Petrlic, and M. C. Platenius, “Towards a Flexible
and Privacy-Preserving Reputation System for Markets of Composed Services,” in
Proceedings of the 6th International Conferences on Advanced Service Computing
(SERVICE COMPUTATION), 2014, pp. 49–57.
mla: Brangewitz, Sonja, et al. “Towards a Flexible and Privacy-Preserving Reputation
System for Markets of Composed Services.” Proceedings of the 6th International
Conferences on Advanced Service Computing (SERVICE COMPUTATION), 2014, pp.
49–57.
short: 'S. Brangewitz, A. Jungmann, R. Petrlic, M.C. Platenius, in: Proceedings
of the 6th International Conferences on Advanced Service Computing (SERVICE COMPUTATION),
2014, pp. 49–57.'
date_created: 2017-10-17T12:41:59Z
date_updated: 2022-01-06T06:59:18Z
ddc:
- '040'
department:
- _id: '205'
- _id: '76'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:26:49Z
date_updated: 2018-03-20T07:26:49Z
file_id: '1418'
file_name: 346-service_computation_2014_3_10_10005.pdf
file_size: 334101
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:26:49Z
has_accepted_license: '1'
language:
- iso: eng
page: 49-57
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '9'
name: SFB 901 - Subprojekt B1
- _id: '7'
name: SFB 901 - Subprojekt A3
- _id: '10'
name: SFB 901 - Subproject B2
- _id: '2'
name: SFB 901 - Project Area A
- _id: '3'
name: SFB 901 - Project Area B
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 6th International Conferences on Advanced Service
Computing (SERVICE COMPUTATION)
status: public
title: Towards a Flexible and Privacy-Preserving Reputation System for Markets of
Composed Services
type: conference
user_id: '477'
year: '2014'
...
---
_id: '350'
abstract:
- lang: eng
text: Customers continuously evaluate the credibility and reliability of a range
of signals both separately and jointly. However, existing econometric studies
pay insufficient attention to the interactions and complex combinations of these
signals, and are typically limited as a result of difficulties controlling for
multicollinearity and endogeneity in their data. We develop a novel theoretical
approach to address these issues and study different signaling effects (i.e.,
word-of-mouth, brand reputation, and distribution strategy) on customer perceptions.
Using data on the US video games market, we apply a fuzzy set qualitative comparative
analysis (fsQCA) to account for cause-effect relationships. The results of our
study address a number of key issues in the economics and management literature.
First, our results support the contention that reviews from professional critics
act as a signal of product quality and therefore positively influence unit sales,
as do the discriminatory effects of prices and restricted age ratings. Second,
we find evidence to support the use of brand extension strategies as marketing
tools that create spillover effects and support the launch of new products.
author:
- first_name: Daniel
full_name: Kaimann, Daniel
id: '18949'
last_name: Kaimann
- first_name: Joe
full_name: Cox, Joe
last_name: Cox
citation:
ama: 'Kaimann D, Cox J. The Interaction of Signals: A Fuzzy Set Analysis of the
Video Game Industry. Universität Paderborn; 2014.'
apa: 'Kaimann, D., & Cox, J. (2014). The Interaction of Signals: A Fuzzy
set Analysis of the Video Game Industry. Universität Paderborn.'
bibtex: '@book{Kaimann_Cox_2014, title={The Interaction of Signals: A Fuzzy set
Analysis of the Video Game Industry}, publisher={Universität Paderborn}, author={Kaimann,
Daniel and Cox, Joe}, year={2014} }'
chicago: 'Kaimann, Daniel, and Joe Cox. The Interaction of Signals: A Fuzzy Set
Analysis of the Video Game Industry. Universität Paderborn, 2014.'
ieee: 'D. Kaimann and J. Cox, The Interaction of Signals: A Fuzzy set Analysis
of the Video Game Industry. Universität Paderborn, 2014.'
mla: 'Kaimann, Daniel, and Joe Cox. The Interaction of Signals: A Fuzzy Set Analysis
of the Video Game Industry. Universität Paderborn, 2014.'
short: 'D. Kaimann, J. Cox, The Interaction of Signals: A Fuzzy Set Analysis of
the Video Game Industry, Universität Paderborn, 2014.'
date_created: 2017-10-17T12:42:00Z
date_updated: 2022-01-06T06:59:20Z
ddc:
- '040'
department:
- _id: '183'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:24:40Z
date_updated: 2018-03-20T07:24:40Z
file_id: '1416'
file_name: 350-SSRN-id2456991.pdf
file_size: 739169
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:24:40Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '7'
name: SFB 901 - Subprojekt A3
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: 'The Interaction of Signals: A Fuzzy set Analysis of the Video Game Industry'
type: report
user_id: '477'
year: '2014'
...
---
_id: '351'
author:
- first_name: Lena
full_name: Holzweißig, Lena
last_name: Holzweißig
citation:
ama: Holzweißig L. The Impact of Customer Reviews and Reputation on Hotel Prices.
Universität Paderborn; 2014.
apa: Holzweißig, L. (2014). The Impact of Customer Reviews and Reputation on
Hotel Prices. Universität Paderborn.
bibtex: '@book{Holzweißig_2014, title={The Impact of Customer Reviews and Reputation
on Hotel Prices}, publisher={Universität Paderborn}, author={Holzweißig, Lena},
year={2014} }'
chicago: Holzweißig, Lena. The Impact of Customer Reviews and Reputation on Hotel
Prices. Universität Paderborn, 2014.
ieee: L. Holzweißig, The Impact of Customer Reviews and Reputation on Hotel Prices.
Universität Paderborn, 2014.
mla: Holzweißig, Lena. The Impact of Customer Reviews and Reputation on Hotel
Prices. Universität Paderborn, 2014.
short: L. Holzweißig, The Impact of Customer Reviews and Reputation on Hotel Prices,
Universität Paderborn, 2014.
date_created: 2017-10-17T12:42:00Z
date_updated: 2022-01-06T06:59:20Z
project:
- _id: '1'
name: SFB 901
- _id: '7'
name: SFB 901 - Subprojekt A3
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: The Impact of Customer Reviews and Reputation on Hotel Prices
type: mastersthesis
user_id: '477'
year: '2014'
...
---
_id: '352'
author:
- first_name: Friedrich
full_name: Scheel, Friedrich
last_name: Scheel
citation:
ama: 'Scheel F. The Economics of Individual Behavior in Competitive Environments:
Empirical Evidence from Real-Life Tournaments. Universität Paderborn; 2014.'
apa: 'Scheel, F. (2014). The Economics of Individual Behavior in Competitive
Environments: Empirical Evidence from Real-Life Tournaments. Universität Paderborn.'
bibtex: '@book{Scheel_2014, title={The Economics of Individual Behavior in Competitive
Environments: Empirical Evidence from Real-Life Tournaments}, publisher={Universität
Paderborn}, author={Scheel, Friedrich}, year={2014} }'
chicago: 'Scheel, Friedrich. The Economics of Individual Behavior in Competitive
Environments: Empirical Evidence from Real-Life Tournaments. Universität Paderborn,
2014.'
ieee: 'F. Scheel, The Economics of Individual Behavior in Competitive Environments:
Empirical Evidence from Real-Life Tournaments. Universität Paderborn, 2014.'
mla: 'Scheel, Friedrich. The Economics of Individual Behavior in Competitive
Environments: Empirical Evidence from Real-Life Tournaments. Universität Paderborn,
2014.'
short: 'F. Scheel, The Economics of Individual Behavior in Competitive Environments:
Empirical Evidence from Real-Life Tournaments, Universität Paderborn, 2014.'
date_created: 2017-10-17T12:42:00Z
date_updated: 2022-01-06T06:59:21Z
ddc:
- '040'
department:
- _id: '19'
- _id: '183'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:24:10Z
date_updated: 2018-03-20T07:24:10Z
file_id: '1415'
file_name: 352-Diss_Veröffentlichung_Friedrich_Scheel.pdf
file_size: 1609436
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:24:10Z
has_accepted_license: '1'
language:
- iso: eng
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: Bernd
full_name: Frick, Bernd
last_name: Frick
title: 'The Economics of Individual Behavior in Competitive Environments: Empirical
Evidence from Real-Life Tournaments'
type: dissertation
user_id: '477'
year: '2014'
...
---
_id: '354'
abstract:
- lang: eng
text: 'In distributed cloud computing, application deployment across multiple sites
can improve quality of service. Recent research developed algorithms to find optimal
locations for virtual machines. However, those algorithms assume to have either
single-tier applications or a fixed number of virtual machines – a strong simplification
of reality. This paper investigates the placement and scaling of complex application
architectures. An application is dynamically scaled to fit both the current demand
situation and the currently available infrastructure resources. We compare two
approaches: The first one is based on virtual network embedding. The second approach
is a novel method called Template Embedding. It is based on a hierarchical 1-allocation
hub flow problem and combines applica- tion scaling and embedding in one step.
Extensive experiments on 43200 network configurations showed that Template Embedding
outperforms virtual network embedding in all cases in three metrics: success rate,
solution quality, and runtime. This positive result shows that template embedding
is a promising approach for distributed cloud resource allocation.'
author:
- first_name: Matthias
full_name: Keller, Matthias
last_name: Keller
- first_name: Christoph
full_name: Robbert, Christoph
last_name: Robbert
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: 'Keller M, Robbert C, Karl H. Template Embedding: Using Application Architecture
to Allocate Resources in Distributed Clouds. In: Proceedings of 7th International
Conference on Utility and Cloud Computing (UCC). ; 2014:387--395. doi:10.1109/UCC.2014.49'
apa: 'Keller, M., Robbert, C., & Karl, H. (2014). Template Embedding: Using
Application Architecture to Allocate Resources in Distributed Clouds. In Proceedings
of 7th International Conference on Utility and Cloud Computing (UCC) (pp.
387--395). https://doi.org/10.1109/UCC.2014.49'
bibtex: '@inproceedings{Keller_Robbert_Karl_2014, title={Template Embedding: Using
Application Architecture to Allocate Resources in Distributed Clouds}, DOI={10.1109/UCC.2014.49}, booktitle={Proceedings
of 7th International Conference on Utility and Cloud Computing (UCC)}, author={Keller,
Matthias and Robbert, Christoph and Karl, Holger}, year={2014}, pages={387--395}
}'
chicago: 'Keller, Matthias, Christoph Robbert, and Holger Karl. “Template Embedding:
Using Application Architecture to Allocate Resources in Distributed Clouds.” In
Proceedings of 7th International Conference on Utility and Cloud Computing
(UCC), 387--395, 2014. https://doi.org/10.1109/UCC.2014.49.'
ieee: 'M. Keller, C. Robbert, and H. Karl, “Template Embedding: Using Application
Architecture to Allocate Resources in Distributed Clouds,” in Proceedings of
7th International Conference on Utility and Cloud Computing (UCC), 2014, pp.
387--395.'
mla: 'Keller, Matthias, et al. “Template Embedding: Using Application Architecture
to Allocate Resources in Distributed Clouds.” Proceedings of 7th International
Conference on Utility and Cloud Computing (UCC), 2014, pp. 387--395, doi:10.1109/UCC.2014.49.'
short: 'M. Keller, C. Robbert, H. Karl, in: Proceedings of 7th International Conference
on Utility and Cloud Computing (UCC), 2014, pp. 387--395.'
date_created: 2017-10-17T12:42:01Z
date_updated: 2022-01-06T06:59:22Z
ddc:
- '040'
department:
- _id: '75'
doi: 10.1109/UCC.2014.49
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:23:02Z
date_updated: 2018-03-20T07:23:02Z
file_id: '1413'
file_name: 354-keller_ucc14_preprint_01.pdf
file_size: 737652
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:23:02Z
has_accepted_license: '1'
page: 387--395
project:
- _id: '1'
name: SFB 901
- _id: '6'
name: SFB 901 - Subprojekt A2
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of 7th International Conference on Utility and Cloud Computing
(UCC)
status: public
title: 'Template Embedding: Using Application Architecture to Allocate Resources in
Distributed Clouds'
type: conference
user_id: '15572'
year: '2014'
...
---
_id: '356'
abstract:
- lang: eng
text: 'Decentralized algorithms are often used in the cooperative robotics field,
especially by large swarm systems. We present a distributed algorithm for a problem
in which a group of autonomous mobile robots must surround a given target. These
robots are oblivious, i.e., they have no memory of the past. They use only local
sensing and need no dedicated communication among themselves. We introduce, then
solve the problem in which the group of autonomous mobile robots must surround
a given target – we call it the “discrete multiorbit target surrounding problem”
(DMTSP). We evaluate our solution using simulation and prove that our solution
invariably ensures that robots enclose the target in finite time. '
author:
- first_name: Laszlo
full_name: Blazovics, Laszlo
last_name: Blazovics
- first_name: Tamas
full_name: Lukovszki, Tamas
last_name: Lukovszki
- first_name: 'Bertalan '
full_name: 'Forstner, Bertalan '
last_name: Forstner
citation:
ama: Blazovics L, Lukovszki T, Forstner B. Surrounding robots -- A discrete localized
solution for the intruder problem. Journal of Advanced Computational Intelligence
and Intelligent Informatics. 2014;(3):315--319. doi:10.20965/jaciii.2014.p0315
apa: Blazovics, L., Lukovszki, T., & Forstner, B. (2014). Surrounding robots
-- A discrete localized solution for the intruder problem. Journal of Advanced
Computational Intelligence and Intelligent Informatics, (3), 315--319. https://doi.org/10.20965/jaciii.2014.p0315
bibtex: '@article{Blazovics_Lukovszki_Forstner_2014, title={Surrounding robots --
A discrete localized solution for the intruder problem}, DOI={10.20965/jaciii.2014.p0315},
number={3}, journal={Journal of Advanced Computational Intelligence and Intelligent
Informatics}, publisher={Fuji Technology Press Ltd.}, author={Blazovics, Laszlo
and Lukovszki, Tamas and Forstner, Bertalan }, year={2014}, pages={315--319} }'
chicago: 'Blazovics, Laszlo, Tamas Lukovszki, and Bertalan Forstner. “Surrounding
Robots -- A Discrete Localized Solution for the Intruder Problem.” Journal
of Advanced Computational Intelligence and Intelligent Informatics, no. 3
(2014): 315--319. https://doi.org/10.20965/jaciii.2014.p0315.'
ieee: L. Blazovics, T. Lukovszki, and B. Forstner, “Surrounding robots -- A discrete
localized solution for the intruder problem,” Journal of Advanced Computational
Intelligence and Intelligent Informatics, no. 3, pp. 315--319, 2014.
mla: Blazovics, Laszlo, et al. “Surrounding Robots -- A Discrete Localized Solution
for the Intruder Problem.” Journal of Advanced Computational Intelligence and
Intelligent Informatics, no. 3, Fuji Technology Press Ltd., 2014, pp. 315--319,
doi:10.20965/jaciii.2014.p0315.
short: L. Blazovics, T. Lukovszki, B. Forstner, Journal of Advanced Computational
Intelligence and Intelligent Informatics (2014) 315--319.
date_created: 2017-10-17T12:42:01Z
date_updated: 2022-01-06T06:59:25Z
ddc:
- '040'
doi: 10.20965/jaciii.2014.p0315
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:21:58Z
date_updated: 2018-03-20T07:21:58Z
file_id: '1411'
file_name: 356-Lukowski.pdf
file_size: 323838
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:21:58Z
has_accepted_license: '1'
issue: '3'
page: 315--319
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Journal of Advanced Computational Intelligence and Intelligent Informatics
publisher: Fuji Technology Press Ltd.
status: public
title: Surrounding robots -- A discrete localized solution for the intruder problem
type: journal_article
user_id: '477'
year: '2014'
...
---
_id: '357'
author:
- first_name: Olga
full_name: Ebel, Olga
last_name: Ebel
citation:
ama: Ebel O. Struktur und algorithmische Bestimmung stabiler Matchings in one-to-one
Matching Märkten. Universität Paderborn; 2014.
apa: Ebel, O. (2014). Struktur und algorithmische Bestimmung stabiler Matchings
in one-to-one Matching Märkten. Universität Paderborn.
bibtex: '@book{Ebel_2014, title={Struktur und algorithmische Bestimmung stabiler
Matchings in one-to-one Matching Märkten}, publisher={Universität Paderborn},
author={Ebel, Olga}, year={2014} }'
chicago: Ebel, Olga. Struktur und algorithmische Bestimmung stabiler Matchings
in one-to-one Matching Märkten. Universität Paderborn, 2014.
ieee: O. Ebel, Struktur und algorithmische Bestimmung stabiler Matchings in one-to-one
Matching Märkten. Universität Paderborn, 2014.
mla: Ebel, Olga. Struktur und algorithmische Bestimmung stabiler Matchings in
one-to-one Matching Märkten. Universität Paderborn, 2014.
short: O. Ebel, Struktur und algorithmische Bestimmung stabiler Matchings in one-to-one
Matching Märkten, Universität Paderborn, 2014.
date_created: 2017-10-17T12:42:01Z
date_updated: 2022-01-06T06:59:25Z
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '7'
name: SFB 901 - Subprojekt A3
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: Struktur und algorithmische Bestimmung stabiler Matchings in one-to-one Matching
Märkten
type: bachelorsthesis
user_id: '477'
year: '2014'
...
---
_id: '358'
author:
- first_name: Nils
full_name: Röhl, Nils
last_name: Röhl
citation:
ama: Röhl N. Strategic and Cooperative Games in Network Economics. Universität
Paderborn; 2014.
apa: Röhl, N. (2014). Strategic and Cooperative Games in Network Economics.
Universität Paderborn.
bibtex: '@book{Röhl_2014, title={Strategic and Cooperative Games in Network Economics},
publisher={Universität Paderborn}, author={Röhl, Nils}, year={2014} }'
chicago: Röhl, Nils. Strategic and Cooperative Games in Network Economics.
Universität Paderborn, 2014.
ieee: N. Röhl, Strategic and Cooperative Games in Network Economics. Universität
Paderborn, 2014.
mla: Röhl, Nils. Strategic and Cooperative Games in Network Economics. Universität
Paderborn, 2014.
short: N. Röhl, Strategic and Cooperative Games in Network Economics, Universität
Paderborn, 2014.
date_created: 2017-10-17T12:42:01Z
date_updated: 2022-01-06T06:59:25Z
ddc:
- '040'
department:
- _id: '19'
- _id: '205'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:21:29Z
date_updated: 2018-03-20T07:21:29Z
file_id: '1410'
file_name: 358-DissertationRoehl.pdf
file_size: 1230059
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:21:29Z
has_accepted_license: '1'
language:
- iso: eng
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: Claus-Jochen
full_name: Haake, Claus-Jochen
id: '20801'
last_name: Haake
title: Strategic and Cooperative Games in Network Economics
type: dissertation
user_id: '477'
year: '2014'
...
---
_id: '360'
abstract:
- lang: eng
text: 'Network appliances perform different functions on network flows and constitute
an important part of an operator’s network. Normally, a set of chained network
functions process network flows. Following the trend of virtualization of networks,
virtualization of the network functions has also become a topic of interest. We
define a model for formalizing the chaining of network functions using a context-free
language. We process deployment requests and construct virtual network function
graphs that can be mapped to the network. We describe the mapping as a Mixed Integer
Quadratically Constrained Program (MIQCP) for finding the placement of the network
functions and chaining them together considering the limited network resources
and requirements of the functions. We have performed a Pareto set analysis to
investigate the possible trade-offs between different optimization objectives. '
author:
- first_name: Sevil
full_name: Dräxler, Sevil
id: '31764'
last_name: Dräxler
- first_name: Matthias
full_name: Keller, Matthias
last_name: Keller
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: 'Dräxler S, Keller M, Karl H. Specifying and Placing Chains of Virtual Network
Functions. In: Proceedings of the 3rd International Conference on Cloud Networking
(CloudNet). ; 2014:7-13. doi:10.1109/CloudNet.2014.6968961'
apa: Dräxler, S., Keller, M., & Karl, H. (2014). Specifying and Placing Chains
of Virtual Network Functions. In Proceedings of the 3rd International Conference
on Cloud Networking (CloudNet) (pp. 7–13). https://doi.org/10.1109/CloudNet.2014.6968961
bibtex: '@inproceedings{Dräxler_Keller_Karl_2014, title={Specifying and Placing
Chains of Virtual Network Functions}, DOI={10.1109/CloudNet.2014.6968961},
booktitle={Proceedings of the 3rd International Conference on Cloud Networking
(CloudNet)}, author={Dräxler, Sevil and Keller, Matthias and Karl, Holger}, year={2014},
pages={7–13} }'
chicago: Dräxler, Sevil, Matthias Keller, and Holger Karl. “Specifying and Placing
Chains of Virtual Network Functions.” In Proceedings of the 3rd International
Conference on Cloud Networking (CloudNet), 7–13, 2014. https://doi.org/10.1109/CloudNet.2014.6968961.
ieee: S. Dräxler, M. Keller, and H. Karl, “Specifying and Placing Chains of Virtual
Network Functions,” in Proceedings of the 3rd International Conference on Cloud
Networking (CloudNet), 2014, pp. 7–13.
mla: Dräxler, Sevil, et al. “Specifying and Placing Chains of Virtual Network Functions.”
Proceedings of the 3rd International Conference on Cloud Networking (CloudNet),
2014, pp. 7–13, doi:10.1109/CloudNet.2014.6968961.
short: 'S. Dräxler, M. Keller, H. Karl, in: Proceedings of the 3rd International
Conference on Cloud Networking (CloudNet), 2014, pp. 7–13.'
date_created: 2017-10-17T12:42:02Z
date_updated: 2022-01-06T06:59:27Z
ddc:
- '040'
department:
- _id: '75'
doi: 10.1109/CloudNet.2014.6968961
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:21:01Z
date_updated: 2018-06-25T08:08:44Z
file_id: '1409'
file_name: 360-Mehr1410_Specifying_preprint_01.pdf
file_size: 422019
relation: main_file
file_date_updated: 2018-06-25T08:08:44Z
has_accepted_license: '1'
oa: '1'
page: 7-13
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 3rd International Conference on Cloud Networking (CloudNet)
status: public
title: Specifying and Placing Chains of Virtual Network Functions
type: conference
urn: '3601'
user_id: '31764'
year: '2014'
...
---
_id: '361'
author:
- first_name: Daniel
full_name: Roeske, Daniel
last_name: Roeske
citation:
ama: Roeske D. Simulating Load-Dependent Operation of Picocells. Universität
Paderborn; 2014.
apa: Roeske, D. (2014). Simulating load-dependent operation of picocells.
Universität Paderborn.
bibtex: '@book{Roeske_2014, title={Simulating load-dependent operation of picocells},
publisher={Universität Paderborn}, author={Roeske, Daniel}, year={2014} }'
chicago: Roeske, Daniel. Simulating Load-Dependent Operation of Picocells.
Universität Paderborn, 2014.
ieee: D. Roeske, Simulating load-dependent operation of picocells. Universität
Paderborn, 2014.
mla: Roeske, Daniel. Simulating Load-Dependent Operation of Picocells. Universität
Paderborn, 2014.
short: D. Roeske, Simulating Load-Dependent Operation of Picocells, Universität
Paderborn, 2014.
date_created: 2017-10-17T12:42:02Z
date_updated: 2022-01-06T06:59:27Z
department:
- _id: '75'
project:
- _id: '1'
name: SFB 901
- _id: '6'
name: SFB 901 - Subprojekt A2
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: Simulating load-dependent operation of picocells
type: bachelorsthesis
user_id: '15504'
year: '2014'
...
---
_id: '362'
author:
- first_name: Sarah
full_name: Kaiser, Sarah
last_name: Kaiser
citation:
ama: Kaiser S. Signalisieren und Screening in Arbeitsmärkten - die Experimente
von Brandts & Holt und Kübler et. al. Universität Paderborn; 2014.
apa: Kaiser, S. (2014). Signalisieren und Screening in Arbeitsmärkten - die Experimente
von Brandts & Holt und Kübler et. al. Universität Paderborn.
bibtex: '@book{Kaiser_2014, title={Signalisieren und Screening in Arbeitsmärkten
- die Experimente von Brandts & Holt und Kübler et. al}, publisher={Universität
Paderborn}, author={Kaiser, Sarah}, year={2014} }'
chicago: Kaiser, Sarah. Signalisieren und Screening in Arbeitsmärkten - die Experimente
von Brandts & Holt und Kübler et. al. Universität Paderborn, 2014.
ieee: S. Kaiser, Signalisieren und Screening in Arbeitsmärkten - die Experimente
von Brandts & Holt und Kübler et. al. Universität Paderborn, 2014.
mla: Kaiser, Sarah. Signalisieren und Screening in Arbeitsmärkten - die Experimente
von Brandts & Holt und Kübler et. al. Universität Paderborn, 2014.
short: S. Kaiser, Signalisieren und Screening in Arbeitsmärkten - die Experimente
von Brandts & Holt und Kübler et. al, Universität Paderborn, 2014.
date_created: 2017-10-17T12:42:02Z
date_updated: 2022-01-06T06:59:27Z
department:
- _id: '280'
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: Burkhard
full_name: Hehenkamp, Burkhard
id: '37339'
last_name: Hehenkamp
title: Signalisieren und Screening in Arbeitsmärkten - die Experimente von Brandts
& Holt und Kübler et. al
type: bachelorsthesis
user_id: '42447'
year: '2014'
...
---
_id: '367'
abstract:
- lang: eng
text: Online social networks are attracting billions of nowadays, both on a global
scale as well as in social enterprise networks. Using distributed hash tables
and peer-to-peer technology allows online social networks to be operated securely
and efficiently only by using the resources of the user devices, thus alleviating
censorship or data misuse by a single network operator. In this paper, we address
the challenges that arise in implementing reliably and conveniently to use distributed
data structures, such as lists or sets, in such a distributed hash-tablebased
online social network. We present a secure, distributed list data structure that
manages the list entries in several buckets in the distributed hash table. The
list entries are authenticated, integrity is maintained and access control for
single users and also groups is integrated. The approach for secure distributed
lists is also applied for prefix trees and sets, and implemented and evaluated
in a peer-to-peer framework for social networks. Evaluation shows that the distributed
data structure is convenient and efficient to use and that the requirements on
security hold.
author:
- first_name: Jens
full_name: Janiuk, Jens
last_name: Janiuk
- first_name: Alexander
full_name: Mäcker, Alexander
id: '13536'
last_name: Mäcker
- first_name: Kalman
full_name: Graffi, Kalman
last_name: Graffi
citation:
ama: 'Janiuk J, Mäcker A, Graffi K. Secure Distributed Data Structures for Peer-to-Peer-based
Social Networks. In: Proceedings of the International Conference on Collaboration
Technologies and Systems (CTS). ; 2014:396-405. doi:10.1109/CTS.2014.6867595'
apa: Janiuk, J., Mäcker, A., & Graffi, K. (2014). Secure Distributed Data Structures
for Peer-to-Peer-based Social Networks. In Proceedings of the International
Conference on Collaboration Technologies and Systems (CTS) (pp. 396–405).
https://doi.org/10.1109/CTS.2014.6867595
bibtex: '@inproceedings{Janiuk_Mäcker_Graffi_2014, title={Secure Distributed Data
Structures for Peer-to-Peer-based Social Networks}, DOI={10.1109/CTS.2014.6867595},
booktitle={Proceedings of the International Conference on Collaboration Technologies
and Systems (CTS)}, author={Janiuk, Jens and Mäcker, Alexander and Graffi, Kalman},
year={2014}, pages={396–405} }'
chicago: Janiuk, Jens, Alexander Mäcker, and Kalman Graffi. “Secure Distributed
Data Structures for Peer-to-Peer-Based Social Networks.” In Proceedings of
the International Conference on Collaboration Technologies and Systems (CTS),
396–405, 2014. https://doi.org/10.1109/CTS.2014.6867595.
ieee: J. Janiuk, A. Mäcker, and K. Graffi, “Secure Distributed Data Structures for
Peer-to-Peer-based Social Networks,” in Proceedings of the International Conference
on Collaboration Technologies and Systems (CTS), 2014, pp. 396–405.
mla: Janiuk, Jens, et al. “Secure Distributed Data Structures for Peer-to-Peer-Based
Social Networks.” Proceedings of the International Conference on Collaboration
Technologies and Systems (CTS), 2014, pp. 396–405, doi:10.1109/CTS.2014.6867595.
short: 'J. Janiuk, A. Mäcker, K. Graffi, in: Proceedings of the International Conference
on Collaboration Technologies and Systems (CTS), 2014, pp. 396–405.'
date_created: 2017-10-17T12:42:03Z
date_updated: 2022-01-06T06:59:29Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1109/CTS.2014.6867595
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:18:12Z
date_updated: 2018-03-20T07:18:12Z
file_id: '1404'
file_name: 367-cts_conf.pdf
file_size: 647997
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:18:12Z
has_accepted_license: '1'
language:
- iso: eng
page: 396-405
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 International Conference on Collaboration Technologies
and Systems (CTS)
status: public
title: Secure Distributed Data Structures for Peer-to-Peer-based Social Networks
type: conference
user_id: '477'
year: '2014'
...
---
_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: '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'
...