---
_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: <i>33rd International Symposium on Distributed
    Computing (DISC 2019)</i>. ; 2019. doi:<a href="https://doi.org/10.4230/LIPICS.DISC.2019.23">10.4230/LIPICS.DISC.2019.23</a>'
  apa: Hinnenthal, K., Scheideler, C., &#38; Struijs, M. (2019). Fast Distributed
    Algorithms for LP-Type Problems of Low Dimension. In <i>33rd International Symposium
    on Distributed Computing (DISC 2019)</i>. <a href="https://doi.org/10.4230/LIPICS.DISC.2019.23">https://doi.org/10.4230/LIPICS.DISC.2019.23</a>
  bibtex: '@inproceedings{Hinnenthal_Scheideler_Struijs_2019, title={Fast Distributed
    Algorithms for LP-Type Problems of Low Dimension}, DOI={<a href="https://doi.org/10.4230/LIPICS.DISC.2019.23">10.4230/LIPICS.DISC.2019.23</a>},
    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 <i>33rd International
    Symposium on Distributed Computing (DISC 2019)</i>, 2019. <a href="https://doi.org/10.4230/LIPICS.DISC.2019.23">https://doi.org/10.4230/LIPICS.DISC.2019.23</a>.
  ieee: K. Hinnenthal, C. Scheideler, and M. Struijs, “Fast Distributed Algorithms
    for LP-Type Problems of Low Dimension,” in <i>33rd International Symposium on
    Distributed Computing (DISC 2019)</i>, 2019.
  mla: Hinnenthal, Kristian, et al. “Fast Distributed Algorithms for LP-Type Problems
    of Low Dimension.” <i>33rd International Symposium on Distributed Computing (DISC
    2019)</i>, 2019, doi:<a href="https://doi.org/10.4230/LIPICS.DISC.2019.23">10.4230/LIPICS.DISC.2019.23</a>.
  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: '2484'
abstract:
- lang: eng
  text: We study the classic bin packing problem in a fully-dynamic setting, where
    new items can arrive and old items may depart. We want algorithms with low asymptotic
    competitive ratio while repacking items sparingly between updates. Formally, each
    item i has a movement cost c_i >= 0, and we want to use alpha * OPT bins and incur
    a movement cost gamma * c_i, either in the worst case, or in an amortized sense,
    for alpha, gamma as small as possible. We call gamma the recourse of the algorithm.
    This is motivated by cloud storage applications, where fully-dynamic bin packing
    models the problem of data backup to minimize the number of disks used, as well
    as communication incurred in moving file backups between disks. Since the set
    of files changes over time, we could recompute a solution periodically from scratch,
    but this would give a high number of disk rewrites, incurring a high energy cost
    and possible wear and tear of the disks. In this work, we present optimal tradeoffs
    between number of bins used and number of items repacked, as well as natural extensions
    of the latter measure.
author:
- first_name: Björn
  full_name: Feldkord, Björn
  id: '22704'
  last_name: Feldkord
- first_name: Matthias
  full_name: Feldotto, Matthias
  id: '14052'
  last_name: Feldotto
  orcid: 0000-0003-1348-6516
- first_name: Anupam
  full_name: Gupta, Anupam
  last_name: Gupta
- first_name: Guru
  full_name: Guruganesh, Guru
  last_name: Guruganesh
- first_name: 'Amit '
  full_name: 'Kumar, Amit '
  last_name: Kumar
- first_name: Sören
  full_name: Riechers, Sören
  last_name: Riechers
- first_name: David
  full_name: Wajc, David
  last_name: Wajc
citation:
  ama: 'Feldkord B, Feldotto M, Gupta A, et al. Fully-Dynamic Bin Packing with Little
    Repacking. In: Chatzigiannakis I, Kaklamanis C, Marx D, Sannella D, eds. <i>45th
    International Colloquium on Automata, Languages, and Programming (ICALP 2018)</i>.
    Vol 107. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl,
    Germany: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik; 2018:51:1-51:24. doi:<a
    href="https://doi.org/10.4230/LIPIcs.ICALP.2018.51">10.4230/LIPIcs.ICALP.2018.51</a>'
  apa: 'Feldkord, B., Feldotto, M., Gupta, A., Guruganesh, G., Kumar, A., Riechers,
    S., &#38; Wajc, D. (2018). Fully-Dynamic Bin Packing with Little Repacking. In
    I. Chatzigiannakis, C. Kaklamanis, D. Marx, &#38; D. Sannella (Eds.), <i>45th
    International Colloquium on Automata, Languages, and Programming (ICALP 2018)</i>
    (Vol. 107, pp. 51:1-51:24). Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum
    fuer Informatik. <a href="https://doi.org/10.4230/LIPIcs.ICALP.2018.51">https://doi.org/10.4230/LIPIcs.ICALP.2018.51</a>'
  bibtex: '@inproceedings{Feldkord_Feldotto_Gupta_Guruganesh_Kumar_Riechers_Wajc_2018,
    place={Dagstuhl, Germany}, series={Leibniz International Proceedings in Informatics
    (LIPIcs)}, title={Fully-Dynamic Bin Packing with Little Repacking}, volume={107},
    DOI={<a href="https://doi.org/10.4230/LIPIcs.ICALP.2018.51">10.4230/LIPIcs.ICALP.2018.51</a>},
    booktitle={45th International Colloquium on Automata, Languages, and Programming
    (ICALP 2018)}, publisher={Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
    author={Feldkord, Björn and Feldotto, Matthias and Gupta, Anupam and Guruganesh,
    Guru and Kumar, Amit  and Riechers, Sören and Wajc, David}, editor={Chatzigiannakis,
    Ioannis and Kaklamanis, Christos and Marx, Dániel and Sannella, DonaldEditors},
    year={2018}, pages={51:1-51:24}, collection={Leibniz International Proceedings
    in Informatics (LIPIcs)} }'
  chicago: 'Feldkord, Björn, Matthias Feldotto, Anupam Gupta, Guru Guruganesh, Amit  Kumar,
    Sören Riechers, and David Wajc. “Fully-Dynamic Bin Packing with Little Repacking.”
    In <i>45th International Colloquium on Automata, Languages, and Programming (ICALP
    2018)</i>, edited by Ioannis Chatzigiannakis, Christos Kaklamanis, Dániel Marx,
    and Donald Sannella, 107:51:1-51:24. Leibniz International Proceedings in Informatics
    (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik,
    2018. <a href="https://doi.org/10.4230/LIPIcs.ICALP.2018.51">https://doi.org/10.4230/LIPIcs.ICALP.2018.51</a>.'
  ieee: B. Feldkord <i>et al.</i>, “Fully-Dynamic Bin Packing with Little Repacking,”
    in <i>45th International Colloquium on Automata, Languages, and Programming (ICALP
    2018)</i>, Prag, 2018, vol. 107, pp. 51:1-51:24.
  mla: Feldkord, Björn, et al. “Fully-Dynamic Bin Packing with Little Repacking.”
    <i>45th International Colloquium on Automata, Languages, and Programming (ICALP
    2018)</i>, edited by Ioannis Chatzigiannakis et al., vol. 107, Schloss Dagstuhl--Leibniz-Zentrum
    fuer Informatik, 2018, pp. 51:1-51:24, doi:<a href="https://doi.org/10.4230/LIPIcs.ICALP.2018.51">10.4230/LIPIcs.ICALP.2018.51</a>.
  short: 'B. Feldkord, M. Feldotto, A. Gupta, G. Guruganesh, A. Kumar, S. Riechers,
    D. Wajc, in: I. Chatzigiannakis, C. Kaklamanis, D. Marx, D. Sannella (Eds.), 45th
    International Colloquium on Automata, Languages, and Programming (ICALP 2018),
    Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 2018, pp.
    51:1-51:24.'
conference:
  end_date: 2018-07-13
  location: Prag
  name: 45th International Colloquium on Automata, Languages, and Programming (ICALP
    2018)
  start_date: 2018-07-10
date_created: 2018-04-24T15:21:56Z
date_updated: 2022-01-06T06:56:39Z
ddc:
- '000'
department:
- _id: '541'
- _id: '63'
doi: 10.4230/LIPIcs.ICALP.2018.51
editor:
- first_name: Ioannis
  full_name: Chatzigiannakis, Ioannis
  last_name: Chatzigiannakis
- first_name: Christos
  full_name: Kaklamanis, Christos
  last_name: Kaklamanis
- first_name: Dániel
  full_name: Marx, Dániel
  last_name: Marx
- first_name: Donald
  full_name: Sannella, Donald
  last_name: Sannella
external_id:
  arxiv:
  - '1711.01231'
file:
- access_level: closed
  content_type: application/pdf
  creator: feldi
  date_created: 2018-10-31T16:58:18Z
  date_updated: 2018-10-31T16:58:18Z
  file_id: '5227'
  file_name: LIPIcs-ICALP-2018-51.pdf
  file_size: 723824
  relation: main_file
  success: 1
file_date_updated: 2018-10-31T16:58:18Z
has_accepted_license: '1'
intvolume: '       107'
language:
- iso: eng
page: 51:1-51:24
place: Dagstuhl, Germany
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '5'
  name: SFB 901 - Subproject A1
- _id: '7'
  name: SFB 901 - Subproject A3
- _id: '16'
  name: SFB 901 - Subproject C4
publication: 45th International Colloquium on Automata, Languages, and Programming
  (ICALP 2018)
publication_identifier:
  isbn:
  - 978-3-95977-076-7
  issn:
  - 1868-8969
publication_status: published
publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
series_title: Leibniz International Proceedings in Informatics (LIPIcs)
status: public
title: Fully-Dynamic Bin Packing with Little Repacking
type: conference
user_id: '14052'
volume: 107
year: '2018'
...
---
_id: '2485'
author:
- first_name: Björn
  full_name: Feldkord, Björn
  id: '22704'
  last_name: Feldkord
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
citation:
  ama: 'Feldkord B, Meyer auf der Heide F. Online Facility Location with Mobile Facilities.
    In: <i>Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and
    Architectures (SPAA)</i>. ACM; 2018:373-381. doi:<a href="https://doi.org/10.1145/3210377.3210389">10.1145/3210377.3210389</a>'
  apa: 'Feldkord, B., &#38; Meyer auf der Heide, F. (2018). Online Facility Location
    with Mobile Facilities. In <i>Proceedings of the 30th ACM Symposium on Parallelism
    in Algorithms and Architectures (SPAA)</i> (pp. 373–381). Wien: ACM. <a href="https://doi.org/10.1145/3210377.3210389">https://doi.org/10.1145/3210377.3210389</a>'
  bibtex: '@inproceedings{Feldkord_Meyer auf der Heide_2018, title={Online Facility
    Location with Mobile Facilities}, DOI={<a href="https://doi.org/10.1145/3210377.3210389">10.1145/3210377.3210389</a>},
    booktitle={Proceedings of the 30th ACM Symposium on Parallelism in Algorithms
    and Architectures (SPAA)}, publisher={ACM}, author={Feldkord, Björn and Meyer
    auf der Heide, Friedhelm}, year={2018}, pages={373–381} }'
  chicago: Feldkord, Björn, and Friedhelm Meyer auf der Heide. “Online Facility Location
    with Mobile Facilities.” In <i>Proceedings of the 30th ACM Symposium on Parallelism
    in Algorithms and Architectures (SPAA)</i>, 373–81. ACM, 2018. <a href="https://doi.org/10.1145/3210377.3210389">https://doi.org/10.1145/3210377.3210389</a>.
  ieee: B. Feldkord and F. Meyer auf der Heide, “Online Facility Location with Mobile
    Facilities,” in <i>Proceedings of the 30th ACM Symposium on Parallelism in Algorithms
    and Architectures (SPAA)</i>, Wien, 2018, pp. 373–381.
  mla: Feldkord, Björn, and Friedhelm Meyer auf der Heide. “Online Facility Location
    with Mobile Facilities.” <i>Proceedings of the 30th ACM Symposium on Parallelism
    in Algorithms and Architectures (SPAA)</i>, ACM, 2018, pp. 373–81, doi:<a href="https://doi.org/10.1145/3210377.3210389">10.1145/3210377.3210389</a>.
  short: 'B. Feldkord, F. Meyer auf der Heide, in: Proceedings of the 30th ACM Symposium
    on Parallelism in Algorithms and Architectures (SPAA), ACM, 2018, pp. 373–381.'
conference:
  location: Wien
  name: SPAA'18
date_created: 2018-04-25T08:49:43Z
date_updated: 2022-01-06T06:56:39Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.1145/3210377.3210389
file:
- access_level: closed
  content_type: application/pdf
  creator: ups
  date_created: 2018-11-02T14:42:33Z
  date_updated: 2018-11-02T14:42:33Z
  file_id: '5280'
  file_name: p373-feldkord.pdf
  file_size: 1207546
  relation: main_file
  success: 1
file_date_updated: 2018-11-02T14:42:33Z
has_accepted_license: '1'
language:
- iso: eng
page: '373 - 381 '
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 30th ACM Symposium on Parallelism in Algorithms and
  Architectures (SPAA)
publication_status: published
publisher: ACM
status: public
title: Online Facility Location with Mobile Facilities
type: conference
user_id: '477'
year: '2018'
...
---
_id: '2849'
author:
- first_name: 'Faisal N. '
  full_name: 'Abu-Khzam, Faisal N. '
  last_name: Abu-Khzam
- first_name: Christine
  full_name: Markarian, Christine
  id: '37612'
  last_name: Markarian
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
- first_name: Michael
  full_name: Schubert, Michael
  last_name: Schubert
citation:
  ama: Abu-Khzam FN, Markarian C, Meyer auf der Heide F, Schubert M. Approximation
    and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-hoc Networks.
    <i>Theory of Computing Systems</i>. 2018. doi:<a href="https://doi.org/10.1007/s00224-017-9836-z">10.1007/s00224-017-9836-z</a>
  apa: Abu-Khzam, F. N., Markarian, C., Meyer auf der Heide, F., &#38; Schubert, M.
    (2018). Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric
    Ad-hoc Networks. <i>Theory of Computing Systems</i>. <a href="https://doi.org/10.1007/s00224-017-9836-z">https://doi.org/10.1007/s00224-017-9836-z</a>
  bibtex: '@article{Abu-Khzam_Markarian_Meyer auf der Heide_Schubert_2018, title={Approximation
    and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-hoc Networks},
    DOI={<a href="https://doi.org/10.1007/s00224-017-9836-z">10.1007/s00224-017-9836-z</a>},
    journal={Theory of Computing Systems}, publisher={Springer}, author={Abu-Khzam,
    Faisal N.  and Markarian, Christine and Meyer auf der Heide, Friedhelm and Schubert,
    Michael}, year={2018} }'
  chicago: Abu-Khzam, Faisal N. , Christine Markarian, Friedhelm Meyer auf der Heide,
    and Michael Schubert. “Approximation and Heuristic Algorithms for Computing Backbones
    in Asymmetric Ad-Hoc Networks.” <i>Theory of Computing Systems</i>, 2018. <a href="https://doi.org/10.1007/s00224-017-9836-z">https://doi.org/10.1007/s00224-017-9836-z</a>.
  ieee: F. N. Abu-Khzam, C. Markarian, F. Meyer auf der Heide, and M. Schubert, “Approximation
    and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-hoc Networks,”
    <i>Theory of Computing Systems</i>, 2018.
  mla: Abu-Khzam, Faisal N., et al. “Approximation and Heuristic Algorithms for Computing
    Backbones in Asymmetric Ad-Hoc Networks.” <i>Theory of Computing Systems</i>,
    Springer, 2018, doi:<a href="https://doi.org/10.1007/s00224-017-9836-z">10.1007/s00224-017-9836-z</a>.
  short: F.N. Abu-Khzam, C. Markarian, F. Meyer auf der Heide, M. Schubert, Theory
    of Computing Systems (2018).
date_created: 2018-05-24T08:39:15Z
date_updated: 2022-01-06T06:58:06Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.1007/s00224-017-9836-z
file:
- access_level: closed
  content_type: application/pdf
  creator: ups
  date_created: 2018-11-02T15:24:32Z
  date_updated: 2018-11-02T15:24:32Z
  file_id: '5301'
  file_name: ApproximationAndHeuristicAlgor.pdf
  file_size: 1371624
  relation: main_file
  success: 1
file_date_updated: 2018-11-02T15:24:32Z
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: Theory of Computing Systems
publication_identifier:
  unknown:
  - 1432-4350
publisher: Springer
status: public
title: Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric
  Ad-hoc Networks
type: journal_article
user_id: '477'
year: '2018'
...
---
_id: '2850'
author:
- first_name: Heiko
  full_name: Hamann, Heiko
  last_name: Hamann
- first_name: Christine
  full_name: Markarian, Christine
  id: '37612'
  last_name: Markarian
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
- first_name: Mostafa
  full_name: Wahby, Mostafa
  last_name: Wahby
citation:
  ama: 'Hamann H, Markarian C, Meyer auf der Heide F, Wahby M. Pick, Pack, &#38; Survive:
    Charging Robots in a Modern Warehouse based on Online Connected Dominating Sets.
    In: <i>Ninth International Conference on Fun with Algorithms (FUN)</i>. ; 2018.
    doi:<a href="https://doi.org/10.4230/LIPIcs.FUN.2018.22">10.4230/LIPIcs.FUN.2018.22</a>'
  apa: 'Hamann, H., Markarian, C., Meyer auf der Heide, F., &#38; Wahby, M. (2018).
    Pick, Pack, &#38; Survive: Charging Robots in a Modern Warehouse based on Online
    Connected Dominating Sets. In <i>Ninth International Conference on Fun with Algorithms
    (FUN)</i>. <a href="https://doi.org/10.4230/LIPIcs.FUN.2018.22">https://doi.org/10.4230/LIPIcs.FUN.2018.22</a>'
  bibtex: '@inproceedings{Hamann_Markarian_Meyer auf der Heide_Wahby_2018, title={Pick,
    Pack, &#38; Survive: Charging Robots in a Modern Warehouse based on Online Connected
    Dominating Sets}, DOI={<a href="https://doi.org/10.4230/LIPIcs.FUN.2018.22">10.4230/LIPIcs.FUN.2018.22</a>},
    booktitle={Ninth International Conference on Fun with Algorithms (FUN)}, author={Hamann,
    Heiko and Markarian, Christine and Meyer auf der Heide, Friedhelm and Wahby, Mostafa},
    year={2018} }'
  chicago: 'Hamann, Heiko, Christine Markarian, Friedhelm Meyer auf der Heide, and
    Mostafa Wahby. “Pick, Pack, &#38; Survive: Charging Robots in a Modern Warehouse
    Based on Online Connected Dominating Sets.” In <i>Ninth International Conference
    on Fun with Algorithms (FUN)</i>, 2018. <a href="https://doi.org/10.4230/LIPIcs.FUN.2018.22">https://doi.org/10.4230/LIPIcs.FUN.2018.22</a>.'
  ieee: 'H. Hamann, C. Markarian, F. Meyer auf der Heide, and M. Wahby, “Pick, Pack,
    &#38; Survive: Charging Robots in a Modern Warehouse based on Online Connected
    Dominating Sets,” in <i>Ninth International Conference on Fun with Algorithms
    (FUN)</i>, 2018.'
  mla: 'Hamann, Heiko, et al. “Pick, Pack, &#38; Survive: Charging Robots in a Modern
    Warehouse Based on Online Connected Dominating Sets.” <i>Ninth International Conference
    on Fun with Algorithms (FUN)</i>, 2018, doi:<a href="https://doi.org/10.4230/LIPIcs.FUN.2018.22">10.4230/LIPIcs.FUN.2018.22</a>.'
  short: 'H. Hamann, C. Markarian, F. Meyer auf der Heide, M. Wahby, in: Ninth International
    Conference on Fun with Algorithms (FUN), 2018.'
date_created: 2018-05-24T08:41:48Z
date_updated: 2022-01-06T06:58:07Z
ddc:
- '000'
department:
- _id: '63'
- _id: '238'
doi: 10.4230/LIPIcs.FUN.2018.22
file:
- access_level: closed
  content_type: application/pdf
  creator: feldi
  date_created: 2018-11-13T13:15:19Z
  date_updated: 2018-11-13T13:15:19Z
  file_id: '5536'
  file_name: LIPIcs-FUN-2018-22.pdf
  file_size: 554298
  relation: main_file
  success: 1
file_date_updated: 2018-11-13T13:15:19Z
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: Ninth International Conference on Fun with Algorithms (FUN)
status: public
title: 'Pick, Pack, & Survive: Charging Robots in a Modern Warehouse based on Online
  Connected Dominating Sets'
type: conference
user_id: '15415'
year: '2018'
...
---
_id: '1138'
author:
- first_name: Robert
  full_name: Gmyr, Robert
  last_name: Gmyr
citation:
  ama: Gmyr R. <i>Distributed Algorithms for Overlay Networks and Programmable Matter</i>.
    Universität Paderborn; 2018. doi:<a href="https://doi.org/10.17619/UNIPB/1-265">10.17619/UNIPB/1-265</a>
  apa: Gmyr, R. (2018). <i>Distributed Algorithms for Overlay Networks and Programmable
    Matter</i>. Universität Paderborn. <a href="https://doi.org/10.17619/UNIPB/1-265">https://doi.org/10.17619/UNIPB/1-265</a>
  bibtex: '@book{Gmyr_2018, title={Distributed Algorithms for Overlay Networks and
    Programmable Matter}, DOI={<a href="https://doi.org/10.17619/UNIPB/1-265">10.17619/UNIPB/1-265</a>},
    publisher={Universität Paderborn}, author={Gmyr, Robert}, year={2018} }'
  chicago: Gmyr, Robert. <i>Distributed Algorithms for Overlay Networks and Programmable
    Matter</i>. Universität Paderborn, 2018. <a href="https://doi.org/10.17619/UNIPB/1-265">https://doi.org/10.17619/UNIPB/1-265</a>.
  ieee: R. Gmyr, <i>Distributed Algorithms for Overlay Networks and Programmable Matter</i>.
    Universität Paderborn, 2018.
  mla: Gmyr, Robert. <i>Distributed Algorithms for Overlay Networks and Programmable
    Matter</i>. Universität Paderborn, 2018, doi:<a href="https://doi.org/10.17619/UNIPB/1-265">10.17619/UNIPB/1-265</a>.
  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: <i>Proceedings of the 32nd IEEE International Parallel
    &#38; Distributed Processing Symposium (IPDPS)</i>. IEEE; 2018. doi:<a href="https://doi.org/10.1109/IPDPS.2018.00114">10.1109/IPDPS.2018.00114</a>'
  apa: 'Feldmann, M., Kolb, C., Scheideler, C., &#38; Strothmann, T. F. (2018). Self-Stabilizing
    Supervised Publish-Subscribe Systems. In <i>Proceedings of the 32nd IEEE International
    Parallel &#38; Distributed Processing Symposium (IPDPS)</i>. Vancouver: IEEE.
    <a href="https://doi.org/10.1109/IPDPS.2018.00114">https://doi.org/10.1109/IPDPS.2018.00114</a>'
  bibtex: '@inproceedings{Feldmann_Kolb_Scheideler_Strothmann_2018, title={Self-Stabilizing
    Supervised Publish-Subscribe Systems}, DOI={<a href="https://doi.org/10.1109/IPDPS.2018.00114">10.1109/IPDPS.2018.00114</a>},
    booktitle={Proceedings of the 32nd IEEE International Parallel &#38; 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 <i>Proceedings
    of the 32nd IEEE International Parallel &#38; Distributed Processing Symposium
    (IPDPS)</i>. IEEE, 2018. <a href="https://doi.org/10.1109/IPDPS.2018.00114">https://doi.org/10.1109/IPDPS.2018.00114</a>.
  ieee: M. Feldmann, C. Kolb, C. Scheideler, and T. F. Strothmann, “Self-Stabilizing
    Supervised Publish-Subscribe Systems,” in <i>Proceedings of the 32nd IEEE International
    Parallel &#38; Distributed Processing Symposium (IPDPS)</i>, Vancouver, 2018.
  mla: Feldmann, Michael, et al. “Self-Stabilizing Supervised Publish-Subscribe Systems.”
    <i>Proceedings of the 32nd IEEE International Parallel &#38; Distributed Processing
    Symposium (IPDPS)</i>, IEEE, 2018, doi:<a href="https://doi.org/10.1109/IPDPS.2018.00114">10.1109/IPDPS.2018.00114</a>.
  short: 'M. Feldmann, C. Kolb, C. Scheideler, T.F. Strothmann, in: Proceedings of
    the 32nd IEEE International Parallel &#38; 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: <i>Proceedings of the 32nd IEEE International Parallel
    &#38; Distributed Processing Symposium (IPDPS)</i>. IEEE; 2018. doi:<a href="https://doi.org/10.1109/IPDPS.2018.00113">10.1109/IPDPS.2018.00113</a>'
  apa: 'Feldmann, M., Scheideler, C., &#38; Setzer, A. (2018). Skueue: A Scalable
    and Sequentially Consistent Distributed Queue. In <i>Proceedings of the 32nd IEEE
    International Parallel &#38; Distributed Processing Symposium (IPDPS)</i>. Vancouver:
    IEEE. <a href="https://doi.org/10.1109/IPDPS.2018.00113">https://doi.org/10.1109/IPDPS.2018.00113</a>'
  bibtex: '@inproceedings{Feldmann_Scheideler_Setzer_2018, title={Skueue: A Scalable
    and Sequentially Consistent Distributed Queue}, DOI={<a href="https://doi.org/10.1109/IPDPS.2018.00113">10.1109/IPDPS.2018.00113</a>},
    booktitle={Proceedings of the 32nd IEEE International Parallel &#38; 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 <i>Proceedings of
    the 32nd IEEE International Parallel &#38; Distributed Processing Symposium (IPDPS)</i>.
    IEEE, 2018. <a href="https://doi.org/10.1109/IPDPS.2018.00113">https://doi.org/10.1109/IPDPS.2018.00113</a>.'
  ieee: 'M. Feldmann, C. Scheideler, and A. Setzer, “Skueue: A Scalable and Sequentially
    Consistent Distributed Queue,” in <i>Proceedings of the 32nd IEEE International
    Parallel &#38; Distributed Processing Symposium (IPDPS)</i>, Vancouver, 2018.'
  mla: 'Feldmann, Michael, et al. “Skueue: A Scalable and Sequentially Consistent
    Distributed Queue.” <i>Proceedings of the 32nd IEEE International Parallel &#38;
    Distributed Processing Symposium (IPDPS)</i>, IEEE, 2018, doi:<a href="https://doi.org/10.1109/IPDPS.2018.00113">10.1109/IPDPS.2018.00113</a>.'
  short: 'M. Feldmann, C. Scheideler, A. Setzer, in: Proceedings of the 32nd IEEE
    International Parallel &#38; 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: '18030'
author:
- first_name: N.
  full_name: N., N.
  last_name: N.
citation:
  ama: N. N. <i>Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen Build-List
    Und Build-Multilist Mit Systemverlassenden Knoten</i>. Universität Paderborn;
    2018.
  apa: N., N. (2018). <i>Monotone Suchbarkeit bei den selbststabilisierenden Protokollen
    Build-List und Build-Multilist mit systemverlassenden Knoten</i>. 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. <i>Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen
    Build-List Und Build-Multilist Mit Systemverlassenden Knoten</i>. Universität
    Paderborn, 2018.
  ieee: N. N., <i>Monotone Suchbarkeit bei den selbststabilisierenden Protokollen
    Build-List und Build-Multilist mit systemverlassenden Knoten</i>. Universität
    Paderborn, 2018.
  mla: N., N. <i>Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen Build-List
    Und Build-Multilist Mit Systemverlassenden Knoten</i>. 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: '18033'
author:
- first_name: Robin
  full_name: Wulfes, Robin
  last_name: Wulfes
citation:
  ama: Wulfes R. <i>Load-Balanced Routing in Hybriden Kommunikationsnetzwerken</i>.
    Universität Paderborn; 2018.
  apa: Wulfes, R. (2018). <i>Load-Balanced Routing in Hybriden Kommunikationsnetzwerken</i>.
    Universität Paderborn.
  bibtex: '@book{Wulfes_2018, title={Load-Balanced Routing in Hybriden Kommunikationsnetzwerken},
    publisher={Universität Paderborn}, author={Wulfes, Robin}, year={2018} }'
  chicago: Wulfes, Robin. <i>Load-Balanced Routing in Hybriden Kommunikationsnetzwerken</i>.
    Universität Paderborn, 2018.
  ieee: R. Wulfes, <i>Load-Balanced Routing in Hybriden Kommunikationsnetzwerken</i>.
    Universität Paderborn, 2018.
  mla: Wulfes, Robin. <i>Load-Balanced Routing in Hybriden Kommunikationsnetzwerken</i>.
    Universität Paderborn, 2018.
  short: R. Wulfes, Load-Balanced Routing in Hybriden Kommunikationsnetzwerken, Universität
    Paderborn, 2018.
date_created: 2020-08-18T08:46:50Z
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: Load-Balanced Routing in Hybriden Kommunikationsnetzwerken
type: bachelorsthesis
user_id: '477'
year: '2018'
...
---
_id: '5984'
alternative_title:
- Special Issue of SIROCCO 2015
author:
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
citation:
  ama: Scheideler C. Preface. <i>Theor Comput Sci</i>. 2018;751:1. doi:<a href="https://doi.org/10.1016/j.tcs.2018.11.004">10.1016/j.tcs.2018.11.004</a>
  apa: Scheideler, C. (2018). Preface. <i>Theor. Comput. Sci.</i>, <i>751</i>, 1.
    <a href="https://doi.org/10.1016/j.tcs.2018.11.004">https://doi.org/10.1016/j.tcs.2018.11.004</a>
  bibtex: '@article{Scheideler_2018, title={Preface}, volume={751}, DOI={<a href="https://doi.org/10.1016/j.tcs.2018.11.004">10.1016/j.tcs.2018.11.004</a>},
    journal={Theor. Comput. Sci.}, author={Scheideler, Christian}, year={2018}, pages={1}
    }'
  chicago: 'Scheideler, Christian. “Preface.” <i>Theor. Comput. Sci.</i> 751 (2018):
    1. <a href="https://doi.org/10.1016/j.tcs.2018.11.004">https://doi.org/10.1016/j.tcs.2018.11.004</a>.'
  ieee: C. Scheideler, “Preface,” <i>Theor. Comput. Sci.</i>, vol. 751, p. 1, 2018.
  mla: Scheideler, Christian. “Preface.” <i>Theor. Comput. Sci.</i>, vol. 751, 2018,
    p. 1, doi:<a href="https://doi.org/10.1016/j.tcs.2018.11.004">10.1016/j.tcs.2018.11.004</a>.
  short: C. Scheideler, Theor. Comput. Sci. 751 (2018) 1.
date_created: 2018-11-30T08:08:23Z
date_updated: 2022-01-06T07:02:49Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1016/j.tcs.2018.11.004
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2019-01-11T10:20:16Z
  date_updated: 2019-01-11T10:20:16Z
  file_id: '6620'
  file_name: Preface.pdf
  file_size: 112676
  relation: main_file
  success: 1
file_date_updated: 2019-01-11T10:20:16Z
has_accepted_license: '1'
intvolume: '       751'
language:
- iso: eng
page: '1'
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '5'
  name: SFB 901 - Subproject A1
publication: Theor. Comput. Sci.
status: public
title: Preface
type: journal_article
user_id: '15504'
volume: 751
year: '2018'
...
---
_id: '4411'
abstract:
- lang: eng
  text: "While a lot of research in distributed computing has covered solutions for
    self-stabilizing computing and topologies, there is far less work on self-stabilization
    for distributed data structures.\r\nConsidering crashing peers in peer-to-peer
    networks, it should not be taken for granted that a distributed data structure
    remains intact.\r\nIn this work, we present a self-stabilizing protocol for a
    distributed data structure called the hashed Patricia Trie (Kniesburges and Scheideler
    WALCOM'11) that enables efficient prefix search on a set of keys.\r\nThe data
    structure has a wide area of applications including string matching problems while
    offering low overhead and efficient operations when embedded on top of a distributed
    hash table.\r\nEspecially, longest prefix matching for $x$ can be done in $\\mathcal{O}(\\log
    |x|)$ hash table read accesses.\r\nWe show how to maintain the structure in a
    self-stabilizing way.\r\nOur protocol assures low overhead in a legal state and
    a total (asymptotically optimal) memory demand of $\\Theta(d)$ bits, where $d$
    is the number of bits needed for storing all keys."
author:
- first_name: Till
  full_name: Knollmann, Till
  id: '39241'
  last_name: Knollmann
  orcid: 0000-0003-2014-4696
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
citation:
  ama: 'Knollmann T, Scheideler C. A Self-Stabilizing Hashed Patricia Trie. In: Izumi
    T, Kuznetsov P, eds. <i>Proceedings of the 20th International Symposium on Stabilization,
    Safety, and Security of Distributed Systems (SSS)</i>. Vol 11201. Lecture Notes
    of Computer Science. Springer, Cham; 2018. doi:<a href="https://doi.org/10.1007/978-3-030-03232-6_1">10.1007/978-3-030-03232-6_1</a>'
  apa: 'Knollmann, T., &#38; Scheideler, C. (2018). A Self-Stabilizing Hashed Patricia
    Trie. In T. Izumi &#38; P. Kuznetsov (Eds.), <i>Proceedings of the 20th International
    Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>
    (Vol. 11201). Tokyo: Springer, Cham. <a href="https://doi.org/10.1007/978-3-030-03232-6_1">https://doi.org/10.1007/978-3-030-03232-6_1</a>'
  bibtex: '@inproceedings{Knollmann_Scheideler_2018, series={Lecture Notes of Computer
    Science}, title={A Self-Stabilizing Hashed Patricia Trie}, volume={11201}, DOI={<a
    href="https://doi.org/10.1007/978-3-030-03232-6_1">10.1007/978-3-030-03232-6_1</a>},
    booktitle={Proceedings of the 20th International Symposium on Stabilization, Safety,
    and Security of Distributed Systems (SSS)}, publisher={Springer, Cham}, author={Knollmann,
    Till and Scheideler, Christian}, editor={Izumi, Taisuke and Kuznetsov, PetrEditors},
    year={2018}, collection={Lecture Notes of Computer Science} }'
  chicago: Knollmann, Till, and Christian Scheideler. “A Self-Stabilizing Hashed Patricia
    Trie.” In <i>Proceedings of the 20th International Symposium on Stabilization,
    Safety, and Security of Distributed Systems (SSS)</i>, edited by Taisuke Izumi
    and Petr Kuznetsov, Vol. 11201. Lecture Notes of Computer Science. Springer, Cham,
    2018. <a href="https://doi.org/10.1007/978-3-030-03232-6_1">https://doi.org/10.1007/978-3-030-03232-6_1</a>.
  ieee: T. Knollmann and C. Scheideler, “A Self-Stabilizing Hashed Patricia Trie,”
    in <i>Proceedings of the 20th International Symposium on Stabilization, Safety,
    and Security of Distributed Systems (SSS)</i>, Tokyo, 2018, vol. 11201.
  mla: Knollmann, Till, and Christian Scheideler. “A Self-Stabilizing Hashed Patricia
    Trie.” <i>Proceedings of the 20th International Symposium on Stabilization, Safety,
    and Security of Distributed Systems (SSS)</i>, edited by Taisuke Izumi and Petr
    Kuznetsov, vol. 11201, Springer, Cham, 2018, doi:<a href="https://doi.org/10.1007/978-3-030-03232-6_1">10.1007/978-3-030-03232-6_1</a>.
  short: 'T. Knollmann, C. Scheideler, in: T. Izumi, P. Kuznetsov (Eds.), Proceedings
    of the 20th International Symposium on Stabilization, Safety, and Security of
    Distributed Systems (SSS), Springer, Cham, 2018.'
conference:
  end_date: 2018-11-07
  location: Tokyo
  name: 20th International Symposium on Stabilization, Safety, and Security of Distributed
    Systems (SSS)
  start_date: 2018-11-04
date_created: 2018-09-17T13:12:18Z
date_updated: 2022-01-06T07:01:02Z
ddc:
- '000'
department:
- _id: '63'
- _id: '79'
doi: 10.1007/978-3-030-03232-6_1
editor:
- first_name: Taisuke
  full_name: Izumi, Taisuke
  last_name: Izumi
- first_name: Petr
  full_name: Kuznetsov, Petr
  last_name: Kuznetsov
external_id:
  arxiv:
  - '1809.04923'
file:
- access_level: closed
  content_type: application/pdf
  creator: ups
  date_created: 2018-11-02T14:38:37Z
  date_updated: 2018-11-02T14:38:37Z
  file_id: '5277'
  file_name: ASelf-stabilizingHashedPatrici.pdf
  file_size: 500005
  relation: main_file
  success: 1
file_date_updated: 2018-11-02T14:38:37Z
has_accepted_license: '1'
intvolume: '     11201'
keyword:
- Self-Stabilizing
- Prefix Search
- Distributed Data Structure
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 20th International Symposium on Stabilization, Safety,
  and Security of Distributed Systems (SSS)
publisher: Springer, Cham
series_title: Lecture Notes of Computer Science
status: public
title: A Self-Stabilizing Hashed Patricia Trie
type: conference
user_id: '39241'
volume: 11201
year: '2018'
...
---
_id: '4563'
abstract:
- lang: eng
  text: "Routing is a challenging problem for wireless ad hoc networks, especially
    when the nodes are mobile and spread so widely that in most cases multiple hops
    are needed to route a message from one node to another. In fact, it is known that
    any online routing protocol has a poor performance in the worst case, in a sense
    that there is a distribution of nodes resulting in bad routing paths for that
    protocol, even if the nodes know their geographic positions and the geographic
    position of the destination of a message is known. The reason for that is that
    radio holes in the ad hoc network may require messages to take long detours in
    order to get to a destination, which are hard to find in an online fashion.\r\n\r\nIn
    this paper, we assume that the wireless ad hoc network can make limited use of
    long-range links provided by a global communication infrastructure like a cellular
    infrastructure or a satellite in order to compute an abstraction of the wireless
    ad hoc network that allows the messages to be sent along near-shortest paths in
    the ad hoc network. We present distributed algorithms that compute an abstraction
    of the ad hoc network in $\\mathcal{O}\\left(\\log ^2 n\\right)$ time using long-range
    links, which results in $c$-competitive routing paths between any two nodes of
    the ad hoc network for some constant $c$ if the convex hulls of the radio holes
    do not intersect. We also show that the storage needed for the abstraction just
    depends on the number and size of the radio holes in the wireless ad hoc network
    and is independent on the total number of nodes, and this information just has
    to be known to a few nodes for the routing to work.\r\n"
author:
- first_name: Daniel
  full_name: Jung, Daniel
  id: '37827'
  last_name: Jung
- 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: Jannik
  full_name: Sundermeier, Jannik
  id: '38705'
  last_name: Sundermeier
citation:
  ama: 'Jung D, Kolb C, Scheideler C, Sundermeier J. Competitive Routing in Hybrid
    Communication Networks. In: <i>Proceedings of the 14th International Symposium
    on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) </i>. Springer;
    2018.'
  apa: 'Jung, D., Kolb, C., Scheideler, C., &#38; Sundermeier, J. (2018). Competitive
    Routing in Hybrid Communication Networks. In <i>Proceedings of the 14th International
    Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) </i>.
    Helsinki: Springer.'
  bibtex: '@inproceedings{Jung_Kolb_Scheideler_Sundermeier_2018, title={Competitive
    Routing in Hybrid Communication Networks}, booktitle={Proceedings of the 14th
    International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS)
    }, publisher={Springer}, author={Jung, Daniel and Kolb, Christina and Scheideler,
    Christian and Sundermeier, Jannik}, year={2018} }'
  chicago: Jung, Daniel, Christina Kolb, Christian Scheideler, and Jannik Sundermeier.
    “Competitive Routing in Hybrid Communication Networks.” In <i>Proceedings of the
    14th International Symposium on Algorithms and Experiments for Wireless Networks
    (ALGOSENSORS) </i>. Springer, 2018.
  ieee: D. Jung, C. Kolb, C. Scheideler, and J. Sundermeier, “Competitive Routing
    in Hybrid Communication Networks,” in <i>Proceedings of the 14th International
    Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) </i>,
    Helsinki, 2018.
  mla: Jung, Daniel, et al. “Competitive Routing in Hybrid Communication Networks.”
    <i>Proceedings of the 14th International Symposium on Algorithms and Experiments
    for Wireless Networks (ALGOSENSORS) </i>, Springer, 2018.
  short: 'D. Jung, C. Kolb, C. Scheideler, J. Sundermeier, in: Proceedings of the
    14th International Symposium on Algorithms and Experiments for Wireless Networks
    (ALGOSENSORS) , Springer, 2018.'
conference:
  end_date: 2018-08-24
  location: Helsinki
  name: '14th International Symposium on Algorithms and Experiments for Wireless Networks
    (ALGOSENSORS) '
  start_date: 2018-08-23
date_created: 2018-10-02T07:06:05Z
date_updated: 2022-01-06T07:01:11Z
ddc:
- '000'
department:
- _id: '63'
- _id: '79'
file:
- access_level: closed
  content_type: application/pdf
  creator: ups
  date_created: 2019-01-11T10:32:38Z
  date_updated: 2019-01-11T10:32:38Z
  file_id: '6621'
  file_name: 23hybrid.pdf
  file_size: 349034
  relation: main_file
  success: 1
file_date_updated: 2019-01-11T10:32:38Z
has_accepted_license: '1'
keyword:
- greedy routing
- ad hoc networks
- convex hulls
- c-competitiveness
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 14th International Symposium on Algorithms and Experiments
  for Wireless Networks (ALGOSENSORS) '
publisher: Springer
status: public
title: Competitive Routing in Hybrid Communication Networks
type: conference
user_id: '38705'
year: '2018'
...
---
_id: '4565'
author:
- first_name: Daniel
  full_name: Jung, Daniel
  id: '37827'
  last_name: Jung
- 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: Jannik
  full_name: Sundermeier, Jannik
  id: '38705'
  last_name: Sundermeier
citation:
  ama: 'Jung D, Kolb C, Scheideler C, Sundermeier J. Brief Announcement: Competitive
    Routing in Hybrid Communication Networks. In: <i>Proceedings of the 30th on Symposium
    on Parallelism in Algorithms and Architectures (SPAA)</i>. ACM Press; 2018. doi:<a
    href="https://doi.org/10.1145/3210377.3210663">10.1145/3210377.3210663</a>'
  apa: 'Jung, D., Kolb, C., Scheideler, C., &#38; Sundermeier, J. (2018). Brief Announcement:
    Competitive Routing in Hybrid Communication Networks. In <i>Proceedings of the
    30th on Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>. Wien:
    ACM Press. <a href="https://doi.org/10.1145/3210377.3210663">https://doi.org/10.1145/3210377.3210663</a>'
  bibtex: '@inproceedings{Jung_Kolb_Scheideler_Sundermeier_2018, title={Brief Announcement:
    Competitive Routing in Hybrid Communication Networks}, DOI={<a href="https://doi.org/10.1145/3210377.3210663">10.1145/3210377.3210663</a>},
    booktitle={Proceedings of the 30th on Symposium on Parallelism in Algorithms and
    Architectures (SPAA)}, publisher={ACM Press}, author={Jung, Daniel and Kolb, Christina
    and Scheideler, Christian and Sundermeier, Jannik}, year={2018} }'
  chicago: 'Jung, Daniel, Christina Kolb, Christian Scheideler, and Jannik Sundermeier.
    “Brief Announcement: Competitive Routing in Hybrid Communication Networks.” In
    <i>Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures
    (SPAA)</i>. ACM Press, 2018. <a href="https://doi.org/10.1145/3210377.3210663">https://doi.org/10.1145/3210377.3210663</a>.'
  ieee: 'D. Jung, C. Kolb, C. Scheideler, and J. Sundermeier, “Brief Announcement:
    Competitive Routing in Hybrid Communication Networks,” in <i>Proceedings of the
    30th on Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, Wien,
    2018.'
  mla: 'Jung, Daniel, et al. “Brief Announcement: Competitive Routing in Hybrid Communication
    Networks.” <i>Proceedings of the 30th on Symposium on Parallelism in Algorithms
    and Architectures (SPAA)</i>, ACM Press, 2018, doi:<a href="https://doi.org/10.1145/3210377.3210663">10.1145/3210377.3210663</a>.'
  short: 'D. Jung, C. Kolb, C. Scheideler, J. Sundermeier, in: Proceedings of the
    30th on Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM Press,
    2018.'
conference:
  end_date: 2018-07-18
  location: Wien
  name: SPAA'18
  start_date: 2018-07-17
date_created: 2018-10-02T07:34:47Z
date_updated: 2022-01-06T07:01:12Z
ddc:
- '000'
department:
- _id: '63'
- _id: '79'
doi: 10.1145/3210377.3210663
file:
- access_level: closed
  content_type: application/pdf
  creator: ups
  date_created: 2018-11-02T13:48:10Z
  date_updated: 2018-11-02T13:48:10Z
  file_id: '5254'
  file_name: p231-jung-1.pdf
  file_size: 1025077
  relation: main_file
  success: 1
file_date_updated: 2018-11-02T13:48:10Z
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 30th on Symposium on Parallelism in Algorithms and
  Architectures (SPAA)
publication_identifier:
  isbn:
  - '9781450357999'
publication_status: published
publisher: ACM Press
status: public
title: 'Brief Announcement: Competitive Routing in Hybrid Communication Networks'
type: conference
user_id: '38705'
year: '2018'
...
---
_id: '7570'
author:
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
- first_name: Johannes Sebastian
  full_name: Schaefer, Johannes Sebastian
  id: '30291'
  last_name: Schaefer
citation:
  ama: 'Meyer auf der Heide F, Schaefer JS. Brief Announcement: Communication in Systems
    of Home Based Mobile Agents. In: <i>Proceedings of the 30th on Symposium on Parallelism
    in Algorithms and Architectures  - SPAA ’18</i>. ACM Press; 2018. doi:<a href="https://doi.org/10.1145/3210377.3210662">10.1145/3210377.3210662</a>'
  apa: 'Meyer auf der Heide, F., &#38; Schaefer, J. S. (2018). Brief Announcement:
    Communication in Systems of Home Based Mobile Agents. In <i>Proceedings of the
    30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18</i>.
    Vienna: ACM Press. <a href="https://doi.org/10.1145/3210377.3210662">https://doi.org/10.1145/3210377.3210662</a>'
  bibtex: '@inproceedings{Meyer auf der Heide_Schaefer_2018, title={Brief Announcement:
    Communication in Systems of Home Based Mobile Agents}, DOI={<a href="https://doi.org/10.1145/3210377.3210662">10.1145/3210377.3210662</a>},
    booktitle={Proceedings of the 30th on Symposium on Parallelism in Algorithms and
    Architectures  - SPAA ’18}, publisher={ACM Press}, author={Meyer auf der Heide,
    Friedhelm and Schaefer, Johannes Sebastian}, year={2018} }'
  chicago: 'Meyer auf der Heide, Friedhelm, and Johannes Sebastian Schaefer. “Brief
    Announcement: Communication in Systems of Home Based Mobile Agents.” In <i>Proceedings
    of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA
    ’18</i>. ACM Press, 2018. <a href="https://doi.org/10.1145/3210377.3210662">https://doi.org/10.1145/3210377.3210662</a>.'
  ieee: 'F. Meyer auf der Heide and J. S. Schaefer, “Brief Announcement: Communication
    in Systems of Home Based Mobile Agents,” in <i>Proceedings of the 30th on Symposium
    on Parallelism in Algorithms and Architectures  - SPAA ’18</i>, Vienna, 2018.'
  mla: 'Meyer auf der Heide, Friedhelm, and Johannes Sebastian Schaefer. “Brief Announcement:
    Communication in Systems of Home Based Mobile Agents.” <i>Proceedings of the 30th
    on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18</i>, ACM
    Press, 2018, doi:<a href="https://doi.org/10.1145/3210377.3210662">10.1145/3210377.3210662</a>.'
  short: 'F. Meyer auf der Heide, J.S. Schaefer, in: Proceedings of the 30th on Symposium
    on Parallelism in Algorithms and Architectures  - SPAA ’18, ACM Press, 2018.'
conference:
  end_date: 2018-07-18
  location: Vienna
  name: 30th Symposium on Parallelism in Algorithms and Architectures
  start_date: 2018-07-16
date_created: 2019-02-06T14:16:19Z
date_updated: 2022-01-06T07:03:40Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.1145/3210377.3210662
file:
- access_level: closed
  content_type: application/pdf
  creator: jschaef
  date_created: 2019-02-06T14:18:35Z
  date_updated: 2019-02-06T14:18:35Z
  file_id: '7576'
  file_name: p359-meyer-auf-der-heide.pdf
  file_size: 1504739
  relation: main_file
file_date_updated: 2019-02-06T14:18:35Z
has_accepted_license: '1'
language:
- iso: eng
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 30th on Symposium on Parallelism in Algorithms and
  Architectures  - SPAA '18
publication_identifier:
  isbn:
  - '9781450357999'
publication_status: published
publisher: ACM Press
status: public
title: 'Brief Announcement: Communication in Systems of Home Based Mobile Agents'
type: conference
user_id: '30291'
year: '2018'
...
---
_id: '4351'
abstract:
- lang: eng
  text: "\tWe extend the concept of monotonic searchability~\\cite{DBLP:conf/opodis/ScheidelerSS15}~\\cite{DBLP:conf/wdag/ScheidelerSS16}
    for self-stabilizing systems from one to multiple dimensions.\r\n\tA system is
    self-stabilizing if it can recover to a legitimate state from any initial illegal
    state.\r\n\tThese kind of systems are most often used in distributed applications.\r\n\tMonotonic
    searchability provides guarantees when searching for nodes while the recovery
    process is going on.\r\n\tMore precisely, if a search request started at some
    node $u$ succeeds in reaching its destination $v$, then all future search requests
    from $u$ to $v$ succeed as well.\r\n\tAlthough there already exists a self-stabilizing
    protocol for a two-dimensional topology~\\cite{DBLP:journals/tcs/JacobRSS12} and
    an universal approach for monotonic searchability~\\cite{DBLP:conf/wdag/ScheidelerSS16},
    it is not clear how both of these concepts fit together effectively.\r\n\tThe
    latter concept even comes with some restrictive assumptions on messages, which
    is not the case for our protocol.\r\n\tWe propose a simple novel protocol for
    a self-stabilizing two-dimensional quadtree that satisfies monotonic searchability.\r\n\tOur
    protocol can easily be extended to higher dimensions and offers routing in $\\mathcal
    O(\\log n)$ hops for any search request.\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
citation:
  ama: 'Feldmann M, Kolb C, Scheideler C. Self-stabilizing Overlays for high-dimensional
    Monotonic Searchability. In: <i>Proceedings of the 20th International Symposium
    on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>. Vol 11201.
    Lecture Notes in Computer Science. Springer, Cham; 2018:16-31. doi:<a href="https://doi.org/10.1007/978-3-030-03232-6_2">10.1007/978-3-030-03232-6_2</a>'
  apa: Feldmann, M., Kolb, C., &#38; Scheideler, C. (2018). Self-stabilizing Overlays
    for high-dimensional Monotonic Searchability. In <i>Proceedings of the 20th International
    Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>
    (Vol. 11201, pp. 16–31). Springer, Cham. <a href="https://doi.org/10.1007/978-3-030-03232-6_2">https://doi.org/10.1007/978-3-030-03232-6_2</a>
  bibtex: '@inproceedings{Feldmann_Kolb_Scheideler_2018, series={Lecture Notes in
    Computer Science}, title={Self-stabilizing Overlays for high-dimensional Monotonic
    Searchability}, volume={11201}, DOI={<a href="https://doi.org/10.1007/978-3-030-03232-6_2">10.1007/978-3-030-03232-6_2</a>},
    booktitle={Proceedings of the 20th International Symposium on Stabilization, Safety,
    and Security of Distributed Systems (SSS)}, publisher={Springer, Cham}, author={Feldmann,
    Michael and Kolb, Christina and Scheideler, Christian}, year={2018}, pages={16–31},
    collection={Lecture Notes in Computer Science} }'
  chicago: Feldmann, Michael, Christina Kolb, and Christian Scheideler. “Self-Stabilizing
    Overlays for High-Dimensional Monotonic Searchability.” In <i>Proceedings of the
    20th International Symposium on Stabilization, Safety, and Security of Distributed
    Systems (SSS)</i>, 11201:16–31. Lecture Notes in Computer Science. Springer, Cham,
    2018. <a href="https://doi.org/10.1007/978-3-030-03232-6_2">https://doi.org/10.1007/978-3-030-03232-6_2</a>.
  ieee: M. Feldmann, C. Kolb, and C. Scheideler, “Self-stabilizing Overlays for high-dimensional
    Monotonic Searchability,” in <i>Proceedings of the 20th International Symposium
    on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, 2018,
    vol. 11201, pp. 16–31.
  mla: Feldmann, Michael, et al. “Self-Stabilizing Overlays for High-Dimensional Monotonic
    Searchability.” <i>Proceedings of the 20th International Symposium on Stabilization,
    Safety, and Security of Distributed Systems (SSS)</i>, vol. 11201, Springer, Cham,
    2018, pp. 16–31, doi:<a href="https://doi.org/10.1007/978-3-030-03232-6_2">10.1007/978-3-030-03232-6_2</a>.
  short: 'M. Feldmann, C. Kolb, C. Scheideler, in: Proceedings of the 20th International
    Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS),
    Springer, Cham, 2018, pp. 16–31.'
date_created: 2018-09-04T14:15:39Z
date_updated: 2022-01-06T07:00:58Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/978-3-030-03232-6_2
external_id:
  arxiv:
  - '1808.10300'
file:
- access_level: closed
  content_type: application/pdf
  creator: mfeldma2
  date_created: 2018-10-31T13:24:17Z
  date_updated: 2018-10-31T13:24:17Z
  file_id: '5210'
  file_name: Feldmann2018_Chapter_Self-stabilizingOverlaysForHig.pdf
  file_size: 329823
  relation: main_file
  success: 1
file_date_updated: 2018-10-31T13:24:17Z
has_accepted_license: '1'
intvolume: '     11201'
language:
- iso: eng
page: '16-31 '
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)
publication_identifier:
  unknown:
  - 978-3-030-03231-9
publisher: Springer, Cham
series_title: Lecture Notes in Computer Science
status: public
title: Self-stabilizing Overlays for high-dimensional Monotonic Searchability
type: conference
user_id: '23538'
volume: 11201
year: '2018'
...
---
_id: '4375'
abstract:
- lang: eng
  text: "We present a peer-to-peer network that supports the efficient processing
    of orthogonal range queries $R=\\bigtimes_{i=1}^{d}[a_i,\\,b_i]$ in a $d$-dimensional
    point space.\\\\\r\nThe  network is the same for each dimension, namely a distance
    halving network like the one introduced by Naor and Wieder (ACM TALG'07).\r\nWe
    show how to execute such range queries using $\\mathcal{O}\\left(2^{d'}d\\,\\log
    m + d\\,|R|\\right)$ hops (and the same number of messages) in total. Here $[m]^d$
    is the ground set, $|R|$ is the size and $d'$ the dimension of the queried range.\r\nFurthermore,
    if the peers form a distributed network, the query can be answered in $\\mathcal{O}\\left(d\\,\\log
    m + d\\,\\sum_{i=1}^{d}(b_i-a_i+1)\\right)$ communication rounds.\r\nOur algorithms
    are based on a mapping of the Hilbert Curve through $[m]^d$ to the peers."
author:
- first_name: Markus
  full_name: Benter, Markus
  last_name: Benter
- 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: Alexander
  full_name: Setzer, Alexander
  id: '11108'
  last_name: Setzer
- first_name: Jannik
  full_name: Sundermeier, Jannik
  id: '38705'
  last_name: Sundermeier
citation:
  ama: 'Benter M, Knollmann T, Meyer auf der Heide F, Setzer A, Sundermeier J. A Peer-to-Peer
    based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension.
    In: <i>Proceedings of the 4th International Symposium on Algorithmic Aspects of
    Cloud Computing (ALGOCLOUD)</i>. ; 2018. doi:<a href="https://doi.org/10.1007/978-3-030-19759-9_4">10.1007/978-3-030-19759-9_4</a>'
  apa: Benter, M., Knollmann, T., Meyer auf der Heide, F., Setzer, A., &#38; Sundermeier,
    J. (2018). A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries
    of arbitrary Dimension. In <i>Proceedings of the 4th International Symposium on
    Algorithmic Aspects of Cloud Computing (ALGOCLOUD)</i>. Helsinki. <a href="https://doi.org/10.1007/978-3-030-19759-9_4">https://doi.org/10.1007/978-3-030-19759-9_4</a>
  bibtex: '@inproceedings{Benter_Knollmann_Meyer auf der Heide_Setzer_Sundermeier_2018,
    title={A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries
    of arbitrary Dimension}, DOI={<a href="https://doi.org/10.1007/978-3-030-19759-9_4">10.1007/978-3-030-19759-9_4</a>},
    booktitle={Proceedings of the 4th International Symposium on Algorithmic Aspects
    of Cloud Computing (ALGOCLOUD)}, author={Benter, Markus and Knollmann, Till and
    Meyer auf der Heide, Friedhelm and Setzer, Alexander and Sundermeier, Jannik},
    year={2018} }'
  chicago: Benter, Markus, Till Knollmann, Friedhelm Meyer auf der Heide, Alexander
    Setzer, and Jannik Sundermeier. “A Peer-to-Peer Based Cloud Storage Supporting
    Orthogonal Range Queries of Arbitrary Dimension.” In <i>Proceedings of the 4th
    International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)</i>,
    2018. <a href="https://doi.org/10.1007/978-3-030-19759-9_4">https://doi.org/10.1007/978-3-030-19759-9_4</a>.
  ieee: M. Benter, T. Knollmann, F. Meyer auf der Heide, A. Setzer, and J. Sundermeier,
    “A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary
    Dimension,” in <i>Proceedings of the 4th International Symposium on Algorithmic
    Aspects of Cloud Computing (ALGOCLOUD)</i>, Helsinki, 2018.
  mla: Benter, Markus, et al. “A Peer-to-Peer Based Cloud Storage Supporting Orthogonal
    Range Queries of Arbitrary Dimension.” <i>Proceedings of the 4th International
    Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)</i>, 2018, doi:<a
    href="https://doi.org/10.1007/978-3-030-19759-9_4">10.1007/978-3-030-19759-9_4</a>.
  short: 'M. Benter, T. Knollmann, F. Meyer auf der Heide, A. Setzer, J. Sundermeier,
    in: Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud
    Computing (ALGOCLOUD), 2018.'
conference:
  end_date: 2018-08-21
  location: Helsinki
  name: 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)
  start_date: 2018-08-20
date_created: 2018-09-11T05:26:59Z
date_updated: 2022-01-06T07:01:00Z
ddc:
- '000'
department:
- _id: '63'
- _id: '79'
doi: 10.1007/978-3-030-19759-9_4
file:
- access_level: closed
  content_type: application/pdf
  creator: tillk
  date_created: 2018-11-27T10:03:33Z
  date_updated: 2018-11-27T10:03:33Z
  file_id: '5863'
  file_name: A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries
    of arbitrary Dimension.pdf
  file_size: 1122875
  relation: main_file
  success: 1
file_date_updated: 2018-11-27T10:03:33Z
has_accepted_license: '1'
keyword:
- Distributed Storage
- Multi-Dimensional Range Queries
- Peer-to-Peer
- Hilbert Curve
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 4th International Symposium on Algorithmic Aspects
  of Cloud Computing (ALGOCLOUD)
status: public
title: A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary
  Dimension
type: conference
user_id: '14955'
year: '2018'
...
---
_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: <i>Proceedings of the 20th International Symposium on Stabilization,
    Safety, and Security of Distributed Systems (SSS 2018)</i>. Vol 11201. Lecture
    Notes in Computer Science. Springer; 2018:50-64.'
  apa: 'Götte, T., Scheideler, C., &#38; Setzer, A. (2018). On Underlay-Aware Self-Stabilizing
    Overlay Networks. In <i>Proceedings of the 20th International Symposium on Stabilization,
    Safety, and Security of Distributed Systems (SSS 2018)</i> (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 <i>Proceedings of the 20th International
    Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)</i>,
    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 <i>Proceedings of the 20th International Symposium on Stabilization,
    Safety, and Security of Distributed Systems (SSS 2018)</i>, Tokyo, Japan, 2018,
    vol. 11201, pp. 50–64.
  mla: Götte, Thorsten, et al. “On Underlay-Aware Self-Stabilizing Overlay Networks.”
    <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and
    Security of Distributed Systems (SSS 2018)</i>, 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: '5368'
author:
- first_name: Moritz
  full_name: Jochmaring, Moritz
  last_name: Jochmaring
citation:
  ama: Jochmaring M. <i>Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen
    Build-List Und Build-Multilist Mit Systemverlassenden Knoten</i>. Universität
    Paderborn; 2018.
  apa: Jochmaring, M. (2018). <i>Monotone Suchbarkeit bei den selbststabilisierenden
    Protokollen Build-List und Build-Multilist mit systemverlassenden Knoten</i>.
    Universität Paderborn.
  bibtex: '@book{Jochmaring_2018, title={Monotone Suchbarkeit bei den selbststabilisierenden
    Protokollen Build-List und Build-Multilist mit systemverlassenden Knoten}, publisher={Universität
    Paderborn}, author={Jochmaring, Moritz}, year={2018} }'
  chicago: Jochmaring, Moritz. <i>Monotone Suchbarkeit Bei Den Selbststabilisierenden
    Protokollen Build-List Und Build-Multilist Mit Systemverlassenden Knoten</i>.
    Universität Paderborn, 2018.
  ieee: M. Jochmaring, <i>Monotone Suchbarkeit bei den selbststabilisierenden Protokollen
    Build-List und Build-Multilist mit systemverlassenden Knoten</i>. Universität
    Paderborn, 2018.
  mla: Jochmaring, Moritz. <i>Monotone Suchbarkeit Bei Den Selbststabilisierenden
    Protokollen Build-List Und Build-Multilist Mit Systemverlassenden Knoten</i>.
    Universität Paderborn, 2018.
  short: M. Jochmaring, Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen
    Build-List Und Build-Multilist Mit Systemverlassenden Knoten, Universität Paderborn,
    2018.
date_created: 2018-11-06T06:21:37Z
date_updated: 2022-01-06T07:01:50Z
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: '5403'
author:
- first_name: Marcel
  full_name: Geromel, Marcel
  last_name: Geromel
citation:
  ama: Geromel M. <i>Mobile Facility Leasing</i>. Universität Paderborn; 2018.
  apa: Geromel, M. (2018). <i>Mobile Facility Leasing</i>. Universität Paderborn.
  bibtex: '@book{Geromel_2018, title={Mobile Facility Leasing}, publisher={Universität
    Paderborn}, author={Geromel, Marcel}, year={2018} }'
  chicago: Geromel, Marcel. <i>Mobile Facility Leasing</i>. Universität Paderborn,
    2018.
  ieee: M. Geromel, <i>Mobile Facility Leasing</i>. Universität Paderborn, 2018.
  mla: Geromel, Marcel. <i>Mobile Facility Leasing</i>. Universität Paderborn, 2018.
  short: M. Geromel, Mobile Facility Leasing, Universität Paderborn, 2018.
date_created: 2018-11-07T09:20:59Z
date_updated: 2022-01-06T07:01:51Z
department:
- _id: '63'
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: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
title: Mobile Facility Leasing
type: bachelorsthesis
user_id: '477'
year: '2018'
...