---
_id: '26888'
author:
- first_name: Thorsten
full_name: Götte, Thorsten
id: '34727'
last_name: Götte
- 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: Julian
full_name: Werthmann, Julian
id: '50024'
last_name: Werthmann
citation:
ama: 'Götte T, Kolb C, Scheideler C, Werthmann J. Beep-And-Sleep: Message and Energy
Efficient Set Cover. In: Algorithms for Sensor Systems (ALGOSENSORS ’21).
; 2021. doi:10.1007/978-3-030-89240-1_7'
apa: 'Götte, T., Kolb, C., Scheideler, C., & Werthmann, J. (2021). Beep-And-Sleep:
Message and Energy Efficient Set Cover. In Algorithms for Sensor Systems (ALGOSENSORS
’21). ALGOSENSORS 2021, Lisbon, Portgual. https://doi.org/10.1007/978-3-030-89240-1_7'
bibtex: '@inbook{Götte_Kolb_Scheideler_Werthmann_2021, place={Cham}, title={Beep-And-Sleep:
Message and Energy Efficient Set Cover}, DOI={10.1007/978-3-030-89240-1_7},
booktitle={Algorithms for Sensor Systems (ALGOSENSORS ’21)}, author={Götte, Thorsten
and Kolb, Christina and Scheideler, Christian and Werthmann, Julian}, year={2021}
}'
chicago: 'Götte, Thorsten, Christina Kolb, Christian Scheideler, and Julian Werthmann.
“Beep-And-Sleep: Message and Energy Efficient Set Cover.” In Algorithms for
Sensor Systems (ALGOSENSORS ’21). Cham, 2021. https://doi.org/10.1007/978-3-030-89240-1_7.'
ieee: 'T. Götte, C. Kolb, C. Scheideler, and J. Werthmann, “Beep-And-Sleep: Message
and Energy Efficient Set Cover,” in Algorithms for Sensor Systems (ALGOSENSORS
’21), Cham, 2021.'
mla: 'Götte, Thorsten, et al. “Beep-And-Sleep: Message and Energy Efficient Set
Cover.” Algorithms for Sensor Systems (ALGOSENSORS ’21), 2021, doi:10.1007/978-3-030-89240-1_7.'
short: 'T. Götte, C. Kolb, C. Scheideler, J. Werthmann, in: Algorithms for Sensor
Systems (ALGOSENSORS ’21), Cham, 2021.'
conference:
location: Lisbon, Portgual
name: ALGOSENSORS 2021
date_created: 2021-10-26T12:06:04Z
date_updated: 2022-11-18T10:01:36Z
doi: 10.1007/978-3-030-89240-1_7
language:
- iso: eng
place: Cham
project:
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
- _id: '1'
name: 'SFB 901: SFB 901'
publication: Algorithms for Sensor Systems (ALGOSENSORS '21)
publication_identifier:
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: 'Beep-And-Sleep: Message and Energy Efficient Set Cover'
type: book_chapter
user_id: '477'
year: '2021'
...
---
_id: '27051'
author:
- first_name: John
full_name: Augustine, John
last_name: Augustine
- first_name: Kristian
full_name: Hinnenthal, Kristian
id: '32229'
last_name: Hinnenthal
- first_name: Fabian
full_name: Kuhn, Fabian
last_name: Kuhn
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Philipp
full_name: Schneider, Philipp
last_name: Schneider
citation:
ama: 'Augustine J, Hinnenthal K, Kuhn F, Scheideler C, Schneider P. Shortest Paths
in a Hybrid Network Model. In: Chawla S, ed. Proceedings of the 2020 ACM-SIAM
Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, January
5-8, 2020. SIAM; 2020:1280-1299. doi:10.1137/1.9781611975994.78'
apa: Augustine, J., Hinnenthal, K., Kuhn, F., Scheideler, C., & Schneider, P.
(2020). Shortest Paths in a Hybrid Network Model. In S. Chawla (Ed.), Proceedings
of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City,
UT, USA, January 5-8, 2020 (pp. 1280–1299). SIAM. https://doi.org/10.1137/1.9781611975994.78
bibtex: '@inproceedings{Augustine_Hinnenthal_Kuhn_Scheideler_Schneider_2020, title={Shortest
Paths in a Hybrid Network Model}, DOI={10.1137/1.9781611975994.78},
booktitle={Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms,
SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020}, publisher={SIAM}, author={Augustine,
John and Hinnenthal, Kristian and Kuhn, Fabian and Scheideler, Christian and Schneider,
Philipp}, editor={Chawla, Shuchi}, year={2020}, pages={1280–1299} }'
chicago: Augustine, John, Kristian Hinnenthal, Fabian Kuhn, Christian Scheideler,
and Philipp Schneider. “Shortest Paths in a Hybrid Network Model.” In Proceedings
of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City,
UT, USA, January 5-8, 2020, edited by Shuchi Chawla, 1280–99. SIAM, 2020.
https://doi.org/10.1137/1.9781611975994.78.
ieee: 'J. Augustine, K. Hinnenthal, F. Kuhn, C. Scheideler, and P. Schneider, “Shortest
Paths in a Hybrid Network Model,” in Proceedings of the 2020 ACM-SIAM Symposium
on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020,
2020, pp. 1280–1299, doi: 10.1137/1.9781611975994.78.'
mla: Augustine, John, et al. “Shortest Paths in a Hybrid Network Model.” Proceedings
of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City,
UT, USA, January 5-8, 2020, edited by Shuchi Chawla, SIAM, 2020, pp. 1280–99,
doi:10.1137/1.9781611975994.78.
short: 'J. Augustine, K. Hinnenthal, F. Kuhn, C. Scheideler, P. Schneider, in: S.
Chawla (Ed.), Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms,
SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020, SIAM, 2020, pp. 1280–1299.'
date_created: 2021-11-02T10:01:42Z
date_updated: 2022-01-06T06:57:33Z
doi: 10.1137/1.9781611975994.78
editor:
- first_name: Shuchi
full_name: Chawla, Shuchi
last_name: Chawla
language:
- iso: eng
page: 1280-1299
publication: Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA
2020, Salt Lake City, UT, USA, January 5-8, 2020
publisher: SIAM
status: public
title: Shortest Paths in a Hybrid Network Model
type: conference
user_id: '15504'
year: '2020'
...
---
_id: '17808'
author:
- first_name: Robert
full_name: Gmyr, Robert
last_name: Gmyr
- first_name: Kristian
full_name: Hinnenthal, Kristian
id: '32229'
last_name: Hinnenthal
- first_name: Irina
full_name: Kostitsyna, Irina
last_name: Kostitsyna
- first_name: Fabian
full_name: Kuhn, Fabian
last_name: Kuhn
- first_name: Dorian
full_name: Rudolph, Dorian
last_name: Rudolph
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Thim
full_name: Strothmann, Thim
last_name: Strothmann
citation:
ama: Gmyr R, Hinnenthal K, Kostitsyna I, et al. Forming tile shapes with simple
robots. Nat Comput. 2020;19(2):375-390. doi:10.1007/s11047-019-09774-2
apa: Gmyr, R., Hinnenthal, K., Kostitsyna, I., Kuhn, F., Rudolph, D., Scheideler,
C., & Strothmann, T. (2020). Forming tile shapes with simple robots. Nat.
Comput., 19(2), 375–390. https://doi.org/10.1007/s11047-019-09774-2
bibtex: '@article{Gmyr_Hinnenthal_Kostitsyna_Kuhn_Rudolph_Scheideler_Strothmann_2020,
title={Forming tile shapes with simple robots}, volume={19}, DOI={10.1007/s11047-019-09774-2},
number={2}, journal={Nat. Comput.}, author={Gmyr, Robert and Hinnenthal, Kristian
and Kostitsyna, Irina and Kuhn, Fabian and Rudolph, Dorian and Scheideler, Christian
and Strothmann, Thim}, year={2020}, pages={375–390} }'
chicago: 'Gmyr, Robert, Kristian Hinnenthal, Irina Kostitsyna, Fabian Kuhn, Dorian
Rudolph, Christian Scheideler, and Thim Strothmann. “Forming Tile Shapes with
Simple Robots.” Nat. Comput. 19, no. 2 (2020): 375–90. https://doi.org/10.1007/s11047-019-09774-2.'
ieee: R. Gmyr et al., “Forming tile shapes with simple robots,” Nat. Comput.,
vol. 19, no. 2, pp. 375–390, 2020.
mla: Gmyr, Robert, et al. “Forming Tile Shapes with Simple Robots.” Nat. Comput.,
vol. 19, no. 2, 2020, pp. 375–90, doi:10.1007/s11047-019-09774-2.
short: R. Gmyr, K. Hinnenthal, I. Kostitsyna, F. Kuhn, D. Rudolph, C. Scheideler,
T. Strothmann, Nat. Comput. 19 (2020) 375–390.
date_created: 2020-08-11T10:57:26Z
date_updated: 2022-01-06T06:53:20Z
doi: 10.1007/s11047-019-09774-2
intvolume: ' 19'
issue: '2'
language:
- iso: eng
page: 375-390
publication: Nat. Comput.
status: public
title: Forming tile shapes with simple robots
type: journal_article
user_id: '15504'
volume: 19
year: '2020'
...
---
_id: '20755'
abstract:
- lang: eng
text: "We consider the problem of computing shortest paths in \\emph{hybrid networks},
in which nodes can make use of different communication modes. For example, mobile
phones may use ad-hoc connections via Bluetooth or Wi-Fi in addition to the cellular
network to solve tasks more efficiently. Like in this case, the different communication
modes may differ considerably in range, bandwidth, and flexibility. We build upon
the model of Augustine et al. [SODA '20], which captures these differences by
a \\emph{local} and a \\emph{global} mode. Specifically, the local edges model
a fixed communication network in which $O(1)$ messages of size $O(\\log n)$ can
be sent over every edge in each synchronous round. The global edges form a clique,
but nodes are only allowed to send and receive a total of at most $O(\\log n)$
messages over global edges, which restricts the nodes to use these edges only
very sparsely.\r\n\r\nWe demonstrate the power of hybrid networks by presenting
algorithms to compute Single-Source Shortest Paths and the diameter very efficiently
in \\emph{sparse graphs}. Specifically, we present exact $O(\\log n)$ time algorithms
for cactus graphs (i.e., graphs in which each edge is contained in at most one
cycle), and $3$-approximations for graphs that have at most $n + O(n^{1/3})$ edges
and arboricity $O(\\log n)$. For these graph classes, our algorithms provide exponentially
faster solutions than the best known algorithms for general graphs in this model.\r\nBeyond
shortest paths, we also provide a variety of useful tools and techniques for hybrid
networks, which may be of independent interest.\r\n"
author:
- first_name: Michael
full_name: Feldmann, Michael
id: '23538'
last_name: Feldmann
- first_name: Kristian
full_name: Hinnenthal, Kristian
id: '32229'
last_name: Hinnenthal
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Feldmann M, Hinnenthal K, Scheideler C. Fast Hybrid Network Algorithms for
Shortest Paths in Sparse Graphs. In: Proceedings of the 24th International
Conference on Principles of Distributed Systems (OPODIS). Schloss Dagstuhl
- Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.OPODIS.2020.31'
apa: Feldmann, M., Hinnenthal, K., & Scheideler, C. (2020). Fast Hybrid Network
Algorithms for Shortest Paths in Sparse Graphs. In Proceedings of the 24th
International Conference on Principles of Distributed Systems (OPODIS). Schloss
Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.OPODIS.2020.31
bibtex: '@inproceedings{Feldmann_Hinnenthal_Scheideler_2020, title={Fast Hybrid
Network Algorithms for Shortest Paths in Sparse Graphs}, DOI={10.4230/LIPIcs.OPODIS.2020.31},
booktitle={Proceedings of the 24th International Conference on Principles of Distributed
Systems (OPODIS)}, publisher={Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
author={Feldmann, Michael and Hinnenthal, Kristian and Scheideler, Christian},
year={2020} }'
chicago: Feldmann, Michael, Kristian Hinnenthal, and Christian Scheideler. “Fast
Hybrid Network Algorithms for Shortest Paths in Sparse Graphs.” In Proceedings
of the 24th International Conference on Principles of Distributed Systems (OPODIS).
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.OPODIS.2020.31.
ieee: M. Feldmann, K. Hinnenthal, and C. Scheideler, “Fast Hybrid Network Algorithms
for Shortest Paths in Sparse Graphs,” in Proceedings of the 24th International
Conference on Principles of Distributed Systems (OPODIS), 2020.
mla: Feldmann, Michael, et al. “Fast Hybrid Network Algorithms for Shortest Paths
in Sparse Graphs.” Proceedings of the 24th International Conference on Principles
of Distributed Systems (OPODIS), Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2020, doi:10.4230/LIPIcs.OPODIS.2020.31.
short: 'M. Feldmann, K. Hinnenthal, C. Scheideler, in: Proceedings of the 24th International
Conference on Principles of Distributed Systems (OPODIS), Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2020.'
date_created: 2020-12-16T10:20:18Z
date_updated: 2022-01-06T06:54:36Z
ddc:
- '000'
department:
- _id: '79'
doi: 10.4230/LIPIcs.OPODIS.2020.31
external_id:
arxiv:
- '2007.01191'
file:
- access_level: closed
content_type: application/pdf
creator: mfeldma2
date_created: 2020-12-16T10:18:50Z
date_updated: 2020-12-16T10:18:50Z
file_id: '20756'
file_name: Fast_Hybrid_Network_Algorithms_for_Shortest_Paths_in_Sparse_Graphs.pdf
file_size: 867373
relation: main_file
success: 1
file_date_updated: 2020-12-16T10:18:50Z
has_accepted_license: '1'
language:
- iso: eng
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 24th International Conference on Principles of Distributed
Systems (OPODIS)
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
status: public
title: Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs
type: conference
user_id: '23538'
year: '2020'
...
---
_id: '16902'
abstract:
- lang: eng
text: "The maintenance of efficient and robust overlay networks is one\r\nof the
most fundamental and reoccurring themes in networking.\r\nThis paper presents
a survey of state-of-the-art \r\nalgorithms to design and repair overlay networks
in a distributed\r\nmanner. In particular, we discuss basic algorithmic primitives\r\nto
preserve connectivity, review algorithms for the fundamental\r\nproblem of graph
linearization, and then survey self-stabilizing\r\nalgorithms for metric and scalable
topologies. \r\nWe also identify open problems and avenues for future research.\r\n"
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: Stefan
full_name: Schmid, Stefan
last_name: Schmid
citation:
ama: Feldmann M, Scheideler C, Schmid S. Survey on Algorithms for Self-Stabilizing
Overlay Networks. ACM Computing Surveys. 2020. doi:10.1145/3397190
apa: Feldmann, M., Scheideler, C., & Schmid, S. (2020). Survey on Algorithms
for Self-Stabilizing Overlay Networks. ACM Computing Surveys. https://doi.org/10.1145/3397190
bibtex: '@article{Feldmann_Scheideler_Schmid_2020, title={Survey on Algorithms for
Self-Stabilizing Overlay Networks}, DOI={10.1145/3397190},
journal={ACM Computing Surveys}, publisher={ACM}, author={Feldmann, Michael and
Scheideler, Christian and Schmid, Stefan}, year={2020} }'
chicago: Feldmann, Michael, Christian Scheideler, and Stefan Schmid. “Survey on
Algorithms for Self-Stabilizing Overlay Networks.” ACM Computing Surveys,
2020. https://doi.org/10.1145/3397190.
ieee: M. Feldmann, C. Scheideler, and S. Schmid, “Survey on Algorithms for Self-Stabilizing
Overlay Networks,” ACM Computing Surveys, 2020.
mla: Feldmann, Michael, et al. “Survey on Algorithms for Self-Stabilizing Overlay
Networks.” ACM Computing Surveys, ACM, 2020, doi:10.1145/3397190.
short: M. Feldmann, C. Scheideler, S. Schmid, ACM Computing Surveys (2020).
date_created: 2020-04-29T07:09:50Z
date_updated: 2022-01-06T06:52:58Z
department:
- _id: '79'
doi: 10.1145/3397190
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: ACM Computing Surveys
publisher: ACM
status: public
title: Survey on Algorithms for Self-Stabilizing Overlay Networks
type: journal_article
user_id: '23538'
year: '2020'
...
---
_id: '16903'
abstract:
- lang: eng
text: "We consider the clock synchronization problem in the (discrete) beeping model:
Given a network of $n$ nodes with each node having a clock value $\\delta(v) \\in
\\{0,\\ldots T-1\\}$, the goal is to synchronize the clock values of all nodes
such that they have the same value in any round.\r\nAs is standard in clock synchronization,
we assume \\emph{arbitrary activations} for all nodes, i.e., the nodes start their
protocol at an arbitrary round (not limited to $\\{0,\\ldots,T-1\\}$).\r\nWe give
an asymptotically optimal algorithm that runs in $4D + \\Bigl\\lfloor \\frac{D}{\\lfloor
T/4 \\rfloor} \\Bigr \\rfloor \\cdot (T \\mod 4) = O(D)$ rounds, where $D$ is
the diameter of the network.\r\nOnce all nodes are in sync, they beep at the same
round every $T$ rounds.\r\nThe algorithm drastically improves on the $O(T D)$-bound
of \\cite{firefly_sync} (where $T$ is required to be at least $4n$, so the bound
is no better than $O(nD)$).\r\nOur algorithm is very simple as nodes only have
to maintain $3$ bits in addition to the $\\lceil \\log T \\rceil$ bits needed
to maintain the clock.\r\nFurthermore we investigate the complexity of \\emph{self-stabilizing}
solutions for the clock synchronization problem: We first show lower bounds of
$\\Omega(\\max\\{T,n\\})$ rounds on the runtime and $\\Omega(\\log(\\max\\{T,n\\}))$
bits of memory required for any such protocol.\r\nAfterwards we present a protocol
that runs in $O(\\max\\{T,n\\})$ rounds using at most $O(\\log(\\max\\{T,n\\}))$
bits at each node, which is asymptotically optimal with regards to both, runtime
and memory requirements."
author:
- first_name: Michael
full_name: Feldmann, Michael
id: '23538'
last_name: Feldmann
- first_name: Ardalan
full_name: Khazraei, Ardalan
last_name: Khazraei
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Feldmann M, Khazraei A, Scheideler C. Time- and Space-Optimal Discrete Clock
Synchronization in the Beeping Model. In: Proceedings of the 32nd ACM Symposium
on Parallelism in Algorithms and Architectures (SPAA). ACM; 2020. doi:10.1145/3350755.3400246'
apa: Feldmann, M., Khazraei, A., & Scheideler, C. (2020). Time- and Space-Optimal
Discrete Clock Synchronization in the Beeping Model. In Proceedings of the
32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA).
ACM. https://doi.org/10.1145/3350755.3400246
bibtex: '@inproceedings{Feldmann_Khazraei_Scheideler_2020, title={Time- and Space-Optimal
Discrete Clock Synchronization in the Beeping Model}, DOI={10.1145/3350755.3400246},
booktitle={Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms
and Architectures (SPAA)}, publisher={ACM}, author={Feldmann, Michael and Khazraei,
Ardalan and Scheideler, Christian}, year={2020} }'
chicago: Feldmann, Michael, Ardalan Khazraei, and Christian Scheideler. “Time- and
Space-Optimal Discrete Clock Synchronization in the Beeping Model.” In Proceedings
of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA).
ACM, 2020. https://doi.org/10.1145/3350755.3400246.
ieee: M. Feldmann, A. Khazraei, and C. Scheideler, “Time- and Space-Optimal Discrete
Clock Synchronization in the Beeping Model,” in Proceedings of the 32nd ACM
Symposium on Parallelism in Algorithms and Architectures (SPAA), 2020.
mla: Feldmann, Michael, et al. “Time- and Space-Optimal Discrete Clock Synchronization
in the Beeping Model.” Proceedings of the 32nd ACM Symposium on Parallelism
in Algorithms and Architectures (SPAA), ACM, 2020, doi:10.1145/3350755.3400246.
short: 'M. Feldmann, A. Khazraei, C. Scheideler, in: Proceedings of the 32nd ACM
Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM, 2020.'
date_created: 2020-04-29T07:16:35Z
date_updated: 2022-01-06T06:52:58Z
department:
- _id: '79'
doi: 10.1145/3350755.3400246
external_id:
arxiv:
- '2005.07388'
language:
- iso: eng
project:
- _id: '96'
name: Algorithmen für programmierbare Materie in einem physiologischen Medium
publication: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and
Architectures (SPAA)
publisher: ACM
status: public
title: Time- and Space-Optimal Discrete Clock Synchronization in the Beeping Model
type: conference
user_id: '23538'
year: '2020'
...
---
_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: '16346'
author:
- first_name: Joshua J.
full_name: Daymude, Joshua J.
last_name: Daymude
- first_name: Robert
full_name: Gmyr, Robert
last_name: Gmyr
- first_name: Kristian
full_name: Hinnenthal, Kristian
id: '32229'
last_name: Hinnenthal
- first_name: Irina
full_name: Kostitsyna, Irina
last_name: Kostitsyna
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Andréa W.
full_name: Richa, Andréa W.
last_name: Richa
citation:
ama: 'Daymude JJ, Gmyr R, Hinnenthal K, Kostitsyna I, Scheideler C, Richa AW. Convex
Hull Formation for Programmable Matter. In: Proceedings of the 21st International
Conference on Distributed Computing and Networking. ; 2020. doi:10.1145/3369740.3372916'
apa: Daymude, J. J., Gmyr, R., Hinnenthal, K., Kostitsyna, I., Scheideler, C., &
Richa, A. W. (2020). Convex Hull Formation for Programmable Matter. In Proceedings
of the 21st International Conference on Distributed Computing and Networking.
https://doi.org/10.1145/3369740.3372916
bibtex: '@inproceedings{Daymude_Gmyr_Hinnenthal_Kostitsyna_Scheideler_Richa_2020,
title={Convex Hull Formation for Programmable Matter}, DOI={10.1145/3369740.3372916},
booktitle={Proceedings of the 21st International Conference on Distributed Computing
and Networking}, author={Daymude, Joshua J. and Gmyr, Robert and Hinnenthal, Kristian
and Kostitsyna, Irina and Scheideler, Christian and Richa, Andréa W.}, year={2020}
}'
chicago: Daymude, Joshua J., Robert Gmyr, Kristian Hinnenthal, Irina Kostitsyna,
Christian Scheideler, and Andréa W. Richa. “Convex Hull Formation for Programmable
Matter.” In Proceedings of the 21st International Conference on Distributed
Computing and Networking, 2020. https://doi.org/10.1145/3369740.3372916.
ieee: J. J. Daymude, R. Gmyr, K. Hinnenthal, I. Kostitsyna, C. Scheideler, and A.
W. Richa, “Convex Hull Formation for Programmable Matter,” in Proceedings of
the 21st International Conference on Distributed Computing and Networking,
2020.
mla: Daymude, Joshua J., et al. “Convex Hull Formation for Programmable Matter.”
Proceedings of the 21st International Conference on Distributed Computing and
Networking, 2020, doi:10.1145/3369740.3372916.
short: 'J.J. Daymude, R. Gmyr, K. Hinnenthal, I. Kostitsyna, C. Scheideler, A.W.
Richa, in: Proceedings of the 21st International Conference on Distributed Computing
and Networking, 2020.'
date_created: 2020-03-26T07:33:41Z
date_updated: 2022-01-06T06:52:49Z
doi: 10.1145/3369740.3372916
language:
- iso: eng
publication: Proceedings of the 21st International Conference on Distributed Computing
and Networking
publication_identifier:
isbn:
- '9781450377515'
publication_status: published
status: public
title: Convex Hull Formation for Programmable Matter
type: conference
user_id: '32229'
year: '2020'
...
---
_id: '7636'
abstract:
- lang: eng
text: "Self-stabilizing overlay networks have the advantage of being able to recover
from illegal states and faults. \r\nHowever, the majority of these networks cannot
give any guarantees on their functionality while the recovery process is going
on. \r\nWe are especially interested in searchability, i.e., the functionality
that search messages for a specific node are answered successfully if a node exists
in the network. \r\nIn this paper we investigate overlay networks that ensure
the maintenance of monotonic searchability while the self-stabilization is going
on. \r\nMore precisely, once a search message from node u to another node v is
successfully delivered, all future search messages from u to v succeed as well.\r\nWe
extend the existing research by focusing on skip graphs and present a solution
for two scenarios: (i) the goal topology is a super graph of the perfect skip
graph and (ii) the goal topology is exactly the perfect skip graph.\r\n"
author:
- first_name: Linghui
full_name: Luo, Linghui
last_name: Luo
- 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: 'Luo L, Scheideler C, Strothmann TF. MultiSkipGraph: A Self-stabilizing Overlay
Network that Maintains Monotonic Searchability. In: Proceedings of the 2019
IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS ’19).
; 2019.'
apa: 'Luo, L., Scheideler, C., & Strothmann, T. F. (2019). MultiSkipGraph: A
Self-stabilizing Overlay Network that Maintains Monotonic Searchability. In Proceedings
of the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium
(IPDPS ’19). Rio de Janeiro, Brazil.'
bibtex: '@inproceedings{Luo_Scheideler_Strothmann_2019, title={MultiSkipGraph: A
Self-stabilizing Overlay Network that Maintains Monotonic Searchability}, booktitle={Proceedings
of the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium
(IPDPS ’19)}, author={Luo, Linghui and Scheideler, Christian and Strothmann, Thim
Frederik}, year={2019} }'
chicago: 'Luo, Linghui, Christian Scheideler, and Thim Frederik Strothmann. “MultiSkipGraph:
A Self-Stabilizing Overlay Network That Maintains Monotonic Searchability.” In
Proceedings of the 2019 IEEE 33rd International Parallel and Distributed Processing
Symposium (IPDPS ’19), 2019.'
ieee: 'L. Luo, C. Scheideler, and T. F. Strothmann, “MultiSkipGraph: A Self-stabilizing
Overlay Network that Maintains Monotonic Searchability,” in Proceedings of
the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium
(IPDPS ’19), Rio de Janeiro, Brazil, 2019.'
mla: 'Luo, Linghui, et al. “MultiSkipGraph: A Self-Stabilizing Overlay Network That
Maintains Monotonic Searchability.” Proceedings of the 2019 IEEE 33rd International
Parallel and Distributed Processing Symposium (IPDPS ’19), 2019.'
short: 'L. Luo, C. Scheideler, T.F. Strothmann, in: Proceedings of the 2019 IEEE
33rd International Parallel and Distributed Processing Symposium (IPDPS ’19),
2019.'
conference:
end_date: 2019-05-25
location: Rio de Janeiro, Brazil
name: 2019 IEEE 33rd International Parallel and Distributed Processing Symposium
(IPDPS '19)
start_date: 2019-05-20
date_created: 2019-02-12T13:39:20Z
date_updated: 2022-01-06T07:03:42Z
ddc:
- '006'
department:
- _id: '66'
file:
- access_level: closed
content_type: application/pdf
creator: thim
date_created: 2019-02-12T13:37:35Z
date_updated: 2019-02-12T13:37:35Z
file_id: '7637'
file_name: IPDPS_main.pdf
file_size: 372026
relation: main_file
file_date_updated: 2019-02-12T13:37:35Z
has_accepted_license: '1'
language:
- iso: eng
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 2019 IEEE 33rd International Parallel and Distributed
Processing Symposium (IPDPS '19)
status: public
title: 'MultiSkipGraph: A Self-stabilizing Overlay Network that Maintains Monotonic
Searchability'
type: conference
user_id: '477'
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'
...