---
_id: '15169'
author:
- first_name: Jannik
full_name: Castenow, Jannik
id: '38705'
last_name: Castenow
- first_name: Christina
full_name: Kolb, Christina
id: '43647'
last_name: Kolb
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Castenow J, Kolb C, Scheideler C. A Bounding Box Overlay for Competitive Routing
in Hybrid Communication Networks. In: Proceedings of the 21st International
Conference on Distributed Computing and Networking (ICDCN). ACM.'
apa: 'Castenow, J., Kolb, C., & Scheideler, C. (n.d.). A Bounding Box Overlay
for Competitive Routing in Hybrid Communication Networks. In Proceedings of
the 21st International Conference on Distributed Computing and Networking (ICDCN).
Kolkata, Indien: ACM.'
bibtex: '@inproceedings{Castenow_Kolb_Scheideler, title={A Bounding Box Overlay
for Competitive Routing in Hybrid Communication Networks}, booktitle={Proceedings
of the 21st International Conference on Distributed Computing and Networking (ICDCN)},
publisher={ACM}, author={Castenow, Jannik and Kolb, Christina and Scheideler,
Christian} }'
chicago: Castenow, Jannik, Christina Kolb, and Christian Scheideler. “A Bounding
Box Overlay for Competitive Routing in Hybrid Communication Networks.” In Proceedings
of the 21st International Conference on Distributed Computing and Networking (ICDCN).
ACM, n.d.
ieee: J. Castenow, C. Kolb, and C. Scheideler, “A Bounding Box Overlay for Competitive
Routing in Hybrid Communication Networks,” in Proceedings of the 21st International
Conference on Distributed Computing and Networking (ICDCN), Kolkata, Indien.
mla: Castenow, Jannik, et al. “A Bounding Box Overlay for Competitive Routing in
Hybrid Communication Networks.” Proceedings of the 21st International Conference
on Distributed Computing and Networking (ICDCN), ACM.
short: 'J. Castenow, C. Kolb, C. Scheideler, in: Proceedings of the 21st International
Conference on Distributed Computing and Networking (ICDCN), ACM, n.d.'
conference:
end_date: 07.01.2020
location: Kolkata, Indien
name: '21st International Conference on Distributed Computing and Networking '
start_date: 04.01.2020
date_created: 2019-11-25T12:18:41Z
date_updated: 2022-01-06T06:52:16Z
department:
- _id: '63'
- _id: '79'
language:
- iso: eng
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 21st International Conference on Distributed Computing
and Networking (ICDCN)
publication_status: accepted
publisher: ACM
status: public
title: A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks
type: conference
user_id: '477'
year: '2020'
...
---
_id: '17809'
author:
- first_name: N.
full_name: N., N.
last_name: N.
citation:
ama: N. N. Scalable Multi Objective Path Optimization for Multi-Laser Selective
Laser Melting Scanning Systems.; 2019.
apa: N., N. (2019). Scalable Multi Objective Path Optimization for Multi-Laser
Selective Laser Melting Scanning Systems.
bibtex: '@book{N._2019, title={Scalable Multi Objective Path Optimization for Multi-Laser
Selective Laser Melting Scanning Systems}, author={N., N.}, year={2019} }'
chicago: N., N. Scalable Multi Objective Path Optimization for Multi-Laser Selective
Laser Melting Scanning Systems, 2019.
ieee: N. N., Scalable Multi Objective Path Optimization for Multi-Laser Selective
Laser Melting Scanning Systems. 2019.
mla: N., N. Scalable Multi Objective Path Optimization for Multi-Laser Selective
Laser Melting Scanning Systems. 2019.
short: N. N., Scalable Multi Objective Path Optimization for Multi-Laser Selective
Laser Melting Scanning Systems, 2019.
date_created: 2020-08-11T11:06:28Z
date_updated: 2022-01-06T06:53:20Z
department:
- _id: '79'
language:
- iso: eng
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Scalable Multi Objective Path Optimization for Multi-Laser Selective Laser
Melting Scanning Systems
type: mastersthesis
user_id: '15504'
year: '2019'
...
---
_id: '8534'
abstract:
- lang: eng
text: "We propose two protocols for distributed priority queues (denoted by 'heap'
for simplicity in this paper) called SKEAP and SEAP. SKEAP realizes a distributed
heap for a constant amount of priorities and SEAP one for an arbitrary amount.
Both protocols build on an overlay, which induces an aggregation tree on which
heap operations are aggregated in batches, ensuring that our protocols scale even
for a high rate of incoming requests. As part of SEAP we provide a novel distributed
protocol for the k-selection problem that runs in time O(log n) w.h.p. SKEAP guarantees
sequential consistency for its heap operations, while SEAP guarantees serializability.
SKEAP and SEAP provide logarithmic runtimes w.h.p. on all their operations. \r\nSKEAP
and SEAP provide logarithmic runtimes w.h.p. on all their operations with SEAP
having to use only O(log n) bit messages."
author:
- first_name: Michael
full_name: Feldmann, Michael
id: '23538'
last_name: Feldmann
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Feldmann M, Scheideler C. Skeap & Seap: Scalable Distributed Priority
Queues for Constant and Arbitrary Priorities. In: Proceedings of the 31st ACM
Symposium on Parallelism in Algorithms and Architectures (SPAA). ACM; 2019:287--296.
doi:10.1145/3323165.3323193'
apa: 'Feldmann, M., & Scheideler, C. (2019). Skeap & Seap: Scalable Distributed
Priority Queues for Constant and Arbitrary Priorities. In Proceedings of the
31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) (pp.
287--296). ACM. https://doi.org/10.1145/3323165.3323193'
bibtex: '@inproceedings{Feldmann_Scheideler_2019, title={Skeap & Seap: Scalable
Distributed Priority Queues for Constant and Arbitrary Priorities}, DOI={10.1145/3323165.3323193},
booktitle={Proceedings of the 31st ACM Symposium on Parallelism in Algorithms
and Architectures (SPAA)}, publisher={ACM}, author={Feldmann, Michael and Scheideler,
Christian}, year={2019}, pages={287--296} }'
chicago: 'Feldmann, Michael, and Christian Scheideler. “Skeap & Seap: Scalable
Distributed Priority Queues for Constant and Arbitrary Priorities.” In Proceedings
of the 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA),
287--296. ACM, 2019. https://doi.org/10.1145/3323165.3323193.'
ieee: 'M. Feldmann and C. Scheideler, “Skeap & Seap: Scalable Distributed Priority
Queues for Constant and Arbitrary Priorities,” in Proceedings of the 31st ACM
Symposium on Parallelism in Algorithms and Architectures (SPAA), 2019, pp.
287--296.'
mla: 'Feldmann, Michael, and Christian Scheideler. “Skeap & Seap: Scalable Distributed
Priority Queues for Constant and Arbitrary Priorities.” Proceedings of the
31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA),
ACM, 2019, pp. 287--296, doi:10.1145/3323165.3323193.'
short: 'M. Feldmann, C. Scheideler, in: Proceedings of the 31st ACM Symposium on
Parallelism in Algorithms and Architectures (SPAA), ACM, 2019, pp. 287--296.'
date_created: 2019-03-21T14:37:26Z
date_updated: 2022-01-06T07:03:56Z
ddc:
- '004'
department:
- _id: '79'
doi: 10.1145/3323165.3323193
external_id:
arxiv:
- '1805.03472'
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2019-08-26T09:14:32Z
date_updated: 2019-08-26T09:14:32Z
file_id: '12954'
file_name: p287-feldmann.pdf
file_size: 1295095
relation: main_file
success: 1
file_date_updated: 2019-08-26T09:14:32Z
has_accepted_license: '1'
language:
- iso: eng
page: 287--296
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 31st ACM Symposium on Parallelism in Algorithms and
Architectures (SPAA)
publisher: ACM
status: public
title: 'Skeap & Seap: Scalable Distributed Priority Queues for Constant and Arbitrary
Priorities'
type: conference
user_id: '477'
year: '2019'
...
---
_id: '8871'
author:
- first_name: John
full_name: Augustine, John
last_name: Augustine
- first_name: Mohsen
full_name: Ghaffari, Mohsen
last_name: Ghaffari
- first_name: Robert
full_name: Gmyr, Robert
last_name: Gmyr
- first_name: Kristian
full_name: Hinnenthal, Kristian
id: '32229'
last_name: Hinnenthal
- first_name: Fabian
full_name: Kuhn, Fabian
last_name: Kuhn
- first_name: Jason
full_name: Li, Jason
last_name: Li
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Augustine J, Ghaffari M, Gmyr R, et al. Distributed Computation in Node-Capacitated
Networks. In: Proceedings of the 31st ACM Symposium on Parallelism in Algorithms
and Architectures. ACM; 2019:69--79. doi:10.1145/3323165.3323195'
apa: Augustine, J., Ghaffari, M., Gmyr, R., Hinnenthal, K., Kuhn, F., Li, J., &
Scheideler, C. (2019). Distributed Computation in Node-Capacitated Networks. In
Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures
(pp. 69--79). ACM. https://doi.org/10.1145/3323165.3323195
bibtex: '@inproceedings{Augustine_Ghaffari_Gmyr_Hinnenthal_Kuhn_Li_Scheideler_2019,
title={Distributed Computation in Node-Capacitated Networks}, DOI={10.1145/3323165.3323195},
booktitle={Proceedings of the 31st ACM Symposium on Parallelism in Algorithms
and Architectures}, publisher={ACM}, author={Augustine, John and Ghaffari, Mohsen
and Gmyr, Robert and Hinnenthal, Kristian and Kuhn, Fabian and Li, Jason and Scheideler,
Christian}, year={2019}, pages={69--79} }'
chicago: Augustine, John, Mohsen Ghaffari, Robert Gmyr, Kristian Hinnenthal, Fabian
Kuhn, Jason Li, and Christian Scheideler. “Distributed Computation in Node-Capacitated
Networks.” In Proceedings of the 31st ACM Symposium on Parallelism in Algorithms
and Architectures, 69--79. ACM, 2019. https://doi.org/10.1145/3323165.3323195.
ieee: J. Augustine et al., “Distributed Computation in Node-Capacitated Networks,”
in Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures,
2019, pp. 69--79.
mla: Augustine, John, et al. “Distributed Computation in Node-Capacitated Networks.”
Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures,
ACM, 2019, pp. 69--79, doi:10.1145/3323165.3323195.
short: 'J. Augustine, M. Ghaffari, R. Gmyr, K. Hinnenthal, F. Kuhn, J. Li, C. Scheideler,
in: Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures,
ACM, 2019, pp. 69--79.'
date_created: 2019-04-10T08:20:34Z
date_updated: 2022-01-06T07:04:04Z
ddc:
- '004'
department:
- _id: '79'
doi: 10.1145/3323165.3323195
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2019-08-26T11:17:58Z
date_updated: 2019-08-26T11:17:58Z
file_id: '12964'
file_name: p69-augustine.pdf
file_size: 1275192
relation: main_file
success: 1
file_date_updated: 2019-08-26T11:17:58Z
has_accepted_license: '1'
language:
- iso: eng
page: 69--79
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 31st ACM Symposium on Parallelism in Algorithms and
Architectures
publisher: ACM
status: public
title: Distributed Computation in Node-Capacitated Networks
type: conference
user_id: '477'
year: '2019'
...
---
_id: '6976'
abstract:
- lang: eng
text: "We investigate the maintenance of overlay networks under massive churn, i.e.\r\nnodes
joining and leaving the network. We assume an adversary that may churn a\r\nconstant
fraction $\\alpha n$ of nodes over the course of $\\mathcal{O}(\\log n)$\r\nrounds.
In particular, the adversary has an almost up-to-date information of\r\nthe network
topology as it can observe an only slightly outdated topology that\r\nis at least
$2$ rounds old. Other than that, we only have the provably minimal\r\nrestriction
that new nodes can only join the network via nodes that have taken\r\npart in
the network for at least one round.\r\n Our contributions are as follows: First,
we show that it is impossible to\r\nmaintain a connected topology if adversary
has up-to-date information about the\r\nnodes' connections. Further, we show that
our restriction concerning the join\r\nis also necessary. As our main result present
an algorithm that constructs a\r\nnew overlay- completely independent of all previous
overlays - every $2$\r\nrounds. Furthermore, each node sends and receives only
$\\mathcal{O}(\\log^3 n)$\r\nmessages each round. As part of our solution we propose
the Linearized DeBruijn\r\nSwarm (LDS), a highly churn resistant overlay, which
will be maintained by the\r\nalgorithm. However, our approaches can be transferred
to a variety of classical\r\nP2P Topologies where nodes are mapped into the $[0,1)$-interval."
author:
- first_name: Thorsten
full_name: Götte, Thorsten
id: '34727'
last_name: Götte
- first_name: Vipin Ravindran
full_name: Vijayalakshmi, Vipin Ravindran
last_name: Vijayalakshmi
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Götte T, Vijayalakshmi VR, Scheideler C. Always be Two Steps Ahead of Your
Enemy - Maintaining a Routable Overlay under Massive Churn with an Almost Up-to-date
Adversary. In: Proceedings of the 2019 IEEE 33rd International Parallel and
Distributed Processing Symposium (IPDPS ’19). IEEE.'
apa: 'Götte, T., Vijayalakshmi, V. R., & Scheideler, C. (n.d.). Always be Two
Steps Ahead of Your Enemy - Maintaining a Routable Overlay under Massive Churn
with an Almost Up-to-date Adversary. In Proceedings of the 2019 IEEE 33rd International
Parallel and Distributed Processing Symposium (IPDPS ’19). Rio de Janeiro,
Brazil: IEEE.'
bibtex: '@inproceedings{Götte_Vijayalakshmi_Scheideler, title={Always be Two Steps
Ahead of Your Enemy - Maintaining a Routable Overlay under Massive Churn with
an Almost Up-to-date Adversary}, booktitle={Proceedings of the 2019 IEEE 33rd
International Parallel and Distributed Processing Symposium (IPDPS ’19)}, publisher={IEEE},
author={Götte, Thorsten and Vijayalakshmi, Vipin Ravindran and Scheideler, Christian}
}'
chicago: Götte, Thorsten, Vipin Ravindran Vijayalakshmi, and Christian Scheideler.
“Always Be Two Steps Ahead of Your Enemy - Maintaining a Routable Overlay under
Massive Churn with an Almost Up-to-Date Adversary.” In Proceedings of the 2019
IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS
’19). IEEE, n.d.
ieee: T. Götte, V. R. Vijayalakshmi, and C. Scheideler, “Always be Two Steps Ahead
of Your Enemy - Maintaining a Routable Overlay under Massive Churn with an Almost
Up-to-date Adversary,” in Proceedings of the 2019 IEEE 33rd International Parallel
and Distributed Processing Symposium (IPDPS ’19), Rio de Janeiro, Brazil.
mla: Götte, Thorsten, et al. “Always Be Two Steps Ahead of Your Enemy - Maintaining
a Routable Overlay under Massive Churn with an Almost Up-to-Date Adversary.” Proceedings
of the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium
(IPDPS ’19), IEEE.
short: 'T. Götte, V.R. Vijayalakshmi, C. Scheideler, in: Proceedings of the 2019
IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS
’19), IEEE, n.d.'
conference:
end_date: 24.05.19
location: Rio de Janeiro, Brazil
name: 2019 IEEE 33rd International Parallel and Distributed Processing Symposium
(IPDPS '19)
start_date: 20.05.19
date_created: 2019-01-24T18:53:11Z
date_updated: 2022-01-06T07:03:25Z
ddc:
- '000'
department:
- _id: '79'
file:
- access_level: closed
content_type: application/pdf
creator: thgoette
date_created: 2019-01-26T16:09:08Z
date_updated: 2019-01-26T16:09:08Z
file_id: '7007'
file_name: Always_be_Two_Steps_Ahead_of_Your_Enemy.pdf
file_size: 638020
relation: main_file
success: 1
file_date_updated: 2019-01-26T16:09:08Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '13'
name: SFB 901 - Subproject C1
publication: Proceedings of the 2019 IEEE 33rd International Parallel and Distributed
Processing Symposium (IPDPS '19)
publication_status: accepted
publisher: IEEE
status: public
title: Always be Two Steps Ahead of Your Enemy - Maintaining a Routable Overlay under
Massive Churn with an Almost Up-to-date Adversary
type: conference
user_id: '34727'
year: '2019'
...
---
_id: '10586'
abstract:
- lang: eng
text: We consider the problem of transforming a given graph G_s into a desired graph
G_t by applying a minimum number of primitives from a particular set of local
graph transformation primitives. These primitives are local in the sense that
each node can apply them based on local knowledge and by affecting only its 1-neighborhood.
Although the specific set of primitives we consider makes it possible to transform
any (weakly) connected graph into any other (weakly) connected graph consisting
of the same nodes, they cannot disconnect the graph or introduce new nodes into
the graph, making them ideal in the context of supervised overlay network transformations.
We prove that computing a minimum sequence of primitive applications (even centralized)
for arbitrary G_s and G_t is NP-hard, which we conjecture to hold for any set
of local graph transformation primitives satisfying the aforementioned properties.
On the other hand, we show that this problem admits a polynomial time algorithm
with a constant approximation ratio.
author:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Alexander
full_name: Setzer, Alexander
id: '11108'
last_name: Setzer
citation:
ama: 'Scheideler C, Setzer A. On the Complexity of Local Graph Transformations.
In: Proceedings of the 46th International Colloquium on Automata, Languages,
and Programming. Vol 132. LIPIcs. Dagstuhl Publishing; 2019:150:1--150:14.
doi:10.4230/LIPICS.ICALP.2019.150'
apa: 'Scheideler, C., & Setzer, A. (2019). On the Complexity of Local Graph
Transformations. In Proceedings of the 46th International Colloquium on Automata,
Languages, and Programming (Vol. 132, pp. 150:1--150:14). Patras, Greece:
Dagstuhl Publishing. https://doi.org/10.4230/LIPICS.ICALP.2019.150'
bibtex: '@inproceedings{Scheideler_Setzer_2019, series={LIPIcs}, title={On the Complexity
of Local Graph Transformations}, volume={132}, DOI={10.4230/LIPICS.ICALP.2019.150},
booktitle={Proceedings of the 46th International Colloquium on Automata, Languages,
and Programming}, publisher={Dagstuhl Publishing}, author={Scheideler, Christian
and Setzer, Alexander}, year={2019}, pages={150:1--150:14}, collection={LIPIcs}
}'
chicago: Scheideler, Christian, and Alexander Setzer. “On the Complexity of Local
Graph Transformations.” In Proceedings of the 46th International Colloquium
on Automata, Languages, and Programming, 132:150:1--150:14. LIPIcs. Dagstuhl
Publishing, 2019. https://doi.org/10.4230/LIPICS.ICALP.2019.150.
ieee: C. Scheideler and A. Setzer, “On the Complexity of Local Graph Transformations,”
in Proceedings of the 46th International Colloquium on Automata, Languages,
and Programming, Patras, Greece, 2019, vol. 132, pp. 150:1--150:14.
mla: Scheideler, Christian, and Alexander Setzer. “On the Complexity of Local Graph
Transformations.” Proceedings of the 46th International Colloquium on Automata,
Languages, and Programming, vol. 132, Dagstuhl Publishing, 2019, pp. 150:1--150:14,
doi:10.4230/LIPICS.ICALP.2019.150.
short: 'C. Scheideler, A. Setzer, in: Proceedings of the 46th International Colloquium
on Automata, Languages, and Programming, Dagstuhl Publishing, 2019, pp. 150:1--150:14.'
conference:
end_date: 2019-07-12
location: Patras, Greece
name: ICALP 2019
start_date: 2019-07-09
date_created: 2019-07-08T17:19:01Z
date_updated: 2022-01-06T06:50:45Z
ddc:
- '004'
department:
- _id: '79'
doi: 10.4230/LIPICS.ICALP.2019.150
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2019-08-26T09:21:27Z
date_updated: 2019-08-26T09:21:27Z
file_id: '12955'
file_name: LIPIcs-ICALP-2019-150.pdf
file_size: 537649
relation: main_file
success: 1
file_date_updated: 2019-08-26T09:21:27Z
has_accepted_license: '1'
intvolume: ' 132'
keyword:
- Graphs transformations
- NP-hardness
- approximation algorithms
language:
- iso: eng
page: 150:1--150:14
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subproject A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 46th International Colloquium on Automata, Languages,
and Programming
publication_status: published
publisher: Dagstuhl Publishing
series_title: LIPIcs
status: public
title: On the Complexity of Local Graph Transformations
type: conference
user_id: '477'
volume: 132
year: '2019'
...
---
_id: '14829'
citation:
ama: Scheideler C, Berenbrink P, eds. The 31st ACM Symposium on Parallelism in
Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June 22-24, 2019.
ACM; 2019. doi:10.1145/3323165
apa: Scheideler, C., & Berenbrink, P. (Eds.). (2019). The 31st ACM Symposium
on Parallelism in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June
22-24, 2019. ACM. https://doi.org/10.1145/3323165
bibtex: '@book{Scheideler_Berenbrink_2019, title={The 31st ACM Symposium on Parallelism
in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June 22-24, 2019},
DOI={10.1145/3323165}, publisher={ACM},
year={2019} }'
chicago: Scheideler, Christian, and Petra Berenbrink, eds. The 31st ACM Symposium
on Parallelism in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June
22-24, 2019. ACM, 2019. https://doi.org/10.1145/3323165.
ieee: C. Scheideler and P. Berenbrink, Eds., The 31st ACM Symposium on Parallelism
in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June 22-24, 2019.
ACM, 2019.
mla: Scheideler, Christian, and Petra Berenbrink, editors. The 31st ACM Symposium
on Parallelism in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June
22-24, 2019. ACM, 2019, doi:10.1145/3323165.
short: C. Scheideler, P. Berenbrink, eds., The 31st ACM Symposium on Parallelism
in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June 22-24, 2019,
ACM, 2019.
date_created: 2019-11-06T10:43:41Z
date_updated: 2022-01-06T06:52:07Z
department:
- _id: '79'
doi: 10.1145/3323165
editor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Petra
full_name: Berenbrink, Petra
last_name: Berenbrink
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
publication_identifier:
isbn:
- 978-1-4503-6184-2
publisher: ACM
status: public
title: The 31st ACM Symposium on Parallelism in Algorithms and Architectures, SPAA
2019, Phoenix, AZ, USA, June 22-24, 2019
type: conference_editor
user_id: '477'
year: '2019'
...
---
_id: '14830'
author:
- first_name: Robert
full_name: Gmyr, Robert
last_name: Gmyr
- first_name: Jonas
full_name: Lefevre, Jonas
last_name: Lefevre
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: Gmyr R, Lefevre J, Scheideler C. Self-Stabilizing Metric Graphs. Theory
Comput Syst. 2019;63(2):177-199. doi:10.1007/s00224-017-9823-4
apa: Gmyr, R., Lefevre, J., & Scheideler, C. (2019). Self-Stabilizing Metric
Graphs. Theory Comput. Syst., 63(2), 177–199. https://doi.org/10.1007/s00224-017-9823-4
bibtex: '@article{Gmyr_Lefevre_Scheideler_2019, title={Self-Stabilizing Metric Graphs},
volume={63}, DOI={10.1007/s00224-017-9823-4},
number={2}, journal={Theory Comput. Syst.}, author={Gmyr, Robert and Lefevre,
Jonas and Scheideler, Christian}, year={2019}, pages={177–199} }'
chicago: 'Gmyr, Robert, Jonas Lefevre, and Christian Scheideler. “Self-Stabilizing
Metric Graphs.” Theory Comput. Syst. 63, no. 2 (2019): 177–99. https://doi.org/10.1007/s00224-017-9823-4.'
ieee: R. Gmyr, J. Lefevre, and C. Scheideler, “Self-Stabilizing Metric Graphs,”
Theory Comput. Syst., vol. 63, no. 2, pp. 177–199, 2019.
mla: Gmyr, Robert, et al. “Self-Stabilizing Metric Graphs.” Theory Comput. Syst.,
vol. 63, no. 2, 2019, pp. 177–99, doi:10.1007/s00224-017-9823-4.
short: R. Gmyr, J. Lefevre, C. Scheideler, Theory Comput. Syst. 63 (2019) 177–199.
date_created: 2019-11-06T10:54:58Z
date_updated: 2022-01-06T06:52:07Z
department:
- _id: '79'
doi: 10.1007/s00224-017-9823-4
intvolume: ' 63'
issue: '2'
language:
- iso: eng
page: 177-199
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '13'
name: SFB 901 - Subproject C1
publication: Theory Comput. Syst.
status: public
title: Self-Stabilizing Metric Graphs
type: journal_article
user_id: '15504'
volume: 63
year: '2019'
...
---
_id: '14539'
author:
- first_name: Jannik
full_name: Castenow, Jannik
id: '38705'
last_name: Castenow
- first_name: Christina
full_name: Kolb, Christina
id: '43647'
last_name: Kolb
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Castenow J, Kolb C, Scheideler C. A Bounding Box Overlay for Competitive Routing
in Hybrid Communication Networks. In: Proceedings of the 26th International
Colloquium on Structural Information and Communication Complexity (SIROCCO).
; 2019:345-348. doi:10.1007/978-3-030-24922-9\_26'
apa: Castenow, J., Kolb, C., & Scheideler, C. (2019). A Bounding Box Overlay
for Competitive Routing in Hybrid Communication Networks. In Proceedings of
the 26th International Colloquium on Structural Information and Communication
Complexity (SIROCCO) (pp. 345–348). L’Aquila, Italy. https://doi.org/10.1007/978-3-030-24922-9\_26
bibtex: '@inproceedings{Castenow_Kolb_Scheideler_2019, title={A Bounding Box Overlay
for Competitive Routing in Hybrid Communication Networks}, DOI={10.1007/978-3-030-24922-9\_26},
booktitle={Proceedings of the 26th International Colloquium on Structural Information
and Communication Complexity (SIROCCO)}, author={Castenow, Jannik and Kolb, Christina
and Scheideler, Christian}, year={2019}, pages={345–348} }'
chicago: Castenow, Jannik, Christina Kolb, and Christian Scheideler. “A Bounding
Box Overlay for Competitive Routing in Hybrid Communication Networks.” In Proceedings
of the 26th International Colloquium on Structural Information and Communication
Complexity (SIROCCO), 345–48, 2019. https://doi.org/10.1007/978-3-030-24922-9\_26.
ieee: J. Castenow, C. Kolb, and C. Scheideler, “A Bounding Box Overlay for Competitive
Routing in Hybrid Communication Networks,” in Proceedings of the 26th International
Colloquium on Structural Information and Communication Complexity (SIROCCO),
L’Aquila, Italy, 2019, pp. 345–348.
mla: Castenow, Jannik, et al. “A Bounding Box Overlay for Competitive Routing in
Hybrid Communication Networks.” Proceedings of the 26th International Colloquium
on Structural Information and Communication Complexity (SIROCCO), 2019, pp.
345–48, doi:10.1007/978-3-030-24922-9\_26.
short: 'J. Castenow, C. Kolb, C. Scheideler, in: Proceedings of the 26th International
Colloquium on Structural Information and Communication Complexity (SIROCCO), 2019,
pp. 345–348.'
conference:
end_date: 2019-07-04
location: L'Aquila, Italy
name: SIROCCO 2019
start_date: 2019-07-01
date_created: 2019-11-04T10:09:35Z
date_updated: 2022-01-06T06:52:00Z
department:
- _id: '79'
- _id: '63'
doi: 10.1007/978-3-030-24922-9\_26
language:
- iso: eng
page: 345-348
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subproject A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 26th International Colloquium on Structural Information
and Communication Complexity (SIROCCO)
status: public
title: A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks
type: conference
user_id: '477'
year: '2019'
...
---
_id: '13182'
abstract:
- lang: eng
text: "We consider congestion control in peer-to-peer distributed systems. \r\nThe
problem can be reduced to the following scenario: Consider a set $V$ of $n$ peers
(called \\emph{clients} in this paper) that want to send messages to a fixed common
peer (called \\emph{server} in this paper).\r\nWe assume that each client $v \\in
V$ sends a message with probability $p(v) \\in [0,1)$ and the server has a capacity
of $\\sigma \\in \\mathbb{N}$, i.e., it can recieve at most $\\sigma$ messages
per round and excess messages are dropped.\r\nThe server can modify these probabilities
when clients send messages.\r\nIdeally, we wish to converge to a state with $\\sum
p(v) = \\sigma$ and $p(v) = p(w)$ for all $v,w \\in V$.\t\r\n\r\nWe propose a
\\emph{loosely} self-stabilizing protocol with a slightly relaxed legitimate state.
\ \r\nOur protocol lets the system converge from \\emph{any} initial state to
a state where $\\sum p(v) \\in \\left[\\sigma \\pm \\epsilon\\right]$ and $|p(v)-p(w)|
\\in O(\\frac{1}{n})$. \r\nThis property is then maintained for $\\Omega(n^{\\mathfrak{c}})$
rounds in expectation.\r\nIn particular, the initial client probabilities and
server variables are not necessarily well-defined, i.e., they may have arbitrary
values.\r\n\r\nOur protocol uses only $O(W + \\log n)$ bits of memory where $W$
is length of node identifiers, making it very lightweight.\r\nFinally we state
a lower bound on the convergence time an see that our protocol performs asymptotically
optimal (up to some polylogarithmic factor).\r\n"
author:
- first_name: Michael
full_name: Feldmann, Michael
id: '23538'
last_name: Feldmann
- first_name: Thorsten
full_name: Götte, Thorsten
id: '34727'
last_name: Götte
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Feldmann M, Götte T, Scheideler C. A Loosely Self-stabilizing Protocol for
Randomized Congestion Control with Logarithmic Memory. In: Proceedings of the
21st International Symposium on Stabilization, Safety, and Security of Distributed
Systems (SSS). Lecture Notes in Computer Science. Springer, Cham; 2019:149-164.
doi:https://doi.org/10.1007/978-3-030-34992-9_13'
apa: Feldmann, M., Götte, T., & Scheideler, C. (2019). A Loosely Self-stabilizing
Protocol for Randomized Congestion Control with Logarithmic Memory. In Proceedings
of the 21st International Symposium on Stabilization, Safety, and Security of
Distributed Systems (SSS) (pp. 149–164). Springer, Cham. https://doi.org/10.1007/978-3-030-34992-9_13
bibtex: '@inproceedings{Feldmann_Götte_Scheideler_2019, series={Lecture Notes in
Computer Science}, title={A Loosely Self-stabilizing Protocol for Randomized Congestion
Control with Logarithmic Memory}, DOI={https://doi.org/10.1007/978-3-030-34992-9_13},
booktitle={Proceedings of the 21st International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS)}, publisher={Springer, Cham}, author={Feldmann,
Michael and Götte, Thorsten and Scheideler, Christian}, year={2019}, pages={149–164},
collection={Lecture Notes in Computer Science} }'
chicago: Feldmann, Michael, Thorsten Götte, and Christian Scheideler. “A Loosely
Self-Stabilizing Protocol for Randomized Congestion Control with Logarithmic Memory.”
In Proceedings of the 21st International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS), 149–64. Lecture Notes in Computer
Science. Springer, Cham, 2019. https://doi.org/10.1007/978-3-030-34992-9_13.
ieee: M. Feldmann, T. Götte, and C. Scheideler, “A Loosely Self-stabilizing Protocol
for Randomized Congestion Control with Logarithmic Memory,” in Proceedings
of the 21st International Symposium on Stabilization, Safety, and Security of
Distributed Systems (SSS), 2019, pp. 149–164.
mla: Feldmann, Michael, et al. “A Loosely Self-Stabilizing Protocol for Randomized
Congestion Control with Logarithmic Memory.” Proceedings of the 21st International
Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS),
Springer, Cham, 2019, pp. 149–64, doi:https://doi.org/10.1007/978-3-030-34992-9_13.
short: 'M. Feldmann, T. Götte, C. Scheideler, in: Proceedings of the 21st International
Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS),
Springer, Cham, 2019, pp. 149–164.'
date_created: 2019-09-10T12:48:33Z
date_updated: 2022-01-06T06:51:30Z
ddc:
- '000'
department:
- _id: '79'
doi: https://doi.org/10.1007/978-3-030-34992-9_13
external_id:
arxiv:
- '1909.04544'
file:
- access_level: closed
content_type: application/pdf
creator: mfeldma2
date_created: 2019-09-11T11:20:16Z
date_updated: 2019-09-11T11:20:16Z
file_id: '13188'
file_name: main.pdf
file_size: 428908
relation: main_file
success: 1
file_date_updated: 2019-09-11T11:20:16Z
has_accepted_license: '1'
language:
- iso: eng
page: 149-164
project:
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
- _id: '1'
name: SFB 901
publication: Proceedings of the 21st International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS)
publisher: Springer, Cham
series_title: Lecture Notes in Computer Science
status: public
title: A Loosely Self-stabilizing Protocol for Randomized Congestion Control with
Logarithmic Memory
type: conference
user_id: '23538'
year: '2019'
...
---
_id: '10271'
author:
- first_name: N.
full_name: N., N.
last_name: N.
citation:
ama: N. N. Implementation and Evaluation of Authenticated Data Structures Using
Intel SGX Enclaves. Universität Paderborn; 2019.
apa: N., N. (2019). Implementation and Evaluation of Authenticated Data Structures
Using Intel SGX Enclaves. Universität Paderborn.
bibtex: '@book{N._2019, title={Implementation and Evaluation of Authenticated Data
Structures Using Intel SGX Enclaves}, publisher={Universität Paderborn}, author={N.,
N.}, year={2019} }'
chicago: N., N. Implementation and Evaluation of Authenticated Data Structures
Using Intel SGX Enclaves. Universität Paderborn, 2019.
ieee: N. N., Implementation and Evaluation of Authenticated Data Structures Using
Intel SGX Enclaves. Universität Paderborn, 2019.
mla: N., N. Implementation and Evaluation of Authenticated Data Structures Using
Intel SGX Enclaves. Universität Paderborn, 2019.
short: N. N., Implementation and Evaluation of Authenticated Data Structures Using
Intel SGX Enclaves, Universität Paderborn, 2019.
date_created: 2019-06-19T11:31:38Z
date_updated: 2022-01-06T06:50:33Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '13'
name: SFB 901 - Subproject C1
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Implementation and Evaluation of Authenticated Data Structures Using Intel
SGX Enclaves
type: mastersthesis
user_id: '477'
year: '2019'
...
---
_id: '13652'
author:
- first_name: Kristian
full_name: Hinnenthal, Kristian
id: '32229'
last_name: Hinnenthal
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Martijn
full_name: Struijs, Martijn
last_name: Struijs
citation:
ama: 'Hinnenthal K, Scheideler C, Struijs M. Fast Distributed Algorithms for LP-Type
Problems of Low Dimension. In: 33rd International Symposium on Distributed
Computing (DISC 2019). ; 2019. doi:10.4230/LIPICS.DISC.2019.23'
apa: Hinnenthal, K., Scheideler, C., & Struijs, M. (2019). Fast Distributed
Algorithms for LP-Type Problems of Low Dimension. In 33rd International Symposium
on Distributed Computing (DISC 2019). https://doi.org/10.4230/LIPICS.DISC.2019.23
bibtex: '@inproceedings{Hinnenthal_Scheideler_Struijs_2019, title={Fast Distributed
Algorithms for LP-Type Problems of Low Dimension}, DOI={10.4230/LIPICS.DISC.2019.23},
booktitle={33rd International Symposium on Distributed Computing (DISC 2019)},
author={Hinnenthal, Kristian and Scheideler, Christian and Struijs, Martijn},
year={2019} }'
chicago: Hinnenthal, Kristian, Christian Scheideler, and Martijn Struijs. “Fast
Distributed Algorithms for LP-Type Problems of Low Dimension.” In 33rd International
Symposium on Distributed Computing (DISC 2019), 2019. https://doi.org/10.4230/LIPICS.DISC.2019.23.
ieee: K. Hinnenthal, C. Scheideler, and M. Struijs, “Fast Distributed Algorithms
for LP-Type Problems of Low Dimension,” in 33rd International Symposium on
Distributed Computing (DISC 2019), 2019.
mla: Hinnenthal, Kristian, et al. “Fast Distributed Algorithms for LP-Type Problems
of Low Dimension.” 33rd International Symposium on Distributed Computing (DISC
2019), 2019, doi:10.4230/LIPICS.DISC.2019.23.
short: 'K. Hinnenthal, C. Scheideler, M. Struijs, in: 33rd International Symposium
on Distributed Computing (DISC 2019), 2019.'
date_created: 2019-10-08T11:53:38Z
date_updated: 2022-01-06T06:51:41Z
department:
- _id: '79'
doi: 10.4230/LIPICS.DISC.2019.23
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
publication: 33rd International Symposium on Distributed Computing (DISC 2019)
status: public
title: Fast Distributed Algorithms for LP-Type Problems of Low Dimension
type: conference
user_id: '32229'
year: '2019'
...
---
_id: '3422'
abstract:
- lang: eng
text: "We study the consensus problem in a synchronous distributed system of n nodes
under an adaptive adversary that has a slightly outdated view of the system and
can block all incoming and outgoing communication of a constant fraction of the
nodes in each round. Motivated by a result of Ben-Or and Bar-Joseph (1998), showing
that any consensus algorithm that is resilient against a linear number of crash
faults requires $\\tilde \\Omega(\\sqrt n)$ rounds in an n-node network against
an adaptive adversary, we consider a late adaptive adversary, who has full knowledge
of the network state at the beginning of the previous round and unlimited computational
power, but is oblivious to the current state of the nodes. \r\n\r\nOur main contributions
are randomized distributed algorithms that achieve consensus with high probability
among all except a small constant fraction of the nodes (i.e., \"almost-everywhere'')
against a late adaptive adversary who can block up to ε n$ nodes in each round,
for a small constant ε >0$. Our first protocol achieves binary almost-everywhere
consensus and also guarantees a decision on the majority input value, thus ensuring
plurality consensus. We also present an algorithm that achieves the same time
complexity for multi-value consensus. Both of our algorithms succeed in $O(log
n)$ rounds with high probability, thus showing an exponential gap to the $\\tilde\\Omega(\\sqrt
n)$ lower bound of Ben-Or and Bar-Joseph for strongly adaptive crash-failure adversaries,
which can be strengthened to $\\Omega(n)$ when allowing the adversary to block
nodes instead of permanently crashing them. Our algorithms are scalable to large
systems as each node contacts only an (amortized) constant number of peers in
each communication round. We show that our algorithms are optimal up to constant
(resp.\\ sub-logarithmic) factors by proving that every almost-everywhere consensus
protocol takes $\\Omega(log_d n)$ rounds in the worst case, where d is an upper
bound on the number of communication requests initiated per node in each round.
We complement our theoretical results with an experimental evaluation of the binary
almost-everywhere consensus protocol revealing a short convergence time even against
an adversary blocking a large fraction of nodes."
author:
- first_name: Peter
full_name: Robinson, Peter
last_name: Robinson
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Alexander
full_name: Setzer, Alexander
id: '11108'
last_name: Setzer
citation:
ama: 'Robinson P, Scheideler C, Setzer A. Breaking the $\tilde\Omega(\sqrt{n})$
Barrier: Fast Consensus under a Late Adversary. In: Proceedings of the 30th
ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). doi:10.1145/3210377.3210399'
apa: 'Robinson, P., Scheideler, C., & Setzer, A. (n.d.). Breaking the $\tilde\Omega(\sqrt{n})$
Barrier: Fast Consensus under a Late Adversary. In Proceedings of the 30th
ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). Wien.
https://doi.org/10.1145/3210377.3210399'
bibtex: '@inproceedings{Robinson_Scheideler_Setzer, title={Breaking the $\tilde\Omega(\sqrt{n})$
Barrier: Fast Consensus under a Late Adversary}, DOI={10.1145/3210377.3210399},
booktitle={Proceedings of the 30th ACM Symposium on Parallelism in Algorithms
and Architectures (SPAA)}, author={Robinson, Peter and Scheideler, Christian and
Setzer, Alexander} }'
chicago: 'Robinson, Peter, Christian Scheideler, and Alexander Setzer. “Breaking
the $\tilde\Omega(\sqrt{n})$ Barrier: Fast Consensus under a Late Adversary.”
In Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures
(SPAA), n.d. https://doi.org/10.1145/3210377.3210399.'
ieee: 'P. Robinson, C. Scheideler, and A. Setzer, “Breaking the $\tilde\Omega(\sqrt{n})$
Barrier: Fast Consensus under a Late Adversary,” in Proceedings of the 30th
ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), Wien.'
mla: 'Robinson, Peter, et al. “Breaking the $\tilde\Omega(\sqrt{n})$ Barrier: Fast
Consensus under a Late Adversary.” Proceedings of the 30th ACM Symposium on
Parallelism in Algorithms and Architectures (SPAA), doi:10.1145/3210377.3210399.'
short: 'P. Robinson, C. Scheideler, A. Setzer, in: Proceedings of the 30th ACM Symposium
on Parallelism in Algorithms and Architectures (SPAA), n.d.'
conference:
end_date: 2018-07-18
location: Wien
name: 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)
start_date: 2018-07-16
date_created: 2018-07-04T08:55:45Z
date_updated: 2022-01-06T06:59:16Z
ddc:
- '040'
department:
- _id: '79'
- _id: '34'
- _id: '7'
doi: 10.1145/3210377.3210399
file:
- access_level: closed
content_type: application/pdf
creator: asetzer
date_created: 2018-10-31T13:30:40Z
date_updated: 2018-10-31T13:30:40Z
file_id: '5215'
file_name: p173-robinson.pdf
file_size: 1675407
relation: main_file
success: 1
file_date_updated: 2018-10-31T13:30:40Z
has_accepted_license: '1'
keyword:
- distributed consensus
- randomized algorithm
- adaptive adversary
- complexity lower bound
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '13'
name: SFB 901 - Subproject C1
publication: Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and
Architectures (SPAA)
publication_identifier:
isbn:
- 978-1-4503-5799-9/18/07
publication_status: accepted
status: public
title: 'Breaking the $\tilde\Omega(\sqrt{n})$ Barrier: Fast Consensus under a Late
Adversary'
type: conference
user_id: '11108'
year: '2018'
...
---
_id: '3874'
citation:
ama: Scheideler C, Fineman JT, eds. Proceedings of the 30th on Symposium on Parallelism
in Algorithms and Architectures. ACM; 2018.
apa: 'Scheideler, C., & Fineman, J. T. (Eds.). (2018). Proceedings of the
30th on Symposium on Parallelism in Algorithms and Architectures. Vienna,
Austria: ACM.'
bibtex: '@book{Scheideler_Fineman_2018, title={Proceedings of the 30th on Symposium
on Parallelism in Algorithms and Architectures}, publisher={ACM}, year={2018}
}'
chicago: Scheideler, Christian, and Jeremy T. Fineman, eds. Proceedings of the
30th on Symposium on Parallelism in Algorithms and Architectures. ACM, 2018.
ieee: C. Scheideler and J. T. Fineman, Eds., Proceedings of the 30th on Symposium
on Parallelism in Algorithms and Architectures. ACM, 2018.
mla: Scheideler, Christian, and Jeremy T. Fineman, editors. Proceedings of the
30th on Symposium on Parallelism in Algorithms and Architectures. ACM, 2018.
short: C. Scheideler, J.T. Fineman, eds., Proceedings of the 30th on Symposium on
Parallelism in Algorithms and Architectures, ACM, 2018.
conference:
location: Vienna, Austria
date_created: 2018-08-10T10:03:47Z
date_updated: 2022-01-06T06:59:47Z
department:
- _id: '79'
editor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Jeremy T.
full_name: Fineman, Jeremy T.
last_name: Fineman
publication_identifier:
isbn:
- 978-1-4503-5799-9
publisher: ACM
status: public
title: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures
type: conference_editor
user_id: '15504'
year: '2018'
...
---
_id: '1138'
author:
- first_name: Robert
full_name: Gmyr, Robert
last_name: Gmyr
citation:
ama: Gmyr R. Distributed Algorithms for Overlay Networks and Programmable Matter.
Universität Paderborn; 2018. doi:10.17619/UNIPB/1-265
apa: Gmyr, R. (2018). Distributed Algorithms for Overlay Networks and Programmable
Matter. Universität Paderborn. https://doi.org/10.17619/UNIPB/1-265
bibtex: '@book{Gmyr_2018, title={Distributed Algorithms for Overlay Networks and
Programmable Matter}, DOI={10.17619/UNIPB/1-265},
publisher={Universität Paderborn}, author={Gmyr, Robert}, year={2018} }'
chicago: Gmyr, Robert. Distributed Algorithms for Overlay Networks and Programmable
Matter. Universität Paderborn, 2018. https://doi.org/10.17619/UNIPB/1-265.
ieee: R. Gmyr, Distributed Algorithms for Overlay Networks and Programmable Matter.
Universität Paderborn, 2018.
mla: Gmyr, Robert. Distributed Algorithms for Overlay Networks and Programmable
Matter. Universität Paderborn, 2018, doi:10.17619/UNIPB/1-265.
short: R. Gmyr, Distributed Algorithms for Overlay Networks and Programmable Matter,
Universität Paderborn, 2018.
date_created: 2018-01-31T06:04:03Z
date_updated: 2022-01-06T06:51:00Z
department:
- _id: '79'
doi: 10.17619/UNIPB/1-265
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subproject C1
- _id: '2'
name: SFB 901 - Project Area A
- _id: '4'
name: SFB 901 - Project Area C
- _id: '5'
name: SFB 901 - Subproject A1
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Distributed Algorithms for Overlay Networks and Programmable Matter
type: dissertation
user_id: '477'
year: '2018'
...
---
_id: '1163'
abstract:
- lang: eng
text: "In this paper we present two major results:\r\nFirst, we introduce the first
self-stabilizing version of a supervised overlay network (as introduced in~\\cite{DBLP:conf/ispan/KothapalliS05})
by presenting a self-stabilizing supervised skip ring.\r\nSecondly, we show how
to use the self-stabilizing supervised skip ring to construct an efficient self-stabilizing
publish-subscribe system.\r\nThat is, in addition to stabilizing the overlay network,
every subscriber of a topic will eventually know all of the publications that
have been issued so far for that topic. The communication work needed to processes
a subscribe or unsubscribe operation is just a constant in a legitimate state,
and the communication work of checking whether the system is still in a legitimate
state is just a constant on expectation for the supervisor as well as any process
in the system.\r\n"
author:
- first_name: Michael
full_name: Feldmann, Michael
id: '23538'
last_name: Feldmann
- first_name: Christina
full_name: Kolb, Christina
id: '43647'
last_name: Kolb
- 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: 'Feldmann M, Kolb C, Scheideler C, Strothmann TF. Self-Stabilizing Supervised
Publish-Subscribe Systems. In: Proceedings of the 32nd IEEE International Parallel
& Distributed Processing Symposium (IPDPS). IEEE; 2018. doi:10.1109/IPDPS.2018.00114'
apa: 'Feldmann, M., Kolb, C., Scheideler, C., & Strothmann, T. F. (2018). Self-Stabilizing
Supervised Publish-Subscribe Systems. In Proceedings of the 32nd IEEE International
Parallel & Distributed Processing Symposium (IPDPS). Vancouver: IEEE.
https://doi.org/10.1109/IPDPS.2018.00114'
bibtex: '@inproceedings{Feldmann_Kolb_Scheideler_Strothmann_2018, title={Self-Stabilizing
Supervised Publish-Subscribe Systems}, DOI={10.1109/IPDPS.2018.00114},
booktitle={Proceedings of the 32nd IEEE International Parallel & Distributed
Processing Symposium (IPDPS)}, publisher={IEEE}, author={Feldmann, Michael and
Kolb, Christina and Scheideler, Christian and Strothmann, Thim Frederik}, year={2018}
}'
chicago: Feldmann, Michael, Christina Kolb, Christian Scheideler, and Thim Frederik
Strothmann. “Self-Stabilizing Supervised Publish-Subscribe Systems.” In Proceedings
of the 32nd IEEE International Parallel & Distributed Processing Symposium
(IPDPS). IEEE, 2018. https://doi.org/10.1109/IPDPS.2018.00114.
ieee: M. Feldmann, C. Kolb, C. Scheideler, and T. F. Strothmann, “Self-Stabilizing
Supervised Publish-Subscribe Systems,” in Proceedings of the 32nd IEEE International
Parallel & Distributed Processing Symposium (IPDPS), Vancouver, 2018.
mla: Feldmann, Michael, et al. “Self-Stabilizing Supervised Publish-Subscribe Systems.”
Proceedings of the 32nd IEEE International Parallel & Distributed Processing
Symposium (IPDPS), IEEE, 2018, doi:10.1109/IPDPS.2018.00114.
short: 'M. Feldmann, C. Kolb, C. Scheideler, T.F. Strothmann, in: Proceedings of
the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS),
IEEE, 2018.'
conference:
end_date: 2018-5-24
location: Vancouver
name: 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS)
start_date: 2018-5-22
date_created: 2018-02-01T13:56:01Z
date_updated: 2022-01-06T06:51:05Z
ddc:
- '040'
department:
- _id: '79'
- _id: '66'
doi: 10.1109/IPDPS.2018.00114
external_id:
arxiv:
- '1710.08128'
file:
- access_level: closed
content_type: application/pdf
creator: mfeldma2
date_created: 2018-10-31T13:25:37Z
date_updated: 2018-10-31T13:25:37Z
file_id: '5211'
file_name: 08425258.pdf
file_size: 239559
relation: main_file
success: 1
file_date_updated: 2018-10-31T13:25:37Z
has_accepted_license: '1'
keyword:
- Topological Self-stabilization
- Supervised Overlay
- Publish-Subscribe System
language:
- iso: eng
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 32nd IEEE International Parallel & Distributed Processing
Symposium (IPDPS)
publisher: IEEE
status: public
title: Self-Stabilizing Supervised Publish-Subscribe Systems
type: conference
user_id: '11319'
year: '2018'
...
---
_id: '1164'
abstract:
- lang: eng
text: "We propose a distributed protocol for a queue, called Skueue, which spreads
its data fairly onto multiple processes, avoiding bottlenecks in high throughput
scenarios.\r\nSkueuecan be used in highly dynamic environments, through the addition
of join and leave requests to the standard queue operations enqueue and dequeue.\r\nFurthermore
Skueue satisfies sequential consistency in the asynchronous message passing model.\r\nScalability
is achieved by aggregating multiple requests to a batch, which can then be processed
in a distributed fashion without hurting the queue semantics.\r\nOperations in
Skueue need a logarithmic number of rounds w.h.p. until they are processed, even
under a high rate of incoming requests."
author:
- first_name: Michael
full_name: Feldmann, Michael
id: '23538'
last_name: Feldmann
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Alexander
full_name: Setzer, Alexander
id: '11108'
last_name: Setzer
citation:
ama: 'Feldmann M, Scheideler C, Setzer A. Skueue: A Scalable and Sequentially Consistent
Distributed Queue. In: Proceedings of the 32nd IEEE International Parallel
& Distributed Processing Symposium (IPDPS). IEEE; 2018. doi:10.1109/IPDPS.2018.00113'
apa: 'Feldmann, M., Scheideler, C., & Setzer, A. (2018). Skueue: A Scalable
and Sequentially Consistent Distributed Queue. In Proceedings of the 32nd IEEE
International Parallel & Distributed Processing Symposium (IPDPS). Vancouver:
IEEE. https://doi.org/10.1109/IPDPS.2018.00113'
bibtex: '@inproceedings{Feldmann_Scheideler_Setzer_2018, title={Skueue: A Scalable
and Sequentially Consistent Distributed Queue}, DOI={10.1109/IPDPS.2018.00113},
booktitle={Proceedings of the 32nd IEEE International Parallel & Distributed
Processing Symposium (IPDPS)}, publisher={IEEE}, author={Feldmann, Michael and
Scheideler, Christian and Setzer, Alexander}, year={2018} }'
chicago: 'Feldmann, Michael, Christian Scheideler, and Alexander Setzer. “Skueue:
A Scalable and Sequentially Consistent Distributed Queue.” In Proceedings of
the 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS).
IEEE, 2018. https://doi.org/10.1109/IPDPS.2018.00113.'
ieee: 'M. Feldmann, C. Scheideler, and A. Setzer, “Skueue: A Scalable and Sequentially
Consistent Distributed Queue,” in Proceedings of the 32nd IEEE International
Parallel & Distributed Processing Symposium (IPDPS), Vancouver, 2018.'
mla: 'Feldmann, Michael, et al. “Skueue: A Scalable and Sequentially Consistent
Distributed Queue.” Proceedings of the 32nd IEEE International Parallel &
Distributed Processing Symposium (IPDPS), IEEE, 2018, doi:10.1109/IPDPS.2018.00113.'
short: 'M. Feldmann, C. Scheideler, A. Setzer, in: Proceedings of the 32nd IEEE
International Parallel & Distributed Processing Symposium (IPDPS), IEEE, 2018.'
conference:
end_date: 2018-5-24
location: Vancouver
name: 32nd IEEE International Parallel & Distributed Processing Symposium (IPDPS)
start_date: 2018-5-22
date_created: 2018-02-01T14:00:36Z
date_updated: 2022-01-06T06:51:05Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1109/IPDPS.2018.00113
external_id:
arxiv:
- '1802.07504'
file:
- access_level: closed
content_type: application/pdf
creator: mfeldma2
date_created: 2018-10-31T13:29:26Z
date_updated: 2018-10-31T13:29:26Z
file_id: '5212'
file_name: 08425257.pdf
file_size: 218420
relation: main_file
success: 1
file_date_updated: 2018-10-31T13:29:26Z
has_accepted_license: '1'
language:
- iso: eng
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 32nd IEEE International Parallel & Distributed Processing
Symposium (IPDPS)
publisher: IEEE
status: public
title: 'Skueue: A Scalable and Sequentially Consistent Distributed Queue'
type: conference
user_id: '23538'
year: '2018'
...
---
_id: '1796'
author:
- first_name: Joshua
full_name: J. Daymude, Joshua
last_name: J. Daymude
- first_name: Zahra
full_name: Derakhshandeh, Zahra
last_name: Derakhshandeh
- first_name: Robert
full_name: Gmyr, Robert
last_name: Gmyr
- first_name: Alexandra
full_name: Porter, Alexandra
last_name: Porter
- 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: J. Daymude J, Derakhshandeh Z, Gmyr R, et al. On the runtime of universal coating
for programmable matter. Natural Computing. 2018;(1):81--96. doi:10.1007/s11047-017-9658-6
apa: J. Daymude, J., Derakhshandeh, Z., Gmyr, R., Porter, A., W. Richa, A., Scheideler,
C., & Strothmann, T. F. (2018). On the runtime of universal coating for programmable
matter. Natural Computing, (1), 81--96. https://doi.org/10.1007/s11047-017-9658-6
bibtex: '@article{J. Daymude_Derakhshandeh_Gmyr_Porter_W. Richa_Scheideler_Strothmann_2018,
title={On the runtime of universal coating for programmable matter}, DOI={10.1007/s11047-017-9658-6},
number={1}, journal={Natural Computing}, author={J. Daymude, Joshua and Derakhshandeh,
Zahra and Gmyr, Robert and Porter, Alexandra and W. Richa, Andrea and Scheideler,
Christian and Strothmann, Thim Frederik}, year={2018}, pages={81--96} }'
chicago: 'J. Daymude, Joshua, Zahra Derakhshandeh, Robert Gmyr, Alexandra Porter,
Andrea W. Richa, Christian Scheideler, and Thim Frederik Strothmann. “On the Runtime
of Universal Coating for Programmable Matter.” Natural Computing, no. 1
(2018): 81--96. https://doi.org/10.1007/s11047-017-9658-6.'
ieee: J. J. Daymude et al., “On the runtime of universal coating for programmable
matter,” Natural Computing, no. 1, pp. 81--96, 2018.
mla: J. Daymude, Joshua, et al. “On the Runtime of Universal Coating for Programmable
Matter.” Natural Computing, no. 1, 2018, pp. 81--96, doi:10.1007/s11047-017-9658-6.
short: J. J. Daymude, Z. Derakhshandeh, R. Gmyr, A. Porter, A. W. Richa, C. Scheideler,
T.F. Strothmann, Natural Computing (2018) 81--96.
date_created: 2018-03-27T06:23:58Z
date_updated: 2022-01-06T06:53:24Z
department:
- _id: '79'
- _id: '66'
doi: 10.1007/s11047-017-9658-6
issue: '1'
language:
- iso: eng
page: 81--96
publication: Natural Computing
status: public
title: On the runtime of universal coating for programmable matter
type: journal_article
user_id: '11319'
year: '2018'
...
---
_id: '18030'
author:
- first_name: N.
full_name: N., N.
last_name: N.
citation:
ama: N. N. Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen Build-List
Und Build-Multilist Mit Systemverlassenden Knoten. Universität Paderborn;
2018.
apa: N., N. (2018). Monotone Suchbarkeit bei den selbststabilisierenden Protokollen
Build-List und Build-Multilist mit systemverlassenden Knoten. Universität
Paderborn.
bibtex: '@book{N._2018, title={Monotone Suchbarkeit bei den selbststabilisierenden
Protokollen Build-List und Build-Multilist mit systemverlassenden Knoten}, publisher={Universität
Paderborn}, author={N., N.}, year={2018} }'
chicago: N., N. Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen
Build-List Und Build-Multilist Mit Systemverlassenden Knoten. Universität
Paderborn, 2018.
ieee: N. N., Monotone Suchbarkeit bei den selbststabilisierenden Protokollen
Build-List und Build-Multilist mit systemverlassenden Knoten. Universität
Paderborn, 2018.
mla: N., N. Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen Build-List
Und Build-Multilist Mit Systemverlassenden Knoten. Universität Paderborn,
2018.
short: N. N., Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen Build-List
Und Build-Multilist Mit Systemverlassenden Knoten, Universität Paderborn, 2018.
date_created: 2020-08-18T08:44:22Z
date_updated: 2022-01-06T06:53:25Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Monotone Suchbarkeit bei den selbststabilisierenden Protokollen Build-List
und Build-Multilist mit systemverlassenden Knoten
type: bachelorsthesis
user_id: '477'
year: '2018'
...
---
_id: '18031'
author:
- first_name: N.
full_name: N., N.
last_name: N.
citation:
ama: N. N. Gathering Strategien Für Mobile Roboterschwärme Im Gitternetz.;
2018.
apa: N., N. (2018). Gathering Strategien für mobile Roboterschwärme im Gitternetz.
bibtex: '@book{N._2018, title={Gathering Strategien für mobile Roboterschwärme im
Gitternetz}, author={N., N.}, year={2018} }'
chicago: N., N. Gathering Strategien Für Mobile Roboterschwärme Im Gitternetz,
2018.
ieee: N. N., Gathering Strategien für mobile Roboterschwärme im Gitternetz.
2018.
mla: N., N. Gathering Strategien Für Mobile Roboterschwärme Im Gitternetz.
2018.
short: N. N., Gathering Strategien Für Mobile Roboterschwärme Im Gitternetz, 2018.
date_created: 2020-08-18T08:45:09Z
date_updated: 2022-01-06T06:53:25Z
department:
- _id: '79'
language:
- iso: eng
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Gathering Strategien für mobile Roboterschwärme im Gitternetz
type: bachelorsthesis
user_id: '15504'
year: '2018'
...