---
_id: '1858'
author:
- first_name: Riko
full_name: Jacob, Riko
last_name: Jacob
- first_name: Andrea
full_name: W. Richa, Andrea
last_name: W. Richa
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
- first_name: Hanjo
full_name: Täubig, Hanjo
last_name: Täubig
citation:
ama: 'Jacob R, W. Richa A, Scheideler C, Schmid S, Täubig H. SKIP*: A Self-Stabilizing
Skip Graph. J ACM. 2014;(6):36:1--36:26. doi:10.1145/2629695'
apa: 'Jacob, R., W. Richa, A., Scheideler, C., Schmid, S., & Täubig, H. (2014).
SKIP*: A Self-Stabilizing Skip Graph. J. ACM, (6), 36:1--36:26. https://doi.org/10.1145/2629695'
bibtex: '@article{Jacob_W. Richa_Scheideler_Schmid_Täubig_2014, title={SKIP*: A
Self-Stabilizing Skip Graph}, DOI={10.1145/2629695},
number={6}, journal={J. ACM}, author={Jacob, Riko and W. Richa, Andrea and Scheideler,
Christian and Schmid, Stefan and Täubig, Hanjo}, year={2014}, pages={36:1--36:26}
}'
chicago: 'Jacob, Riko, Andrea W. Richa, Christian Scheideler, Stefan Schmid, and
Hanjo Täubig. “SKIP*: A Self-Stabilizing Skip Graph.” J. ACM, no. 6 (2014):
36:1--36:26. https://doi.org/10.1145/2629695.'
ieee: 'R. Jacob, A. W. Richa, C. Scheideler, S. Schmid, and H. Täubig, “SKIP*: A
Self-Stabilizing Skip Graph,” J. ACM, no. 6, pp. 36:1--36:26, 2014.'
mla: 'Jacob, Riko, et al. “SKIP*: A Self-Stabilizing Skip Graph.” J. ACM,
no. 6, 2014, pp. 36:1--36:26, doi:10.1145/2629695.'
short: R. Jacob, A. W. Richa, C. Scheideler, S. Schmid, H. Täubig, J. ACM (2014)
36:1--36:26.
date_created: 2018-03-28T06:17:25Z
date_updated: 2022-01-06T06:53:40Z
department:
- _id: '79'
doi: 10.1145/2629695
issue: '6'
page: 36:1--36:26
publication: J. ACM
status: public
title: 'SKIP*: A Self-Stabilizing Skip Graph'
type: journal_article
user_id: '15504'
year: '2014'
...
---
_id: '1863'
author:
- first_name: Zahra
full_name: Derakhshandeh, Zahra
last_name: Derakhshandeh
- first_name: Shlomi
full_name: Dolev, Shlomi
last_name: Dolev
- first_name: Robert
full_name: Gmyr, Robert
last_name: Gmyr
- first_name: Andrea
full_name: W. Richa, Andrea
last_name: W. Richa
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Thim Frederik
full_name: Strothmann, Thim Frederik
id: '11319'
last_name: Strothmann
citation:
ama: 'Derakhshandeh Z, Dolev S, Gmyr R, W. Richa A, Scheideler C, Strothmann TF.
Brief announcement: amoebot - a new model for programmable matter. In: 26th
ACM Symposium on Parallelism in Algorithms and Architectures, SPAA’14, Prague,
Czech Republic - June 23 - 25, 2014. ACM; 2014:220--222. doi:10.1145/2612669.2612712'
apa: 'Derakhshandeh, Z., Dolev, S., Gmyr, R., W. Richa, A., Scheideler, C., &
Strothmann, T. F. (2014). Brief announcement: amoebot - a new model for programmable
matter. In 26th ACM Symposium on Parallelism in Algorithms and Architectures,
SPAA’14, Prague, Czech Republic - June 23 - 25, 2014 (pp. 220--222). ACM.
https://doi.org/10.1145/2612669.2612712'
bibtex: '@inproceedings{Derakhshandeh_Dolev_Gmyr_W. Richa_Scheideler_Strothmann_2014,
title={Brief announcement: amoebot - a new model for programmable matter}, DOI={10.1145/2612669.2612712}, booktitle={26th
ACM Symposium on Parallelism in Algorithms and Architectures, SPAA’14, Prague,
Czech Republic - June 23 - 25, 2014}, publisher={ACM}, author={Derakhshandeh,
Zahra and Dolev, Shlomi and Gmyr, Robert and W. Richa, Andrea and Scheideler,
Christian and Strothmann, Thim Frederik}, year={2014}, pages={220--222} }'
chicago: 'Derakhshandeh, Zahra, Shlomi Dolev, Robert Gmyr, Andrea W. Richa, Christian
Scheideler, and Thim Frederik Strothmann. “Brief Announcement: Amoebot - a New
Model for Programmable Matter.” In 26th ACM Symposium on Parallelism in Algorithms
and Architectures, SPAA’14, Prague, Czech Republic - June 23 - 25, 2014, 220--222.
ACM, 2014. https://doi.org/10.1145/2612669.2612712.'
ieee: 'Z. Derakhshandeh, S. Dolev, R. Gmyr, A. W. Richa, C. Scheideler, and T. F.
Strothmann, “Brief announcement: amoebot - a new model for programmable matter,”
in 26th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA’14,
Prague, Czech Republic - June 23 - 25, 2014, 2014, pp. 220--222.'
mla: 'Derakhshandeh, Zahra, et al. “Brief Announcement: Amoebot - a New Model for
Programmable Matter.” 26th ACM Symposium on Parallelism in Algorithms and Architectures,
SPAA’14, Prague, Czech Republic - June 23 - 25, 2014, ACM, 2014, pp. 220--222,
doi:10.1145/2612669.2612712.'
short: 'Z. Derakhshandeh, S. Dolev, R. Gmyr, A. W. Richa, C. Scheideler, T.F. Strothmann,
in: 26th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA’14,
Prague, Czech Republic - June 23 - 25, 2014, ACM, 2014, pp. 220--222.'
date_created: 2018-03-28T06:24:00Z
date_updated: 2022-01-06T06:53:47Z
department:
- _id: '79'
doi: 10.1145/2612669.2612712
language:
- iso: eng
page: 220--222
publication: 26th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'14,
Prague, Czech Republic - June 23 - 25, 2014
publication_identifier:
isbn:
- 978-1-4503-2821-0
publisher: ACM
status: public
title: 'Brief announcement: amoebot - a new model for programmable matter'
type: conference
user_id: '15504'
year: '2014'
...
---
_id: '446'
abstract:
- lang: eng
text: 'This paper considers the problem of how to efficiently share a wireless medium
which is subject to harsh external interference or even jamming. While this problem
has already been studied intensively for simplistic single-hop or unit disk graph
models, we make a leap forward and study MAC protocols for the SINR interference
model (a.k.a. the physical model). We make two contributions. First, we introduce
a new adversarial SINR model which captures a wide range of interference phenomena.
Concretely, we consider a powerful, adaptive adversary which can jam nodes at
arbitrary times and which is only limited by some energy budget. The second contribution
of this paper is a distributed MAC protocol which provably achieves a constant
competitive throughput in this environment: we show that, with high probability,
the protocol ensures that a constant fraction of the non-blocked time periods
is used for successful transmissions.'
author:
- first_name: Adrian
full_name: Ogierman, Adrian
last_name: Ogierman
- first_name: Andrea W.
full_name: Richa, Andrea W.
last_name: Richa
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
- first_name: Jin
full_name: Zhang, Jin
last_name: Zhang
citation:
ama: 'Ogierman A, Richa AW, Scheideler C, Schmid S, Zhang J. Competitive MAC under
adversarial SINR. In: Proceedings of the 33rd Annual IEEE International Conference
on Computer Communications (INFOCOM). ; 2014:2751--2759. doi:10.1109/INFOCOM.2014.6848224'
apa: Ogierman, A., Richa, A. W., Scheideler, C., Schmid, S., & Zhang, J. (2014).
Competitive MAC under adversarial SINR. In Proceedings of the 33rd Annual IEEE
International Conference on Computer Communications (INFOCOM) (pp. 2751--2759).
https://doi.org/10.1109/INFOCOM.2014.6848224
bibtex: '@inproceedings{Ogierman_Richa_Scheideler_Schmid_Zhang_2014, title={Competitive
MAC under adversarial SINR}, DOI={10.1109/INFOCOM.2014.6848224},
booktitle={Proceedings of the 33rd Annual IEEE International Conference on Computer
Communications (INFOCOM)}, author={Ogierman, Adrian and Richa, Andrea W. and Scheideler,
Christian and Schmid, Stefan and Zhang, Jin}, year={2014}, pages={2751--2759}
}'
chicago: Ogierman, Adrian, Andrea W. Richa, Christian Scheideler, Stefan Schmid,
and Jin Zhang. “Competitive MAC under Adversarial SINR.” In Proceedings of
the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM),
2751--2759, 2014. https://doi.org/10.1109/INFOCOM.2014.6848224.
ieee: A. Ogierman, A. W. Richa, C. Scheideler, S. Schmid, and J. Zhang, “Competitive
MAC under adversarial SINR,” in Proceedings of the 33rd Annual IEEE International
Conference on Computer Communications (INFOCOM), 2014, pp. 2751--2759.
mla: Ogierman, Adrian, et al. “Competitive MAC under Adversarial SINR.” Proceedings
of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM),
2014, pp. 2751--2759, doi:10.1109/INFOCOM.2014.6848224.
short: 'A. Ogierman, A.W. Richa, C. Scheideler, S. Schmid, J. Zhang, in: Proceedings
of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM),
2014, pp. 2751--2759.'
date_created: 2017-10-17T12:42:18Z
date_updated: 2022-01-06T07:01:05Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1109/INFOCOM.2014.6848224
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-16T11:27:04Z
date_updated: 2018-03-16T11:27:04Z
file_id: '1348'
file_name: 446-infocom14_01.pdf
file_size: 378095
relation: main_file
success: 1
file_date_updated: 2018-03-16T11:27:04Z
has_accepted_license: '1'
page: 2751--2759
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 33rd Annual IEEE International Conference on Computer
Communications (INFOCOM)
status: public
title: Competitive MAC under adversarial SINR
type: conference
user_id: '15504'
year: '2014'
...
---
_id: '459'
abstract:
- lang: eng
text: In this survey article, we discuss two algorithmic research areas that emerge
from problems that arise when resources are offered in the cloud. The first area,
online leasing, captures problems arising from the fact that resources in the
cloud are not bought, but leased by cloud vendors. The second area, Distributed
Storage Systems, deals with problems arising from so-called cloud federations,
i.e., when several cloud providers are needed to fulfill a given task.
author:
- first_name: Sebastian
full_name: Kniesburges, Sebastian
last_name: Kniesburges
- 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: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Kniesburges S, Markarian C, Meyer auf der Heide F, Scheideler C. Algorithmic
Aspects of Resource Management in the Cloud. In: Proceedings of the 21st International
Colloquium on Structural Information and Communication Complexity (SIROCCO).
LNCS. ; 2014:1-13. doi:10.1007/978-3-319-09620-9_1'
apa: Kniesburges, S., Markarian, C., Meyer auf der Heide, F., & Scheideler,
C. (2014). Algorithmic Aspects of Resource Management in the Cloud. In Proceedings
of the 21st International Colloquium on Structural Information and Communication
Complexity (SIROCCO) (pp. 1–13). https://doi.org/10.1007/978-3-319-09620-9_1
bibtex: '@inproceedings{Kniesburges_Markarian_Meyer auf der Heide_Scheideler_2014,
series={LNCS}, title={Algorithmic Aspects of Resource Management in the Cloud},
DOI={10.1007/978-3-319-09620-9_1},
booktitle={Proceedings of the 21st International Colloquium on Structural Information
and Communication Complexity (SIROCCO)}, author={Kniesburges, Sebastian and Markarian,
Christine and Meyer auf der Heide, Friedhelm and Scheideler, Christian}, year={2014},
pages={1–13}, collection={LNCS} }'
chicago: Kniesburges, Sebastian, Christine Markarian, Friedhelm Meyer auf der Heide,
and Christian Scheideler. “Algorithmic Aspects of Resource Management in the Cloud.”
In Proceedings of the 21st International Colloquium on Structural Information
and Communication Complexity (SIROCCO), 1–13. LNCS, 2014. https://doi.org/10.1007/978-3-319-09620-9_1.
ieee: S. Kniesburges, C. Markarian, F. Meyer auf der Heide, and C. Scheideler, “Algorithmic
Aspects of Resource Management in the Cloud,” in Proceedings of the 21st International
Colloquium on Structural Information and Communication Complexity (SIROCCO),
2014, pp. 1–13.
mla: Kniesburges, Sebastian, et al. “Algorithmic Aspects of Resource Management
in the Cloud.” Proceedings of the 21st International Colloquium on Structural
Information and Communication Complexity (SIROCCO), 2014, pp. 1–13, doi:10.1007/978-3-319-09620-9_1.
short: 'S. Kniesburges, C. Markarian, F. Meyer auf der Heide, C. Scheideler, in:
Proceedings of the 21st International Colloquium on Structural Information and
Communication Complexity (SIROCCO), 2014, pp. 1–13.'
date_created: 2017-10-17T12:42:21Z
date_updated: 2022-01-06T07:01:14Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
doi: 10.1007/978-3-319-09620-9_1
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-16T11:21:54Z
date_updated: 2018-03-16T11:21:54Z
file_id: '1338'
file_name: 459-SIROCCO2014.pdf
file_size: 274496
relation: main_file
success: 1
file_date_updated: 2018-03-16T11:21:54Z
has_accepted_license: '1'
page: 1-13
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 21st International Colloquium on Structural Information
and Communication Complexity (SIROCCO)
series_title: LNCS
status: public
title: Algorithmic Aspects of Resource Management in the Cloud
type: conference
user_id: '477'
year: '2014'
...
---
_id: '464'
abstract:
- lang: eng
text: Topological self-stabilization is an important concept to build robust open
distributed systems (such as peer-to-peer systems) where nodes can organize themselves
into meaningful network topologies. The goal is to devise distributed algorithms
where nodes forward, insert, and delete links to neighboring nodes, and that converge
quickly to such a desirable topology, independently of the initial network configuration.
This article proposes a new model to study the parallel convergence time. Our
model sheds light on the achievable parallelism by avoiding bottlenecks of existing
models that can yield a distorted picture. As a case study, we consider local
graph linearization—i.e., how to build a sorted list of the nodes of a connected
graph in a distributed and self-stabilizing manner. In order to study the main
structure and properties of our model, we propose two variants of a most simple
local linearization algorithm. For each of these variants, we present analyses
of the worst-case and bestcase parallel time complexities, as well as the performance
under a greedy selection of the actions to be executed. It turns out that the
analysis is non-trivial despite the simple setting, and to complement our formal
insights we report on our experiments which indicate that the runtimes may be
better in the average case.
author:
- first_name: Dominik
full_name: Gall, Dominik
last_name: Gall
- first_name: Riko
full_name: Jacob, Riko
last_name: Jacob
- first_name: Andrea W.
full_name: Richa, Andrea W.
last_name: Richa
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
- first_name: 'Hanjo '
full_name: 'Täubig, Hanjo '
last_name: Täubig
citation:
ama: Gall D, Jacob R, Richa AW, Scheideler C, Schmid S, Täubig H. A Note on the
Parallel Runtime of Self-Stabilizing Graph Linearization. Theory of Computing
Systems. 2014;(1):110-135. doi:10.1007/s00224-013-9504-x
apa: Gall, D., Jacob, R., Richa, A. W., Scheideler, C., Schmid, S., & Täubig,
H. (2014). A Note on the Parallel Runtime of Self-Stabilizing Graph Linearization.
Theory of Computing Systems, (1), 110–135. https://doi.org/10.1007/s00224-013-9504-x
bibtex: '@article{Gall_Jacob_Richa_Scheideler_Schmid_Täubig_2014, title={A Note
on the Parallel Runtime of Self-Stabilizing Graph Linearization}, DOI={10.1007/s00224-013-9504-x},
number={1}, journal={Theory of Computing Systems}, publisher={Springer}, author={Gall,
Dominik and Jacob, Riko and Richa, Andrea W. and Scheideler, Christian and Schmid,
Stefan and Täubig, Hanjo }, year={2014}, pages={110–135} }'
chicago: 'Gall, Dominik, Riko Jacob, Andrea W. Richa, Christian Scheideler, Stefan
Schmid, and Hanjo Täubig. “A Note on the Parallel Runtime of Self-Stabilizing
Graph Linearization.” Theory of Computing Systems, no. 1 (2014): 110–35.
https://doi.org/10.1007/s00224-013-9504-x.'
ieee: D. Gall, R. Jacob, A. W. Richa, C. Scheideler, S. Schmid, and H. Täubig, “A
Note on the Parallel Runtime of Self-Stabilizing Graph Linearization,” Theory
of Computing Systems, no. 1, pp. 110–135, 2014.
mla: Gall, Dominik, et al. “A Note on the Parallel Runtime of Self-Stabilizing Graph
Linearization.” Theory of Computing Systems, no. 1, Springer, 2014, pp.
110–35, doi:10.1007/s00224-013-9504-x.
short: D. Gall, R. Jacob, A.W. Richa, C. Scheideler, S. Schmid, H. Täubig, Theory
of Computing Systems (2014) 110–135.
date_created: 2017-10-17T12:42:22Z
date_updated: 2022-01-06T07:01:16Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/s00224-013-9504-x
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-16T11:19:45Z
date_updated: 2018-03-16T11:19:45Z
file_id: '1334'
file_name: 464-GJRSST2014.pdf
file_size: 947484
relation: main_file
success: 1
file_date_updated: 2018-03-16T11:19:45Z
has_accepted_license: '1'
issue: '1'
page: 110-135
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Theory of Computing Systems
publisher: Springer
status: public
title: A Note on the Parallel Runtime of Self-Stabilizing Graph Linearization
type: journal_article
user_id: '477'
year: '2014'
...
---
_id: '393'
abstract:
- lang: eng
text: 'A fundamental problem for peer-to-peer systems is to maintain connectivity
while nodes are leaving, i.e., the nodes requesting to leave the peer-to-peer
system are excluded from the overlay network without affecting its connectivity.
There are a number of studies for safe node exclusion if the overlay is in a well-defined
state initially. Surprisingly, the problem is not formally studied yet for the
case in which the overlay network is in an arbitrary initial state, i.e., when
looking for a self-stabilizing solution for excluding leaving nodes. We study
this problem in two variants: the Finite Departure Problem (FDP) ) and the Finite
Sleep Problem (FSP). In the FDP the leaving nodes have to irrevocably decide when
it is safe to leave the network, whereas in the FSP, this leaving decision does
not have to be final: the nodes may resume computation if necessary. We show that
there is no self-stabilizing distributed algorithm for the FDP, even in a synchronous
message passing model. To allow a solution, we introduce an oracle called NIDEC
and show that it is sufficient even for the asynchronous message passing model
by proposing an algorithm that can solve the FDP using NIDEC. We also show that
a solution to the FSP does not require an oracle.'
author:
- first_name: Dianne
full_name: Foreback, Dianne
last_name: Foreback
- first_name: Andreas
full_name: Koutsopoulos, Andreas
last_name: Koutsopoulos
- first_name: Mikhail
full_name: Nesterenko, Mikhail
last_name: Nesterenko
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Thim Frederik
full_name: Strothmann, Thim Frederik
id: '11319'
last_name: Strothmann
citation:
ama: 'Foreback D, Koutsopoulos A, Nesterenko M, Scheideler C, Strothmann TF. On
Stabilizing Departures in Overlay Networks. In: Proceedings of the 16th International
Symposium on Stabilization, Safety, and Security of Distributed Systems. LNCS.
; 2014:48--62. doi:10.1007/978-3-319-11764-5_4'
apa: Foreback, D., Koutsopoulos, A., Nesterenko, M., Scheideler, C., & Strothmann,
T. F. (2014). On Stabilizing Departures in Overlay Networks. In Proceedings
of the 16th International Symposium on Stabilization, Safety, and Security of
Distributed Systems (pp. 48--62). https://doi.org/10.1007/978-3-319-11764-5_4
bibtex: '@inproceedings{Foreback_Koutsopoulos_Nesterenko_Scheideler_Strothmann_2014,
series={LNCS}, title={On Stabilizing Departures in Overlay Networks}, DOI={10.1007/978-3-319-11764-5_4},
booktitle={Proceedings of the 16th International Symposium on Stabilization, Safety,
and Security of Distributed Systems}, author={Foreback, Dianne and Koutsopoulos,
Andreas and Nesterenko, Mikhail and Scheideler, Christian and Strothmann, Thim
Frederik}, year={2014}, pages={48--62}, collection={LNCS} }'
chicago: Foreback, Dianne, Andreas Koutsopoulos, Mikhail Nesterenko, Christian Scheideler,
and Thim Frederik Strothmann. “On Stabilizing Departures in Overlay Networks.”
In Proceedings of the 16th International Symposium on Stabilization, Safety,
and Security of Distributed Systems, 48--62. LNCS, 2014. https://doi.org/10.1007/978-3-319-11764-5_4.
ieee: D. Foreback, A. Koutsopoulos, M. Nesterenko, C. Scheideler, and T. F. Strothmann,
“On Stabilizing Departures in Overlay Networks,” in Proceedings of the 16th
International Symposium on Stabilization, Safety, and Security of Distributed
Systems, 2014, pp. 48--62.
mla: Foreback, Dianne, et al. “On Stabilizing Departures in Overlay Networks.” Proceedings
of the 16th International Symposium on Stabilization, Safety, and Security of
Distributed Systems, 2014, pp. 48--62, doi:10.1007/978-3-319-11764-5_4.
short: 'D. Foreback, A. Koutsopoulos, M. Nesterenko, C. Scheideler, T.F. Strothmann,
in: Proceedings of the 16th International Symposium on Stabilization, Safety,
and Security of Distributed Systems, 2014, pp. 48--62.'
date_created: 2017-10-17T12:42:08Z
date_updated: 2022-01-06T06:59:56Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/978-3-319-11764-5_4
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:00:28Z
date_updated: 2018-03-20T07:00:28Z
file_id: '1384'
file_name: 393-departures.pdf
file_size: 287539
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:00:28Z
has_accepted_license: '1'
language:
- iso: eng
page: 48--62
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 16th International Symposium on Stabilization, Safety,
and Security of Distributed Systems
series_title: LNCS
status: public
title: On Stabilizing Departures in Overlay Networks
type: conference
user_id: '477'
year: '2014'
...
---
_id: '397'
abstract:
- lang: eng
text: We present a factor $14D^2$ approximation algorithm for the minimum linear
arrangement problem on series-parallel graphs, where $D$ is the maximum degree
in the graph. Given a suitable decomposition of the graph, our algorithm runs
in time $O(|E|)$ and is very easy to implement. Its divide-and-conquer approach
allows for an effective parallelization. Note that a suitable decomposition can
also be computed in time $O(|E|\log{|E|})$ (or even $O(\log{|E|}\log^*{|E|})$
on an EREW PRAM using $O(|E|)$ processors). For the proof of the approximation
ratio, we use a sophisticated charging method that uses techniques similar to
amortized analysis in advanced data structures. On general graphs, the minimum
linear arrangement problem is known to be NP-hard. To the best of our knowledge,
the minimum linear arrangement problem on series-parallel graphs has not been
studied before.
author:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Martina
full_name: Eikel, Martina
last_name: Eikel
- first_name: Alexander
full_name: Setzer, Alexander
id: '11108'
last_name: Setzer
citation:
ama: 'Scheideler C, Eikel M, Setzer A. Minimum Linear Arrangement of Series-Parallel
Graphs. In: Proceedings of the 12th Workshop on Approximation and Online Algorithms
(WAOA). LNCS. ; 2014:168--180.'
apa: Scheideler, C., Eikel, M., & Setzer, A. (2014). Minimum Linear Arrangement
of Series-Parallel Graphs. In Proceedings of the 12th Workshop on Approximation
and Online Algorithms (WAOA) (pp. 168--180).
bibtex: '@inproceedings{Scheideler_Eikel_Setzer_2014, series={LNCS}, title={Minimum
Linear Arrangement of Series-Parallel Graphs}, booktitle={Proceedings of the 12th
Workshop on Approximation and Online Algorithms (WAOA)}, author={Scheideler, Christian
and Eikel, Martina and Setzer, Alexander}, year={2014}, pages={168--180}, collection={LNCS}
}'
chicago: Scheideler, Christian, Martina Eikel, and Alexander Setzer. “Minimum Linear
Arrangement of Series-Parallel Graphs.” In Proceedings of the 12th Workshop
on Approximation and Online Algorithms (WAOA), 168--180. LNCS, 2014.
ieee: C. Scheideler, M. Eikel, and A. Setzer, “Minimum Linear Arrangement of Series-Parallel
Graphs,” in Proceedings of the 12th Workshop on Approximation and Online Algorithms
(WAOA), 2014, pp. 168--180.
mla: Scheideler, Christian, et al. “Minimum Linear Arrangement of Series-Parallel
Graphs.” Proceedings of the 12th Workshop on Approximation and Online Algorithms
(WAOA), 2014, pp. 168--180.
short: 'C. Scheideler, M. Eikel, A. Setzer, in: Proceedings of the 12th Workshop
on Approximation and Online Algorithms (WAOA), 2014, pp. 168--180.'
date_created: 2017-10-17T12:42:09Z
date_updated: 2022-01-06T07:00:02Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T06:58:44Z
date_updated: 2018-03-20T06:58:44Z
file_id: '1381'
file_name: 397-WAOA14_01.pdf
file_size: 365818
relation: main_file
success: 1
file_date_updated: 2018-03-20T06:58:44Z
has_accepted_license: '1'
page: 168--180
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 12th Workshop on Approximation and Online Algorithms
(WAOA)
series_title: LNCS
status: public
title: Minimum Linear Arrangement of Series-Parallel Graphs
type: conference
user_id: '15504'
year: '2014'
...
---
_id: '412'
abstract:
- lang: eng
text: In this paper we present and analyze HSkip+, a self-stabilizing overlay network
for nodes with arbitrary heterogeneous bandwidths. HSkip+ has the same topology
as the Skip+ graph proposed by Jacob et al. [PODC 2009] but its self-stabilization
mechanism significantly outperforms the self-stabilization mechanism proposed
for Skip+. Also, the nodes are now ordered according to their bandwidths and not
according to their identifiers. Various other solutions have already been proposed
for overlay networks with heterogeneous bandwidths, but they are not self-stabilizing.
In addition to HSkip+ being self-stabilizing, its performance is on par with the
best previous bounds on the time and work for joining or leaving a network of
peers of logarithmic diameter and degree and arbitrary bandwidths. Also, the dilation
and congestion for routing messages is on par with the best previous bounds for
such networks, so that HSkip+ combines the advantages of both worlds. Our theoretical
investigations are backed by simulations demonstrating that HSkip+ is indeed performing
much better than Skip+ and working correctly under high churn rates.
author:
- first_name: Matthias
full_name: Feldotto, Matthias
id: '14052'
last_name: Feldotto
orcid: 0000-0003-1348-6516
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Kalman
full_name: Graffi, Kalman
last_name: Graffi
citation:
ama: 'Feldotto M, Scheideler C, Graffi K. HSkip+: A Self-Stabilizing Overlay Network
for Nodes with Heterogeneous Bandwidths. In: Proceedings of the 14th IEEE International
Conference on Peer-to-Peer Computing (P2P). ; 2014:1-10. doi:10.1109/P2P.2014.6934300'
apa: 'Feldotto, M., Scheideler, C., & Graffi, K. (2014). HSkip+: A Self-Stabilizing
Overlay Network for Nodes with Heterogeneous Bandwidths. In Proceedings of
the 14th IEEE International Conference on Peer-to-Peer Computing (P2P) (pp.
1–10). https://doi.org/10.1109/P2P.2014.6934300'
bibtex: '@inproceedings{Feldotto_Scheideler_Graffi_2014, title={HSkip+: A Self-Stabilizing
Overlay Network for Nodes with Heterogeneous Bandwidths}, DOI={10.1109/P2P.2014.6934300},
booktitle={Proceedings of the 14th IEEE International Conference on Peer-to-Peer
Computing (P2P)}, author={Feldotto, Matthias and Scheideler, Christian and Graffi,
Kalman}, year={2014}, pages={1–10} }'
chicago: 'Feldotto, Matthias, Christian Scheideler, and Kalman Graffi. “HSkip+:
A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths.” In
Proceedings of the 14th IEEE International Conference on Peer-to-Peer Computing
(P2P), 1–10, 2014. https://doi.org/10.1109/P2P.2014.6934300.'
ieee: 'M. Feldotto, C. Scheideler, and K. Graffi, “HSkip+: A Self-Stabilizing Overlay
Network for Nodes with Heterogeneous Bandwidths,” in Proceedings of the 14th
IEEE International Conference on Peer-to-Peer Computing (P2P), 2014, pp. 1–10.'
mla: 'Feldotto, Matthias, et al. “HSkip+: A Self-Stabilizing Overlay Network for
Nodes with Heterogeneous Bandwidths.” Proceedings of the 14th IEEE International
Conference on Peer-to-Peer Computing (P2P), 2014, pp. 1–10, doi:10.1109/P2P.2014.6934300.'
short: 'M. Feldotto, C. Scheideler, K. Graffi, in: Proceedings of the 14th IEEE
International Conference on Peer-to-Peer Computing (P2P), 2014, pp. 1–10.'
date_created: 2017-10-17T12:42:12Z
date_updated: 2022-01-06T07:00:20Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
- _id: '541'
doi: 10.1109/P2P.2014.6934300
external_id:
arxiv:
- '1408.0395'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-16T11:34:00Z
date_updated: 2018-03-16T11:34:00Z
file_id: '1361'
file_name: 412-FSG2014P2P.pdf
file_size: 472321
relation: main_file
success: 1
file_date_updated: 2018-03-16T11:34:00Z
has_accepted_license: '1'
page: 1-10
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
publication: Proceedings of the 14th IEEE International Conference on Peer-to-Peer
Computing (P2P)
status: public
title: 'HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths'
type: conference
user_id: '14052'
year: '2014'
...
---
_id: '1868'
author:
- first_name: Andr{\'{e}}a
full_name: W. Richa, Andr{\'{e}}a
last_name: W. Richa
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
- first_name: Jin
full_name: Zhang, Jin
last_name: Zhang
citation:
ama: W. Richa A, Scheideler C, Schmid S, Zhang J. Competitive throughput in multi-hop
wireless networks despite adaptive jamming. Distributed Computing. 2013;(3):159--171.
doi:10.1007/s00446-012-0180-x
apa: W. Richa, A., Scheideler, C., Schmid, S., & Zhang, J. (2013). Competitive
throughput in multi-hop wireless networks despite adaptive jamming. Distributed
Computing, (3), 159--171. https://doi.org/10.1007/s00446-012-0180-x
bibtex: '@article{W. Richa_Scheideler_Schmid_Zhang_2013, title={Competitive throughput
in multi-hop wireless networks despite adaptive jamming}, DOI={10.1007/s00446-012-0180-x},
number={3}, journal={Distributed Computing}, author={W. Richa, Andr{\’{e}}a and
Scheideler, Christian and Schmid, Stefan and Zhang, Jin}, year={2013}, pages={159--171}
}'
chicago: 'W. Richa, Andr{\’{e}}a, Christian Scheideler, Stefan Schmid, and Jin Zhang.
“Competitive Throughput in Multi-Hop Wireless Networks despite Adaptive Jamming.”
Distributed Computing, no. 3 (2013): 159--171. https://doi.org/10.1007/s00446-012-0180-x.'
ieee: A. W. Richa, C. Scheideler, S. Schmid, and J. Zhang, “Competitive throughput
in multi-hop wireless networks despite adaptive jamming,” Distributed Computing,
no. 3, pp. 159--171, 2013.
mla: W. Richa, Andr{\’{e}}a, et al. “Competitive Throughput in Multi-Hop Wireless
Networks despite Adaptive Jamming.” Distributed Computing, no. 3, 2013,
pp. 159--171, doi:10.1007/s00446-012-0180-x.
short: A. W. Richa, C. Scheideler, S. Schmid, J. Zhang, Distributed Computing (2013)
159--171.
date_created: 2018-03-28T06:31:02Z
date_updated: 2022-01-06T06:53:50Z
department:
- _id: '79'
doi: 10.1007/s00446-012-0180-x
issue: '3'
page: 159--171
publication: Distributed Computing
status: public
title: Competitive throughput in multi-hop wireless networks despite adaptive jamming
type: journal_article
user_id: '15504'
year: '2013'
...
---
_id: '1870'
author:
- first_name: Rizal
full_name: Mohd Nor, Rizal
last_name: Mohd Nor
- first_name: Mikhail
full_name: Nesterenko, Mikhail
last_name: Nesterenko
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: Mohd Nor R, Nesterenko M, Scheideler C. Corona: A stabilizing deterministic
message-passing skip list. Theor Comput Sci. 2013:119--129. doi:10.1016/j.tcs.2012.08.029
apa: Mohd Nor, R., Nesterenko, M., & Scheideler, C. (2013). Corona: A stabilizing
deterministic message-passing skip list. Theor. Comput. Sci., 119--129.
https://doi.org/10.1016/j.tcs.2012.08.029
bibtex: '@article{Mohd Nor_Nesterenko_Scheideler_2013, title={Corona: A stabilizing
deterministic message-passing skip list}, DOI={10.1016/j.tcs.2012.08.029},
journal={Theor. Comput. Sci.}, author={Mohd Nor, Rizal and Nesterenko, Mikhail
and Scheideler, Christian}, year={2013}, pages={119--129} }'
chicago: Mohd Nor, Rizal, Mikhail Nesterenko, and Christian Scheideler. “Corona:
A Stabilizing Deterministic Message-Passing Skip List.” Theor. Comput. Sci.,
2013, 119--129. https://doi.org/10.1016/j.tcs.2012.08.029.
ieee: R. Mohd Nor, M. Nesterenko, and C. Scheideler, “Corona: A stabilizing deterministic
message-passing skip list,” Theor. Comput. Sci., pp. 119--129, 2013.
mla: Mohd Nor, Rizal, et al. “Corona: A Stabilizing Deterministic Message-Passing
Skip List.” Theor. Comput. Sci., 2013, pp. 119--129, doi:10.1016/j.tcs.2012.08.029.
short: R. Mohd Nor, M. Nesterenko, C. Scheideler, Theor. Comput. Sci. (2013) 119--129.
date_created: 2018-03-28T06:32:26Z
date_updated: 2022-01-06T06:53:51Z
department:
- _id: '79'
doi: 10.1016/j.tcs.2012.08.029
page: 119--129
publication: Theor. Comput. Sci.
status: public
title: 'Corona: A stabilizing deterministic message-passing skip list'
type: journal_article
user_id: '15504'
year: '2013'
...