---
_id: '59268'
author:
- first_name: Jinfeng
full_name: Dou, Jinfeng
id: '92888'
last_name: Dou
- first_name: Thorsten
full_name: Götte, Thorsten
id: '34727'
last_name: Götte
- first_name: Henning
full_name: Hillebrandt, Henning
id: '74425'
last_name: Hillebrandt
- 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: 'Dou J, Götte T, Hillebrandt H, Scheideler C, Werthmann J. Distributed and
Parallel Low-Diameter Decompositions for Arbitrary and Restricted Graphs. In:
Meka R, ed. 16th Innovations in Theoretical Computer Science Conference (ITCS
2025). Vol 325. Leibniz International Proceedings in Informatics (LIPIcs).
Schloss Dagstuhl – Leibniz-Zentrum für Informatik; 2025:45:1–45:26. doi:10.4230/LIPIcs.ITCS.2025.45'
apa: Dou, J., Götte, T., Hillebrandt, H., Scheideler, C., & Werthmann, J. (2025).
Distributed and Parallel Low-Diameter Decompositions for Arbitrary and Restricted
Graphs. In R. Meka (Ed.), 16th Innovations in Theoretical Computer Science
Conference (ITCS 2025) (Vol. 325, p. 45:1–45:26). Schloss Dagstuhl – Leibniz-Zentrum
für Informatik. https://doi.org/10.4230/LIPIcs.ITCS.2025.45
bibtex: '@inproceedings{Dou_Götte_Hillebrandt_Scheideler_Werthmann_2025, place={Dagstuhl,
Germany}, series={Leibniz International Proceedings in Informatics (LIPIcs)},
title={Distributed and Parallel Low-Diameter Decompositions for Arbitrary and
Restricted Graphs}, volume={325}, DOI={10.4230/LIPIcs.ITCS.2025.45},
booktitle={16th Innovations in Theoretical Computer Science Conference (ITCS 2025)},
publisher={Schloss Dagstuhl – Leibniz-Zentrum für Informatik}, author={Dou, Jinfeng
and Götte, Thorsten and Hillebrandt, Henning and Scheideler, Christian and Werthmann,
Julian}, editor={Meka, Raghu}, year={2025}, pages={45:1–45:26}, collection={Leibniz
International Proceedings in Informatics (LIPIcs)} }'
chicago: 'Dou, Jinfeng, Thorsten Götte, Henning Hillebrandt, Christian Scheideler,
and Julian Werthmann. “Distributed and Parallel Low-Diameter Decompositions for
Arbitrary and Restricted Graphs.” In 16th Innovations in Theoretical Computer
Science Conference (ITCS 2025), edited by Raghu Meka, 325:45:1–45:26. Leibniz
International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss
Dagstuhl – Leibniz-Zentrum für Informatik, 2025. https://doi.org/10.4230/LIPIcs.ITCS.2025.45.'
ieee: 'J. Dou, T. Götte, H. Hillebrandt, C. Scheideler, and J. Werthmann, “Distributed
and Parallel Low-Diameter Decompositions for Arbitrary and Restricted Graphs,”
in 16th Innovations in Theoretical Computer Science Conference (ITCS 2025),
2025, vol. 325, p. 45:1–45:26, doi: 10.4230/LIPIcs.ITCS.2025.45.'
mla: Dou, Jinfeng, et al. “Distributed and Parallel Low-Diameter Decompositions
for Arbitrary and Restricted Graphs.” 16th Innovations in Theoretical Computer
Science Conference (ITCS 2025), edited by Raghu Meka, vol. 325, Schloss Dagstuhl
– Leibniz-Zentrum für Informatik, 2025, p. 45:1–45:26, doi:10.4230/LIPIcs.ITCS.2025.45.
short: 'J. Dou, T. Götte, H. Hillebrandt, C. Scheideler, J. Werthmann, in: R. Meka
(Ed.), 16th Innovations in Theoretical Computer Science Conference (ITCS 2025),
Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2025, p.
45:1–45:26.'
date_created: 2025-04-02T14:09:19Z
date_updated: 2025-10-15T12:57:11Z
doi: 10.4230/LIPIcs.ITCS.2025.45
editor:
- first_name: Raghu
full_name: Meka, Raghu
last_name: Meka
intvolume: ' 325'
language:
- iso: eng
page: 45:1–45:26
place: Dagstuhl, Germany
publication: 16th Innovations in Theoretical Computer Science Conference (ITCS 2025)
publication_identifier:
isbn:
- 978-3-95977-361-4
issn:
- 1868-8969
publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
series_title: Leibniz International Proceedings in Informatics (LIPIcs)
status: public
title: Distributed and Parallel Low-Diameter Decompositions for Arbitrary and Restricted
Graphs
type: conference
user_id: '34727'
volume: 325
year: '2025'
...
---
_id: '43109'
author:
- first_name: Thorsten
full_name: Götte, Thorsten
id: '34727'
last_name: Götte
- first_name: Christina
full_name: Kolb, Christina
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. Theor Comput Sci. 2023;950:113756. doi:10.1016/j.tcs.2023.113756'
apa: 'Götte, T., Kolb, C., Scheideler, C., & Werthmann, J. (2023). Beep-and-Sleep:
Message and Energy Efficient Set Cover. Theor. Comput. Sci., 950,
113756. https://doi.org/10.1016/j.tcs.2023.113756'
bibtex: '@article{Götte_Kolb_Scheideler_Werthmann_2023, title={Beep-and-Sleep: Message
and Energy Efficient Set Cover}, volume={950}, DOI={10.1016/j.tcs.2023.113756},
journal={Theor. Comput. Sci.}, author={Götte, Thorsten and Kolb, Christina and
Scheideler, Christian and Werthmann, Julian}, year={2023}, pages={113756} }'
chicago: 'Götte, Thorsten, Christina Kolb, Christian Scheideler, and Julian Werthmann.
“Beep-and-Sleep: Message and Energy Efficient Set Cover.” Theor. Comput. Sci.
950 (2023): 113756. https://doi.org/10.1016/j.tcs.2023.113756.'
ieee: 'T. Götte, C. Kolb, C. Scheideler, and J. Werthmann, “Beep-and-Sleep: Message
and Energy Efficient Set Cover,” Theor. Comput. Sci., vol. 950, p. 113756,
2023, doi: 10.1016/j.tcs.2023.113756.'
mla: 'Götte, Thorsten, et al. “Beep-and-Sleep: Message and Energy Efficient Set
Cover.” Theor. Comput. Sci., vol. 950, 2023, p. 113756, doi:10.1016/j.tcs.2023.113756.'
short: T. Götte, C. Kolb, C. Scheideler, J. Werthmann, Theor. Comput. Sci. 950 (2023)
113756.
date_created: 2023-03-27T07:45:44Z
date_updated: 2023-03-27T09:55:04Z
department:
- _id: '79'
doi: 10.1016/j.tcs.2023.113756
intvolume: ' 950'
language:
- iso: eng
page: '113756'
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '2'
name: 'SFB 901 - A: SFB 901 - Project Area A'
- _id: '5'
name: 'SFB 901 - A1: SFB 901 - Subproject A1'
publication: Theor. Comput. Sci.
status: public
title: 'Beep-and-Sleep: Message and Energy Efficient Set Cover'
type: journal_article
user_id: '15504'
volume: 950
year: '2023'
...
---
_id: '45192'
author:
- first_name: Thorsten
full_name: Götte, Thorsten
id: '34727'
last_name: Götte
- 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: Julian
full_name: Werthmann, Julian
id: '50024'
last_name: Werthmann
citation:
ama: Götte T, Hinnenthal K, Scheideler C, Werthmann J. Time-Optimal Construction
of Overlays. Distributed Computing. Published online 2023. doi:https://doi.org/10.1007/s00446-023-00442-4
apa: Götte, T., Hinnenthal, K., Scheideler, C., & Werthmann, J. (2023). Time-Optimal
Construction of Overlays. Distributed Computing. https://doi.org/10.1007/s00446-023-00442-4
bibtex: '@article{Götte_Hinnenthal_Scheideler_Werthmann_2023, title={Time-Optimal
Construction of Overlays}, DOI={https://doi.org/10.1007/s00446-023-00442-4},
journal={Distributed Computing}, author={Götte, Thorsten and Hinnenthal, Kristian
and Scheideler, Christian and Werthmann, Julian}, year={2023} }'
chicago: Götte, Thorsten, Kristian Hinnenthal, Christian Scheideler, and Julian
Werthmann. “Time-Optimal Construction of Overlays.” Distributed Computing,
2023. https://doi.org/10.1007/s00446-023-00442-4.
ieee: 'T. Götte, K. Hinnenthal, C. Scheideler, and J. Werthmann, “Time-Optimal Construction
of Overlays,” Distributed Computing, 2023, doi: https://doi.org/10.1007/s00446-023-00442-4.'
mla: Götte, Thorsten, et al. “Time-Optimal Construction of Overlays.” Distributed
Computing, 2023, doi:https://doi.org/10.1007/s00446-023-00442-4.
short: T. Götte, K. Hinnenthal, C. Scheideler, J. Werthmann, Distributed Computing
(2023).
date_created: 2023-05-22T14:34:34Z
date_updated: 2023-05-23T12:38:57Z
doi: https://doi.org/10.1007/s00446-023-00442-4
language:
- iso: eng
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '2'
name: 'SFB 901 - A: SFB 901 - Project Area A'
- _id: '4'
name: 'SFB 901 - C: SFB 901 - Project Area C'
- _id: '13'
name: 'SFB 901 - C1: SFB 901 - Subproject C1'
- _id: '5'
name: 'SFB 901 - A1: SFB 901 - Subproject A1'
publication: Distributed Computing
status: public
title: Time-Optimal Construction of Overlays
type: journal_article
user_id: '477'
year: '2023'
...
---
_id: '45875'
author:
- first_name: Thorsten
full_name: Götte, Thorsten
id: '34727'
last_name: Götte
- first_name: Till
full_name: Knollmann, Till
id: '39241'
last_name: Knollmann
orcid: 0000-0003-2014-4696
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Julian
full_name: Werthmann, Julian
id: '50024'
last_name: Werthmann
citation:
ama: 'Götte T, Knollmann T, Meyer auf der Heide F, Scheideler C, Werthmann J. Capabilities
and Limitations of Local Strategies in Dynamic Networks. In: Haake C-J, Meyer
auf der Heide F, Platzner M, Wachsmuth H, Wehrheim H, eds. On-The-Fly Computing
-- Individualized IT-Services in Dynamic Markets. Vol 412. Verlagsschriftenreihe
des Heinz Nixdorf Instituts. Heinz Nixdorf Institut, Universität Paderborn; 2023:1--20.
doi:10.5281/zenodo.8060372'
apa: Götte, T., Knollmann, T., Meyer auf der Heide, F., Scheideler, C., & Werthmann,
J. (2023). Capabilities and Limitations of Local Strategies in Dynamic Networks.
In C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, & H. Wehrheim
(Eds.), On-The-Fly Computing -- Individualized IT-services in dynamic markets
(Vol. 412, pp. 1--20). Heinz Nixdorf Institut, Universität Paderborn. https://doi.org/10.5281/zenodo.8060372
bibtex: '@inbook{Götte_Knollmann_Meyer auf der Heide_Scheideler_Werthmann_2023,
place={Paderborn}, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts},
title={Capabilities and Limitations of Local Strategies in Dynamic Networks},
volume={412}, DOI={10.5281/zenodo.8060372},
booktitle={On-The-Fly Computing -- Individualized IT-services in dynamic markets},
publisher={Heinz Nixdorf Institut, Universität Paderborn}, author={Götte, Thorsten
and Knollmann, Till and Meyer auf der Heide, Friedhelm and Scheideler, Christian
and Werthmann, Julian}, editor={Haake, Claus-Jochen and Meyer auf der Heide, Friedhelm
and Platzner, Marco and Wachsmuth, Henning and Wehrheim, Heike}, year={2023},
pages={1--20}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts}
}'
chicago: 'Götte, Thorsten, Till Knollmann, Friedhelm Meyer auf der Heide, Christian
Scheideler, and Julian Werthmann. “Capabilities and Limitations of Local Strategies
in Dynamic Networks.” In On-The-Fly Computing -- Individualized IT-Services
in Dynamic Markets, edited by Claus-Jochen Haake, Friedhelm Meyer auf der
Heide, Marco Platzner, Henning Wachsmuth, and Heike Wehrheim, 412:1--20. Verlagsschriftenreihe
Des Heinz Nixdorf Instituts. Paderborn: Heinz Nixdorf Institut, Universität Paderborn,
2023. https://doi.org/10.5281/zenodo.8060372.'
ieee: 'T. Götte, T. Knollmann, F. Meyer auf der Heide, C. Scheideler, and J. Werthmann,
“Capabilities and Limitations of Local Strategies in Dynamic Networks,” in On-The-Fly
Computing -- Individualized IT-services in dynamic markets, vol. 412, C.-J.
Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, and H. Wehrheim, Eds.
Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023, pp. 1--20.'
mla: Götte, Thorsten, et al. “Capabilities and Limitations of Local Strategies in
Dynamic Networks.” On-The-Fly Computing -- Individualized IT-Services in Dynamic
Markets, edited by Claus-Jochen Haake et al., vol. 412, Heinz Nixdorf Institut,
Universität Paderborn, 2023, pp. 1--20, doi:10.5281/zenodo.8060372.
short: 'T. Götte, T. Knollmann, F. Meyer auf der Heide, C. Scheideler, J. Werthmann,
in: C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, H. Wehrheim
(Eds.), On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets,
Heinz Nixdorf Institut, Universität Paderborn, Paderborn, 2023, pp. 1--20.'
date_created: 2023-07-07T06:21:38Z
date_updated: 2023-07-07T06:21:57Z
ddc:
- '004'
department:
- _id: '7'
doi: 10.5281/zenodo.8060372
editor:
- first_name: Claus-Jochen
full_name: Haake, Claus-Jochen
last_name: Haake
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
last_name: Meyer auf der Heide
- first_name: Marco
full_name: Platzner, Marco
last_name: Platzner
- first_name: Henning
full_name: Wachsmuth, Henning
last_name: Wachsmuth
- first_name: Heike
full_name: Wehrheim, Heike
last_name: Wehrheim
file:
- access_level: open_access
content_type: application/pdf
creator: ups
date_created: 2023-07-07T06:20:43Z
date_updated: 2023-07-07T06:20:43Z
file_id: '45876'
file_name: A1-Chapter-SFB-Buch-Final.pdf
file_size: 543715
relation: main_file
file_date_updated: 2023-07-07T06:20:43Z
has_accepted_license: '1'
intvolume: ' 412'
language:
- iso: eng
oa: '1'
page: 1--20
place: Paderborn
project:
- _id: '1'
grant_number: '160364472'
name: 'SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen
in dynamischen Märkten '
- _id: '2'
name: 'SFB 901 - A: SFB 901 - Project Area A'
- _id: '5'
grant_number: '160364472'
name: 'SFB 901 - A1: SFB 901 - Möglichkeiten und Grenzen lokaler Strategien in dynamischen
Netzen (Subproject A1)'
publication: On-The-Fly Computing -- Individualized IT-services in dynamic markets
publisher: Heinz Nixdorf Institut, Universität Paderborn
series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts
status: public
title: Capabilities and Limitations of Local Strategies in Dynamic Networks
type: book_chapter
user_id: '477'
volume: 412
year: '2023'
...
---
_id: '45193'
author:
- first_name: Jinfeng
full_name: Dou, Jinfeng
id: '92888'
last_name: Dou
- first_name: Thorsten
full_name: Götte, Thorsten
id: '34727'
last_name: Götte
- first_name: Henning
full_name: Hillebrandt, Henning
id: '74425'
last_name: Hillebrandt
- 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: 'Dou J, Götte T, Hillebrandt H, Scheideler C, Werthmann J. Brief Announcement:
Distributed Construction of Near-Optimal Compact Routing Schemes for Planar Graphs.
In: Proc. of the 42nd ACM Symposium on Principles of Distributed Computing
(PODC ’23). ; 2023.'
apa: 'Dou, J., Götte, T., Hillebrandt, H., Scheideler, C., & Werthmann, J. (2023).
Brief Announcement: Distributed Construction of Near-Optimal Compact Routing Schemes
for Planar Graphs. Proc. of the 42nd ACM Symposium on Principles of Distributed
Computing (PODC ’23). ACM Symposium on Principles of Distributed Computing
(PODC), Orlando, USA.'
bibtex: '@inproceedings{Dou_Götte_Hillebrandt_Scheideler_Werthmann_2023, title={Brief
Announcement: Distributed Construction of Near-Optimal Compact Routing Schemes
for Planar Graphs}, booktitle={Proc. of the 42nd ACM Symposium on Principles of
Distributed Computing (PODC ’23)}, author={Dou, Jinfeng and Götte, Thorsten and
Hillebrandt, Henning and Scheideler, Christian and Werthmann, Julian}, year={2023}
}'
chicago: 'Dou, Jinfeng, Thorsten Götte, Henning Hillebrandt, Christian Scheideler,
and Julian Werthmann. “Brief Announcement: Distributed Construction of Near-Optimal
Compact Routing Schemes for Planar Graphs.” In Proc. of the 42nd ACM Symposium
on Principles of Distributed Computing (PODC ’23), 2023.'
ieee: 'J. Dou, T. Götte, H. Hillebrandt, C. Scheideler, and J. Werthmann, “Brief
Announcement: Distributed Construction of Near-Optimal Compact Routing Schemes
for Planar Graphs,” presented at the ACM Symposium on Principles of Distributed
Computing (PODC), Orlando, USA, 2023.'
mla: 'Dou, Jinfeng, et al. “Brief Announcement: Distributed Construction of Near-Optimal
Compact Routing Schemes for Planar Graphs.” Proc. of the 42nd ACM Symposium
on Principles of Distributed Computing (PODC ’23), 2023.'
short: 'J. Dou, T. Götte, H. Hillebrandt, C. Scheideler, J. Werthmann, in: Proc.
of the 42nd ACM Symposium on Principles of Distributed Computing (PODC ’23), 2023.'
conference:
end_date: 2023-06-25
location: Orlando, USA
name: ACM Symposium on Principles of Distributed Computing (PODC)
start_date: 2023-06-19
date_created: 2023-05-22T14:42:31Z
date_updated: 2025-10-15T12:57:48Z
language:
- iso: eng
project:
- _id: '2'
name: 'SFB 901 - A: SFB 901 - Project Area A'
- _id: '5'
name: 'SFB 901 - A1: SFB 901 - Subproject A1'
- _id: '1'
name: 'SFB 901: SFB 901'
publication: Proc. of the 42nd ACM Symposium on Principles of Distributed Computing
(PODC '23)
status: public
title: 'Brief Announcement: Distributed Construction of Near-Optimal Compact Routing
Schemes for Planar Graphs'
type: conference
user_id: '34727'
year: '2023'
...
---
_id: '33240'
author:
- 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: 'Götte T, Scheideler C. Brief Announcement: The (Limited) Power of Multiple
Identities: Asynchronous Byzantine Reliable Broadcast with Improved Resilience
through Collusion. In: Agrawal K, Lee I-TA, eds. SPAA ’22: 34th ACM Symposium
on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11
- 14, 2022. ACM; 2022:99–101. doi:10.1145/3490148.3538556'
apa: 'Götte, T., & Scheideler, C. (2022). Brief Announcement: The (Limited)
Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved
Resilience through Collusion. In K. Agrawal & I.-T. A. Lee (Eds.), SPAA
’22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia,
PA, USA, July 11 - 14, 2022 (pp. 99–101). ACM. https://doi.org/10.1145/3490148.3538556'
bibtex: '@inproceedings{Götte_Scheideler_2022, title={Brief Announcement: The (Limited)
Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved
Resilience through Collusion}, DOI={10.1145/3490148.3538556},
booktitle={SPAA ’22: 34th ACM Symposium on Parallelism in Algorithms and Architectures,
Philadelphia, PA, USA, July 11 - 14, 2022}, publisher={ACM}, author={Götte, Thorsten
and Scheideler, Christian}, editor={Agrawal, Kunal and Lee, I-Ting Angelina},
year={2022}, pages={99–101} }'
chicago: 'Götte, Thorsten, and Christian Scheideler. “Brief Announcement: The (Limited)
Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved
Resilience through Collusion.” In SPAA ’22: 34th ACM Symposium on Parallelism
in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022,
edited by Kunal Agrawal and I-Ting Angelina Lee, 99–101. ACM, 2022. https://doi.org/10.1145/3490148.3538556.'
ieee: 'T. Götte and C. Scheideler, “Brief Announcement: The (Limited) Power of Multiple
Identities: Asynchronous Byzantine Reliable Broadcast with Improved Resilience
through Collusion,” in SPAA ’22: 34th ACM Symposium on Parallelism in Algorithms
and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022, 2022, pp. 99–101,
doi: 10.1145/3490148.3538556.'
mla: 'Götte, Thorsten, and Christian Scheideler. “Brief Announcement: The (Limited)
Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved
Resilience through Collusion.” SPAA ’22: 34th ACM Symposium on Parallelism
in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022,
edited by Kunal Agrawal and I-Ting Angelina Lee, ACM, 2022, pp. 99–101, doi:10.1145/3490148.3538556.'
short: 'T. Götte, C. Scheideler, in: K. Agrawal, I.-T.A. Lee (Eds.), SPAA ’22: 34th
ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA,
USA, July 11 - 14, 2022, ACM, 2022, pp. 99–101.'
date_created: 2022-09-01T07:55:00Z
date_updated: 2022-09-01T07:57:53Z
department:
- _id: '79'
doi: 10.1145/3490148.3538556
editor:
- first_name: Kunal
full_name: Agrawal, Kunal
last_name: Agrawal
- first_name: I-Ting Angelina
full_name: Lee, I-Ting Angelina
last_name: Lee
language:
- iso: eng
page: 99–101
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '4'
name: 'SFB 901 - C: SFB 901 - Project Area C'
- _id: '13'
name: 'SFB 901 - C1: SFB 901 - Subproject C1'
publication: 'SPAA ’22: 34th ACM Symposium on Parallelism in Algorithms and Architectures,
Philadelphia, PA, USA, July 11 - 14, 2022'
publisher: ACM
status: public
title: 'Brief Announcement: The (Limited) Power of Multiple Identities: Asynchronous
Byzantine Reliable Broadcast with Improved Resilience through Collusion'
type: conference
user_id: '15504'
year: '2022'
...
---
_id: '22283'
abstract:
- lang: eng
text: " We show how to construct an overlay network of constant degree and diameter
$O(\\log n)$ in time $O(\\log n)$ starting from an arbitrary weakly connected
graph.\r\n We assume a synchronous communication network in which nodes can
send messages to nodes they know the identifier of and establish new connections
by sending node identifiers.\r\n If the initial network's graph is weakly connected
and has constant degree, then our algorithm constructs the desired topology with
each node sending and receiving only $O(\\log n)$ messages in each round in time
$O(\\log n)$, w.h.p., which beats the currently best $O(\\log^{3/2} n)$ time algorithm
of [Götte et al., SIROCCO'19].\r\n Since the problem cannot be solved faster
than by using pointer jumping for $O(\\log n)$ rounds (which would even require
each node to communicate $\\Omega(n)$ bits), our algorithm is asymptotically optimal.\r\n
\ We achieve this speedup by using short random walks to repeatedly establish
random connections between the nodes that quickly reduce the conductance of the
graph using an observation of [Kwok and Lau, APPROX'14].\r\n \r\n Additionally,
we show how our algorithm can be used to efficiently solve graph problems in \\emph{hybrid
networks} [Augustine et al., SODA'20].\r\n Motivated by the idea that nodes
possess two different modes of communication, we assume that communication of
the \\emph{initial} edges is unrestricted. In contrast, only polylogarithmically
many messages can be communicated over edges that have been established throughout
an algorithm's execution.\r\n For an (undirected) graph $G$ with arbitrary
degree, we show how to compute connected components, a spanning tree, and biconnected
components in time $O(\\log n)$, w.h.p.\r\n Furthermore, we show how to compute
an MIS in time $O(\\log d + \\log \\log n)$, w.h.p., where $d$ is the initial
degree of $G$."
author:
- first_name: Thorsten
full_name: Götte, Thorsten
id: '34727'
last_name: Götte
- 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: Julian
full_name: Werthmann, Julian
id: '50024'
last_name: Werthmann
citation:
ama: 'Götte T, Hinnenthal K, Scheideler C, Werthmann J. Time-Optimal Construction
of Overlays. In: Censor-Hillel K, ed. Proc. of the 40th ACM Symposium on Principles
of Distributed Computing (PODC ’21). New York: ACM. doi:10.1145/3465084.3467932'
apa: 'Götte, T., Hinnenthal, K., Scheideler, C., & Werthmann, J. (n.d.). Time-Optimal
Construction of Overlays. In K. Censor-Hillel (Ed.), Proc. of the 40th ACM
Symposium on Principles of Distributed Computing (PODC ’21). New York: ACM.
https://doi.org/10.1145/3465084.3467932'
bibtex: '@inproceedings{Götte_Hinnenthal_Scheideler_Werthmann, place={New York},
title={Time-Optimal Construction of Overlays}, DOI={10.1145/3465084.3467932},
booktitle={Proc. of the 40th ACM Symposium on Principles of Distributed Computing
(PODC ’21)}, publisher={ACM}, author={Götte, Thorsten and Hinnenthal, Kristian
and Scheideler, Christian and Werthmann, Julian}, editor={Censor-Hillel, KerenEditor}
}'
chicago: 'Götte, Thorsten, Kristian Hinnenthal, Christian Scheideler, and Julian
Werthmann. “Time-Optimal Construction of Overlays.” In Proc. of the 40th ACM
Symposium on Principles of Distributed Computing (PODC ’21), edited by Keren
Censor-Hillel. New York: ACM, n.d. https://doi.org/10.1145/3465084.3467932.'
ieee: T. Götte, K. Hinnenthal, C. Scheideler, and J. Werthmann, “Time-Optimal Construction
of Overlays,” in Proc. of the 40th ACM Symposium on Principles of Distributed
Computing (PODC ’21), Virtual.
mla: Götte, Thorsten, et al. “Time-Optimal Construction of Overlays.” Proc. of
the 40th ACM Symposium on Principles of Distributed Computing (PODC ’21),
edited by Keren Censor-Hillel, ACM, doi:10.1145/3465084.3467932.
short: 'T. Götte, K. Hinnenthal, C. Scheideler, J. Werthmann, in: K. Censor-Hillel
(Ed.), Proc. of the 40th ACM Symposium on Principles of Distributed Computing
(PODC ’21), ACM, New York, n.d.'
conference:
end_date: 2021-07-30
location: Virtual
name: ACM Symposium on Principles of Distributed Computing (PODC)
start_date: 2021-07-26
date_created: 2021-06-06T19:10:26Z
date_updated: 2022-01-06T06:55:30Z
ddc:
- '000'
department:
- _id: '34'
doi: 10.1145/3465084.3467932
editor:
- first_name: Keren
full_name: Censor-Hillel, Keren
last_name: Censor-Hillel
file:
- access_level: closed
content_type: application/pdf
creator: thgoette
date_created: 2021-06-06T19:12:49Z
date_updated: 2021-06-06T19:12:49Z
file_id: '22284'
file_name: Wicked_Fast_Overlay_Construction(1).pdf
file_size: 590875
relation: main_file
success: 1
file_date_updated: 2021-06-06T19:12:49Z
has_accepted_license: '1'
language:
- iso: eng
place: New York
project:
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
- _id: '4'
name: SFB 901 - Project Area C
- _id: '13'
name: SFB 901 - Subproject C1
- _id: '1'
name: SFB 901
publication: Proc. of the 40th ACM Symposium on Principles of Distributed Computing
(PODC '21)
publication_status: accepted
publisher: ACM
status: public
title: Time-Optimal Construction of Overlays
type: conference
user_id: '477'
year: '2021'
...
---
_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: '26986'
author:
- first_name: Jannik
full_name: Castenow, Jannik
id: '38705'
last_name: Castenow
- first_name: Thorsten
full_name: Götte, Thorsten
id: '34727'
last_name: Götte
- first_name: Till
full_name: Knollmann, Till
id: '39241'
last_name: Knollmann
orcid: 0000-0003-2014-4696
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Castenow J, Götte T, Knollmann T, Meyer auf der Heide F. The Max-Line-Formation
Problem – And New Insights for Gathering and Chain-Formation. In: Johnen C, Schiller
EM, Schmid S, eds. Proceedings of the 23rd International Symposium on Stabilization,
Safety, and Security of Distributed Systems, SSS 2021. Vol 13046. LNCS. Springer;
2021:289-304. doi:10.1007/978-3-030-91081-5_19'
apa: Castenow, J., Götte, T., Knollmann, T., & Meyer auf der Heide, F. (2021).
The Max-Line-Formation Problem – And New Insights for Gathering and Chain-Formation.
In C. Johnen, E. M. Schiller, & S. Schmid (Eds.), Proceedings of the 23rd
International Symposium on Stabilization, Safety, and Security of Distributed
Systems, SSS 2021 (Vol. 13046, pp. 289–304). Springer. https://doi.org/10.1007/978-3-030-91081-5_19
bibtex: '@inproceedings{Castenow_Götte_Knollmann_Meyer auf der Heide_2021, series={LNCS},
title={The Max-Line-Formation Problem – And New Insights for Gathering and Chain-Formation},
volume={13046}, DOI={10.1007/978-3-030-91081-5_19},
booktitle={Proceedings of the 23rd International Symposium on Stabilization, Safety,
and Security of Distributed Systems, SSS 2021}, publisher={Springer}, author={Castenow,
Jannik and Götte, Thorsten and Knollmann, Till and Meyer auf der Heide, Friedhelm},
editor={Johnen, C. and Schiller, E.M. and Schmid, S.}, year={2021}, pages={289–304},
collection={LNCS} }'
chicago: Castenow, Jannik, Thorsten Götte, Till Knollmann, and Friedhelm Meyer auf
der Heide. “The Max-Line-Formation Problem – And New Insights for Gathering and
Chain-Formation.” In Proceedings of the 23rd International Symposium on Stabilization,
Safety, and Security of Distributed Systems, SSS 2021, edited by C. Johnen,
E.M. Schiller, and S. Schmid, 13046:289–304. LNCS. Springer, 2021. https://doi.org/10.1007/978-3-030-91081-5_19.
ieee: 'J. Castenow, T. Götte, T. Knollmann, and F. Meyer auf der Heide, “The Max-Line-Formation
Problem – And New Insights for Gathering and Chain-Formation,” in Proceedings
of the 23rd International Symposium on Stabilization, Safety, and Security of
Distributed Systems, SSS 2021, Online, 2021, vol. 13046, pp. 289–304, doi:
10.1007/978-3-030-91081-5_19.'
mla: Castenow, Jannik, et al. “The Max-Line-Formation Problem – And New Insights
for Gathering and Chain-Formation.” Proceedings of the 23rd International Symposium
on Stabilization, Safety, and Security of Distributed Systems, SSS 2021, edited
by C. Johnen et al., vol. 13046, Springer, 2021, pp. 289–304, doi:10.1007/978-3-030-91081-5_19.
short: 'J. Castenow, T. Götte, T. Knollmann, F. Meyer auf der Heide, in: C. Johnen,
E.M. Schiller, S. Schmid (Eds.), Proceedings of the 23rd International Symposium
on Stabilization, Safety, and Security of Distributed Systems, SSS 2021, Springer,
2021, pp. 289–304.'
conference:
end_date: 2021-11-20
location: Online
name: 23rd International Symposium on Stabilization, Safety, and Security of Distributed
Systems
start_date: 2021-11-17
date_created: 2021-10-28T07:01:30Z
date_updated: 2022-01-07T15:24:10Z
department:
- _id: '63'
doi: 10.1007/978-3-030-91081-5_19
editor:
- first_name: C.
full_name: Johnen, C.
last_name: Johnen
- first_name: E.M.
full_name: Schiller, E.M.
last_name: Schiller
- first_name: S.
full_name: Schmid, S.
last_name: Schmid
external_id:
arxiv:
- '2109.11856'
intvolume: ' 13046'
language:
- iso: eng
page: '289-304 '
project:
- _id: '106'
name: 'Algorithmen für Schwarmrobotik: Verteiltes Rechnen trifft Dynamische Systeme'
publication: Proceedings of the 23rd International Symposium on Stabilization, Safety,
and Security of Distributed Systems, SSS 2021
publication_status: published
publisher: Springer
series_title: LNCS
status: public
title: The Max-Line-Formation Problem – And New Insights for Gathering and Chain-Formation
type: conference
user_id: '38705'
volume: 13046
year: '2021'
...
---
_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: '12944'
author:
- first_name: Thorsten
full_name: Götte, Thorsten
id: '34727'
last_name: Götte
- 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: 'Götte T, Hinnenthal K, Scheideler C. Faster Construction of Overlay Networks.
In: Structural Information and Communication Complexity. Cham; 2019. doi:10.1007/978-3-030-24922-9_18'
apa: Götte, T., Hinnenthal, K., & Scheideler, C. (2019). Faster Construction
of Overlay Networks. In Structural Information and Communication Complexity.
Cham. https://doi.org/10.1007/978-3-030-24922-9_18
bibtex: '@inproceedings{Götte_Hinnenthal_Scheideler_2019, place={Cham}, title={Faster
Construction of Overlay Networks}, DOI={10.1007/978-3-030-24922-9_18},
booktitle={Structural Information and Communication Complexity}, author={Götte,
Thorsten and Hinnenthal, Kristian and Scheideler, Christian}, year={2019} }'
chicago: Götte, Thorsten, Kristian Hinnenthal, and Christian Scheideler. “Faster
Construction of Overlay Networks.” In Structural Information and Communication
Complexity. Cham, 2019. https://doi.org/10.1007/978-3-030-24922-9_18.
ieee: T. Götte, K. Hinnenthal, and C. Scheideler, “Faster Construction of Overlay
Networks,” in Structural Information and Communication Complexity, 2019.
mla: Götte, Thorsten, et al. “Faster Construction of Overlay Networks.” Structural
Information and Communication Complexity, 2019, doi:10.1007/978-3-030-24922-9_18.
short: 'T. Götte, K. Hinnenthal, C. Scheideler, in: Structural Information and Communication
Complexity, Cham, 2019.'
date_created: 2019-08-19T07:18:57Z
date_updated: 2022-01-06T06:51:27Z
doi: 10.1007/978-3-030-24922-9_18
language:
- iso: eng
place: Cham
publication: Structural Information and Communication Complexity
publication_status: published
status: public
title: Faster Construction of Overlay Networks
type: conference
user_id: '32229'
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: '5222'
abstract:
- lang: eng
text: 'We present a self-stabilizing protocol for an overlay network that constructs
the Minimum Spanning Tree (MST) for an underlay that is modeled by a weighted
tree. The weight of an overlay edge between two nodes is the weighted length of
their shortest path in the tree. We rigorously prove that our protocol works correctly
under asynchronous and non-FIFO message delivery. Further, the protocol stabilizes
after O(N^2) asynchronous rounds where N is the number of nodes in the overlay. '
author:
- 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
- first_name: Alexander
full_name: Setzer, Alexander
id: '11108'
last_name: Setzer
citation:
ama: 'Götte T, Scheideler C, Setzer A. On Underlay-Aware Self-Stabilizing Overlay
Networks. In: Proceedings of the 20th International Symposium on Stabilization,
Safety, and Security of Distributed Systems (SSS 2018). Vol 11201. Lecture
Notes in Computer Science. Springer; 2018:50-64.'
apa: 'Götte, T., Scheideler, C., & Setzer, A. (2018). On Underlay-Aware Self-Stabilizing
Overlay Networks. In Proceedings of the 20th International Symposium on Stabilization,
Safety, and Security of Distributed Systems (SSS 2018) (Vol. 11201, pp. 50–64).
Tokyo, Japan: Springer.'
bibtex: '@inproceedings{Götte_Scheideler_Setzer_2018, series={Lecture Notes in Computer
Science}, title={On Underlay-Aware Self-Stabilizing Overlay Networks}, volume={11201},
booktitle={Proceedings of the 20th International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS 2018)}, publisher={Springer}, author={Götte,
Thorsten and Scheideler, Christian and Setzer, Alexander}, year={2018}, pages={50–64},
collection={Lecture Notes in Computer Science} }'
chicago: Götte, Thorsten, Christian Scheideler, and Alexander Setzer. “On Underlay-Aware
Self-Stabilizing Overlay Networks.” In Proceedings of the 20th International
Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018),
11201:50–64. Lecture Notes in Computer Science. Springer, 2018.
ieee: T. Götte, C. Scheideler, and A. Setzer, “On Underlay-Aware Self-Stabilizing
Overlay Networks,” in Proceedings of the 20th International Symposium on Stabilization,
Safety, and Security of Distributed Systems (SSS 2018), Tokyo, Japan, 2018,
vol. 11201, pp. 50–64.
mla: Götte, Thorsten, et al. “On Underlay-Aware Self-Stabilizing Overlay Networks.”
Proceedings of the 20th International Symposium on Stabilization, Safety, and
Security of Distributed Systems (SSS 2018), vol. 11201, Springer, 2018, pp.
50–64.
short: 'T. Götte, C. Scheideler, A. Setzer, in: Proceedings of the 20th International
Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018),
Springer, 2018, pp. 50–64.'
conference:
location: Tokyo, Japan
name: ' 20th International Symposium on Stabilization, Safety, and Security of Distributed
Systems (SSS 2018)'
date_created: 2018-10-31T15:44:30Z
date_updated: 2022-01-06T07:01:47Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: closed
content_type: application/pdf
creator: thgoette
date_created: 2018-10-31T15:59:26Z
date_updated: 2018-10-31T15:59:26Z
file_id: '5224'
file_name: sss18_camera.pdf
file_size: 367812
relation: main_file
success: 1
file_date_updated: 2018-10-31T15:59:26Z
has_accepted_license: '1'
intvolume: ' 11201'
language:
- iso: eng
page: 50-64
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 20th International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS 2018)
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: On Underlay-Aware Self-Stabilizing Overlay Networks
type: conference
user_id: '477'
volume: 11201
year: '2018'
...
---
_id: '701'
author:
- first_name: Thorsten
full_name: Götte, Thorsten
id: '34727'
last_name: Götte
citation:
ama: Götte T. Self-Stabilizing Spanners for Tree Metrics. Universität Paderborn;
2017.
apa: Götte, T. (2017). Self-Stabilizing Spanners for Tree Metrics. Universität
Paderborn.
bibtex: '@book{Götte_2017, title={Self-Stabilizing Spanners for Tree Metrics}, publisher={Universität
Paderborn}, author={Götte, Thorsten}, year={2017} }'
chicago: Götte, Thorsten. Self-Stabilizing Spanners for Tree Metrics. Universität
Paderborn, 2017.
ieee: T. Götte, Self-Stabilizing Spanners for Tree Metrics. Universität Paderborn,
2017.
mla: Götte, Thorsten. Self-Stabilizing Spanners for Tree Metrics. Universität
Paderborn, 2017.
short: T. Götte, Self-Stabilizing Spanners for Tree Metrics, Universität Paderborn,
2017.
date_created: 2017-11-14T09:32:39Z
date_updated: 2022-01-06T07:03:26Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Self-Stabilizing Spanners for Tree Metrics
type: mastersthesis
user_id: '477'
year: '2017'
...
---
_id: '18003'
author:
- first_name: Thorsten
full_name: Götte, Thorsten
id: '34727'
last_name: Götte
citation:
ama: Götte T. Covering and Bridging Im Selbstorganisierenden Partikelsystem Amoebabot.
Universität Paderborn; 2015.
apa: Götte, T. (2015). Covering and Bridging im selbstorganisierenden Partikelsystem
Amoebabot. Universität Paderborn.
bibtex: '@book{Götte_2015, title={Covering and Bridging im selbstorganisierenden
Partikelsystem Amoebabot}, publisher={Universität Paderborn}, author={Götte, Thorsten},
year={2015} }'
chicago: Götte, Thorsten. Covering and Bridging Im Selbstorganisierenden Partikelsystem
Amoebabot. Universität Paderborn, 2015.
ieee: T. Götte, Covering and Bridging im selbstorganisierenden Partikelsystem
Amoebabot. Universität Paderborn, 2015.
mla: Götte, Thorsten. Covering and Bridging Im Selbstorganisierenden Partikelsystem
Amoebabot. Universität Paderborn, 2015.
short: T. Götte, Covering and Bridging Im Selbstorganisierenden Partikelsystem Amoebabot,
Universität Paderborn, 2015.
date_created: 2020-08-17T08:18:04Z
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: Covering and Bridging im selbstorganisierenden Partikelsystem Amoebabot
type: bachelorsthesis
user_id: '477'
year: '2015'
...