---
_id: '9867'
abstract:
- lang: eng
text: We report the piezoelectric properties of CuO-doped hydrothermal (K,Na)NbO3
ceramics that can be applied as hard-type lead-free piezoelectric ceramics. To
date, we have succeeded in synthesizing high-quality KNbO3 and NaNbO3 powders
by the hydrothermal method, which is based on an ionic reaction at high temperature
(around 210 $\,^{\circ}$C) and pressure. Increasing both the piezoelectric constant
d and the mechanical quality factor (Qm) is important for resonance-type piezoelectric
devices, such as ultrasonic motors and transformers. CuO doping into hydrothermal
(K,Na)NbO3 ceramics was examined to realize hard-type lead-free piezoelectric
ceramics. By doping with 1.2 mol \% CuO, Qm was increased and the dielectric loss
(tan δ) was decreased to 0.5\%. The grain size was also influenced by the amount
of CuO doping, which indicates that Qm is related to the density. To achieve a
higher Qm value, the grain size is required to be less than 5 µm; however, excessive
CuO doping leads to anomalous grain growth. Optimal piezoelectric properties were
obtained for 1.2 mol \% CuO-doped (K,Na)NbO3; k31 = 0.32, d31 = -44 pC/N, Qm (radial)
= 959, and tan δ= 0.5\%. These characteristics showed that CuO doping with hydrothermal
powders is effective for obtaining hard-type ceramics, and the mechanical quality
factor is more than ten times higher than that of nondoped hydrothermal (K,Na)NbO3
ceramics. Therefore, compared with the conventional solid-state method, we could
succeed in obtaining hard-type ceramics by a simple and short process.
author:
- first_name: Yuriko
full_name: Yokouchi, Yuriko
last_name: Yokouchi
- first_name: Takafumi
full_name: Maeda, Takafumi
last_name: Maeda
- first_name: Peter
full_name: Bornmann, Peter
last_name: Bornmann
- first_name: Tobias
full_name: Hemsel, Tobias
id: '210'
last_name: Hemsel
- first_name: Takeshi
full_name: Morita, Takeshi
last_name: Morita
citation:
ama: Yokouchi Y, Maeda T, Bornmann P, Hemsel T, Morita T. Piezoelectric Properties
of CuO-Doped (K,Na)NbO3 Lead-Free Ceramics Synthesized with Hydrothermal Powders.
Japanese Journal of Applied Physics. 2013;52(7S). doi:10.7567/JJAP.52.07HB03
apa: Yokouchi, Y., Maeda, T., Bornmann, P., Hemsel, T., & Morita, T. (2013).
Piezoelectric Properties of CuO-Doped (K,Na)NbO3 Lead-Free Ceramics Synthesized
with Hydrothermal Powders. Japanese Journal of Applied Physics, 52(7S).
https://doi.org/10.7567/JJAP.52.07HB03
bibtex: '@article{Yokouchi_Maeda_Bornmann_Hemsel_Morita_2013, title={Piezoelectric
Properties of CuO-Doped (K,Na)NbO3 Lead-Free Ceramics Synthesized with Hydrothermal
Powders}, volume={52}, DOI={10.7567/JJAP.52.07HB03},
number={7S}, journal={Japanese Journal of Applied Physics}, author={Yokouchi,
Yuriko and Maeda, Takafumi and Bornmann, Peter and Hemsel, Tobias and Morita,
Takeshi}, year={2013} }'
chicago: Yokouchi, Yuriko, Takafumi Maeda, Peter Bornmann, Tobias Hemsel, and Takeshi
Morita. “Piezoelectric Properties of CuO-Doped (K,Na)NbO3 Lead-Free Ceramics Synthesized
with Hydrothermal Powders.” Japanese Journal of Applied Physics 52, no.
7S (2013). https://doi.org/10.7567/JJAP.52.07HB03.
ieee: Y. Yokouchi, T. Maeda, P. Bornmann, T. Hemsel, and T. Morita, “Piezoelectric
Properties of CuO-Doped (K,Na)NbO3 Lead-Free Ceramics Synthesized with Hydrothermal
Powders,” Japanese Journal of Applied Physics, vol. 52, no. 7S, 2013.
mla: Yokouchi, Yuriko, et al. “Piezoelectric Properties of CuO-Doped (K,Na)NbO3
Lead-Free Ceramics Synthesized with Hydrothermal Powders.” Japanese Journal
of Applied Physics, vol. 52, no. 7S, 2013, doi:10.7567/JJAP.52.07HB03.
short: Y. Yokouchi, T. Maeda, P. Bornmann, T. Hemsel, T. Morita, Japanese Journal
of Applied Physics 52 (2013).
date_created: 2019-05-20T12:06:04Z
date_updated: 2019-05-20T12:08:02Z
department:
- _id: '151'
doi: 10.7567/JJAP.52.07HB03
intvolume: ' 52'
issue: 7S
language:
- iso: eng
publication: Japanese Journal of Applied Physics
status: public
title: Piezoelectric Properties of CuO-Doped (K,Na)NbO3 Lead-Free Ceramics Synthesized
with Hydrothermal Powders
type: journal_article
user_id: '55222'
volume: 52
year: '2013'
...
---
_id: '503'
author:
- first_name: Andreas
full_name: Blix, Andreas
last_name: Blix
citation:
ama: Blix A. Optimale und adaptive binäre Bäume in Netzwerken. Universität
Paderborn; 2013.
apa: Blix, A. (2013). Optimale und adaptive binäre Bäume in Netzwerken. Universität
Paderborn.
bibtex: '@book{Blix_2013, title={Optimale und adaptive binäre Bäume in Netzwerken},
publisher={Universität Paderborn}, author={Blix, Andreas}, year={2013} }'
chicago: Blix, Andreas. Optimale und adaptive binäre Bäume in Netzwerken.
Universität Paderborn, 2013.
ieee: A. Blix, Optimale und adaptive binäre Bäume in Netzwerken. Universität
Paderborn, 2013.
mla: Blix, Andreas. Optimale und adaptive binäre Bäume in Netzwerken. Universität
Paderborn, 2013.
short: A. Blix, Optimale und adaptive binäre Bäume in Netzwerken, Universität Paderborn,
2013.
date_created: 2017-10-17T12:42:30Z
date_updated: 2022-01-06T07:01:35Z
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: Optimale und adaptive binäre Bäume in Netzwerken
type: bachelorsthesis
user_id: '477'
year: '2013'
...
---
_id: '5031'
author:
- first_name: Jörg
full_name: Becker, Jörg
last_name: Becker
- first_name: Torben
full_name: Bernhold, Torben
last_name: Bernhold
- first_name: Daniel
full_name: Beverungen, Daniel
id: '59677'
last_name: Beverungen
- first_name: Nina
full_name: Kaling, Nina
last_name: Kaling
- first_name: Ralf
full_name: Knackstedt, Ralf
last_name: Knackstedt
- first_name: Lellek
full_name: Vanessa, Lellek
last_name: Vanessa
- first_name: Hans
full_name: Peter Rauer, Hans
last_name: Peter Rauer
citation:
ama: 'Becker J, Bernhold T, Beverungen D, et al. Softwaregestützte Konstruktion
von Produktivitätsmodellen im Facility Management. In: Thomas O, Nüttgens M, eds.
Dienstleistungsmodellierung 2012: Product-Service Systems Und Produktivität.
Wiesbaden; 2013:208--226. doi:10.1007/978-3-658-00863-5'
apa: 'Becker, J., Bernhold, T., Beverungen, D., Kaling, N., Knackstedt, R., Vanessa,
L., & Peter Rauer, H. (2013). Softwaregestützte Konstruktion von Produktivitätsmodellen
im Facility Management. In O. Thomas & M. Nüttgens (Eds.), Dienstleistungsmodellierung
2012: Product-Service Systems und Produktivität (pp. 208--226). Wiesbaden.
https://doi.org/10.1007/978-3-658-00863-5'
bibtex: '@inbook{Becker_Bernhold_Beverungen_Kaling_Knackstedt_Vanessa_Peter Rauer_2013,
place={Wiesbaden}, title={Softwaregestützte Konstruktion von Produktivitätsmodellen
im Facility Management}, DOI={10.1007/978-3-658-00863-5},
booktitle={Dienstleistungsmodellierung 2012: Product-Service Systems und Produktivität},
author={Becker, Jörg and Bernhold, Torben and Beverungen, Daniel and Kaling, Nina
and Knackstedt, Ralf and Vanessa, Lellek and Peter Rauer, Hans}, editor={Thomas,
Oliver and Nüttgens, MarkusEditors}, year={2013}, pages={208--226} }'
chicago: 'Becker, Jörg, Torben Bernhold, Daniel Beverungen, Nina Kaling, Ralf Knackstedt,
Lellek Vanessa, and Hans Peter Rauer. “Softwaregestützte Konstruktion von Produktivitätsmodellen
Im Facility Management.” In Dienstleistungsmodellierung 2012: Product-Service
Systems Und Produktivität, edited by Oliver Thomas and Markus Nüttgens, 208--226.
Wiesbaden, 2013. https://doi.org/10.1007/978-3-658-00863-5.'
ieee: 'J. Becker et al., “Softwaregestützte Konstruktion von Produktivitätsmodellen
im Facility Management,” in Dienstleistungsmodellierung 2012: Product-Service
Systems und Produktivität, O. Thomas and M. Nüttgens, Eds. Wiesbaden, 2013,
pp. 208--226.'
mla: 'Becker, Jörg, et al. “Softwaregestützte Konstruktion von Produktivitätsmodellen
Im Facility Management.” Dienstleistungsmodellierung 2012: Product-Service
Systems Und Produktivität, edited by Oliver Thomas and Markus Nüttgens, 2013,
pp. 208--226, doi:10.1007/978-3-658-00863-5.'
short: 'J. Becker, T. Bernhold, D. Beverungen, N. Kaling, R. Knackstedt, L. Vanessa,
H. Peter Rauer, in: O. Thomas, M. Nüttgens (Eds.), Dienstleistungsmodellierung
2012: Product-Service Systems Und Produktivität, Wiesbaden, 2013, pp. 208--226.'
date_created: 2018-10-30T13:32:55Z
date_updated: 2022-01-06T07:01:35Z
department:
- _id: '526'
doi: 10.1007/978-3-658-00863-5
editor:
- first_name: Oliver
full_name: Thomas, Oliver
last_name: Thomas
- first_name: Markus
full_name: Nüttgens, Markus
last_name: Nüttgens
extern: '1'
page: 208--226
place: Wiesbaden
publication: 'Dienstleistungsmodellierung 2012: Product-Service Systems und Produktivität'
status: public
title: Softwaregestützte Konstruktion von Produktivitätsmodellen im Facility Management
type: book_chapter
user_id: '21671'
year: '2013'
...
---
_id: '507'
abstract:
- lang: eng
text: We study two-party communication in the context of directed dynamic networks
that are controlled by an adaptive adversary. This adversary is able to change
all edges as long as the networks stay strongly-connected in each round. In this
work, we establish a relation between counting the total number of nodes in the
network and the problem of exchanging tokens between two communication partners
which communicate through a dynamic network. We show that the communication problem
for a constant fraction of n tokens in a dynamic network with n nodes is at most
as hard as counting the number of nodes in a dynamic network with at most 4n+3
nodes. For the proof, we construct a family of directed dynamic networks and apply
a lower bound from two-party communication complexity.
author:
- first_name: Sebastian
full_name: Abshoff, Sebastian
last_name: Abshoff
- first_name: Markus
full_name: Benter, Markus
last_name: Benter
- 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
citation:
ama: 'Abshoff S, Benter M, Malatyali M, Meyer auf der Heide F. On Two-Party Communication
Through Dynamic Networks. In: Proceedings of the 17th International Conference
on Principles of Distributed Systems (OPODIS). LNCS. ; 2013:11-22. doi:10.1007/978-3-319-03850-6_2'
apa: Abshoff, S., Benter, M., Malatyali, M., & Meyer auf der Heide, F. (2013).
On Two-Party Communication Through Dynamic Networks. In Proceedings of the
17th International Conference on Principles of Distributed Systems (OPODIS)
(pp. 11–22). https://doi.org/10.1007/978-3-319-03850-6_2
bibtex: '@inproceedings{Abshoff_Benter_Malatyali_Meyer auf der Heide_2013, series={LNCS},
title={On Two-Party Communication Through Dynamic Networks}, DOI={10.1007/978-3-319-03850-6_2},
booktitle={Proceedings of the 17th International Conference on Principles of Distributed
Systems (OPODIS)}, author={Abshoff, Sebastian and Benter, Markus and Malatyali,
Manuel and Meyer auf der Heide, Friedhelm}, year={2013}, pages={11–22}, collection={LNCS}
}'
chicago: Abshoff, Sebastian, Markus Benter, Manuel Malatyali, and Friedhelm Meyer
auf der Heide. “On Two-Party Communication Through Dynamic Networks.” In Proceedings
of the 17th International Conference on Principles of Distributed Systems (OPODIS),
11–22. LNCS, 2013. https://doi.org/10.1007/978-3-319-03850-6_2.
ieee: S. Abshoff, M. Benter, M. Malatyali, and F. Meyer auf der Heide, “On Two-Party
Communication Through Dynamic Networks,” in Proceedings of the 17th International
Conference on Principles of Distributed Systems (OPODIS), 2013, pp. 11–22.
mla: Abshoff, Sebastian, et al. “On Two-Party Communication Through Dynamic Networks.”
Proceedings of the 17th International Conference on Principles of Distributed
Systems (OPODIS), 2013, pp. 11–22, doi:10.1007/978-3-319-03850-6_2.
short: 'S. Abshoff, M. Benter, M. Malatyali, F. Meyer auf der Heide, in: Proceedings
of the 17th International Conference on Principles of Distributed Systems (OPODIS),
2013, pp. 11–22.'
date_created: 2017-10-17T12:42:31Z
date_updated: 2022-01-06T07:01:36Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1007/978-3-319-03850-6_2
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T10:47:31Z
date_updated: 2018-03-15T10:47:31Z
file_id: '1305'
file_name: 507-on-two-party-communication-through-dynamic-networks_01.pdf
file_size: 181398
relation: main_file
success: 1
file_date_updated: 2018-03-15T10:47:31Z
has_accepted_license: '1'
page: 11-22
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 17th International Conference on Principles of Distributed
Systems (OPODIS)
series_title: LNCS
status: public
title: On Two-Party Communication Through Dynamic Networks
type: conference
user_id: '15504'
year: '2013'
...
---
_id: '510'
author:
- first_name: Chintan
full_name: Jayesh Parekh, Chintan
last_name: Jayesh Parekh
citation:
ama: Jayesh Parekh C. Meta-Data Based Search in Structured Peer-to-Peer Networks.
Universität Paderborn; 2013.
apa: Jayesh Parekh, C. (2013). Meta-data based Search in Structured Peer-to-Peer
Networks. Universität Paderborn.
bibtex: '@book{Jayesh Parekh_2013, title={Meta-data based Search in Structured Peer-to-Peer
Networks}, publisher={Universität Paderborn}, author={Jayesh Parekh, Chintan},
year={2013} }'
chicago: Jayesh Parekh, Chintan. Meta-Data Based Search in Structured Peer-to-Peer
Networks. Universität Paderborn, 2013.
ieee: C. Jayesh Parekh, Meta-data based Search in Structured Peer-to-Peer Networks.
Universität Paderborn, 2013.
mla: Jayesh Parekh, Chintan. Meta-Data Based Search in Structured Peer-to-Peer
Networks. Universität Paderborn, 2013.
short: C. Jayesh Parekh, Meta-Data Based Search in Structured Peer-to-Peer Networks,
Universität Paderborn, 2013.
date_created: 2017-10-17T12:42:31Z
date_updated: 2022-01-06T07:01:37Z
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: Meta-data based Search in Structured Peer-to-Peer Networks
type: mastersthesis
user_id: '15504'
year: '2013'
...
---
_id: '513'
abstract:
- lang: eng
text: This paper initiates the study of self-adjusting networks (or distributed
data structures) whose topologies dynamically adapt to a communication pattern
$\sigma$. We present a fully decentralized self-adjusting solution called SplayNet.
A SplayNet is a distributed generalization of the classic splay tree concept.
It ensures short paths (which can be found using local-greedy routing) between
communication partners while minimizing topological rearrangements. We derive
an upper bound for the amortized communication cost of a SplayNet based on empirical
entropies of $\sigma$, and show that SplayNets have several interesting convergence
properties. For instance, SplayNets features a provable online optimality under
special requests scenarios. We also investigate the optimal static network and
prove different lower bounds for the average communication cost based on graph
cuts and on the empirical entropy of the communication pattern $\sigma$. From
these lower bounds it follows, e.g., that SplayNets are optimal in scenarios where
the requests follow a product distribution as well. Finally, this paper shows
that in contrast to the Minimum Linear Arrangement problem which is generally
NP-hard, the optimal static tree network can be computed in polynomial time for
any guest graph, despite the exponentially large graph family. We complement our
formal analysis with a small simulation study on a Facebook graph.
author:
- first_name: Chen
full_name: Avin, Chen
last_name: Avin
- first_name: Bernhard
full_name: Häupler, Bernhard
last_name: Häupler
- first_name: Zvi
full_name: Lotker, Zvi
last_name: Lotker
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
citation:
ama: 'Avin C, Häupler B, Lotker Z, Scheideler C, Schmid S. Locally Self-Adjusting
Tree Networks. In: Proceedings of the 27th IEEE International Parallel and
Distributed Processing Symposium (IPDPS). ; 2013:395-406. doi:10.1109/IPDPS.2013.40'
apa: Avin, C., Häupler, B., Lotker, Z., Scheideler, C., & Schmid, S. (2013).
Locally Self-Adjusting Tree Networks. In Proceedings of the 27th IEEE International
Parallel and Distributed Processing Symposium (IPDPS) (pp. 395–406). https://doi.org/10.1109/IPDPS.2013.40
bibtex: '@inproceedings{Avin_Häupler_Lotker_Scheideler_Schmid_2013, title={Locally
Self-Adjusting Tree Networks}, DOI={10.1109/IPDPS.2013.40},
booktitle={Proceedings of the 27th IEEE International Parallel and Distributed
Processing Symposium (IPDPS)}, author={Avin, Chen and Häupler, Bernhard and Lotker,
Zvi and Scheideler, Christian and Schmid, Stefan}, year={2013}, pages={395–406}
}'
chicago: Avin, Chen, Bernhard Häupler, Zvi Lotker, Christian Scheideler, and Stefan
Schmid. “Locally Self-Adjusting Tree Networks.” In Proceedings of the 27th
IEEE International Parallel and Distributed Processing Symposium (IPDPS),
395–406, 2013. https://doi.org/10.1109/IPDPS.2013.40.
ieee: C. Avin, B. Häupler, Z. Lotker, C. Scheideler, and S. Schmid, “Locally Self-Adjusting
Tree Networks,” in Proceedings of the 27th IEEE International Parallel and
Distributed Processing Symposium (IPDPS), 2013, pp. 395–406.
mla: Avin, Chen, et al. “Locally Self-Adjusting Tree Networks.” Proceedings of
the 27th IEEE International Parallel and Distributed Processing Symposium (IPDPS),
2013, pp. 395–406, doi:10.1109/IPDPS.2013.40.
short: 'C. Avin, B. Häupler, Z. Lotker, C. Scheideler, S. Schmid, in: Proceedings
of the 27th IEEE International Parallel and Distributed Processing Symposium (IPDPS),
2013, pp. 395–406.'
date_created: 2017-10-17T12:42:32Z
date_updated: 2022-01-06T07:01:38Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1109/IPDPS.2013.40
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T10:45:15Z
date_updated: 2018-03-15T10:45:15Z
file_id: '1303'
file_name: 513-ipdps13_01.pdf
file_size: 518804
relation: main_file
success: 1
file_date_updated: 2018-03-15T10:45:15Z
has_accepted_license: '1'
page: 395-406
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 27th IEEE International Parallel and Distributed Processing
Symposium (IPDPS)
status: public
title: Locally Self-Adjusting Tree Networks
type: conference
user_id: '15504'
year: '2013'
...
---
_id: '514'
abstract:
- lang: eng
text: Diese Arbeit besch{\"a}ftigt sich mit dem Facility Location Problem. Dies
ist ein Optimierungsproblem, bei dem festgelegt werden muss an welchen Positionen
Ressourcen zur Verf{\"u}gung gestellt werden, so dass diese von Nutzern gut erreicht
werden k{\"o}nnen. Es sollen dabei Kosten minimiert werden, die zum einen durch
Bereitstellung von Ressourcen und zum anderen durch Verbindungskosten zwischen
Nutzern und Ressourcen entstehen. Die Schwierigkeit des Problems liegt darin,
dass man einerseits m{\"o}glichst wenige Ressourcen zur Verf{\"u}gung stellen
m{\"o}chte, andererseits daf{\"u}r sorgen muss, dass sich Nutzer nicht all zu
weit weg von Ressourcen befinden. Dies w{\"u}rde n{\"a}mlich hohe Verbindungskosten
nach sich ziehen. Das Facility Location Problem wurde bereits sehr intensiv in
vielen unterschiedlichen Varianten untersucht. In dieser Arbeit werden drei Varianten
des Problems modelliert und neue Algorithmen f{\"u}r sie entwickelt und bez{\"u}glich
ihres Approximationsfaktors und ihrer Laufzeit analysiert. Jede dieser drei untersuchten
Varianten hat einen besonderen Schwerpunkt. Bei der ersten Varianten handelt es
sich um ein Online Problem, da hier die Eingabe nicht von Anfang an bekannt ist,
sondern Schritt f{\"u}r Schritt enth{\"u}llt wird. Die Schwierigkeit hierbei besteht
darin unwiderrufliche Entscheidungen treffen zu m{\"u}ssen ohne dabei die Zukunft
zu kennen und trotzdem eine zu jeder Zeit gute L{\"o}sung angeben zu k{\"o}nnen.
Der Schwerpunkt der zweiten Variante liegt auf Lokalit{\"a}t, die z.B. in Sensornetzwerken
von großer Bedeutung ist. Hier soll eine L{\"o}sung verteilt und nur mit Hilfe
von lokalen Information berechnet werden. Schließlich besch{\"a}ftigt sich die
dritte Variante mit einer verteilten Berechnung, bei welcher nur eine stark beschr{\"a}nkte
Datenmenge verschickt werden darf und dabei trotzdem ein sehr guter Approximationsfaktor
erreicht werden muss. Die bei der Analyse der Approximationsfaktoren bzw. der
Kompetitivit{\"a}t verwendeten Techniken basieren zum großen Teil auf Absch{\"a}tzung
der primalen L{\"o}sung mit Hilfe einer L{\"o}sung des zugeh{\"o}rigen dualen
Problems. F{\"u}r die Modellierung von Lokalit{\"a}t wird das weitverbreitete
LOCAL Modell verwendet. In diesem Modell werden f{\"u}r die Algorithmen subpolynomielle
obere Laufzeitschranken gezeigt.
author:
- first_name: Peter
full_name: Pietrzyk, Peter
last_name: Pietrzyk
citation:
ama: Pietrzyk P. Local and Online Algorithms for Facility Location. Universität
Paderborn; 2013.
apa: Pietrzyk, P. (2013). Local and Online Algorithms for Facility Location.
Universität Paderborn.
bibtex: '@book{Pietrzyk_2013, title={Local and Online Algorithms for Facility Location},
publisher={Universität Paderborn}, author={Pietrzyk, Peter}, year={2013} }'
chicago: Pietrzyk, Peter. Local and Online Algorithms for Facility Location.
Universität Paderborn, 2013.
ieee: P. Pietrzyk, Local and Online Algorithms for Facility Location. Universität
Paderborn, 2013.
mla: Pietrzyk, Peter. Local and Online Algorithms for Facility Location.
Universität Paderborn, 2013.
short: P. Pietrzyk, Local and Online Algorithms for Facility Location, Universität
Paderborn, 2013.
date_created: 2017-10-17T12:42:32Z
date_updated: 2022-01-06T07:01:38Z
ddc:
- '040'
department:
- _id: '63'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T10:44:13Z
date_updated: 2018-03-15T10:44:13Z
file_id: '1302'
file_name: 514-DissertationPietrzyk.pdf
file_size: 790821
relation: main_file
success: 1
file_date_updated: 2018-03-15T10:44:13Z
has_accepted_license: '1'
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
title: Local and Online Algorithms for Facility Location
type: dissertation
user_id: '477'
year: '2013'
...
---
_id: '522'
author:
- first_name: Matthias
full_name: Feldotto, Matthias
id: '14052'
last_name: Feldotto
orcid: 0000-0003-1348-6516
citation:
ama: 'Feldotto M. HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous
Bandwidths. Universität Paderborn; 2013.'
apa: 'Feldotto, M. (2013). HSkip+: A Self-Stabilizing Overlay Network for Nodes
with Heterogeneous Bandwidths. Universität Paderborn.'
bibtex: '@book{Feldotto_2013, title={HSkip+: A Self-Stabilizing Overlay Network
for Nodes with Heterogeneous Bandwidths}, publisher={Universität Paderborn}, author={Feldotto,
Matthias}, year={2013} }'
chicago: 'Feldotto, Matthias. HSkip+: A Self-Stabilizing Overlay Network for
Nodes with Heterogeneous Bandwidths. Universität Paderborn, 2013.'
ieee: 'M. Feldotto, HSkip+: A Self-Stabilizing Overlay Network for Nodes with
Heterogeneous Bandwidths. Universität Paderborn, 2013.'
mla: 'Feldotto, Matthias. HSkip+: A Self-Stabilizing Overlay Network for Nodes
with Heterogeneous Bandwidths. Universität Paderborn, 2013.'
short: 'M. Feldotto, HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous
Bandwidths, Universität Paderborn, 2013.'
date_created: 2017-10-17T12:42:34Z
date_updated: 2022-01-06T07:01:47Z
department:
- _id: '79'
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Teilprojekt A
- _id: '5'
name: SFB 901 - Subprojekt A1
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: 'HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths'
type: mastersthesis
user_id: '14052'
year: '2013'
...
---
_id: '524'
abstract:
- lang: eng
text: 'We study the complexity theory for the local distributed setting introduced
by Korman, Peleg and Fraigniaud. They have defined three complexity classes LD
(Local Decision), NLD (Nondeterministic Local Decision) and NLD^#n. The class
LD consists of all languages which can be decided with a constant number of communication
rounds. The class NLD consists of all languages which can be verified by a nondeterministic
algorithm with a constant number of communication rounds. In order to define the
nondeterministic classes, they have transferred the notation of nondeterminism
into the distributed setting by the use of certificates and verifiers. The class
NLD^#n consists of all languages which can be verified by a nondeterministic algorithm
where each node has access to an oracle for the number of nodes. They have shown
the hierarchy LD subset NLD subset NLD^#n. Our main contributions are strict hierarchies
within the classes defined by Korman, Peleg and Fraigniaud. We define additional
complexity classes: the class LD(t) consists of all languages which can be decided
with at most t communication rounds. The class NLD-O(f) consists of all languages
which can be verified by a local verifier such that the size of the certificates
that are needed to verify the language are bounded by a function from O(f). Our
main results are refined strict hierarchies within these nondeterministic classes.'
author:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Kamil
full_name: Swirkot, Kamil
last_name: Swirkot
citation:
ama: Meyer auf der Heide F, Swirkot K. Hierarchies in Local Distributed Decision.
2013.
apa: Meyer auf der Heide, F., & Swirkot, K. (2013). Hierarchies in Local Distributed
Decision. arXiv.
bibtex: '@article{Meyer auf der Heide_Swirkot_2013, title={Hierarchies in Local
Distributed Decision}, publisher={arXiv}, author={Meyer auf der Heide, Friedhelm
and Swirkot, Kamil}, year={2013} }'
chicago: Meyer auf der Heide, Friedhelm, and Kamil Swirkot. “Hierarchies in Local
Distributed Decision.” arXiv, 2013.
ieee: F. Meyer auf der Heide and K. Swirkot, “Hierarchies in Local Distributed Decision.”
arXiv, 2013.
mla: Meyer auf der Heide, Friedhelm, and Kamil Swirkot. Hierarchies in Local
Distributed Decision. arXiv, 2013.
short: F. Meyer auf der Heide, K. Swirkot, (2013).
date_created: 2017-10-17T12:42:34Z
date_updated: 2022-01-06T07:01:48Z
ddc:
- '040'
department:
- _id: '63'
external_id:
arxiv:
- '1311.7229'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T10:37:07Z
date_updated: 2018-03-15T10:37:07Z
file_id: '1296'
file_name: 524-paper_01.pdf
file_size: 534906
relation: main_file
success: 1
file_date_updated: 2018-03-15T10:37:07Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publisher: arXiv
status: public
title: Hierarchies in Local Distributed Decision
type: preprint
user_id: '15415'
year: '2013'
...
---
_id: '526'
author:
- first_name: Alexander
full_name: Mäcker, Alexander
id: '13536'
last_name: Mäcker
citation:
ama: Mäcker A. Greedy Network Creation With Heavy And Light Edges. Universität
Paderborn; 2013.
apa: Mäcker, A. (2013). Greedy Network Creation With Heavy And Light Edges.
Universität Paderborn.
bibtex: '@book{Mäcker_2013, title={Greedy Network Creation With Heavy And Light
Edges}, publisher={Universität Paderborn}, author={Mäcker, Alexander}, year={2013}
}'
chicago: Mäcker, Alexander. Greedy Network Creation With Heavy And Light Edges.
Universität Paderborn, 2013.
ieee: A. Mäcker, Greedy Network Creation With Heavy And Light Edges. Universität
Paderborn, 2013.
mla: Mäcker, Alexander. Greedy Network Creation With Heavy And Light Edges.
Universität Paderborn, 2013.
short: A. Mäcker, Greedy Network Creation With Heavy And Light Edges, Universität
Paderborn, 2013.
date_created: 2017-10-17T12:42:35Z
date_updated: 2022-01-06T07:01:48Z
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: Greedy Network Creation With Heavy And Light Edges
type: mastersthesis
user_id: '15504'
year: '2013'
...
---
_id: '537'
author:
- first_name: Stefan
full_name: Heindorf, Stefan
last_name: Heindorf
citation:
ama: Heindorf S. Dispersion of Multi-Robot Teams. Universität Paderborn;
2013.
apa: Heindorf, S. (2013). Dispersion of Multi-Robot Teams. Universität Paderborn.
bibtex: '@book{Heindorf_2013, title={Dispersion of Multi-Robot Teams}, publisher={Universität
Paderborn}, author={Heindorf, Stefan}, year={2013} }'
chicago: Heindorf, Stefan. Dispersion of Multi-Robot Teams. Universität Paderborn,
2013.
ieee: S. Heindorf, Dispersion of Multi-Robot Teams. Universität Paderborn,
2013.
mla: Heindorf, Stefan. Dispersion of Multi-Robot Teams. Universität Paderborn,
2013.
short: S. Heindorf, Dispersion of Multi-Robot Teams, Universität Paderborn, 2013.
date_created: 2017-10-17T12:42:37Z
date_updated: 2022-01-06T07:01:50Z
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: Dispersion of Multi-Robot Teams
type: mastersthesis
user_id: '15504'
year: '2013'
...
---
_id: '541'
abstract:
- lang: eng
text: Existing solutions for gossip-based aggregation in peer-to-peer networks use
epochs to calculate a global estimation from an initial static set of local values.
Once the estimation converges system-wide, a new epoch is started with fresh initial
values. Long epochs result in precise estimations based on old measurements and
short epochs result in imprecise aggregated estimations. In contrast to this approach,
we present in this paper a continuous, epoch-less approach which considers fresh
local values in every round of the gossip-based aggregation. By using an approach
for dynamic information aging, inaccurate values and values from left peers fade
from the aggregation memory. Evaluation shows that the presented approach for
continuous information aggregation in peer-to-peer systems monitors the system
performance precisely, adapts to changes and is lightweight to operate.
author:
- first_name: Kalman
full_name: Graffi, Kalman
last_name: Graffi
- first_name: Vitaly
full_name: Rapp, Vitaly
last_name: Rapp
citation:
ama: 'Graffi K, Rapp V. Continuous Gossip-based Aggregation through Dynamic Information
Aging. In: Proceedings of the International Conference on Computer Communications
and Networks (ICCCN’13). ; 2013:1-7. doi:10.1109/ICCCN.2013.6614118'
apa: Graffi, K., & Rapp, V. (2013). Continuous Gossip-based Aggregation through
Dynamic Information Aging. In Proceedings of the International Conference on
Computer Communications and Networks (ICCCN’13) (pp. 1–7). https://doi.org/10.1109/ICCCN.2013.6614118
bibtex: '@inproceedings{Graffi_Rapp_2013, title={Continuous Gossip-based Aggregation
through Dynamic Information Aging}, DOI={10.1109/ICCCN.2013.6614118},
booktitle={Proceedings of the International Conference on Computer Communications
and Networks (ICCCN’13)}, author={Graffi, Kalman and Rapp, Vitaly}, year={2013},
pages={1–7} }'
chicago: Graffi, Kalman, and Vitaly Rapp. “Continuous Gossip-Based Aggregation through
Dynamic Information Aging.” In Proceedings of the International Conference
on Computer Communications and Networks (ICCCN’13), 1–7, 2013. https://doi.org/10.1109/ICCCN.2013.6614118.
ieee: K. Graffi and V. Rapp, “Continuous Gossip-based Aggregation through Dynamic
Information Aging,” in Proceedings of the International Conference on Computer
Communications and Networks (ICCCN’13), 2013, pp. 1–7.
mla: Graffi, Kalman, and Vitaly Rapp. “Continuous Gossip-Based Aggregation through
Dynamic Information Aging.” Proceedings of the International Conference on
Computer Communications and Networks (ICCCN’13), 2013, pp. 1–7, doi:10.1109/ICCCN.2013.6614118.
short: 'K. Graffi, V. Rapp, in: Proceedings of the International Conference on Computer
Communications and Networks (ICCCN’13), 2013, pp. 1–7.'
date_created: 2017-10-17T12:42:37Z
date_updated: 2022-01-06T07:01:52Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1109/ICCCN.2013.6614118
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T10:33:20Z
date_updated: 2018-03-15T10:33:20Z
file_id: '1290'
file_name: 541-Continuous.Gossip.based.Aggregation.Through.Dynamic.Information.Aging.pdf
file_size: 272960
relation: main_file
success: 1
file_date_updated: 2018-03-15T10:33:20Z
has_accepted_license: '1'
language:
- iso: eng
page: 1-7
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 Computer Communications
and Networks (ICCCN'13)
status: public
title: Continuous Gossip-based Aggregation through Dynamic Information Aging
type: conference
user_id: '477'
year: '2013'
...
---
_id: '544'
abstract:
- lang: eng
text: Comparative evaluations of peer-to-peer protocols through simulations are
a viable approach to judge the performance and costs of the individual protocols
in large-scale networks. In order to support this work, we enhanced the peer-to-peer
systems simulator PeerfactSim.KOM with a fine-grained analyzer concept, with exhaustive
automated measurements and gnuplot generators as well as a coordination control
to evaluate a set of experiment setups in parallel. Thus, by configuring all experiments
and protocols only once and starting the simulator, all desired measurements are
performed, analyzed, evaluated and combined, resulting in a holistic environment
for the comparative evaluation of peer-to-peer systems.
author:
- first_name: Matthias
full_name: Feldotto, Matthias
id: '14052'
last_name: Feldotto
orcid: 0000-0003-1348-6516
- first_name: Kalman
full_name: Graffi, Kalman
last_name: Graffi
citation:
ama: 'Feldotto M, Graffi K. Comparative Evaluation of Peer-to-Peer Systems Using
PeerfactSim.KOM. In: Proceedings of the International Conference on High Performance
Computing and Simulation (HPCS’13). ; 2013:99-106. doi:10.1109/HPCSim.2013.6641399'
apa: Feldotto, M., & Graffi, K. (2013). Comparative Evaluation of Peer-to-Peer
Systems Using PeerfactSim.KOM. In Proceedings of the International Conference
on High Performance Computing and Simulation (HPCS’13) (pp. 99–106). https://doi.org/10.1109/HPCSim.2013.6641399
bibtex: '@inproceedings{Feldotto_Graffi_2013, title={Comparative Evaluation of Peer-to-Peer
Systems Using PeerfactSim.KOM}, DOI={10.1109/HPCSim.2013.6641399},
booktitle={Proceedings of the International Conference on High Performance Computing
and Simulation (HPCS’13)}, author={Feldotto, Matthias and Graffi, Kalman}, year={2013},
pages={99–106} }'
chicago: Feldotto, Matthias, and Kalman Graffi. “Comparative Evaluation of Peer-to-Peer
Systems Using PeerfactSim.KOM.” In Proceedings of the International Conference
on High Performance Computing and Simulation (HPCS’13), 99–106, 2013. https://doi.org/10.1109/HPCSim.2013.6641399.
ieee: M. Feldotto and K. Graffi, “Comparative Evaluation of Peer-to-Peer Systems
Using PeerfactSim.KOM,” in Proceedings of the International Conference on High
Performance Computing and Simulation (HPCS’13), 2013, pp. 99–106.
mla: Feldotto, Matthias, and Kalman Graffi. “Comparative Evaluation of Peer-to-Peer
Systems Using PeerfactSim.KOM.” Proceedings of the International Conference
on High Performance Computing and Simulation (HPCS’13), 2013, pp. 99–106,
doi:10.1109/HPCSim.2013.6641399.
short: 'M. Feldotto, K. Graffi, in: Proceedings of the International Conference
on High Performance Computing and Simulation (HPCS’13), 2013, pp. 99–106.'
date_created: 2017-10-17T12:42:38Z
date_updated: 2022-01-06T07:01:53Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1109/HPCSim.2013.6641399
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T10:32:17Z
date_updated: 2018-03-15T10:32:17Z
file_id: '1288'
file_name: 544-FeldGraffi13.pdf
file_size: 899441
relation: main_file
success: 1
file_date_updated: 2018-03-15T10:32:17Z
has_accepted_license: '1'
language:
- iso: eng
page: 99-106
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 High Performance Computing
and Simulation (HPCS'13)
status: public
title: Comparative Evaluation of Peer-to-Peer Systems Using PeerfactSim.KOM
type: conference
user_id: '14052'
year: '2013'
...
---
_id: '545'
author:
- first_name: Fritz
full_name: Blumentritt, Fritz
last_name: Blumentritt
citation:
ama: Blumentritt F. Cliquenbildung in verteilten Systemen. Universität Paderborn;
2013.
apa: Blumentritt, F. (2013). Cliquenbildung in verteilten Systemen. Universität
Paderborn.
bibtex: '@book{Blumentritt_2013, title={Cliquenbildung in verteilten Systemen},
publisher={Universität Paderborn}, author={Blumentritt, Fritz}, year={2013} }'
chicago: Blumentritt, Fritz. Cliquenbildung in verteilten Systemen. Universität
Paderborn, 2013.
ieee: F. Blumentritt, Cliquenbildung in verteilten Systemen. Universität
Paderborn, 2013.
mla: Blumentritt, Fritz. Cliquenbildung in verteilten Systemen. Universität
Paderborn, 2013.
short: F. Blumentritt, Cliquenbildung in verteilten Systemen, Universität Paderborn,
2013.
date_created: 2017-10-17T12:42:38Z
date_updated: 2022-01-06T07:01:54Z
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: Cliquenbildung in verteilten Systemen
type: bachelorsthesis
user_id: '477'
year: '2013'
...
---
_id: '546'
abstract:
- lang: eng
text: Self-stabilization is the property of a system to transfer itself regardless
of the initial state into a legitimate state. Chord as a simple, decentralized
and scalable distributed hash table is an ideal showcase to introduce self-stabilization
for p2p overlays. In this paper, we present Re-Chord, a self-stabilizing version
of Chord. We show, that the stabilization process is functional, but prone to
strong churn. For that, we present Ca-Re-Chord, a churn resistant version of Re-Chord,
that allows the creation of a useful DHT in any kind of graph regardless of the
initial state. Simulation results attest the churn resistance and good performance
of Ca-Re-Chord.
author:
- first_name: Kalman
full_name: Graffi, Kalman
last_name: Graffi
- first_name: Markus
full_name: Benter, Markus
last_name: Benter
- first_name: Mohammad
full_name: Divband, Mohammad
last_name: Divband
- first_name: Sebastian
full_name: Kniesburges, Sebastian
last_name: Kniesburges
- first_name: Andreas
full_name: Koutsopoulos, Andreas
last_name: Koutsopoulos
citation:
ama: 'Graffi K, Benter M, Divband M, Kniesburges S, Koutsopoulos A. Ca-Re-Chord:
A Churn Resistant Self-stabilizing Chord Overlay Network. In: Proceedings of
the Conference on Networked Systems (NetSys). ; 2013:27-34. doi:10.1109/NetSys.2013.11'
apa: 'Graffi, K., Benter, M., Divband, M., Kniesburges, S., & Koutsopoulos,
A. (2013). Ca-Re-Chord: A Churn Resistant Self-stabilizing Chord Overlay Network.
In Proceedings of the Conference on Networked Systems (NetSys) (pp. 27–34).
https://doi.org/10.1109/NetSys.2013.11'
bibtex: '@inproceedings{Graffi_Benter_Divband_Kniesburges_Koutsopoulos_2013, title={Ca-Re-Chord:
A Churn Resistant Self-stabilizing Chord Overlay Network}, DOI={10.1109/NetSys.2013.11},
booktitle={Proceedings of the Conference on Networked Systems (NetSys)}, author={Graffi,
Kalman and Benter, Markus and Divband, Mohammad and Kniesburges, Sebastian and
Koutsopoulos, Andreas}, year={2013}, pages={27–34} }'
chicago: 'Graffi, Kalman, Markus Benter, Mohammad Divband, Sebastian Kniesburges,
and Andreas Koutsopoulos. “Ca-Re-Chord: A Churn Resistant Self-Stabilizing Chord
Overlay Network.” In Proceedings of the Conference on Networked Systems (NetSys),
27–34, 2013. https://doi.org/10.1109/NetSys.2013.11.'
ieee: 'K. Graffi, M. Benter, M. Divband, S. Kniesburges, and A. Koutsopoulos, “Ca-Re-Chord:
A Churn Resistant Self-stabilizing Chord Overlay Network,” in Proceedings of
the Conference on Networked Systems (NetSys), 2013, pp. 27–34.'
mla: 'Graffi, Kalman, et al. “Ca-Re-Chord: A Churn Resistant Self-Stabilizing Chord
Overlay Network.” Proceedings of the Conference on Networked Systems (NetSys),
2013, pp. 27–34, doi:10.1109/NetSys.2013.11.'
short: 'K. Graffi, M. Benter, M. Divband, S. Kniesburges, A. Koutsopoulos, in: Proceedings
of the Conference on Networked Systems (NetSys), 2013, pp. 27–34.'
date_created: 2017-10-17T12:42:38Z
date_updated: 2022-01-06T07:01:55Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1109/NetSys.2013.11
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T10:30:42Z
date_updated: 2018-03-15T10:30:42Z
file_id: '1286'
file_name: 546-Kalman.Graffi_CaReChord.A.Churn.Resistant.Selfstabilizing.Chord.Overlay.Network_02.pdf
file_size: 244841
relation: main_file
success: 1
file_date_updated: 2018-03-15T10:30:42Z
has_accepted_license: '1'
page: 27-34
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '13'
name: SFB 901 - Subproject C1
- _id: '2'
name: SFB 901 - Project Area A
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the Conference on Networked Systems (NetSys)
status: public
title: 'Ca-Re-Chord: A Churn Resistant Self-stabilizing Chord Overlay Network'
type: conference
user_id: '15504'
year: '2013'
...
---
_id: '548'
abstract:
- lang: eng
text: Peer-to-peer systems scale to millions of nodes and provide routing and storage
functions with best effort quality. In order to provide a guaranteed quality of
the overlay functions, even under strong dynamics in the network with regard to
peer capacities, online participation and usage patterns, we propose to calibrate
the peer-to-peer overlay and to autonomously learn which qualities can be reached.
For that, we simulate the peer-to-peer overlay systematically under a wide range
of parameter configurations and use neural networks to learn the effects of the
configurations on the quality metrics. Thus, by choosing a specific quality setting
by the overlay operator, the network can tune itself to the learned parameter
configurations that lead to the desired quality. Evaluation shows that the presented
self-calibration succeeds in learning the configuration-quality interdependencies
and that peer-to-peer systems can learn and adapt their behavior according to
desired quality goals.
author:
- first_name: Kalman
full_name: Graffi, Kalman
last_name: Graffi
- first_name: Timo
full_name: Klerx, Timo
last_name: Klerx
citation:
ama: 'Graffi K, Klerx T. Bootstrapping Skynet: Calibration and Autonomic Self-Control
of Structured Peer-to-Peer Networks. In: Proceedings of the International Conference
on Peer-to-Peer Computing (P2P’13). ; 2013:1-5. doi:10.1109/P2P.2013.6688720'
apa: 'Graffi, K., & Klerx, T. (2013). Bootstrapping Skynet: Calibration and
Autonomic Self-Control of Structured Peer-to-Peer Networks. In Proceedings
of the International Conference on Peer-to-Peer Computing (P2P’13) (pp. 1–5).
https://doi.org/10.1109/P2P.2013.6688720'
bibtex: '@inproceedings{Graffi_Klerx_2013, title={Bootstrapping Skynet: Calibration
and Autonomic Self-Control of Structured Peer-to-Peer Networks}, DOI={10.1109/P2P.2013.6688720},
booktitle={Proceedings of the International Conference on Peer-to-Peer Computing
(P2P’13)}, author={Graffi, Kalman and Klerx, Timo}, year={2013}, pages={1–5} }'
chicago: 'Graffi, Kalman, and Timo Klerx. “Bootstrapping Skynet: Calibration and
Autonomic Self-Control of Structured Peer-to-Peer Networks.” In Proceedings
of the International Conference on Peer-to-Peer Computing (P2P’13), 1–5, 2013.
https://doi.org/10.1109/P2P.2013.6688720.'
ieee: 'K. Graffi and T. Klerx, “Bootstrapping Skynet: Calibration and Autonomic
Self-Control of Structured Peer-to-Peer Networks,” in Proceedings of the International
Conference on Peer-to-Peer Computing (P2P’13), 2013, pp. 1–5.'
mla: 'Graffi, Kalman, and Timo Klerx. “Bootstrapping Skynet: Calibration and Autonomic
Self-Control of Structured Peer-to-Peer Networks.” Proceedings of the International
Conference on Peer-to-Peer Computing (P2P’13), 2013, pp. 1–5, doi:10.1109/P2P.2013.6688720.'
short: 'K. Graffi, T. Klerx, in: Proceedings of the International Conference on
Peer-to-Peer Computing (P2P’13), 2013, pp. 1–5.'
date_created: 2017-10-17T12:42:39Z
date_updated: 2022-01-06T07:01:56Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1109/P2P.2013.6688720
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T10:30:09Z
date_updated: 2018-03-15T10:30:09Z
file_id: '1285'
file_name: 548-Bootstrapping.Skynet.Calibration.and.Autonomic.Self-Control.of.Structured.P2P.Networks_01.pdf
file_size: 629234
relation: main_file
success: 1
file_date_updated: 2018-03-15T10:30:09Z
has_accepted_license: '1'
language:
- iso: eng
page: 1-5
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 Peer-to-Peer Computing
(P2P'13)
status: public
title: 'Bootstrapping Skynet: Calibration and Autonomic Self-Control of Structured
Peer-to-Peer Networks'
type: conference
user_id: '477'
year: '2013'
...
---
_id: '555'
author:
- first_name: Alexander
full_name: Setzer, Alexander
id: '11108'
last_name: Setzer
citation:
ama: Setzer A. Approximation Algorithms for the Linear Arrangement of Special
Classes of Graphs. Universität Paderborn; 2013.
apa: Setzer, A. (2013). Approximation Algorithms for the Linear Arrangement of
Special Classes of Graphs. Universität Paderborn.
bibtex: '@book{Setzer_2013, title={Approximation Algorithms for the Linear Arrangement
of Special Classes of Graphs}, publisher={Universität Paderborn}, author={Setzer,
Alexander}, year={2013} }'
chicago: Setzer, Alexander. Approximation Algorithms for the Linear Arrangement
of Special Classes of Graphs. Universität Paderborn, 2013.
ieee: A. Setzer, Approximation Algorithms for the Linear Arrangement of Special
Classes of Graphs. Universität Paderborn, 2013.
mla: Setzer, Alexander. Approximation Algorithms for the Linear Arrangement of
Special Classes of Graphs. Universität Paderborn, 2013.
short: A. Setzer, Approximation Algorithms for the Linear Arrangement of Special
Classes of Graphs, Universität Paderborn, 2013.
date_created: 2017-10-17T12:42:40Z
date_updated: 2022-01-06T07:01:59Z
department:
- _id: '79'
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: Approximation Algorithms for the Linear Arrangement of Special Classes of Graphs
type: mastersthesis
user_id: '477'
year: '2013'
...
---
_id: '558'
citation:
ama: Flocchini P, Gao J, Kranakis E, Meyer auf der Heide F, eds. Algorithms for
Sensor Systems - 9th International Symposium on Algorithms and Experiments for
Sensor Systems, Wireless Networks and Distributed Robotics. Vol 8243. Springer;
2013. doi:10.1007/978-3-642-45346-5
apa: 'Flocchini, P., Gao, J., Kranakis, E., & Meyer auf der Heide, F. (Eds.).
(2013). Algorithms for Sensor Systems - 9th International Symposium on Algorithms
and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics
(Vol. 8243). Presented at the ALGOSENSORS 2013, Sophia Antipolis, France: Springer.
https://doi.org/10.1007/978-3-642-45346-5'
bibtex: '@book{Flocchini_Gao_Kranakis_Meyer auf der Heide_2013, series={LNCS}, title={Algorithms
for Sensor Systems - 9th International Symposium on Algorithms and Experiments
for Sensor Systems, Wireless Networks and Distributed Robotics}, volume={8243},
DOI={10.1007/978-3-642-45346-5},
publisher={Springer}, year={2013}, collection={LNCS} }'
chicago: Flocchini, Paola, Jie Gao, Evangelos Kranakis, and Friedhelm Meyer auf
der Heide, eds. Algorithms for Sensor Systems - 9th International Symposium
on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed
Robotics. Vol. 8243. LNCS. Springer, 2013. https://doi.org/10.1007/978-3-642-45346-5.
ieee: P. Flocchini, J. Gao, E. Kranakis, and F. Meyer auf der Heide, Eds., Algorithms
for Sensor Systems - 9th International Symposium on Algorithms and Experiments
for Sensor Systems, Wireless Networks and Distributed Robotics, vol. 8243.
Springer, 2013.
mla: Flocchini, Paola, et al., editors. Algorithms for Sensor Systems - 9th International
Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks
and Distributed Robotics. Vol. 8243, Springer, 2013, doi:10.1007/978-3-642-45346-5.
short: P. Flocchini, J. Gao, E. Kranakis, F. Meyer auf der Heide, eds., Algorithms
for Sensor Systems - 9th International Symposium on Algorithms and Experiments
for Sensor Systems, Wireless Networks and Distributed Robotics, Springer, 2013.
conference:
end_date: 2013-09-06
location: Sophia Antipolis, France
name: ALGOSENSORS 2013
start_date: 2013-09-05
date_created: 2017-10-17T12:42:41Z
date_updated: 2022-01-06T07:02:02Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.1007/978-3-642-45346-5
editor:
- first_name: Paola
full_name: Flocchini, Paola
last_name: Flocchini
- first_name: Jie
full_name: Gao, Jie
last_name: Gao
- first_name: Evangelos
full_name: Kranakis, Evangelos
last_name: Kranakis
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T16:29:07Z
date_updated: 2018-11-02T16:29:07Z
file_id: '5327'
file_name: 2014_Book_AlgorithmsForSensorSystems-1.pdf
file_size: 9186107
relation: main_file
success: 1
file_date_updated: 2018-11-02T16:29:07Z
has_accepted_license: '1'
intvolume: ' 8243'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publisher: Springer
series_title: LNCS
status: public
title: Algorithms for Sensor Systems - 9th International Symposium on Algorithms and
Experiments for Sensor Systems, Wireless Networks and Distributed Robotics
type: conference_editor
user_id: '477'
volume: 8243
year: '2013'
...
---
_id: '559'
abstract:
- lang: eng
text: Distributed hash tables are very versatile to use, as distributed storage
is a desirable feature for various applications. Typical structured overlays like
Chord, Pastry or Kademlia consider only homogeneous nodes with equal capacities,
which does not resemble reality. In a practical use case, nodes might get overloaded
by storing popular data. In this paper, we present a general approach to enable
capacity awareness and load-balancing capability of homogeneous structured overlays.
We introduce a hierarchical second structured overlay aside, which allows efficient
capacity-based access on the nodes in the system as hosting mirrors. Simulation
results show that the structured overlay is able to store various contents, such
as of a social network, with only a negligible number of overloaded peers. Content,
even if very popular, is hosted by easily findable capable peers. Thus, long-existing
and well-evaluated overlays like Chord or Pastry can be used to create attractive
DHT-based applications.
author:
- first_name: Philip
full_name: Wette, Philip
last_name: Wette
- first_name: Kalman
full_name: Graffi, Kalman
last_name: Graffi
citation:
ama: 'Wette P, Graffi K. Adding Capacity-Aware Storage Indirection to Homogeneous
Distributed Hash Tables. In: Proceedings of the Conference on Networked Systems
(NetSys). ; 2013:35-42. doi:10.1109/NetSys.2013.9'
apa: Wette, P., & Graffi, K. (2013). Adding Capacity-Aware Storage Indirection
to Homogeneous Distributed Hash Tables. In Proceedings of the Conference on
Networked Systems (NetSys) (pp. 35–42). https://doi.org/10.1109/NetSys.2013.9
bibtex: '@inproceedings{Wette_Graffi_2013, title={Adding Capacity-Aware Storage
Indirection to Homogeneous Distributed Hash Tables}, DOI={10.1109/NetSys.2013.9},
booktitle={Proceedings of the Conference on Networked Systems (NetSys)}, author={Wette,
Philip and Graffi, Kalman}, year={2013}, pages={35–42} }'
chicago: Wette, Philip, and Kalman Graffi. “Adding Capacity-Aware Storage Indirection
to Homogeneous Distributed Hash Tables.” In Proceedings of the Conference on
Networked Systems (NetSys), 35–42, 2013. https://doi.org/10.1109/NetSys.2013.9.
ieee: P. Wette and K. Graffi, “Adding Capacity-Aware Storage Indirection to Homogeneous
Distributed Hash Tables,” in Proceedings of the Conference on Networked Systems
(NetSys), 2013, pp. 35–42.
mla: Wette, Philip, and Kalman Graffi. “Adding Capacity-Aware Storage Indirection
to Homogeneous Distributed Hash Tables.” Proceedings of the Conference on Networked
Systems (NetSys), 2013, pp. 35–42, doi:10.1109/NetSys.2013.9.
short: 'P. Wette, K. Graffi, in: Proceedings of the Conference on Networked Systems
(NetSys), 2013, pp. 35–42.'
date_created: 2017-10-17T12:42:41Z
date_updated: 2022-01-06T07:02:04Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1109/NetSys.2013.9
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T10:27:21Z
date_updated: 2018-03-15T10:27:21Z
file_id: '1282'
file_name: 559-Adding.Capacity.Aware.Storage.Indirection.to.Homogeneous.Distributed.Hash.Tables.pdf
file_size: 734618
relation: main_file
success: 1
file_date_updated: 2018-03-15T10:27:21Z
has_accepted_license: '1'
language:
- iso: eng
page: 35-42
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 Conference on Networked Systems (NetSys)
status: public
title: Adding Capacity-Aware Storage Indirection to Homogeneous Distributed Hash Tables
type: conference
user_id: '477'
year: '2013'
...
---
_id: '562'
abstract:
- lang: eng
text: In Distributed Cloud Computing, applications are deployed across many data
centres at topologically diverse locations to improved network-related quality
of service (QoS). As we focus on interactive applications, we minimize the latency
between users and an application by allocating Cloud resources nearby the customers.
Allocating resources at all locations will result in the best latency but also
in the highest expenses. So we need to find an optimal subset of locations which
reduces the latency but also the expenses – the facility location problem (FLP).
In addition, we consider resource capacity restrictions, as a resource can only
serve a limited amount of users. An FLP can be globally solved. Additionally,
we propose a local, distributed heuristic. This heuristic is running within the
network and does not depend on a global component. No distributed, local approximations
for the capacitated FLP have been proposed so far due to the complexity of the
problem. We compared the heuristic with an optimal solution obtained from a mixed
integer program for different network topologies. We investigated the influence
of different parameters like overall resource utilization or different latency
weights.
author:
- first_name: Matthias
full_name: Keller, Matthias
last_name: Keller
- first_name: Stefan
full_name: Pawlik, Stefan
last_name: Pawlik
- first_name: Peter
full_name: Pietrzyk, Peter
last_name: Pietrzyk
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: 'Keller M, Pawlik S, Pietrzyk P, Karl H. A Local Heuristic for Latency-Optimized
Distributed Cloud Deployment. In: Proceedings of the 6th International Conference
on Utility and Cloud Computing (UCC) Workshop on Distributed Cloud Computing.
; 2013:429-434. doi:10.1109/UCC.2013.85'
apa: Keller, M., Pawlik, S., Pietrzyk, P., & Karl, H. (2013). A Local Heuristic
for Latency-Optimized Distributed Cloud Deployment. In Proceedings of the 6th
International Conference on Utility and Cloud Computing (UCC) workshop on Distributed
cloud computing (pp. 429–434). https://doi.org/10.1109/UCC.2013.85
bibtex: '@inproceedings{Keller_Pawlik_Pietrzyk_Karl_2013, title={A Local Heuristic
for Latency-Optimized Distributed Cloud Deployment}, DOI={10.1109/UCC.2013.85},
booktitle={Proceedings of the 6th International Conference on Utility and Cloud
Computing (UCC) workshop on Distributed cloud computing}, author={Keller, Matthias
and Pawlik, Stefan and Pietrzyk, Peter and Karl, Holger}, year={2013}, pages={429–434}
}'
chicago: Keller, Matthias, Stefan Pawlik, Peter Pietrzyk, and Holger Karl. “A Local
Heuristic for Latency-Optimized Distributed Cloud Deployment.” In Proceedings
of the 6th International Conference on Utility and Cloud Computing (UCC) Workshop
on Distributed Cloud Computing, 429–34, 2013. https://doi.org/10.1109/UCC.2013.85.
ieee: M. Keller, S. Pawlik, P. Pietrzyk, and H. Karl, “A Local Heuristic for Latency-Optimized
Distributed Cloud Deployment,” in Proceedings of the 6th International Conference
on Utility and Cloud Computing (UCC) workshop on Distributed cloud computing,
2013, pp. 429–434.
mla: Keller, Matthias, et al. “A Local Heuristic for Latency-Optimized Distributed
Cloud Deployment.” Proceedings of the 6th International Conference on Utility
and Cloud Computing (UCC) Workshop on Distributed Cloud Computing, 2013, pp.
429–34, doi:10.1109/UCC.2013.85.
short: 'M. Keller, S. Pawlik, P. Pietrzyk, H. Karl, in: Proceedings of the 6th International
Conference on Utility and Cloud Computing (UCC) Workshop on Distributed Cloud
Computing, 2013, pp. 429–434.'
date_created: 2017-10-17T12:42:41Z
date_updated: 2022-01-06T07:02:11Z
ddc:
- '040'
department:
- _id: '75'
- _id: '63'
doi: 10.1109/UCC.2013.85
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T10:25:45Z
date_updated: 2018-03-15T10:25:45Z
file_id: '1279'
file_name: 562-dcc13_paper.pdf
file_size: 347873
relation: main_file
success: 1
file_date_updated: 2018-03-15T10:25:45Z
has_accepted_license: '1'
language:
- iso: eng
page: 429-434
project:
- _id: '1'
name: SFB 901
- _id: '6'
name: SFB 901 - Subprojekt A2
- _id: '5'
name: SFB 901 - Subproject A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 6th International Conference on Utility and Cloud
Computing (UCC) workshop on Distributed cloud computing
status: public
title: A Local Heuristic for Latency-Optimized Distributed Cloud Deployment
type: conference
user_id: '477'
year: '2013'
...