---
_id: '66'
abstract:
- lang: eng
text: In budget games, players compete over resources with finite budgets. For every
resource, a player has a specific demand and as a strategy, he chooses a subset
of resources. If the total demand on a resource does not exceed its budget, the
utility of each player who chose that resource equals his demand. Otherwise, the
budget is shared proportionally. In the general case, pure Nash equilibria (NE)
do not exist for such games. In this paper, we consider the natural classes of
singleton and matroid budget games with additional constraints and show that for
each, pure NE can be guaranteed. In addition, we introduce a lexicographical potential
function to prove that every matroid budget game has an approximate pure NE which
depends on the largest ratio between the different demands of each individual
player.
author:
- first_name: Maximilian
full_name: Drees, Maximilian
last_name: Drees
- first_name: Matthias
full_name: Feldotto, Matthias
id: '14052'
last_name: Feldotto
orcid: 0000-0003-1348-6516
- first_name: Sören
full_name: Riechers, Sören
last_name: Riechers
- first_name: Alexander
full_name: Skopalik, Alexander
id: '40384'
last_name: Skopalik
citation:
ama: 'Drees M, Feldotto M, Riechers S, Skopalik A. Pure Nash Equilibria in Restricted
Budget Games. In: Proceedings of the 23rd International Computing and Combinatorics
Conference (COCOON). LNCS. ; 2017:175--187. doi:10.1007/978-3-319-62389-4_15'
apa: Drees, M., Feldotto, M., Riechers, S., & Skopalik, A. (2017). Pure Nash
Equilibria in Restricted Budget Games. In Proceedings of the 23rd International
Computing and Combinatorics Conference (COCOON) (pp. 175--187). https://doi.org/10.1007/978-3-319-62389-4_15
bibtex: '@inproceedings{Drees_Feldotto_Riechers_Skopalik_2017, series={LNCS}, title={Pure
Nash Equilibria in Restricted Budget Games}, DOI={10.1007/978-3-319-62389-4_15},
booktitle={Proceedings of the 23rd International Computing and Combinatorics Conference
(COCOON)}, author={Drees, Maximilian and Feldotto, Matthias and Riechers, Sören
and Skopalik, Alexander}, year={2017}, pages={175--187}, collection={LNCS} }'
chicago: Drees, Maximilian, Matthias Feldotto, Sören Riechers, and Alexander Skopalik.
“Pure Nash Equilibria in Restricted Budget Games.” In Proceedings of the 23rd
International Computing and Combinatorics Conference (COCOON), 175--187. LNCS,
2017. https://doi.org/10.1007/978-3-319-62389-4_15.
ieee: M. Drees, M. Feldotto, S. Riechers, and A. Skopalik, “Pure Nash Equilibria
in Restricted Budget Games,” in Proceedings of the 23rd International Computing
and Combinatorics Conference (COCOON), 2017, pp. 175--187.
mla: Drees, Maximilian, et al. “Pure Nash Equilibria in Restricted Budget Games.”
Proceedings of the 23rd International Computing and Combinatorics Conference
(COCOON), 2017, pp. 175--187, doi:10.1007/978-3-319-62389-4_15.
short: 'M. Drees, M. Feldotto, S. Riechers, A. Skopalik, in: Proceedings of the
23rd International Computing and Combinatorics Conference (COCOON), 2017, pp.
175--187.'
date_created: 2017-10-17T12:41:04Z
date_updated: 2022-01-06T07:03:13Z
ddc:
- '000'
department:
- _id: '541'
- _id: '63'
doi: 10.1007/978-3-319-62389-4_15
file:
- access_level: closed
content_type: application/pdf
creator: feldi
date_created: 2018-10-31T16:58:42Z
date_updated: 2018-10-31T16:58:42Z
file_id: '5228'
file_name: Drees2017_Chapter_PureNashEquilibriaInRestricted.pdf
file_size: 346390
relation: main_file
success: 1
file_date_updated: 2018-10-31T16:58:42Z
has_accepted_license: '1'
language:
- iso: eng
page: 175--187
project:
- _id: '1'
name: SFB 901
- _id: '7'
name: SFB 901 - Subprojekt A3
- _id: '16'
name: SFB 901 - Subproject C4
- _id: '2'
name: SFB 901 - Project Area A
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 23rd International Computing and Combinatorics Conference
(COCOON)
series_title: LNCS
status: public
title: Pure Nash Equilibria in Restricted Budget Games
type: conference
user_id: '14052'
year: '2017'
...
---
_id: '110'
abstract:
- lang: eng
text: 'We consider an extension of the dynamic speed scaling scheduling model introduced
by Yao et al.: A set of jobs, each with a release time, deadline, and workload,
has to be scheduled on a single, speed-scalable processor. Both the maximum allowed
speed of the processor and the energy costs may vary continuously over time. The
objective is to find a feasible schedule that minimizes the total energy costs.
Theoretical algorithm design for speed scaling problems often tends to discretize
problems, as our tools in the discrete realm are often better developed or understood.
Using the above speed scaling variant with variable, continuous maximal processor
speeds and energy prices as an example, we demonstrate that a more direct approach
via tools from variational calculus can not only lead to a very concise and elegant
formulation and analysis, but also avoids the “explosion of variables/constraints”
that often comes with discretizing. Using well-known tools from calculus of variations,
we derive combinatorial optimality characteristics for our continuous problem
and provide a quite concise and simple correctness proof.'
author:
- first_name: Antonios
full_name: Antoniadis, Antonios
last_name: Antoniadis
- first_name: Peter
full_name: Kling, Peter
last_name: Kling
- first_name: Sebastian
full_name: Ott, Sebastian
last_name: Ott
- first_name: Sören
full_name: Riechers, Sören
last_name: Riechers
citation:
ama: 'Antoniadis A, Kling P, Ott S, Riechers S. Continuous Speed Scaling with Variability:
A Simple and Direct Approach. Theoretical Computer Science. 2017:1-13.
doi:10.1016/j.tcs.2017.03.021'
apa: 'Antoniadis, A., Kling, P., Ott, S., & Riechers, S. (2017). Continuous
Speed Scaling with Variability: A Simple and Direct Approach. Theoretical Computer
Science, 1–13. https://doi.org/10.1016/j.tcs.2017.03.021'
bibtex: '@article{Antoniadis_Kling_Ott_Riechers_2017, title={Continuous Speed Scaling
with Variability: A Simple and Direct Approach}, DOI={10.1016/j.tcs.2017.03.021},
journal={Theoretical Computer Science}, publisher={Elsevier}, author={Antoniadis,
Antonios and Kling, Peter and Ott, Sebastian and Riechers, Sören}, year={2017},
pages={1–13} }'
chicago: 'Antoniadis, Antonios, Peter Kling, Sebastian Ott, and Sören Riechers.
“Continuous Speed Scaling with Variability: A Simple and Direct Approach.” Theoretical
Computer Science, 2017, 1–13. https://doi.org/10.1016/j.tcs.2017.03.021.'
ieee: 'A. Antoniadis, P. Kling, S. Ott, and S. Riechers, “Continuous Speed Scaling
with Variability: A Simple and Direct Approach,” Theoretical Computer Science,
pp. 1–13, 2017.'
mla: 'Antoniadis, Antonios, et al. “Continuous Speed Scaling with Variability: A
Simple and Direct Approach.” Theoretical Computer Science, Elsevier, 2017,
pp. 1–13, doi:10.1016/j.tcs.2017.03.021.'
short: A. Antoniadis, P. Kling, S. Ott, S. Riechers, Theoretical Computer Science
(2017) 1–13.
date_created: 2017-10-17T12:41:13Z
date_updated: 2022-01-06T06:50:55Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1016/j.tcs.2017.03.021
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T13:07:43Z
date_updated: 2018-03-21T13:07:43Z
file_id: '1567'
file_name: 110-TCSSubmission.pdf
file_size: 494600
relation: main_file
success: 1
file_date_updated: 2018-03-21T13:07:43Z
has_accepted_license: '1'
language:
- iso: eng
page: 1-13
project:
- _id: '1'
name: SFB 901
- _id: '16'
name: SFB 901 - Subprojekt C4
- _id: '4'
name: SFB 901 - Project Area C
publication: Theoretical Computer Science
publisher: Elsevier
status: public
title: 'Continuous Speed Scaling with Variability: A Simple and Direct Approach'
type: journal_article
user_id: '477'
year: '2017'
...
---
_id: '207'
abstract:
- lang: eng
text: We consider a scheduling problem where machines need to be rented from the
cloud in order to process jobs. There are two types of machines available which
can be rented for machine-type dependent prices and for arbitrary durations. However,
a machine-type dependent setup time is required before a machine is available
for processing. Jobs arrive online over time, have machine-type dependent sizes
and have individual deadlines. The objective is to rent machines and schedule
jobs so as to meet all deadlines while minimizing the rental cost. Since we observe
the slack of jobs to have a fundamental influence on the competitiveness, we study
the model when instances are parameterized by their (minimum) slack. An instance
is called to have a slack of $\beta$ if, for all jobs, the difference between
the job's release time and the latest point in time at which it needs to be started
is at least $\beta$. While for $\beta series = {LNCS}
author:
- first_name: Alexander
full_name: Mäcker, Alexander
id: '13536'
last_name: Mäcker
- first_name: Manuel
full_name: Malatyali, Manuel
last_name: Malatyali
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Sören
full_name: Riechers, Sören
last_name: Riechers
citation:
ama: 'Mäcker A, Malatyali M, Meyer auf der Heide F, Riechers S. Cost-efficient Scheduling
on Machines from the Cloud. In: Proceedings of the 10th Annual International
Conference on Combinatorial Optimization and Applications (COCOA). ; 2016:578--592.
doi:10.1007/978-3-319-48749-6_42'
apa: Mäcker, A., Malatyali, M., Meyer auf der Heide, F., & Riechers, S. (2016).
Cost-efficient Scheduling on Machines from the Cloud. In Proceedings of the
10th Annual International Conference on Combinatorial Optimization and Applications
(COCOA) (pp. 578--592). https://doi.org/10.1007/978-3-319-48749-6_42
bibtex: '@inproceedings{Mäcker_Malatyali_Meyer auf der Heide_Riechers_2016, title={Cost-efficient
Scheduling on Machines from the Cloud}, DOI={10.1007/978-3-319-48749-6_42},
booktitle={Proceedings of the 10th Annual International Conference on Combinatorial
Optimization and Applications (COCOA)}, author={Mäcker, Alexander and Malatyali,
Manuel and Meyer auf der Heide, Friedhelm and Riechers, Sören}, year={2016}, pages={578--592}
}'
chicago: Mäcker, Alexander, Manuel Malatyali, Friedhelm Meyer auf der Heide, and
Sören Riechers. “Cost-Efficient Scheduling on Machines from the Cloud.” In Proceedings
of the 10th Annual International Conference on Combinatorial Optimization and
Applications (COCOA), 578--592, 2016. https://doi.org/10.1007/978-3-319-48749-6_42.
ieee: A. Mäcker, M. Malatyali, F. Meyer auf der Heide, and S. Riechers, “Cost-efficient
Scheduling on Machines from the Cloud,” in Proceedings of the 10th Annual International
Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp.
578--592.
mla: Mäcker, Alexander, et al. “Cost-Efficient Scheduling on Machines from the Cloud.”
Proceedings of the 10th Annual International Conference on Combinatorial Optimization
and Applications (COCOA), 2016, pp. 578--592, doi:10.1007/978-3-319-48749-6_42.
short: 'A. Mäcker, M. Malatyali, F. Meyer auf der Heide, S. Riechers, in: Proceedings
of the 10th Annual International Conference on Combinatorial Optimization and
Applications (COCOA), 2016, pp. 578--592.'
date_created: 2017-10-17T12:41:32Z
date_updated: 2022-01-06T06:54:33Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.1007/978-3-319-48749-6_42
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T14:18:51Z
date_updated: 2018-11-02T14:18:51Z
file_id: '5268'
file_name: Cost-EfficientSchedulingOnMach.pdf
file_size: 608614
relation: main_file
success: 1
file_date_updated: 2018-11-02T14:18:51Z
has_accepted_license: '1'
language:
- iso: eng
page: 578--592
project:
- _id: '1'
name: SFB 901
- _id: '16'
name: SFB 901 - Subprojekt C4
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 10th Annual International Conference on Combinatorial
Optimization and Applications (COCOA)
status: public
title: Cost-efficient Scheduling on Machines from the Cloud
type: conference
user_id: '477'
year: '2016'
...
---
_id: '220'
author:
- first_name: Matthias
full_name: Keller, Matthias
last_name: Keller
citation:
ama: Keller M. Application Deployment at Distributed Clouds. Universität
Paderborn; 2016.
apa: Keller, M. (2016). Application Deployment at Distributed Clouds. Universität
Paderborn.
bibtex: '@book{Keller_2016, title={Application Deployment at Distributed Clouds},
publisher={Universität Paderborn}, author={Keller, Matthias}, year={2016} }'
chicago: Keller, Matthias. Application Deployment at Distributed Clouds.
Universität Paderborn, 2016.
ieee: M. Keller, Application Deployment at Distributed Clouds. Universität
Paderborn, 2016.
mla: Keller, Matthias. Application Deployment at Distributed Clouds. Universität
Paderborn, 2016.
short: M. Keller, Application Deployment at Distributed Clouds, Universität Paderborn,
2016.
date_created: 2017-10-17T12:41:34Z
date_updated: 2022-01-06T06:55:22Z
ddc:
- '040'
department:
- _id: '75'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T10:37:11Z
date_updated: 2018-03-21T10:37:11Z
file_id: '1513'
file_name: 220-Keller_PhD-Theses_01.pdf
file_size: 7467820
relation: main_file
success: 1
file_date_updated: 2018-03-21T10:37:11Z
has_accepted_license: '1'
project:
- _id: '1'
name: SFB 901
- _id: '6'
name: SFB 901 - Subprojekt A2
- _id: '16'
name: SFB 901 - Subprojekt C4
- _id: '2'
name: SFB 901 - Project Area A
- _id: '4'
name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
title: Application Deployment at Distributed Clouds
type: dissertation
user_id: '477'
year: '2016'
...
---
_id: '726'
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. DCT2Gen: A traffic generator for data centers.
Computer Communications. 2016:45--58. doi:10.1016/j.comcom.2015.12.001'
apa: 'Wette, P., & Karl, H. (2016). DCT2Gen: A traffic generator
for data centers. Computer Communications, 45--58. https://doi.org/10.1016/j.comcom.2015.12.001'
bibtex: '@article{Wette_Karl_2016, title={DCT2Gen: A traffic generator
for data centers}, DOI={10.1016/j.comcom.2015.12.001},
journal={Computer Communications}, author={Wette, Philip and Karl, Holger}, year={2016},
pages={45--58} }'
chicago: 'Wette, Philip, and Holger Karl. “DCT2Gen: A Traffic Generator
for Data Centers.” Computer Communications, 2016, 45--58. https://doi.org/10.1016/j.comcom.2015.12.001.'
ieee: 'P. Wette and H. Karl, “DCT2Gen: A traffic generator for data centers,”
Computer Communications, pp. 45--58, 2016.'
mla: 'Wette, Philip, and Holger Karl. “DCT2Gen: A Traffic Generator for
Data Centers.” Computer Communications, 2016, pp. 45--58, doi:10.1016/j.comcom.2015.12.001.'
short: P. Wette, H. Karl, Computer Communications (2016) 45--58.
date_created: 2017-11-27T10:22:25Z
date_updated: 2022-01-06T07:03:31Z
ddc:
- '000'
department:
- _id: '75'
doi: 10.1016/j.comcom.2015.12.001
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T15:59:29Z
date_updated: 2018-11-02T15:59:29Z
file_id: '5319'
file_name: WetteKarl.pdf
file_size: 1671431
relation: main_file
success: 1
file_date_updated: 2018-11-02T15:59:29Z
has_accepted_license: '1'
language:
- iso: eng
page: 45--58
project:
- _id: '16'
name: SFB 901 - Subproject C4
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
publication: Computer Communications
status: public
title: 'DCT²Gen: A traffic generator for data centers'
type: journal_article
user_id: '477'
year: '2016'
...
---
_id: '730'
abstract:
- lang: eng
text: "Allocating resources to virtualized network functions and services to meet
service level agreements is a challenging task for NFV management and orchestration
systems. This becomes even more challenging when agile development methodologies,
like DevOps, are applied. In such scenarios, management and orchestration systems
are continuously facing new versions of functions and services which makes it
hard to decide how much resources have to be allocated to them to provide the
expected service performance. \r\nOne solution for this problem is to support
resource allocation decisions with performance behavior information obtained by
profiling techniques applied to such network functions and services.\r\n\r\nIn
this position paper, we analyze and discuss the components needed to generate
such performance behavior information within the NFV DevOps workflow. We also
outline research questions that identify open issues and missing pieces for a
fully integrated NFV profiling solution. Further, we introduce a novel profiling
mechanism that is able to profile virtualized network functions and entire network
service chains under different resource constraints before they are deployed on
production infrastructure."
author:
- first_name: Manuel
full_name: Peuster, Manuel
id: '13271'
last_name: Peuster
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: 'Peuster M, Karl H. Understand Your Chains: Towards Performance Profile-Based
Network Service Management. In: Fifth European Workshop on Software-Defined
Networks, EWSDN 2016, Den Haag, The Netherlands, October 10-11, 2016. ; 2016:7--12.
doi:10.1109/EWSDN.2016.9'
apa: 'Peuster, M., & Karl, H. (2016). Understand Your Chains: Towards Performance
Profile-Based Network Service Management. In Fifth European Workshop on Software-Defined
Networks, EWSDN 2016, Den Haag, The Netherlands, October 10-11, 2016 (pp.
7--12). Den Haag. https://doi.org/10.1109/EWSDN.2016.9'
bibtex: '@inproceedings{Peuster_Karl_2016, title={Understand Your Chains: Towards
Performance Profile-Based Network Service Management}, DOI={10.1109/EWSDN.2016.9},
booktitle={Fifth European Workshop on Software-Defined Networks, EWSDN 2016, Den
Haag, The Netherlands, October 10-11, 2016}, author={Peuster, Manuel and Karl,
Holger}, year={2016}, pages={7--12} }'
chicago: 'Peuster, Manuel, and Holger Karl. “Understand Your Chains: Towards Performance
Profile-Based Network Service Management.” In Fifth European Workshop on Software-Defined
Networks, EWSDN 2016, Den Haag, The Netherlands, October 10-11, 2016, 7--12,
2016. https://doi.org/10.1109/EWSDN.2016.9.'
ieee: 'M. Peuster and H. Karl, “Understand Your Chains: Towards Performance Profile-Based
Network Service Management,” in Fifth European Workshop on Software-Defined
Networks, EWSDN 2016, Den Haag, The Netherlands, October 10-11, 2016, Den
Haag, 2016, pp. 7--12.'
mla: 'Peuster, Manuel, and Holger Karl. “Understand Your Chains: Towards Performance
Profile-Based Network Service Management.” Fifth European Workshop on Software-Defined
Networks, EWSDN 2016, Den Haag, The Netherlands, October 10-11, 2016, 2016,
pp. 7--12, doi:10.1109/EWSDN.2016.9.'
short: 'M. Peuster, H. Karl, in: Fifth European Workshop on Software-Defined Networks,
EWSDN 2016, Den Haag, The Netherlands, October 10-11, 2016, 2016, pp. 7--12.'
conference:
location: Den Haag
name: Fifth European Workshop on Software-Defined Networks (EWSDN
date_created: 2017-11-27T10:22:25Z
date_updated: 2022-01-06T07:03:33Z
ddc:
- '000'
department:
- _id: '75'
doi: 10.1109/EWSDN.2016.9
file:
- access_level: open_access
content_type: application/pdf
creator: peuster
date_created: 2018-06-25T13:10:10Z
date_updated: 2018-06-25T13:16:56Z
file_id: '3353'
file_name: main_ris.pdf
file_size: 966702
relation: main_file
file_date_updated: 2018-06-25T13:16:56Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- url: http://ieeexplore.ieee.org/document/7956044/
oa: '1'
page: 7--12
project:
- _id: '25'
call_identifier: 5G PPP Phase 1
grant_number: '671517'
name: 'SONATA NFV: Agile Service Development and Orchestration in 5G Virtualized
Networks'
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '16'
name: SFB 901 - Subproject C4
publication: Fifth European Workshop on Software-Defined Networks, EWSDN 2016, Den
Haag, The Netherlands, October 10-11, 2016
publication_status: published
status: public
title: 'Understand Your Chains: Towards Performance Profile-Based Network Service
Management'
type: conference
urn: '7309'
user_id: '13271'
year: '2016'
...
---
_id: '731'
abstract:
- lang: eng
text: "Traditional cellular networks are forced to remain active regardless of the
actual amount of traffic that is currently produced/requested, with a clear waste
of energy. Two-layer mobile networks with separated signalling and data layers
have been recently proposed for energy savings in future implementations. These
networks are able to switch off unneeded data cells completely while maintaining
full coverage with their signalling cells, thus saving energy. In this demonstration,
we showcase a testbed that uses Wi-Fi access points to emulate small cells of
the data layer and a publicly available cellular connection as the signalling
layer. We use off-the-shelf Android smartphones with an ad-hoc networking management
module and a MultiPath TCP-enabled kernel to manage the Wi-Fi and cellular interfaces
simultaneously.\r\nThe testbed is used to demonstrate the general feasibility
of this layered architecture and to facilitate experiments with network-wide resource
optimization. "
author:
- first_name: Manuel
full_name: Peuster, Manuel
id: '13271'
last_name: Peuster
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
- first_name: Alessandro
full_name: Enrico Redondi, Alessandro
last_name: Enrico Redondi
- first_name: Antonio
full_name: Capone, Antonio
last_name: Capone
citation:
ama: 'Peuster M, Karl H, Enrico Redondi A, Capone A. Demonstrating on-demand cell
switching with a two-layer mobile network testbed. In: IEEE Conference on Computer
Communications Workshops, INFOCOM Workshops 2016, San Francisco, CA, USA, April
10-14, 2016. ; 2016:1015--1016. doi:10.1109/INFCOMW.2016.7562232'
apa: Peuster, M., Karl, H., Enrico Redondi, A., & Capone, A. (2016). Demonstrating
on-demand cell switching with a two-layer mobile network testbed. In IEEE Conference
on Computer Communications Workshops, INFOCOM Workshops 2016, San Francisco, CA,
USA, April 10-14, 2016 (pp. 1015--1016). San Francisco. https://doi.org/10.1109/INFCOMW.2016.7562232
bibtex: '@inproceedings{Peuster_Karl_Enrico Redondi_Capone_2016, title={Demonstrating
on-demand cell switching with a two-layer mobile network testbed}, DOI={10.1109/INFCOMW.2016.7562232},
booktitle={IEEE Conference on Computer Communications Workshops, INFOCOM Workshops
2016, San Francisco, CA, USA, April 10-14, 2016}, author={Peuster, Manuel and
Karl, Holger and Enrico Redondi, Alessandro and Capone, Antonio}, year={2016},
pages={1015--1016} }'
chicago: Peuster, Manuel, Holger Karl, Alessandro Enrico Redondi, and Antonio Capone.
“Demonstrating On-Demand Cell Switching with a Two-Layer Mobile Network Testbed.”
In IEEE Conference on Computer Communications Workshops, INFOCOM Workshops
2016, San Francisco, CA, USA, April 10-14, 2016, 1015--1016, 2016. https://doi.org/10.1109/INFCOMW.2016.7562232.
ieee: M. Peuster, H. Karl, A. Enrico Redondi, and A. Capone, “Demonstrating on-demand
cell switching with a two-layer mobile network testbed,” in IEEE Conference
on Computer Communications Workshops, INFOCOM Workshops 2016, San Francisco, CA,
USA, April 10-14, 2016, San Francisco, 2016, pp. 1015--1016.
mla: Peuster, Manuel, et al. “Demonstrating On-Demand Cell Switching with a Two-Layer
Mobile Network Testbed.” IEEE Conference on Computer Communications Workshops,
INFOCOM Workshops 2016, San Francisco, CA, USA, April 10-14, 2016, 2016, pp.
1015--1016, doi:10.1109/INFCOMW.2016.7562232.
short: 'M. Peuster, H. Karl, A. Enrico Redondi, A. Capone, in: IEEE Conference on
Computer Communications Workshops, INFOCOM Workshops 2016, San Francisco, CA,
USA, April 10-14, 2016, 2016, pp. 1015--1016.'
conference:
location: San Francisco
name: IEEE Conference on Computer Communications Workshops, INFOCOM
date_created: 2017-11-27T10:22:25Z
date_updated: 2022-01-06T07:03:34Z
ddc:
- '000'
department:
- _id: '75'
doi: 10.1109/INFCOMW.2016.7562232
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T14:11:50Z
date_updated: 2018-11-02T14:11:50Z
file_id: '5264'
file_name: 07562232.pdf
file_size: 2080026
relation: main_file
success: 1
file_date_updated: 2018-11-02T14:11:50Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- url: http://ieeexplore.ieee.org/document/7562232/
page: 1015--1016
project:
- _id: '4'
name: SFB 901 - Project Area C
- _id: '1'
name: SFB 901
- _id: '16'
name: SFB 901 - Subproject C4
publication: IEEE Conference on Computer Communications Workshops, INFOCOM Workshops
2016, San Francisco, CA, USA, April 10-14, 2016
publication_status: published
status: public
title: Demonstrating on-demand cell switching with a two-layer mobile network testbed
type: conference
user_id: '477'
year: '2016'
...
---
_id: '738'
abstract:
- lang: eng
text: "Virtualized network services consisting of multiple individual network functions
are already today deployed across multiple sites, so called multi-PoP (points
of presence) environments. This allows to improve service performance by optimizing
its placement in the network. But prototyping and testing of these complex distributed
software systems becomes extremely challenging. The reason is that not only the
network service as such has to be tested but also its integration with management
and orchestration systems. Existing solutions, like simulators, basic network
emulators, or local cloud testbeds, do not support all aspects of these tasks.\r\n\r\nTo
this end, we introduce MeDICINE, a novel NFV prototyping platform that is able
to execute production-ready network functions, provided as software containers,
in an emulated multi-PoP environment. These network functions can be controlled
by any third-party management and orchestration system that connects to our platform
through standard interfaces. Based on this, a developer can use our platform to
prototype and test complex network services in a realistic environment running
on his laptop.\r\n"
author:
- first_name: Manuel
full_name: Peuster, Manuel
id: '13271'
last_name: Peuster
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
- first_name: Steven
full_name: van Rossem, Steven
last_name: van Rossem
citation:
ama: 'Peuster M, Karl H, van Rossem S. MeDICINE: Rapid Prototyping of Production-Ready
Network Services in Multi-PoP Environments. In: IEEE Conference on Network
Function Virtualization and Software Defined Networks (NFV-SDN). ; 2016. doi:10.1109/NFV-SDN.2016.7919490'
apa: 'Peuster, M., Karl, H., & van Rossem, S. (2016). MeDICINE: Rapid Prototyping
of Production-Ready Network Services in Multi-PoP Environments. In IEEE Conference
on Network Function Virtualization and Software Defined Networks (NFV-SDN).
Palo Alto. https://doi.org/10.1109/NFV-SDN.2016.7919490'
bibtex: '@inproceedings{Peuster_Karl_van Rossem_2016, title={MeDICINE: Rapid Prototyping
of Production-Ready Network Services in Multi-PoP Environments}, DOI={10.1109/NFV-SDN.2016.7919490},
booktitle={IEEE Conference on Network Function Virtualization and Software Defined
Networks (NFV-SDN)}, author={Peuster, Manuel and Karl, Holger and van Rossem,
Steven}, year={2016} }'
chicago: 'Peuster, Manuel, Holger Karl, and Steven van Rossem. “MeDICINE: Rapid
Prototyping of Production-Ready Network Services in Multi-PoP Environments.” In
IEEE Conference on Network Function Virtualization and Software Defined Networks
(NFV-SDN), 2016. https://doi.org/10.1109/NFV-SDN.2016.7919490.'
ieee: 'M. Peuster, H. Karl, and S. van Rossem, “MeDICINE: Rapid Prototyping of Production-Ready
Network Services in Multi-PoP Environments,” in IEEE Conference on Network
Function Virtualization and Software Defined Networks (NFV-SDN), Palo Alto,
2016.'
mla: 'Peuster, Manuel, et al. “MeDICINE: Rapid Prototyping of Production-Ready Network
Services in Multi-PoP Environments.” IEEE Conference on Network Function Virtualization
and Software Defined Networks (NFV-SDN), 2016, doi:10.1109/NFV-SDN.2016.7919490.'
short: 'M. Peuster, H. Karl, S. van Rossem, in: IEEE Conference on Network Function
Virtualization and Software Defined Networks (NFV-SDN), 2016.'
conference:
location: Palo Alto
name: IEEE Conference on Network Function Virtualization and Software Defined Networks
(NFV-SDN)
date_created: 2017-11-27T10:22:25Z
date_updated: 2022-01-06T07:03:36Z
ddc:
- '000'
department:
- _id: '75'
doi: 10.1109/NFV-SDN.2016.7919490
file:
- access_level: open_access
content_type: application/pdf
creator: peuster
date_created: 2018-06-25T13:06:47Z
date_updated: 2018-06-25T13:17:34Z
file_id: '3349'
file_name: main_ris.pdf
file_size: 848438
relation: main_file
file_date_updated: 2018-06-25T13:17:34Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- url: https://arxiv.org/pdf/1606.05995.pdf
oa: '1'
project:
- _id: '25'
call_identifier: 5G PPP Phase 1
grant_number: '671517'
name: 'SONATA NFV: Agile Service Development and Orchestration in 5G Virtualized
Networks'
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '16'
name: SFB 901 - Subproject C4
publication: IEEE Conference on Network Function Virtualization and Software Defined
Networks (NFV-SDN)
publication_status: published
status: public
title: 'MeDICINE: Rapid Prototyping of Production-Ready Network Services in Multi-PoP
Environments'
type: conference
urn: '7384'
user_id: '13271'
year: '2016'
...
---
_id: '166'
abstract:
- lang: eng
text: Network function virtualization and software-defined networking allow services
consisting of virtual network functions to be designed and implemented with great
flexibility by facilitating automatic deployments, migrations, and reconfigurations
for services and their components. For extended flexibility, we go beyond seeing
services as a fixed chain of functions. We present a YANG model for describing
the service structure in deployment requests in a flexible way that enables changing
the order of functions in case the order of traversing them does not affect the
functionality of the service. Upon receiving such requests, the network orchestration
system can choose the optimal composition of service components that gives the
best results for placement of services in the network. This introduces new complexities
to the placement problem by greatly increasing the number of possible ways a service
can be composed. In this paper, we describe a heuristic solution that selects
a Pareto set of the possible compositions of a service as well as possible combinations
of different services, with respect to different resource requirements of the
services. Our evaluations show that the selected combinations consist of representative
samples of possible structures and requirements and therefore, can result in optimal
or close-to-optimal placement results.
author:
- first_name: Sevil
full_name: Dräxler, Sevil
id: '31764'
last_name: Dräxler
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: 'Dräxler S, Karl H. Placement of Services with Flexible Structures Specified
by a YANG Data Model. In: Proceedings of the 2nd International IEEE Conference
on Network Softwarization (NetSoft). ; 2016:184--192. doi:10.1109/NETSOFT.2016.7502412'
apa: Dräxler, S., & Karl, H. (2016). Placement of Services with Flexible Structures
Specified by a YANG Data Model. In Proceedings of the 2nd International IEEE
Conference on Network Softwarization (NetSoft) (pp. 184--192). https://doi.org/10.1109/NETSOFT.2016.7502412
bibtex: '@inproceedings{Dräxler_Karl_2016, title={Placement of Services with Flexible
Structures Specified by a YANG Data Model}, DOI={10.1109/NETSOFT.2016.7502412},
booktitle={Proceedings of the 2nd International IEEE Conference on Network Softwarization
(NetSoft)}, author={Dräxler, Sevil and Karl, Holger}, year={2016}, pages={184--192}
}'
chicago: Dräxler, Sevil, and Holger Karl. “Placement of Services with Flexible Structures
Specified by a YANG Data Model.” In Proceedings of the 2nd International IEEE
Conference on Network Softwarization (NetSoft), 184--192, 2016. https://doi.org/10.1109/NETSOFT.2016.7502412.
ieee: S. Dräxler and H. Karl, “Placement of Services with Flexible Structures Specified
by a YANG Data Model,” in Proceedings of the 2nd International IEEE Conference
on Network Softwarization (NetSoft), 2016, pp. 184--192.
mla: Dräxler, Sevil, and Holger Karl. “Placement of Services with Flexible Structures
Specified by a YANG Data Model.” Proceedings of the 2nd International IEEE
Conference on Network Softwarization (NetSoft), 2016, pp. 184--192, doi:10.1109/NETSOFT.2016.7502412.
short: 'S. Dräxler, H. Karl, in: Proceedings of the 2nd International IEEE Conference
on Network Softwarization (NetSoft), 2016, pp. 184--192.'
date_created: 2017-10-17T12:41:24Z
date_updated: 2022-01-06T06:52:53Z
ddc:
- '040'
department:
- _id: '75'
doi: 10.1109/NETSOFT.2016.7502412
file:
- access_level: open_access
content_type: application/pdf
creator: sevilmeh
date_created: 2018-06-25T07:53:54Z
date_updated: 2018-06-25T07:53:54Z
file_id: '3322'
file_name: RIS.pdf
file_size: 1471937
relation: main_file
file_date_updated: 2018-06-25T07:53:54Z
has_accepted_license: '1'
main_file_link:
- url: http://ieeexplore.ieee.org/search/searchresult.jsp?newsearch=true&queryText=10.1109%2FNETSOFT.2016.7502412
oa: '1'
page: 184--192
project:
- _id: '1'
name: SFB 901
- _id: '16'
name: SFB 901 - Subprojekt C4
- _id: '4'
name: SFB 901 - Project Area C
- _id: '25'
call_identifier: 5G PPP Phase 1
grant_number: '671517'
name: 'SONATA NFV: Agile Service Development and Orchestration in 5G Virtualized
Networks'
publication: Proceedings of the 2nd International IEEE Conference on Network Softwarization
(NetSoft)
status: public
title: Placement of Services with Flexible Structures Specified by a YANG Data Model
type: conference
urn: '1665'
user_id: '31764'
year: '2016'
...
---
_id: '153'
author:
- first_name: Jürgen
full_name: König, Jürgen
last_name: König
citation:
ama: König J. Shared Resource Scheduling with Interconnected Services. Universität
Paderborn; 2016.
apa: König, J. (2016). Shared Resource Scheduling with Interconnected Services.
Universität Paderborn.
bibtex: '@book{König_2016, title={Shared Resource Scheduling with Interconnected
Services}, publisher={Universität Paderborn}, author={König, Jürgen}, year={2016}
}'
chicago: König, Jürgen. Shared Resource Scheduling with Interconnected Services.
Universität Paderborn, 2016.
ieee: J. König, Shared Resource Scheduling with Interconnected Services.
Universität Paderborn, 2016.
mla: König, Jürgen. Shared Resource Scheduling with Interconnected Services.
Universität Paderborn, 2016.
short: J. König, Shared Resource Scheduling with Interconnected Services, Universität
Paderborn, 2016.
date_created: 2017-10-17T12:41:21Z
date_updated: 2022-01-06T06:52:20Z
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '16'
name: SFB 901 - Subproject C4
publisher: Universität Paderborn
status: public
title: Shared Resource Scheduling with Interconnected Services
type: mastersthesis
user_id: '15504'
year: '2016'
...
---
_id: '157'
abstract:
- lang: eng
text: Consider a scheduling problem in which a set of jobs with interjob communication,
canonically represented by a weighted tree, needs to be scheduled on m parallel
processors interconnected by a shared communication channel. In each time step,
we may allow any processed job to use a certain capacity of the channel in order
to satisfy (parts of) its communication demands to adjacent jobs processed in
parallel. The goal is to find a schedule that minimizes the makespan and in which
communication demands of all jobs are satisfied.We show that this problem is NP-hard
in the strong sense even if the number of processors and the maximum degree of
the underlying tree is constant.Consequently, we design and analyze simple approximation
algorithms with asymptotic approximation ratio 2-2/m in case of paths and a ratio
of 5/2 in case of arbitrary trees.
author:
- first_name: Jürgen
full_name: König, Jürgen
last_name: König
- 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
- first_name: Sören
full_name: Riechers, Sören
last_name: Riechers
citation:
ama: 'König J, Mäcker A, Meyer auf der Heide F, Riechers S. Scheduling with Interjob
Communication on Parallel Processors. In: Proceedings of the 10th Annual International
Conference on Combinatorial Optimization and Applications (COCOA). LNCS. ;
2016:563--577. doi:10.1007/978-3-319-48749-6_41'
apa: König, J., Mäcker, A., Meyer auf der Heide, F., & Riechers, S. (2016).
Scheduling with Interjob Communication on Parallel Processors. In Proceedings
of the 10th Annual International Conference on Combinatorial Optimization and
Applications (COCOA) (pp. 563--577). https://doi.org/10.1007/978-3-319-48749-6_41
bibtex: '@inproceedings{König_Mäcker_Meyer auf der Heide_Riechers_2016, series={LNCS},
title={Scheduling with Interjob Communication on Parallel Processors}, DOI={10.1007/978-3-319-48749-6_41},
booktitle={Proceedings of the 10th Annual International Conference on Combinatorial
Optimization and Applications (COCOA)}, author={König, Jürgen and Mäcker, Alexander
and Meyer auf der Heide, Friedhelm and Riechers, Sören}, year={2016}, pages={563--577},
collection={LNCS} }'
chicago: König, Jürgen, Alexander Mäcker, Friedhelm Meyer auf der Heide, and Sören
Riechers. “Scheduling with Interjob Communication on Parallel Processors.” In
Proceedings of the 10th Annual International Conference on Combinatorial Optimization
and Applications (COCOA), 563--577. LNCS, 2016. https://doi.org/10.1007/978-3-319-48749-6_41.
ieee: J. König, A. Mäcker, F. Meyer auf der Heide, and S. Riechers, “Scheduling
with Interjob Communication on Parallel Processors,” in Proceedings of the
10th Annual International Conference on Combinatorial Optimization and Applications
(COCOA), 2016, pp. 563--577.
mla: König, Jürgen, et al. “Scheduling with Interjob Communication on Parallel Processors.”
Proceedings of the 10th Annual International Conference on Combinatorial Optimization
and Applications (COCOA), 2016, pp. 563--577, doi:10.1007/978-3-319-48749-6_41.
short: 'J. König, A. Mäcker, F. Meyer auf der Heide, S. Riechers, in: Proceedings
of the 10th Annual International Conference on Combinatorial Optimization and
Applications (COCOA), 2016, pp. 563--577.'
date_created: 2017-10-17T12:41:22Z
date_updated: 2022-01-06T06:52:32Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1007/978-3-319-48749-6_41
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T12:50:29Z
date_updated: 2018-03-21T12:50:29Z
file_id: '1549'
file_name: 157-chp_3A10.1007_2F978-3-319-48749-6_41.pdf
file_size: 753147
relation: main_file
success: 1
file_date_updated: 2018-03-21T12:50:29Z
has_accepted_license: '1'
page: 563--577
project:
- _id: '1'
name: SFB 901
- _id: '16'
name: SFB 901 - Subprojekt C4
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 10th Annual International Conference on Combinatorial
Optimization and Applications (COCOA)
series_title: LNCS
status: public
title: Scheduling with Interjob Communication on Parallel Processors
type: conference
user_id: '15504'
year: '2016'
...
---
_id: '163'
citation:
ama: Dressler F, Meyer auf der Heide F, eds. Proceedings of the 17th ACM International
Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc). ACM; 2016.
doi:10.1145/2942358
apa: 'Dressler, F., & Meyer auf der Heide, F. (Eds.). (2016). Proceedings
of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing
(MobiHoc). Presented at the MobiHoc, Paderborn, Germany: ACM. https://doi.org/10.1145/2942358'
bibtex: '@book{Dressler_Meyer auf der Heide_2016, title={Proceedings of the 17th
ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)},
DOI={10.1145/2942358}, publisher={ACM},
year={2016} }'
chicago: Dressler, Falko, and Friedhelm Meyer auf der Heide, eds. Proceedings
of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing
(MobiHoc). ACM, 2016. https://doi.org/10.1145/2942358.
ieee: F. Dressler and F. Meyer auf der Heide, Eds., Proceedings of the 17th ACM
International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc).
ACM, 2016.
mla: Dressler, Falko, and Friedhelm Meyer auf der Heide, editors. Proceedings
of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing
(MobiHoc). ACM, 2016, doi:10.1145/2942358.
short: F. Dressler, F. Meyer auf der Heide, eds., Proceedings of the 17th ACM International
Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc), ACM, 2016.
conference:
end_date: 2016-07-08
location: Paderborn, Germany
name: MobiHoc
start_date: 2016-07-04
date_created: 2017-10-17T12:41:23Z
date_updated: 2022-01-06T06:52:48Z
department:
- _id: '63'
doi: 10.1145/2942358
editor:
- first_name: Falko
full_name: Dressler, Falko
last_name: Dressler
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
project:
- _id: '1'
name: SFB 901
- _id: '16'
name: SFB 901 - Subprojekt C4
- _id: '4'
name: SFB 901 - Project Area C
publisher: ACM
status: public
title: Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking
and Computing (MobiHoc)
type: conference_editor
user_id: '15504'
year: '2016'
...
---
_id: '139'
abstract:
- lang: eng
text: 'We consider online optimization problems in which certain goods have to be
acquired in order to provide a service or infrastructure. Classically, decisions
for such problems are considered as final: one buys the goods. However, in many
real world applications, there is a shift away from the idea of buying goods.
Instead, leasing is often a more flexible and lucrative business model. Research
has realized this shift and recently initiated the theoretical study of leasing
models (Anthony and Gupta in Proceedings of the integer programming and combinatorial
optimization: 12th International IPCO Conference, Ithaca, NY, USA, June 25–27,
2007; Meyerson in Proceedings of the 46th Annual IEEE Symposium on Foundations
of Computer Science (FOCS 2005), 23–25 Oct 2005, Pittsburgh, PA, USA, 2005; Nagarajan
and Williamson in Discret Optim 10(4):361–370, 2013) We extend this line of work
and suggest a more systematic study of leasing aspects for a class of online optimization
problems. We provide two major technical results. We introduce the leasing variant
of online set multicover and give an O(log(mK)logn)-competitive algorithm (with
n, m, and K being the number of elements, sets, and leases, respectively). Our
results also imply improvements for the non-leasing variant of online set cover.
Moreover, we extend results for the leasing variant of online facility location.
Nagarajan and Williamson (Discret Optim 10(4):361–370, 2013) gave an O(Klogn)-competitive
algorithm for this problem (with n and K being the number of clients and leases,
respectively). We remove the dependency on n (and, thereby, on time). In general,
this leads to a bound of O(lmaxloglmax) (with the maximal lease length lmax).
For many natural problem instances, the bound improves to O(K2).'
author:
- first_name: Sebastian
full_name: Abshoff, Sebastian
last_name: Abshoff
- first_name: Peter
full_name: Kling, Peter
last_name: Kling
- 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
- first_name: 'Peter '
full_name: 'Pietrzyk, Peter '
last_name: Pietrzyk
citation:
ama: Abshoff S, Kling P, Markarian C, Meyer auf der Heide F, Pietrzyk P. Towards
the price of leasing online. Journal of Combinatorial Optimization. 2016;(4):1197--1216.
doi:10.1007/s10878-015-9915-5
apa: Abshoff, S., Kling, P., Markarian, C., Meyer auf der Heide, F., & Pietrzyk,
P. (2016). Towards the price of leasing online. Journal of Combinatorial Optimization,
(4), 1197--1216. https://doi.org/10.1007/s10878-015-9915-5
bibtex: '@article{Abshoff_Kling_Markarian_Meyer auf der Heide_Pietrzyk_2016, title={Towards
the price of leasing online}, DOI={10.1007/s10878-015-9915-5},
number={4}, journal={Journal of Combinatorial Optimization}, publisher={Springer},
author={Abshoff, Sebastian and Kling, Peter and Markarian, Christine and Meyer
auf der Heide, Friedhelm and Pietrzyk, Peter }, year={2016}, pages={1197--1216}
}'
chicago: 'Abshoff, Sebastian, Peter Kling, Christine Markarian, Friedhelm Meyer
auf der Heide, and Peter Pietrzyk. “Towards the Price of Leasing Online.” Journal
of Combinatorial Optimization, no. 4 (2016): 1197--1216. https://doi.org/10.1007/s10878-015-9915-5.'
ieee: S. Abshoff, P. Kling, C. Markarian, F. Meyer auf der Heide, and P. Pietrzyk,
“Towards the price of leasing online,” Journal of Combinatorial Optimization,
no. 4, pp. 1197--1216, 2016.
mla: Abshoff, Sebastian, et al. “Towards the Price of Leasing Online.” Journal
of Combinatorial Optimization, no. 4, Springer, 2016, pp. 1197--1216, doi:10.1007/s10878-015-9915-5.
short: S. Abshoff, P. Kling, C. Markarian, F. Meyer auf der Heide, P. Pietrzyk,
Journal of Combinatorial Optimization (2016) 1197--1216.
date_created: 2017-10-17T12:41:18Z
date_updated: 2022-01-06T06:51:46Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.1007/s10878-015-9915-5
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T15:57:25Z
date_updated: 2018-11-02T15:57:25Z
file_id: '5318'
file_name: Abshoff-TowardsThePriceOfLeasingOnline.pdf
file_size: 654903
relation: main_file
success: 1
file_date_updated: 2018-11-02T15:57:25Z
has_accepted_license: '1'
issue: '4'
language:
- iso: eng
page: ' 1197--1216'
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '16'
name: SFB 901 - Subprojekt C4
- _id: '2'
name: SFB 901 - Project Area A
- _id: '4'
name: SFB 901 - Project Area C
publication: Journal of Combinatorial Optimization
publisher: Springer
status: public
title: Towards the price of leasing online
type: journal_article
user_id: '477'
year: '2016'
...
---
_id: '264'
author:
- first_name: Philip
full_name: Wette, Philip
last_name: Wette
citation:
ama: Wette P. Optimizing Software-Defined Networks Using Application-Layer Knowledge.
Universität Paderborn; 2015.
apa: Wette, P. (2015). Optimizing Software-Defined Networks using Application-Layer
Knowledge. Universität Paderborn.
bibtex: '@book{Wette_2015, title={Optimizing Software-Defined Networks using Application-Layer
Knowledge}, publisher={Universität Paderborn}, author={Wette, Philip}, year={2015}
}'
chicago: Wette, Philip. Optimizing Software-Defined Networks Using Application-Layer
Knowledge. Universität Paderborn, 2015.
ieee: P. Wette, Optimizing Software-Defined Networks using Application-Layer
Knowledge. Universität Paderborn, 2015.
mla: Wette, Philip. Optimizing Software-Defined Networks Using Application-Layer
Knowledge. Universität Paderborn, 2015.
short: P. Wette, Optimizing Software-Defined Networks Using Application-Layer Knowledge,
Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:43Z
date_updated: 2022-01-06T06:57:20Z
ddc:
- '040'
department:
- _id: '75'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:34:36Z
date_updated: 2018-03-21T09:34:36Z
file_id: '1481'
file_name: 264-Dissertation_-_Wette.pdf
file_size: 8031107
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:34:36Z
has_accepted_license: '1'
project:
- _id: '1'
name: SFB 901
- _id: '6'
name: SFB 901 - Subprojekt A2
- _id: '16'
name: SFB 901 - Subprojekt C4
- _id: '2'
name: SFB 901 - Project Area A
- _id: '4'
name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
title: Optimizing Software-Defined Networks using Application-Layer Knowledge
type: dissertation
user_id: '477'
year: '2015'
...
---
_id: '266'
abstract:
- lang: eng
text: 'Many markets have seen a shift from the idea of buying and moved to leasing
instead. Arguably, the latter has been the major catalyst for their success. Ten
years ago, research realized this shift and initiated the study of "online leasing
problems" by introducing leasing to online optimization problems. Resources required
to provide a service in an "online leasing problem" are no more bought but leased
for different durations. In this paper, we provide an overview of results that
contribute to the understanding of "online resource leasing problems". '
author:
- first_name: Christine
full_name: Markarian, Christine
id: '37612'
last_name: Markarian
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Markarian C, Meyer auf der Heide F. Online Resource Leasing. In: Proceedings
of the 2015 ACM Symposium on Principles of Distributed Computing (PODC). ;
2015:343-344. doi:10.1145/2767386.2767454'
apa: Markarian, C., & Meyer auf der Heide, F. (2015). Online Resource Leasing.
In Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing
(PODC) (pp. 343–344). https://doi.org/10.1145/2767386.2767454
bibtex: '@inproceedings{Markarian_Meyer auf der Heide_2015, title={Online Resource
Leasing}, DOI={10.1145/2767386.2767454},
booktitle={Proceedings of the 2015 ACM Symposium on Principles of Distributed
Computing (PODC)}, author={Markarian, Christine and Meyer auf der Heide, Friedhelm},
year={2015}, pages={343–344} }'
chicago: Markarian, Christine, and Friedhelm Meyer auf der Heide. “Online Resource
Leasing.” In Proceedings of the 2015 ACM Symposium on Principles of Distributed
Computing (PODC), 343–44, 2015. https://doi.org/10.1145/2767386.2767454.
ieee: C. Markarian and F. Meyer auf der Heide, “Online Resource Leasing,” in Proceedings
of the 2015 ACM Symposium on Principles of Distributed Computing (PODC), 2015,
pp. 343–344.
mla: Markarian, Christine, and Friedhelm Meyer auf der Heide. “Online Resource Leasing.”
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing
(PODC), 2015, pp. 343–44, doi:10.1145/2767386.2767454.
short: 'C. Markarian, F. Meyer auf der Heide, in: Proceedings of the 2015 ACM Symposium
on Principles of Distributed Computing (PODC), 2015, pp. 343–344.'
date_created: 2017-10-17T12:41:44Z
date_updated: 2022-01-06T06:57:22Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1145/2767386.2767454
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:33:11Z
date_updated: 2018-03-21T09:33:11Z
file_id: '1478'
file_name: 266-p343-markarian.pdf
file_size: 679580
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:33:11Z
has_accepted_license: '1'
page: 343-344
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '16'
name: SFB 901 - Subprojekt C4
- _id: '2'
name: SFB 901 - Project Area A
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing
(PODC)
status: public
title: Online Resource Leasing
type: conference
user_id: '15504'
year: '2015'
...
---
_id: '267'
author:
- first_name: Christine
full_name: Markarian, Christine
id: '37612'
last_name: Markarian
citation:
ama: Markarian C. Online Resource Leasing. Universität Paderborn; 2015.
apa: Markarian, C. (2015). Online Resource Leasing. Universität Paderborn.
bibtex: '@book{Markarian_2015, title={Online Resource Leasing}, publisher={Universität
Paderborn}, author={Markarian, Christine}, year={2015} }'
chicago: Markarian, Christine. Online Resource Leasing. Universität Paderborn,
2015.
ieee: C. Markarian, Online Resource Leasing. Universität Paderborn, 2015.
mla: Markarian, Christine. Online Resource Leasing. Universität Paderborn,
2015.
short: C. Markarian, Online Resource Leasing, Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:44Z
date_updated: 2022-01-06T06:57:26Z
ddc:
- '040'
department:
- _id: '63'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:33:41Z
date_updated: 2018-03-21T09:33:41Z
file_id: '1479'
file_name: 267-Dissertation_-_Markarian.pdf
file_size: 1328685
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:33:41Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '16'
name: SFB 901 - Subprojekt C4
- _id: '4'
name: SFB 901 - Project Area C
publisher: Universität Paderborn
related_material:
link:
- relation: confirmation
url: http://nbn-resolving.de/urn:nbn:de:hbz:466:2-16656
status: public
supervisor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
title: Online Resource Leasing
type: dissertation
user_id: '15415'
year: '2015'
...
---
_id: '271'
abstract:
- lang: eng
text: In \emph{bandwidth allocation games} (BAGs), the strategy of a player consists
of various demands on different resources. The player's utility is at most the
sum of these demands, provided they are fully satisfied. Every resource has a
limited capacity and if it is exceeded by the total demand, it has to be split
between the players. Since these games generally do not have pure Nash equilibria,
we consider approximate pure Nash equilibria, in which no player can improve her
utility by more than some fixed factor $\alpha$ through unilateral strategy changes.
There is a threshold $\alpha_\delta$ (where $\delta$ is a parameter that limits
the demand of each player on a specific resource) such that $\alpha$-approximate
pure Nash equilibria always exist for $\alpha \geq \alpha_\delta$, but not for
$\alpha < \alpha_\delta$. We give both upper and lower bounds on this threshold
$\alpha_\delta$ and show that the corresponding decision problem is ${\sf NP}$-hard.
We also show that the $\alpha$-approximate price of anarchy for BAGs is $\alpha+1$.
For a restricted version of the game, where demands of players only differ slightly
from each other (e.g. symmetric games), we show that approximate Nash equilibria
can be reached (and thus also be computed) in polynomial time using the best-response
dynamic. Finally, we show that a broader class of utility-maximization games (which
includes BAGs) converges quickly towards states whose social welfare is close
to the optimum.
author:
- first_name: Maximilian
full_name: Drees, Maximilian
last_name: Drees
- first_name: Matthias
full_name: Feldotto, Matthias
id: '14052'
last_name: Feldotto
orcid: 0000-0003-1348-6516
- first_name: Sören
full_name: Riechers, Sören
last_name: Riechers
- first_name: Alexander
full_name: Skopalik, Alexander
id: '40384'
last_name: Skopalik
citation:
ama: 'Drees M, Feldotto M, Riechers S, Skopalik A. On Existence and Properties of
Approximate Pure Nash Equilibria in Bandwidth Allocation Games. In: Proceedings
of the 8th International Symposium on Algorithmic Game Theory (SAGT). Lecture
Notes in Computer Science. ; 2015:178-189. doi:10.1007/978-3-662-48433-3_14'
apa: Drees, M., Feldotto, M., Riechers, S., & Skopalik, A. (2015). On Existence
and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games.
In Proceedings of the 8th International Symposium on Algorithmic Game Theory
(SAGT) (pp. 178–189). https://doi.org/10.1007/978-3-662-48433-3_14
bibtex: '@inproceedings{Drees_Feldotto_Riechers_Skopalik_2015, series={Lecture Notes
in Computer Science}, title={On Existence and Properties of Approximate Pure Nash
Equilibria in Bandwidth Allocation Games}, DOI={10.1007/978-3-662-48433-3_14},
booktitle={Proceedings of the 8th International Symposium on Algorithmic Game
Theory (SAGT)}, author={Drees, Maximilian and Feldotto, Matthias and Riechers,
Sören and Skopalik, Alexander}, year={2015}, pages={178–189}, collection={Lecture
Notes in Computer Science} }'
chicago: Drees, Maximilian, Matthias Feldotto, Sören Riechers, and Alexander Skopalik.
“On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth
Allocation Games.” In Proceedings of the 8th International Symposium on Algorithmic
Game Theory (SAGT), 178–89. Lecture Notes in Computer Science, 2015. https://doi.org/10.1007/978-3-662-48433-3_14.
ieee: M. Drees, M. Feldotto, S. Riechers, and A. Skopalik, “On Existence and Properties
of Approximate Pure Nash Equilibria in Bandwidth Allocation Games,” in Proceedings
of the 8th International Symposium on Algorithmic Game Theory (SAGT), 2015,
pp. 178–189.
mla: Drees, Maximilian, et al. “On Existence and Properties of Approximate Pure
Nash Equilibria in Bandwidth Allocation Games.” Proceedings of the 8th International
Symposium on Algorithmic Game Theory (SAGT), 2015, pp. 178–89, doi:10.1007/978-3-662-48433-3_14.
short: 'M. Drees, M. Feldotto, S. Riechers, A. Skopalik, in: Proceedings of the
8th International Symposium on Algorithmic Game Theory (SAGT), 2015, pp. 178–189.'
date_created: 2017-10-17T12:41:45Z
date_updated: 2022-01-06T06:57:34Z
ddc:
- '040'
department:
- _id: '63'
- _id: '541'
doi: 10.1007/978-3-662-48433-3_14
external_id:
arxiv:
- '1507.02908'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:29:34Z
date_updated: 2018-03-21T09:29:34Z
file_id: '1475'
file_name: 271-chp_3A10.1007_2F978-3-662-48433-3_14.pdf
file_size: 256718
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:29:34Z
has_accepted_license: '1'
page: 178-189
project:
- _id: '1'
name: SFB 901
- _id: '7'
name: SFB 901 - Subprojekt A3
- _id: '16'
name: SFB 901 - Subproject C4
- _id: '2'
name: SFB 901 - Project Area A
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 8th International Symposium on Algorithmic Game Theory
(SAGT)
series_title: Lecture Notes in Computer Science
status: public
title: On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth
Allocation Games
type: conference
user_id: '14052'
year: '2015'
...
---
_id: '274'
abstract:
- lang: eng
text: Consider the problem in which n jobs that are classified into k types are
to be scheduled on m identical machines without preemption. A machine requires
a proper setup taking s time units before processing jobs of a given type. The
objective is to minimize the makespan of the resulting schedule. We design and
analyze an approximation algorithm that runs in time polynomial in n,m and k and
computes a solution with an approximation factor that can be made arbitrarily
close to 3/2.
author:
- first_name: Alexander
full_name: Mäcker, Alexander
id: '13536'
last_name: Mäcker
- first_name: Manuel
full_name: Malatyali, Manuel
last_name: Malatyali
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Sören
full_name: Riechers, Sören
last_name: Riechers
citation:
ama: 'Mäcker A, Malatyali M, Meyer auf der Heide F, Riechers S. Non-preemptive Scheduling
on Machines with Setup Times. In: Dehne F, Sack JR, Stege U, eds. Algorithms
and Data Structures: 14th International Symposium, WADS 2015, Victoria, BC, Canada,
August 5-7, 2015. Proceedings. Lecture Notes in Computer Science. ; 2015:542--553.
doi:10.1007/978-3-319-21840-3_45'
apa: 'Mäcker, A., Malatyali, M., Meyer auf der Heide, F., & Riechers, S. (2015).
Non-preemptive Scheduling on Machines with Setup Times. In F. Dehne, J. R. Sack,
& U. Stege (Eds.), Algorithms and Data Structures: 14th International Symposium,
WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings (pp. 542--553).
https://doi.org/10.1007/978-3-319-21840-3_45'
bibtex: '@inproceedings{Mäcker_Malatyali_Meyer auf der Heide_Riechers_2015, series={Lecture
Notes in Computer Science}, title={Non-preemptive Scheduling on Machines with
Setup Times}, DOI={10.1007/978-3-319-21840-3_45},
booktitle={Algorithms and Data Structures: 14th International Symposium, WADS
2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings}, author={Mäcker, Alexander
and Malatyali, Manuel and Meyer auf der Heide, Friedhelm and Riechers, Sören},
editor={Dehne, Frank and Sack, Jörg Rüdiger and Stege, UlrikeEditors}, year={2015},
pages={542--553}, collection={Lecture Notes in Computer Science} }'
chicago: 'Mäcker, Alexander, Manuel Malatyali, Friedhelm Meyer auf der Heide, and
Sören Riechers. “Non-Preemptive Scheduling on Machines with Setup Times.” In Algorithms
and Data Structures: 14th International Symposium, WADS 2015, Victoria, BC, Canada,
August 5-7, 2015. Proceedings, edited by Frank Dehne, Jörg Rüdiger Sack, and
Ulrike Stege, 542--553. Lecture Notes in Computer Science, 2015. https://doi.org/10.1007/978-3-319-21840-3_45.'
ieee: 'A. Mäcker, M. Malatyali, F. Meyer auf der Heide, and S. Riechers, “Non-preemptive
Scheduling on Machines with Setup Times,” in Algorithms and Data Structures:
14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015.
Proceedings, 2015, pp. 542--553.'
mla: 'Mäcker, Alexander, et al. “Non-Preemptive Scheduling on Machines with Setup
Times.” Algorithms and Data Structures: 14th International Symposium, WADS
2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings, edited by Frank
Dehne et al., 2015, pp. 542--553, doi:10.1007/978-3-319-21840-3_45.'
short: 'A. Mäcker, M. Malatyali, F. Meyer auf der Heide, S. Riechers, in: F. Dehne,
J.R. Sack, U. Stege (Eds.), Algorithms and Data Structures: 14th International
Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings, 2015,
pp. 542--553.'
date_created: 2017-10-17T12:41:45Z
date_updated: 2022-01-06T06:57:39Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1007/978-3-319-21840-3_45
editor:
- first_name: Frank
full_name: Dehne, Frank
last_name: Dehne
- first_name: Jörg Rüdiger
full_name: Sack, Jörg Rüdiger
last_name: Sack
- first_name: Ulrike
full_name: Stege, Ulrike
last_name: Stege
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:28:34Z
date_updated: 2018-03-21T09:28:34Z
file_id: '1473'
file_name: 274-chp_3A10.1007_2F978-3-319-21840-3_45.pdf
file_size: 215498
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:28:34Z
has_accepted_license: '1'
page: 542--553
project:
- _id: '1'
name: SFB 901
- _id: '16'
name: SFB 901 - Subprojekt C4
- _id: '4'
name: SFB 901 - Project Area C
publication: 'Algorithms and Data Structures: 14th International Symposium, WADS 2015,
Victoria, BC, Canada, August 5-7, 2015. Proceedings'
series_title: Lecture Notes in Computer Science
status: public
title: Non-preemptive Scheduling on Machines with Setup Times
type: conference
user_id: '15504'
year: '2015'
...
---
_id: '240'
abstract:
- lang: eng
text: We consider online leasing problems in which demands arrive over time and
need to be served by leasing resources. We introduce a new model for these problems
such that a resource can be leased for K different durations each incurring a
different cost (longer leases cost less per time unit). Each demand i can be served
anytime between its arrival ai and its deadline ai+di by a leased resource. The
objective is to meet all deadlines while minimizing the total leasing costs. This
model is a natural generalization of Meyerson’s ParkingPermitProblem (FOCS 2005)
in which di=0 for all i. We propose an online algorithm that is Θ(K+dmaxlmin)-competitive
where dmax and lmin denote the largest di and the shortest available lease length,
respectively. We also extend the SetCoverLeasing problem by deadlines and give
a competitive online algorithm which also improves on existing solutions for the
original SetCoverLeasing problem.
author:
- first_name: Shouwei
full_name: Li, Shouwei
last_name: Li
- first_name: Alexander
full_name: Mäcker, Alexander
id: '13536'
last_name: Mäcker
- 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
- first_name: Sören
full_name: Riechers, Sören
last_name: Riechers
citation:
ama: 'Li S, Mäcker A, Markarian C, Meyer auf der Heide F, Riechers S. Towards Flexible
Demands in Online Leasing Problems. In: Proceedings of the 21st Annual International
Computing and Combinatorics Conference (COCOON). Lecture Notes in Computer
Science. ; 2015:277--288. doi:10.1007/978-3-319-21398-9_22'
apa: Li, S., Mäcker, A., Markarian, C., Meyer auf der Heide, F., & Riechers,
S. (2015). Towards Flexible Demands in Online Leasing Problems. In Proceedings
of the 21st Annual International Computing and Combinatorics Conference (COCOON)
(pp. 277--288). https://doi.org/10.1007/978-3-319-21398-9_22
bibtex: '@inproceedings{Li_Mäcker_Markarian_Meyer auf der Heide_Riechers_2015, series={Lecture
Notes in Computer Science}, title={Towards Flexible Demands in Online Leasing
Problems}, DOI={10.1007/978-3-319-21398-9_22},
booktitle={Proceedings of the 21st Annual International Computing and Combinatorics
Conference (COCOON)}, author={Li, Shouwei and Mäcker, Alexander and Markarian,
Christine and Meyer auf der Heide, Friedhelm and Riechers, Sören}, year={2015},
pages={277--288}, collection={Lecture Notes in Computer Science} }'
chicago: Li, Shouwei, Alexander Mäcker, Christine Markarian, Friedhelm Meyer auf
der Heide, and Sören Riechers. “Towards Flexible Demands in Online Leasing Problems.”
In Proceedings of the 21st Annual International Computing and Combinatorics
Conference (COCOON), 277--288. Lecture Notes in Computer Science, 2015. https://doi.org/10.1007/978-3-319-21398-9_22.
ieee: S. Li, A. Mäcker, C. Markarian, F. Meyer auf der Heide, and S. Riechers, “Towards
Flexible Demands in Online Leasing Problems,” in Proceedings of the 21st Annual
International Computing and Combinatorics Conference (COCOON), 2015, pp. 277--288.
mla: Li, Shouwei, et al. “Towards Flexible Demands in Online Leasing Problems.”
Proceedings of the 21st Annual International Computing and Combinatorics Conference
(COCOON), 2015, pp. 277--288, doi:10.1007/978-3-319-21398-9_22.
short: 'S. Li, A. Mäcker, C. Markarian, F. Meyer auf der Heide, S. Riechers, in:
Proceedings of the 21st Annual International Computing and Combinatorics Conference
(COCOON), 2015, pp. 277--288.'
date_created: 2017-10-17T12:41:38Z
date_updated: 2022-01-06T06:56:05Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1007/978-3-319-21398-9_22
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T10:28:50Z
date_updated: 2018-03-21T10:28:50Z
file_id: '1498'
file_name: 240-chp_3A10.1007_2F978-3-319-21398-9_22.pdf
file_size: 264482
relation: main_file
success: 1
file_date_updated: 2018-03-21T10:28:50Z
has_accepted_license: '1'
page: 277--288
project:
- _id: '1'
name: SFB 901
- _id: '16'
name: SFB 901 - Subprojekt C4
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 21st Annual International Computing and Combinatorics
Conference (COCOON)
series_title: Lecture Notes in Computer Science
status: public
title: Towards Flexible Demands in Online Leasing Problems
type: conference
user_id: '15504'
year: '2015'
...
---
_id: '986'
abstract:
- lang: eng
text: "The increasing amount of mobile traffic leads to a significantly higher energy
consumption of mobile networks that is mainly caused by the high number of required
base stations. One recent solution for this is based on a two-layered network
that uses long-range macro cells to provide a full coverage signaling overlay
and short-range small cells for fast data transmissions. These small cells can
be switched off when they are not needed and allow network-wide energy optimizations.\r\n\r\nThis
paper presents an architecture that extends existing mobile networks to integrate
a small cell layer that supports on-demand cell activation. We discuss how additional
small cells can be interconnected with existing core components and how they can
be controlled by a resource management component. \r\nFinally, a Wi-Fi based proof
of concept testbed implementation is presented that demonstrates the feasibility
of the approach."
accept: '1'
author:
- first_name: Manuel
full_name: Peuster, Manuel
id: '13271'
last_name: Peuster
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: 'Peuster M, Karl H. An Architecture for Energy-aware On-demand Mobile Network
Management. In: Proceedings of the 5th Workshop on All Things Cellular: Operations,
Applications and Challenges. ; 2015.'
apa: 'Peuster, M., & Karl, H. (2015). An Architecture for Energy-aware On-demand
Mobile Network Management. In Proceedings of the 5th Workshop on All Things
Cellular: Operations, Applications and Challenges. London.'
bibtex: '@inproceedings{Peuster_Karl_2015, title={An Architecture for Energy-aware
On-demand Mobile Network Management}, booktitle={Proceedings of the 5th Workshop
on All Things Cellular: Operations, Applications and Challenges}, author={Peuster,
Manuel and Karl, Holger}, year={2015} }'
chicago: 'Peuster, Manuel, and Holger Karl. “An Architecture for Energy-Aware On-Demand
Mobile Network Management.” In Proceedings of the 5th Workshop on All Things
Cellular: Operations, Applications and Challenges, 2015.'
ieee: 'M. Peuster and H. Karl, “An Architecture for Energy-aware On-demand Mobile
Network Management,” in Proceedings of the 5th Workshop on All Things Cellular:
Operations, Applications and Challenges, London, 2015.'
mla: 'Peuster, Manuel, and Holger Karl. “An Architecture for Energy-Aware On-Demand
Mobile Network Management.” Proceedings of the 5th Workshop on All Things Cellular:
Operations, Applications and Challenges, 2015.'
short: 'M. Peuster, H. Karl, in: Proceedings of the 5th Workshop on All Things Cellular:
Operations, Applications and Challenges, 2015.'
conference:
location: London
name: 'Proceedings of the 5th Workshop on All Things Cellular: Operations, Applications
and Challenges'
date_created: 2017-11-27T10:22:29Z
date_updated: 2019-01-03T13:18:55Z
ddc:
- '000'
department:
- _id: '75'
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T14:06:06Z
date_updated: 2018-11-02T14:06:06Z
file_id: '5261'
file_name: p25-peuster.pdf
file_size: 1916017
open_access: 1
relation: main_file
success: 1
file_date_updated: 2018-11-02T14:06:06Z
language:
- iso: eng
main_file_link:
- url: https://dl.acm.org/citation.cfm?id=2785973
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '16'
name: SFB 901 - Subproject C4
publication: 'Proceedings of the 5th Workshop on All Things Cellular: Operations,
Applications and Challenges'
publication_status: published
status: public
title: An Architecture for Energy-aware On-demand Mobile Network Management
type: conference
user_id: '477'
year: '2015'
...