---
_id: '20755'
abstract:
- lang: eng
  text: "We consider the problem of computing shortest paths in \\emph{hybrid networks},
    in which nodes can make use of different communication modes. For example, mobile
    phones may use ad-hoc connections via Bluetooth or Wi-Fi in addition to the cellular
    network to solve tasks more efficiently. Like in this case, the different communication
    modes may differ considerably in range, bandwidth, and flexibility. We build upon
    the model of Augustine et al. [SODA '20], which captures these differences by
    a \\emph{local} and a \\emph{global} mode. Specifically, the local edges model
    a fixed communication network in which $O(1)$ messages of size $O(\\log n)$ can
    be sent over every edge in each synchronous round. The global edges form a clique,
    but nodes are only allowed to send and receive a total of at most $O(\\log n)$
    messages over global edges, which restricts the nodes to use these edges only
    very sparsely.\r\n\r\nWe demonstrate the power of hybrid networks by presenting
    algorithms to compute Single-Source Shortest Paths and the diameter very efficiently
    in \\emph{sparse graphs}. Specifically, we present exact $O(\\log n)$ time algorithms
    for cactus graphs (i.e., graphs in which each edge is contained in at most one
    cycle), and $3$-approximations for graphs that have at most $n + O(n^{1/3})$ edges
    and arboricity $O(\\log n)$. For these graph classes, our algorithms provide exponentially
    faster solutions than the best known algorithms for general graphs in this model.\r\nBeyond
    shortest paths, we also provide a variety of useful tools and techniques for hybrid
    networks, which may be of independent interest.\r\n"
author:
- first_name: Michael
  full_name: Feldmann, Michael
  id: '23538'
  last_name: Feldmann
- first_name: Kristian
  full_name: Hinnenthal, Kristian
  id: '32229'
  last_name: Hinnenthal
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
citation:
  ama: 'Feldmann M, Hinnenthal K, Scheideler C. Fast Hybrid Network Algorithms for
    Shortest Paths in Sparse Graphs. In: <i>Proceedings of the 24th International
    Conference on Principles of Distributed Systems (OPODIS)</i>. Schloss Dagstuhl
    - Leibniz-Zentrum für Informatik; 2020. doi:<a href="https://doi.org/10.4230/LIPIcs.OPODIS.2020.31">10.4230/LIPIcs.OPODIS.2020.31</a>'
  apa: Feldmann, M., Hinnenthal, K., &#38; Scheideler, C. (2020). Fast Hybrid Network
    Algorithms for Shortest Paths in Sparse Graphs. In <i>Proceedings of the 24th
    International Conference on Principles of Distributed Systems (OPODIS)</i>. Schloss
    Dagstuhl - Leibniz-Zentrum für Informatik. <a href="https://doi.org/10.4230/LIPIcs.OPODIS.2020.31">https://doi.org/10.4230/LIPIcs.OPODIS.2020.31</a>
  bibtex: '@inproceedings{Feldmann_Hinnenthal_Scheideler_2020, title={Fast Hybrid
    Network Algorithms for Shortest Paths in Sparse Graphs}, DOI={<a href="https://doi.org/10.4230/LIPIcs.OPODIS.2020.31">10.4230/LIPIcs.OPODIS.2020.31</a>},
    booktitle={Proceedings of the 24th International Conference on Principles of Distributed
    Systems (OPODIS)}, publisher={Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
    author={Feldmann, Michael and Hinnenthal, Kristian and Scheideler, Christian},
    year={2020} }'
  chicago: Feldmann, Michael, Kristian Hinnenthal, and Christian Scheideler. “Fast
    Hybrid Network Algorithms for Shortest Paths in Sparse Graphs.” In <i>Proceedings
    of the 24th International Conference on Principles of Distributed Systems (OPODIS)</i>.
    Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. <a href="https://doi.org/10.4230/LIPIcs.OPODIS.2020.31">https://doi.org/10.4230/LIPIcs.OPODIS.2020.31</a>.
  ieee: M. Feldmann, K. Hinnenthal, and C. Scheideler, “Fast Hybrid Network Algorithms
    for Shortest Paths in Sparse Graphs,” in <i>Proceedings of the 24th International
    Conference on Principles of Distributed Systems (OPODIS)</i>, 2020.
  mla: Feldmann, Michael, et al. “Fast Hybrid Network Algorithms for Shortest Paths
    in Sparse Graphs.” <i>Proceedings of the 24th International Conference on Principles
    of Distributed Systems (OPODIS)</i>, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
    2020, doi:<a href="https://doi.org/10.4230/LIPIcs.OPODIS.2020.31">10.4230/LIPIcs.OPODIS.2020.31</a>.
  short: 'M. Feldmann, K. Hinnenthal, C. Scheideler, in: Proceedings of the 24th International
    Conference on Principles of Distributed Systems (OPODIS), Schloss Dagstuhl - Leibniz-Zentrum
    für Informatik, 2020.'
date_created: 2020-12-16T10:20:18Z
date_updated: 2022-01-06T06:54:36Z
ddc:
- '000'
department:
- _id: '79'
doi: 10.4230/LIPIcs.OPODIS.2020.31
external_id:
  arxiv:
  - '2007.01191'
file:
- access_level: closed
  content_type: application/pdf
  creator: mfeldma2
  date_created: 2020-12-16T10:18:50Z
  date_updated: 2020-12-16T10:18:50Z
  file_id: '20756'
  file_name: Fast_Hybrid_Network_Algorithms_for_Shortest_Paths_in_Sparse_Graphs.pdf
  file_size: 867373
  relation: main_file
  success: 1
file_date_updated: 2020-12-16T10:18:50Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '5'
  name: SFB 901 - Subproject A1
- _id: '1'
  name: SFB 901
publication: Proceedings of the 24th International Conference on Principles of Distributed
  Systems (OPODIS)
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
status: public
title: Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs
type: conference
user_id: '23538'
year: '2020'
...
---
_id: '18066'
author:
- first_name: Michael
  full_name: Skowronek, Michael
  last_name: Skowronek
citation:
  ama: Skowronek M. <i>Approaches for Competetive Routing through Intersections of
    Hole Abstractions in Hybrid Communication Networks</i>. Universität Paderborn;
    2020.
  apa: Skowronek, M. (2020). <i>Approaches for Competetive Routing through Intersections
    of Hole Abstractions in Hybrid Communication Networks</i>. Universität Paderborn.
  bibtex: '@book{Skowronek_2020, title={Approaches for Competetive Routing through
    Intersections of Hole Abstractions in Hybrid Communication Networks}, publisher={Universität
    Paderborn}, author={Skowronek, Michael}, year={2020} }'
  chicago: Skowronek, Michael. <i>Approaches for Competetive Routing through Intersections
    of Hole Abstractions in Hybrid Communication Networks</i>. Universität Paderborn,
    2020.
  ieee: M. Skowronek, <i>Approaches for Competetive Routing through Intersections
    of Hole Abstractions in Hybrid Communication Networks</i>. Universität Paderborn,
    2020.
  mla: Skowronek, Michael. <i>Approaches for Competetive Routing through Intersections
    of Hole Abstractions in Hybrid Communication Networks</i>. Universität Paderborn,
    2020.
  short: M. Skowronek, Approaches for Competetive Routing through Intersections of
    Hole Abstractions in Hybrid Communication Networks, Universität Paderborn, 2020.
date_created: 2020-08-20T07:40:58Z
date_updated: 2022-01-06T06:53:25Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subproject 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: Approaches for Competetive Routing through Intersections of Hole Abstractions
  in Hybrid Communication Networks
type: bachelorsthesis
user_id: '477'
year: '2020'
...
---
_id: '18648'
author:
- first_name: Andreas
  full_name: Guggenmos, Andreas
  last_name: Guggenmos
citation:
  ama: Guggenmos A. <i>Algorithmen Für Selbststabilisierende Skip+-Delaunaygraphen</i>.
    Universität Paderborn; 2020.
  apa: Guggenmos, A. (2020). <i>Algorithmen für selbststabilisierende Skip+-Delaunaygraphen</i>.
    Universität Paderborn.
  bibtex: '@book{Guggenmos_2020, title={Algorithmen für selbststabilisierende Skip+-Delaunaygraphen},
    publisher={Universität Paderborn}, author={Guggenmos, Andreas}, year={2020} }'
  chicago: Guggenmos, Andreas. <i>Algorithmen Für Selbststabilisierende Skip+-Delaunaygraphen</i>.
    Universität Paderborn, 2020.
  ieee: A. Guggenmos, <i>Algorithmen für selbststabilisierende Skip+-Delaunaygraphen</i>.
    Universität Paderborn, 2020.
  mla: Guggenmos, Andreas. <i>Algorithmen Für Selbststabilisierende Skip+-Delaunaygraphen</i>.
    Universität Paderborn, 2020.
  short: A. Guggenmos, Algorithmen Für Selbststabilisierende Skip+-Delaunaygraphen,
    Universität Paderborn, 2020.
date_created: 2020-08-31T07:14:51Z
date_updated: 2022-01-06T06:53:50Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subproject 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: Algorithmen für selbststabilisierende Skip+-Delaunaygraphen
type: bachelorsthesis
user_id: '477'
year: '2020'
...
---
_id: '16902'
abstract:
- lang: eng
  text: "The maintenance of efficient and robust overlay networks is one\r\nof the
    most fundamental and reoccurring themes in networking.\r\nThis paper presents
    a survey of state-of-the-art \r\nalgorithms to design and repair overlay networks
    in a distributed\r\nmanner. In particular, we discuss basic algorithmic primitives\r\nto
    preserve connectivity, review algorithms for the fundamental\r\nproblem of graph
    linearization, and then survey self-stabilizing\r\nalgorithms for metric and scalable
    topologies. \r\nWe also identify open problems and avenues for future research.\r\n"
author:
- first_name: Michael
  full_name: Feldmann, Michael
  id: '23538'
  last_name: Feldmann
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
- first_name: Stefan
  full_name: Schmid, Stefan
  last_name: Schmid
citation:
  ama: Feldmann M, Scheideler C, Schmid S. Survey on Algorithms for Self-Stabilizing
    Overlay Networks. <i>ACM Computing Surveys</i>. 2020. doi:<a href="https://doi.org/10.1145/3397190">10.1145/3397190</a>
  apa: Feldmann, M., Scheideler, C., &#38; Schmid, S. (2020). Survey on Algorithms
    for Self-Stabilizing Overlay Networks. <i>ACM Computing Surveys</i>. <a href="https://doi.org/10.1145/3397190">https://doi.org/10.1145/3397190</a>
  bibtex: '@article{Feldmann_Scheideler_Schmid_2020, title={Survey on Algorithms for
    Self-Stabilizing Overlay Networks}, DOI={<a href="https://doi.org/10.1145/3397190">10.1145/3397190</a>},
    journal={ACM Computing Surveys}, publisher={ACM}, author={Feldmann, Michael and
    Scheideler, Christian and Schmid, Stefan}, year={2020} }'
  chicago: Feldmann, Michael, Christian Scheideler, and Stefan Schmid. “Survey on
    Algorithms for Self-Stabilizing Overlay Networks.” <i>ACM Computing Surveys</i>,
    2020. <a href="https://doi.org/10.1145/3397190">https://doi.org/10.1145/3397190</a>.
  ieee: M. Feldmann, C. Scheideler, and S. Schmid, “Survey on Algorithms for Self-Stabilizing
    Overlay Networks,” <i>ACM Computing Surveys</i>, 2020.
  mla: Feldmann, Michael, et al. “Survey on Algorithms for Self-Stabilizing Overlay
    Networks.” <i>ACM Computing Surveys</i>, ACM, 2020, doi:<a href="https://doi.org/10.1145/3397190">10.1145/3397190</a>.
  short: M. Feldmann, C. Scheideler, S. Schmid, ACM Computing Surveys (2020).
date_created: 2020-04-29T07:09:50Z
date_updated: 2022-01-06T06:52:58Z
department:
- _id: '79'
doi: 10.1145/3397190
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '5'
  name: SFB 901 - Subproject A1
publication: ACM Computing Surveys
publisher: ACM
status: public
title: Survey on Algorithms for Self-Stabilizing Overlay Networks
type: journal_article
user_id: '23538'
year: '2020'
...
---
_id: '15631'
author:
- first_name: Björn
  full_name: Feldkord, Björn
  id: '22704'
  last_name: Feldkord
citation:
  ama: Feldkord B. <i>Mobile Resource Allocation</i>. Universität Paderborn; 2020.
    doi:<a href="https://doi.org/10.17619/UNIPB/1-869">10.17619/UNIPB/1-869</a>
  apa: Feldkord, B. (2020). <i>Mobile Resource Allocation</i>. Universität Paderborn.
    <a href="https://doi.org/10.17619/UNIPB/1-869">https://doi.org/10.17619/UNIPB/1-869</a>
  bibtex: '@book{Feldkord_2020, place={Universität Paderborn}, title={Mobile Resource
    Allocation}, DOI={<a href="https://doi.org/10.17619/UNIPB/1-869">10.17619/UNIPB/1-869</a>},
    author={Feldkord, Björn}, year={2020} }'
  chicago: Feldkord, Björn. <i>Mobile Resource Allocation</i>. Universität Paderborn,
    2020. <a href="https://doi.org/10.17619/UNIPB/1-869">https://doi.org/10.17619/UNIPB/1-869</a>.
  ieee: B. Feldkord, <i>Mobile Resource Allocation</i>. Universität Paderborn, 2020.
  mla: Feldkord, Björn. <i>Mobile Resource Allocation</i>. 2020, doi:<a href="https://doi.org/10.17619/UNIPB/1-869">10.17619/UNIPB/1-869</a>.
  short: B. Feldkord, Mobile Resource Allocation, Universität Paderborn, 2020.
date_created: 2020-01-23T14:20:25Z
date_updated: 2022-01-06T06:52:31Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.17619/UNIPB/1-869
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2020-01-24T08:19:38Z
  date_updated: 2020-01-24T08:19:38Z
  file_id: '15634'
  file_name: DissertationFeldkord.pdf
  file_size: 633652
  relation: main_file
  success: 1
file_date_updated: 2020-01-24T08:19:38Z
has_accepted_license: '1'
language:
- iso: eng
place: Universität Paderborn
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '5'
  name: SFB 901 - Subproject A1
status: public
supervisor:
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
title: Mobile Resource Allocation
type: dissertation
user_id: '15415'
year: '2020'
...
---
_id: '15770'
author:
- first_name: Daniel
  full_name: Warner, Daniel
  last_name: Warner
citation:
  ama: Warner D. <i>On the Complexity of Local Transformations in SDN Overlays</i>.
    Universität Paderborn; 2020.
  apa: Warner, D. (2020). <i>On the complexity of local transformations in SDN overlays</i>.
    Universität Paderborn.
  bibtex: '@book{Warner_2020, title={On the complexity of local transformations in
    SDN overlays}, publisher={Universität Paderborn}, author={Warner, Daniel}, year={2020}
    }'
  chicago: Warner, Daniel. <i>On the Complexity of Local Transformations in SDN Overlays</i>.
    Universität Paderborn, 2020.
  ieee: D. Warner, <i>On the complexity of local transformations in SDN overlays</i>.
    Universität Paderborn, 2020.
  mla: Warner, Daniel. <i>On the Complexity of Local Transformations in SDN Overlays</i>.
    Universität Paderborn, 2020.
  short: D. Warner, On the Complexity of Local Transformations in SDN Overlays, Universität
    Paderborn, 2020.
date_created: 2020-02-04T13:47:02Z
date_updated: 2022-01-06T06:52:32Z
department:
- _id: '79'
language:
- iso: eng
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: '13'
  name: SFB 901 - Subproject C1
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
title: On the complexity of local transformations in SDN overlays
type: mastersthesis
user_id: '477'
year: '2020'
...
---
_id: '15169'
author:
- first_name: Jannik
  full_name: Castenow, Jannik
  id: '38705'
  last_name: Castenow
- first_name: Christina
  full_name: Kolb, Christina
  id: '43647'
  last_name: Kolb
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
citation:
  ama: 'Castenow J, Kolb C, Scheideler C. A Bounding Box Overlay for Competitive Routing
    in Hybrid Communication Networks. In: <i>Proceedings of the 21st International
    Conference on Distributed Computing and Networking (ICDCN)</i>. ACM.'
  apa: 'Castenow, J., Kolb, C., &#38; Scheideler, C. (n.d.). A Bounding Box Overlay
    for Competitive Routing in Hybrid Communication Networks. In <i>Proceedings of
    the 21st International Conference on Distributed Computing and Networking (ICDCN)</i>.
    Kolkata, Indien: ACM.'
  bibtex: '@inproceedings{Castenow_Kolb_Scheideler, title={A Bounding Box Overlay
    for Competitive Routing in Hybrid Communication Networks}, booktitle={Proceedings
    of the 21st International Conference on Distributed Computing and Networking (ICDCN)},
    publisher={ACM}, author={Castenow, Jannik and Kolb, Christina and Scheideler,
    Christian} }'
  chicago: Castenow, Jannik, Christina Kolb, and Christian Scheideler. “A Bounding
    Box Overlay for Competitive Routing in Hybrid Communication Networks.” In <i>Proceedings
    of the 21st International Conference on Distributed Computing and Networking (ICDCN)</i>.
    ACM, n.d.
  ieee: J. Castenow, C. Kolb, and C. Scheideler, “A Bounding Box Overlay for Competitive
    Routing in Hybrid Communication Networks,” in <i>Proceedings of the 21st International
    Conference on Distributed Computing and Networking (ICDCN)</i>, Kolkata, Indien.
  mla: Castenow, Jannik, et al. “A Bounding Box Overlay for Competitive Routing in
    Hybrid Communication Networks.” <i>Proceedings of the 21st International Conference
    on Distributed Computing and Networking (ICDCN)</i>, ACM.
  short: 'J. Castenow, C. Kolb, C. Scheideler, in: Proceedings of the 21st International
    Conference on Distributed Computing and Networking (ICDCN), ACM, n.d.'
conference:
  end_date: 07.01.2020
  location: Kolkata, Indien
  name: '21st International Conference on Distributed Computing and Networking '
  start_date: 04.01.2020
date_created: 2019-11-25T12:18:41Z
date_updated: 2022-01-06T06:52:16Z
department:
- _id: '63'
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '5'
  name: SFB 901 - Subproject A1
publication: Proceedings of the 21st International Conference on Distributed Computing
  and Networking (ICDCN)
publication_status: accepted
publisher: ACM
status: public
title: A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks
type: conference
user_id: '477'
year: '2020'
...
---
_id: '13770'
author:
- first_name: Holger
  full_name: Karl, Holger
  id: '126'
  last_name: Karl
- first_name: Dennis
  full_name: Kundisch, Dennis
  id: '21117'
  last_name: Kundisch
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
- first_name: Heike
  full_name: Wehrheim, Heike
  id: '573'
  last_name: Wehrheim
citation:
  ama: 'Karl H, Kundisch D, Meyer auf der Heide F, Wehrheim H. A Case for a New IT
    Ecosystem: On-The-Fly Computing. <i>Business &#38; Information Systems Engineering</i>.
    2020;62(6):467-481. doi:<a href="https://doi.org/10.1007/s12599-019-00627-x">10.1007/s12599-019-00627-x</a>'
  apa: 'Karl, H., Kundisch, D., Meyer auf der Heide, F., &#38; Wehrheim, H. (2020).
    A Case for a New IT Ecosystem: On-The-Fly Computing. <i>Business &#38; Information
    Systems Engineering</i>, <i>62</i>(6), 467–481. <a href="https://doi.org/10.1007/s12599-019-00627-x">https://doi.org/10.1007/s12599-019-00627-x</a>'
  bibtex: '@article{Karl_Kundisch_Meyer auf der Heide_Wehrheim_2020, title={A Case
    for a New IT Ecosystem: On-The-Fly Computing}, volume={62}, DOI={<a href="https://doi.org/10.1007/s12599-019-00627-x">10.1007/s12599-019-00627-x</a>},
    number={6}, journal={Business &#38; Information Systems Engineering}, publisher={Springer},
    author={Karl, Holger and Kundisch, Dennis and Meyer auf der Heide, Friedhelm and
    Wehrheim, Heike}, year={2020}, pages={467–481} }'
  chicago: 'Karl, Holger, Dennis Kundisch, Friedhelm Meyer auf der Heide, and Heike
    Wehrheim. “A Case for a New IT Ecosystem: On-The-Fly Computing.” <i>Business &#38;
    Information Systems Engineering</i> 62, no. 6 (2020): 467–81. <a href="https://doi.org/10.1007/s12599-019-00627-x">https://doi.org/10.1007/s12599-019-00627-x</a>.'
  ieee: 'H. Karl, D. Kundisch, F. Meyer auf der Heide, and H. Wehrheim, “A Case for
    a New IT Ecosystem: On-The-Fly Computing,” <i>Business &#38; Information Systems
    Engineering</i>, vol. 62, no. 6, pp. 467–481, 2020, doi: <a href="https://doi.org/10.1007/s12599-019-00627-x">10.1007/s12599-019-00627-x</a>.'
  mla: 'Karl, Holger, et al. “A Case for a New IT Ecosystem: On-The-Fly Computing.”
    <i>Business &#38; Information Systems Engineering</i>, vol. 62, no. 6, Springer,
    2020, pp. 467–81, doi:<a href="https://doi.org/10.1007/s12599-019-00627-x">10.1007/s12599-019-00627-x</a>.'
  short: H. Karl, D. Kundisch, F. Meyer auf der Heide, H. Wehrheim, Business &#38;
    Information Systems Engineering 62 (2020) 467–481.
date_created: 2019-10-10T13:41:06Z
date_updated: 2022-12-02T09:27:17Z
ddc:
- '004'
department:
- _id: '276'
- _id: '75'
- _id: '63'
- _id: '77'
doi: 10.1007/s12599-019-00627-x
file:
- access_level: closed
  content_type: application/pdf
  creator: ups
  date_created: 2019-12-12T10:24:47Z
  date_updated: 2019-12-12T10:24:47Z
  file_id: '15311'
  file_name: Karl2019_Article_ACaseForANewITEcosystemOn-The-.pdf
  file_size: 454532
  relation: main_file
  success: 1
file_date_updated: 2019-12-12T10:24:47Z
has_accepted_license: '1'
intvolume: '        62'
issue: '6'
language:
- iso: eng
page: 467-481
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '3'
  name: SFB 901 - Project Area B
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '82'
  name: SFB 901 - Project Area T
- _id: '5'
  name: SFB 901 - Subproject A1
- _id: '6'
  name: SFB 901 - Subproject A2
- _id: '7'
  name: SFB 901 - Subproject A3
- _id: '8'
  name: SFB 901 - Subproject A4
- _id: '9'
  name: SFB 901 - Subproject B1
- _id: '10'
  name: SFB 901 - Subproject B2
- _id: '11'
  name: SFB 901 - Subproject B3
- _id: '12'
  name: SFB 901 - Subproject B4
- _id: '13'
  name: SFB 901 - Subproject C1
- _id: '14'
  name: SFB 901 - Subproject C2
- _id: '15'
  name: SFB 901 - Subproject C3
- _id: '16'
  name: SFB 901 - Subproject C4
- _id: '17'
  name: SFB 901 - Subproject C5
- _id: '83'
  name: SFB 901 -Subproject T1
- _id: '84'
  name: SFB 901 -Subproject T2
- _id: '107'
  name: SFB 901 -Subproject T3
- _id: '158'
  name: 'SFB 901 - T4: SFB 901 -Subproject T4'
publication: Business & Information Systems Engineering
publication_status: published
publisher: Springer
status: public
title: 'A Case for a New IT Ecosystem: On-The-Fly Computing'
type: journal_article
user_id: '477'
volume: 62
year: '2020'
...
---
_id: '7636'
abstract:
- lang: eng
  text: "Self-stabilizing overlay networks have the advantage of being able to recover
    from illegal states and faults. \r\nHowever, the majority of these networks cannot
    give any guarantees on their functionality while the recovery process is going
    on. \r\nWe are especially interested in searchability, i.e., the functionality
    that search messages for a specific node are answered successfully if a node exists
    in the network. \r\nIn this paper we investigate overlay networks that ensure
    the maintenance of monotonic searchability while the self-stabilization is going
    on. \r\nMore precisely, once a search message from node u to another node v is
    successfully delivered, all future search messages from u to v succeed as well.\r\nWe
    extend the existing research by focusing on skip graphs and present a solution
    for two scenarios: (i) the goal topology is a super graph of the perfect skip
    graph and (ii) the goal topology is exactly the perfect skip graph.\r\n"
author:
- first_name: Linghui
  full_name: Luo, Linghui
  last_name: Luo
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
- first_name: Thim Frederik
  full_name: Strothmann, Thim Frederik
  id: '11319'
  last_name: Strothmann
citation:
  ama: 'Luo L, Scheideler C, Strothmann TF. MultiSkipGraph: A Self-stabilizing Overlay
    Network that Maintains Monotonic Searchability. In: <i>Proceedings of the 2019
    IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS ’19)</i>.
    ; 2019.'
  apa: 'Luo, L., Scheideler, C., &#38; Strothmann, T. F. (2019). MultiSkipGraph: A
    Self-stabilizing Overlay Network that Maintains Monotonic Searchability. In <i>Proceedings
    of the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium
    (IPDPS ’19)</i>. Rio de Janeiro, Brazil.'
  bibtex: '@inproceedings{Luo_Scheideler_Strothmann_2019, title={MultiSkipGraph: A
    Self-stabilizing Overlay Network that Maintains Monotonic Searchability}, booktitle={Proceedings
    of the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium
    (IPDPS ’19)}, author={Luo, Linghui and Scheideler, Christian and Strothmann, Thim
    Frederik}, year={2019} }'
  chicago: 'Luo, Linghui, Christian Scheideler, and Thim Frederik Strothmann. “MultiSkipGraph:
    A Self-Stabilizing Overlay Network That Maintains Monotonic Searchability.” In
    <i>Proceedings of the 2019 IEEE 33rd International Parallel and Distributed Processing
    Symposium (IPDPS ’19)</i>, 2019.'
  ieee: 'L. Luo, C. Scheideler, and T. F. Strothmann, “MultiSkipGraph: A Self-stabilizing
    Overlay Network that Maintains Monotonic Searchability,” in <i>Proceedings of
    the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium
    (IPDPS ’19)</i>, Rio de Janeiro, Brazil, 2019.'
  mla: 'Luo, Linghui, et al. “MultiSkipGraph: A Self-Stabilizing Overlay Network That
    Maintains Monotonic Searchability.” <i>Proceedings of the 2019 IEEE 33rd International
    Parallel and Distributed Processing Symposium (IPDPS ’19)</i>, 2019.'
  short: 'L. Luo, C. Scheideler, T.F. Strothmann, in: Proceedings of the 2019 IEEE
    33rd International Parallel and Distributed Processing Symposium (IPDPS ’19),
    2019.'
conference:
  end_date: 2019-05-25
  location: Rio de Janeiro, Brazil
  name: 2019 IEEE 33rd International Parallel and Distributed Processing Symposium
    (IPDPS '19)
  start_date: 2019-05-20
date_created: 2019-02-12T13:39:20Z
date_updated: 2022-01-06T07:03:42Z
ddc:
- '006'
department:
- _id: '66'
file:
- access_level: closed
  content_type: application/pdf
  creator: thim
  date_created: 2019-02-12T13:37:35Z
  date_updated: 2019-02-12T13:37:35Z
  file_id: '7637'
  file_name: IPDPS_main.pdf
  file_size: 372026
  relation: main_file
file_date_updated: 2019-02-12T13:37:35Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '5'
  name: SFB 901 - Subproject A1
- _id: '1'
  name: SFB 901
publication: Proceedings of the 2019 IEEE 33rd International Parallel and Distributed
  Processing Symposium (IPDPS '19)
status: public
title: 'MultiSkipGraph: A Self-stabilizing Overlay Network that Maintains Monotonic
  Searchability'
type: conference
user_id: '477'
year: '2019'
...
---
_id: '8534'
abstract:
- lang: eng
  text: "We propose two protocols for distributed priority queues (denoted by 'heap'
    for simplicity in this paper) called SKEAP and SEAP. SKEAP realizes a distributed
    heap for a constant amount of priorities and SEAP one for an arbitrary amount.
    Both protocols build on an overlay, which induces an aggregation tree on which
    heap operations are aggregated in batches, ensuring that our protocols scale even
    for a high rate of incoming requests. As part of SEAP we provide a novel distributed
    protocol for the k-selection problem that runs in time O(log n) w.h.p. SKEAP guarantees
    sequential consistency for its heap operations, while SEAP guarantees serializability.
    SKEAP and SEAP provide logarithmic runtimes w.h.p. on all their operations. \r\nSKEAP
    and SEAP provide logarithmic runtimes w.h.p. on all their operations with SEAP
    having to use only O(log n) bit messages."
author:
- first_name: Michael
  full_name: Feldmann, Michael
  id: '23538'
  last_name: Feldmann
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
citation:
  ama: 'Feldmann M, Scheideler C. Skeap &#38; Seap: Scalable Distributed Priority
    Queues for Constant and Arbitrary Priorities. In: <i>Proceedings of the 31st ACM
    Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>. ACM; 2019:287--296.
    doi:<a href="https://doi.org/10.1145/3323165.3323193">10.1145/3323165.3323193</a>'
  apa: 'Feldmann, M., &#38; Scheideler, C. (2019). Skeap &#38; Seap: Scalable Distributed
    Priority Queues for Constant and Arbitrary Priorities. In <i>Proceedings of the
    31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i> (pp.
    287--296). ACM. <a href="https://doi.org/10.1145/3323165.3323193">https://doi.org/10.1145/3323165.3323193</a>'
  bibtex: '@inproceedings{Feldmann_Scheideler_2019, title={Skeap &#38; Seap: Scalable
    Distributed Priority Queues for Constant and Arbitrary Priorities}, DOI={<a href="https://doi.org/10.1145/3323165.3323193">10.1145/3323165.3323193</a>},
    booktitle={Proceedings of the 31st ACM Symposium on Parallelism in Algorithms
    and Architectures (SPAA)}, publisher={ACM}, author={Feldmann, Michael and Scheideler,
    Christian}, year={2019}, pages={287--296} }'
  chicago: 'Feldmann, Michael, and Christian Scheideler. “Skeap &#38; Seap: Scalable
    Distributed Priority Queues for Constant and Arbitrary Priorities.” In <i>Proceedings
    of the 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>,
    287--296. ACM, 2019. <a href="https://doi.org/10.1145/3323165.3323193">https://doi.org/10.1145/3323165.3323193</a>.'
  ieee: 'M. Feldmann and C. Scheideler, “Skeap &#38; Seap: Scalable Distributed Priority
    Queues for Constant and Arbitrary Priorities,” in <i>Proceedings of the 31st ACM
    Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 2019, pp.
    287--296.'
  mla: 'Feldmann, Michael, and Christian Scheideler. “Skeap &#38; Seap: Scalable Distributed
    Priority Queues for Constant and Arbitrary Priorities.” <i>Proceedings of the
    31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>,
    ACM, 2019, pp. 287--296, doi:<a href="https://doi.org/10.1145/3323165.3323193">10.1145/3323165.3323193</a>.'
  short: 'M. Feldmann, C. Scheideler, in: Proceedings of the 31st ACM Symposium on
    Parallelism in Algorithms and Architectures (SPAA), ACM, 2019, pp. 287--296.'
date_created: 2019-03-21T14:37:26Z
date_updated: 2022-01-06T07:03:56Z
ddc:
- '004'
department:
- _id: '79'
doi: 10.1145/3323165.3323193
external_id:
  arxiv:
  - '1805.03472'
file:
- access_level: closed
  content_type: application/pdf
  creator: ups
  date_created: 2019-08-26T09:14:32Z
  date_updated: 2019-08-26T09:14:32Z
  file_id: '12954'
  file_name: p287-feldmann.pdf
  file_size: 1295095
  relation: main_file
  success: 1
file_date_updated: 2019-08-26T09:14:32Z
has_accepted_license: '1'
language:
- iso: eng
page: 287--296
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '5'
  name: SFB 901 - Subproject A1
publication: Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and
  Architectures (SPAA)
publisher: ACM
status: public
title: 'Skeap & Seap: Scalable Distributed Priority Queues for Constant and Arbitrary
  Priorities'
type: conference
user_id: '477'
year: '2019'
...
---
_id: '8871'
author:
- first_name: John
  full_name: Augustine, John
  last_name: Augustine
- first_name: Mohsen
  full_name: Ghaffari, Mohsen
  last_name: Ghaffari
- first_name: Robert
  full_name: Gmyr, Robert
  last_name: Gmyr
- first_name: Kristian
  full_name: Hinnenthal, Kristian
  id: '32229'
  last_name: Hinnenthal
- first_name: Fabian
  full_name: Kuhn, Fabian
  last_name: Kuhn
- first_name: Jason
  full_name: Li, Jason
  last_name: Li
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
citation:
  ama: 'Augustine J, Ghaffari M, Gmyr R, et al. Distributed Computation in Node-Capacitated
    Networks. In: <i>Proceedings of the 31st ACM Symposium on Parallelism in Algorithms
    and Architectures</i>. ACM; 2019:69--79. doi:<a href="https://doi.org/10.1145/3323165.3323195">10.1145/3323165.3323195</a>'
  apa: Augustine, J., Ghaffari, M., Gmyr, R., Hinnenthal, K., Kuhn, F., Li, J., &#38;
    Scheideler, C. (2019). Distributed Computation in Node-Capacitated Networks. In
    <i>Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures</i>
    (pp. 69--79). ACM. <a href="https://doi.org/10.1145/3323165.3323195">https://doi.org/10.1145/3323165.3323195</a>
  bibtex: '@inproceedings{Augustine_Ghaffari_Gmyr_Hinnenthal_Kuhn_Li_Scheideler_2019,
    title={Distributed Computation in Node-Capacitated Networks}, DOI={<a href="https://doi.org/10.1145/3323165.3323195">10.1145/3323165.3323195</a>},
    booktitle={Proceedings of the 31st ACM Symposium on Parallelism in Algorithms
    and Architectures}, publisher={ACM}, author={Augustine, John and Ghaffari, Mohsen
    and Gmyr, Robert and Hinnenthal, Kristian and Kuhn, Fabian and Li, Jason and Scheideler,
    Christian}, year={2019}, pages={69--79} }'
  chicago: Augustine, John, Mohsen Ghaffari, Robert Gmyr, Kristian Hinnenthal, Fabian
    Kuhn, Jason Li, and Christian Scheideler. “Distributed Computation in Node-Capacitated
    Networks.” In <i>Proceedings of the 31st ACM Symposium on Parallelism in Algorithms
    and Architectures</i>, 69--79. ACM, 2019. <a href="https://doi.org/10.1145/3323165.3323195">https://doi.org/10.1145/3323165.3323195</a>.
  ieee: J. Augustine <i>et al.</i>, “Distributed Computation in Node-Capacitated Networks,”
    in <i>Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures</i>,
    2019, pp. 69--79.
  mla: Augustine, John, et al. “Distributed Computation in Node-Capacitated Networks.”
    <i>Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures</i>,
    ACM, 2019, pp. 69--79, doi:<a href="https://doi.org/10.1145/3323165.3323195">10.1145/3323165.3323195</a>.
  short: 'J. Augustine, M. Ghaffari, R. Gmyr, K. Hinnenthal, F. Kuhn, J. Li, C. Scheideler,
    in: Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures,
    ACM, 2019, pp. 69--79.'
date_created: 2019-04-10T08:20:34Z
date_updated: 2022-01-06T07:04:04Z
ddc:
- '004'
department:
- _id: '79'
doi: 10.1145/3323165.3323195
file:
- access_level: closed
  content_type: application/pdf
  creator: ups
  date_created: 2019-08-26T11:17:58Z
  date_updated: 2019-08-26T11:17:58Z
  file_id: '12964'
  file_name: p69-augustine.pdf
  file_size: 1275192
  relation: main_file
  success: 1
file_date_updated: 2019-08-26T11:17:58Z
has_accepted_license: '1'
language:
- iso: eng
page: 69--79
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '5'
  name: SFB 901 - Subproject A1
publication: Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and
  Architectures
publisher: ACM
status: public
title: Distributed Computation in Node-Capacitated Networks
type: conference
user_id: '477'
year: '2019'
...
---
_id: '10586'
abstract:
- lang: eng
  text: We consider the problem of transforming a given graph G_s into a desired graph
    G_t by applying a minimum number of primitives from a particular set of local
    graph transformation primitives. These primitives are local in the sense that
    each node can apply them based on local knowledge and by affecting only its 1-neighborhood.
    Although the specific set of primitives we consider makes it possible to transform
    any (weakly) connected graph into any other (weakly) connected graph consisting
    of the same nodes, they cannot disconnect the graph or introduce new nodes into
    the graph, making them ideal in the context of supervised overlay network transformations.
    We prove that computing a minimum sequence of primitive applications (even centralized)
    for arbitrary G_s and G_t is NP-hard, which we conjecture to hold for any set
    of local graph transformation primitives satisfying the aforementioned properties.
    On the other hand, we show that this problem admits a polynomial time algorithm
    with a constant approximation ratio.
author:
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
- first_name: Alexander
  full_name: Setzer, Alexander
  id: '11108'
  last_name: Setzer
citation:
  ama: 'Scheideler C, Setzer A. On the Complexity of Local Graph Transformations.
    In: <i>Proceedings of the 46th International Colloquium on Automata, Languages,
    and Programming</i>. Vol 132. LIPIcs. Dagstuhl Publishing; 2019:150:1--150:14.
    doi:<a href="https://doi.org/10.4230/LIPICS.ICALP.2019.150">10.4230/LIPICS.ICALP.2019.150</a>'
  apa: 'Scheideler, C., &#38; Setzer, A. (2019). On the Complexity of Local Graph
    Transformations. In <i>Proceedings of the 46th International Colloquium on Automata,
    Languages, and Programming</i> (Vol. 132, pp. 150:1--150:14). Patras, Greece:
    Dagstuhl Publishing. <a href="https://doi.org/10.4230/LIPICS.ICALP.2019.150">https://doi.org/10.4230/LIPICS.ICALP.2019.150</a>'
  bibtex: '@inproceedings{Scheideler_Setzer_2019, series={LIPIcs}, title={On the Complexity
    of Local Graph Transformations}, volume={132}, DOI={<a href="https://doi.org/10.4230/LIPICS.ICALP.2019.150">10.4230/LIPICS.ICALP.2019.150</a>},
    booktitle={Proceedings of the 46th International Colloquium on Automata, Languages,
    and Programming}, publisher={Dagstuhl Publishing}, author={Scheideler, Christian
    and Setzer, Alexander}, year={2019}, pages={150:1--150:14}, collection={LIPIcs}
    }'
  chicago: Scheideler, Christian, and Alexander Setzer. “On the Complexity of Local
    Graph Transformations.” In <i>Proceedings of the 46th International Colloquium
    on Automata, Languages, and Programming</i>, 132:150:1--150:14. LIPIcs. Dagstuhl
    Publishing, 2019. <a href="https://doi.org/10.4230/LIPICS.ICALP.2019.150">https://doi.org/10.4230/LIPICS.ICALP.2019.150</a>.
  ieee: C. Scheideler and A. Setzer, “On the Complexity of Local Graph Transformations,”
    in <i>Proceedings of the 46th International Colloquium on Automata, Languages,
    and Programming</i>, Patras, Greece, 2019, vol. 132, pp. 150:1--150:14.
  mla: Scheideler, Christian, and Alexander Setzer. “On the Complexity of Local Graph
    Transformations.” <i>Proceedings of the 46th International Colloquium on Automata,
    Languages, and Programming</i>, vol. 132, Dagstuhl Publishing, 2019, pp. 150:1--150:14,
    doi:<a href="https://doi.org/10.4230/LIPICS.ICALP.2019.150">10.4230/LIPICS.ICALP.2019.150</a>.
  short: 'C. Scheideler, A. Setzer, in: Proceedings of the 46th International Colloquium
    on Automata, Languages, and Programming, Dagstuhl Publishing, 2019, pp. 150:1--150:14.'
conference:
  end_date: 2019-07-12
  location: Patras, Greece
  name: ICALP 2019
  start_date: 2019-07-09
date_created: 2019-07-08T17:19:01Z
date_updated: 2022-01-06T06:50:45Z
ddc:
- '004'
department:
- _id: '79'
doi: 10.4230/LIPICS.ICALP.2019.150
file:
- access_level: closed
  content_type: application/pdf
  creator: ups
  date_created: 2019-08-26T09:21:27Z
  date_updated: 2019-08-26T09:21:27Z
  file_id: '12955'
  file_name: LIPIcs-ICALP-2019-150.pdf
  file_size: 537649
  relation: main_file
  success: 1
file_date_updated: 2019-08-26T09:21:27Z
has_accepted_license: '1'
intvolume: '       132'
keyword:
- Graphs transformations
- NP-hardness
- approximation algorithms
language:
- iso: eng
page: 150:1--150:14
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subproject A1
- _id: '2'
  name: SFB 901 - Project Area A
publication: Proceedings of the 46th International Colloquium on Automata, Languages,
  and Programming
publication_status: published
publisher: Dagstuhl Publishing
series_title: LIPIcs
status: public
title: On the Complexity of Local Graph Transformations
type: conference
user_id: '477'
volume: 132
year: '2019'
...
---
_id: '12870'
author:
- first_name: Björn
  full_name: Feldkord, Björn
  id: '22704'
  last_name: Feldkord
- first_name: Till
  full_name: Knollmann, Till
  id: '39241'
  last_name: Knollmann
  orcid: 0000-0003-2014-4696
- first_name: Manuel
  full_name: Malatyali, Manuel
  last_name: Malatyali
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
citation:
  ama: 'Feldkord B, Knollmann T, Malatyali M, Meyer auf der Heide F. Managing Multiple
    Mobile Resources. In: <i>Proceedings of the 17th Workshop on Approximation and
    Online Algorithms (WAOA)</i>. Springer; 2019:120-137. doi:<a href="https://doi.org/10.1007/978-3-030-39479-0_9">10.1007/978-3-030-39479-0_9</a>'
  apa: Feldkord, B., Knollmann, T., Malatyali, M., &#38; Meyer auf der Heide, F. (2019).
    Managing Multiple Mobile Resources. In <i>Proceedings of the 17th Workshop on
    Approximation and Online Algorithms (WAOA)</i> (pp. 120–137). Springer. <a href="https://doi.org/10.1007/978-3-030-39479-0_9">https://doi.org/10.1007/978-3-030-39479-0_9</a>
  bibtex: '@inproceedings{Feldkord_Knollmann_Malatyali_Meyer auf der Heide_2019, title={Managing
    Multiple Mobile Resources}, DOI={<a href="https://doi.org/10.1007/978-3-030-39479-0_9">10.1007/978-3-030-39479-0_9</a>},
    booktitle={Proceedings of the 17th Workshop on Approximation and Online Algorithms
    (WAOA)}, publisher={Springer}, author={Feldkord, Björn and Knollmann, Till and
    Malatyali, Manuel and Meyer auf der Heide, Friedhelm}, year={2019}, pages={120–137}
    }'
  chicago: Feldkord, Björn, Till Knollmann, Manuel Malatyali, and Friedhelm Meyer
    auf der Heide. “Managing Multiple Mobile Resources.” In <i>Proceedings of the
    17th Workshop on Approximation and Online Algorithms (WAOA)</i>, 120–37. Springer,
    2019. <a href="https://doi.org/10.1007/978-3-030-39479-0_9">https://doi.org/10.1007/978-3-030-39479-0_9</a>.
  ieee: B. Feldkord, T. Knollmann, M. Malatyali, and F. Meyer auf der Heide, “Managing
    Multiple Mobile Resources,” in <i>Proceedings of the 17th Workshop on Approximation
    and Online Algorithms (WAOA)</i>, 2019, pp. 120–137.
  mla: Feldkord, Björn, et al. “Managing Multiple Mobile Resources.” <i>Proceedings
    of the 17th Workshop on Approximation and Online Algorithms (WAOA)</i>, Springer,
    2019, pp. 120–37, doi:<a href="https://doi.org/10.1007/978-3-030-39479-0_9">10.1007/978-3-030-39479-0_9</a>.
  short: 'B. Feldkord, T. Knollmann, M. Malatyali, F. Meyer auf der Heide, in: Proceedings
    of the 17th Workshop on Approximation and Online Algorithms (WAOA), Springer,
    2019, pp. 120–137.'
date_created: 2019-07-22T09:00:05Z
date_updated: 2022-01-06T06:51:20Z
department:
- _id: '63'
doi: 10.1007/978-3-030-39479-0_9
external_id:
  arxiv:
  - '1907.09834'
language:
- iso: eng
page: 120 - 137
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 17th Workshop on Approximation and Online Algorithms
  (WAOA)
publication_status: published
publisher: Springer
status: public
title: Managing Multiple Mobile Resources
type: conference
user_id: '22704'
year: '2019'
...
---
_id: '15627'
author:
- first_name: John
  full_name: Augustine, John
  last_name: Augustine
- first_name: Kristian
  full_name: Hinnenthal, Kristian
  id: '32229'
  last_name: Hinnenthal
- first_name: Fabian
  full_name: Kuhn, Fabian
  last_name: Kuhn
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
- first_name: Philipp
  full_name: Schneider, Philipp
  last_name: Schneider
citation:
  ama: 'Augustine J, Hinnenthal K, Kuhn F, Scheideler C, Schneider P. Shortest Paths
    in a Hybrid Network Model. In: <i>Proceedings of the Fourteenth Annual ACM-SIAM
    Symposium on Discrete Algorithms</i>. Philadelphia, PA; 2019:1280-1299. doi:<a
    href="https://doi.org/10.1137/1.9781611975994.78">10.1137/1.9781611975994.78</a>'
  apa: Augustine, J., Hinnenthal, K., Kuhn, F., Scheideler, C., &#38; Schneider, P.
    (2019). Shortest Paths in a Hybrid Network Model. In <i>Proceedings of the Fourteenth
    Annual ACM-SIAM Symposium on Discrete Algorithms</i> (pp. 1280–1299). Philadelphia,
    PA. <a href="https://doi.org/10.1137/1.9781611975994.78">https://doi.org/10.1137/1.9781611975994.78</a>
  bibtex: '@inproceedings{Augustine_Hinnenthal_Kuhn_Scheideler_Schneider_2019, place={Philadelphia,
    PA}, title={Shortest Paths in a Hybrid Network Model}, DOI={<a href="https://doi.org/10.1137/1.9781611975994.78">10.1137/1.9781611975994.78</a>},
    booktitle={Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete
    Algorithms}, author={Augustine, John and Hinnenthal, Kristian and Kuhn, Fabian
    and Scheideler, Christian and Schneider, Philipp}, year={2019}, pages={1280–1299}
    }'
  chicago: Augustine, John, Kristian Hinnenthal, Fabian Kuhn, Christian Scheideler,
    and Philipp Schneider. “Shortest Paths in a Hybrid Network Model.” In <i>Proceedings
    of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms</i>, 1280–99.
    Philadelphia, PA, 2019. <a href="https://doi.org/10.1137/1.9781611975994.78">https://doi.org/10.1137/1.9781611975994.78</a>.
  ieee: J. Augustine, K. Hinnenthal, F. Kuhn, C. Scheideler, and P. Schneider, “Shortest
    Paths in a Hybrid Network Model,” in <i>Proceedings of the Fourteenth Annual ACM-SIAM
    Symposium on Discrete Algorithms</i>, 2019, pp. 1280–1299.
  mla: Augustine, John, et al. “Shortest Paths in a Hybrid Network Model.” <i>Proceedings
    of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms</i>, 2019,
    pp. 1280–99, doi:<a href="https://doi.org/10.1137/1.9781611975994.78">10.1137/1.9781611975994.78</a>.
  short: 'J. Augustine, K. Hinnenthal, F. Kuhn, C. Scheideler, P. Schneider, in: Proceedings
    of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, Philadelphia,
    PA, 2019, pp. 1280–1299.'
date_created: 2020-01-22T09:07:36Z
date_updated: 2022-01-06T06:52:30Z
doi: 10.1137/1.9781611975994.78
language:
- iso: eng
page: 1280-1299
place: Philadelphia, PA
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 Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms
publication_identifier:
  isbn:
  - '9781611975994'
publication_status: published
status: public
title: Shortest Paths in a Hybrid Network Model
type: conference
user_id: '32229'
year: '2019'
...
---
_id: '14829'
citation:
  ama: Scheideler C, Berenbrink P, eds. <i>The 31st ACM Symposium on Parallelism in
    Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June 22-24, 2019</i>.
    ACM; 2019. doi:<a href="https://doi.org/10.1145/3323165">10.1145/3323165</a>
  apa: Scheideler, C., &#38; Berenbrink, P. (Eds.). (2019). <i>The 31st ACM Symposium
    on Parallelism in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June
    22-24, 2019</i>. ACM. <a href="https://doi.org/10.1145/3323165">https://doi.org/10.1145/3323165</a>
  bibtex: '@book{Scheideler_Berenbrink_2019, title={The 31st ACM Symposium on Parallelism
    in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June 22-24, 2019},
    DOI={<a href="https://doi.org/10.1145/3323165">10.1145/3323165</a>}, publisher={ACM},
    year={2019} }'
  chicago: Scheideler, Christian, and Petra Berenbrink, eds. <i>The 31st ACM Symposium
    on Parallelism in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June
    22-24, 2019</i>. ACM, 2019. <a href="https://doi.org/10.1145/3323165">https://doi.org/10.1145/3323165</a>.
  ieee: C. Scheideler and P. Berenbrink, Eds., <i>The 31st ACM Symposium on Parallelism
    in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June 22-24, 2019</i>.
    ACM, 2019.
  mla: Scheideler, Christian, and Petra Berenbrink, editors. <i>The 31st ACM Symposium
    on Parallelism in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June
    22-24, 2019</i>. ACM, 2019, doi:<a href="https://doi.org/10.1145/3323165">10.1145/3323165</a>.
  short: C. Scheideler, P. Berenbrink, eds., The 31st ACM Symposium on Parallelism
    in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June 22-24, 2019,
    ACM, 2019.
date_created: 2019-11-06T10:43:41Z
date_updated: 2022-01-06T06:52:07Z
department:
- _id: '79'
doi: 10.1145/3323165
editor:
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
- first_name: Petra
  full_name: Berenbrink, Petra
  last_name: Berenbrink
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '5'
  name: SFB 901 - Subproject A1
publication_identifier:
  isbn:
  - 978-1-4503-6184-2
publisher: ACM
status: public
title: The 31st ACM Symposium on Parallelism in Algorithms and Architectures, SPAA
  2019, Phoenix, AZ, USA, June 22-24, 2019
type: conference_editor
user_id: '477'
year: '2019'
...
---
_id: '13873'
article_number: '14'
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. The Mobile Server Problem. <i>ACM Transactions
    on Parallel Computing (TOPC)</i>. 2019;6(3). doi:<a href="https://doi.org/10.1145/3364204">10.1145/3364204</a>
  apa: Feldkord, B., &#38; Meyer auf der Heide, F. (2019). The Mobile Server Problem.
    <i>ACM Transactions on Parallel Computing (TOPC)</i>, <i>6</i>(3). <a href="https://doi.org/10.1145/3364204">https://doi.org/10.1145/3364204</a>
  bibtex: '@article{Feldkord_Meyer auf der Heide_2019, title={The Mobile Server Problem},
    volume={6}, DOI={<a href="https://doi.org/10.1145/3364204">10.1145/3364204</a>},
    number={314}, journal={ACM Transactions on Parallel Computing (TOPC)}, author={Feldkord,
    Björn and Meyer auf der Heide, Friedhelm}, year={2019} }'
  chicago: Feldkord, Björn, and Friedhelm Meyer auf der Heide. “The Mobile Server
    Problem.” <i>ACM Transactions on Parallel Computing (TOPC)</i> 6, no. 3 (2019).
    <a href="https://doi.org/10.1145/3364204">https://doi.org/10.1145/3364204</a>.
  ieee: B. Feldkord and F. Meyer auf der Heide, “The Mobile Server Problem,” <i>ACM
    Transactions on Parallel Computing (TOPC)</i>, vol. 6, no. 3, 2019.
  mla: Feldkord, Björn, and Friedhelm Meyer auf der Heide. “The Mobile Server Problem.”
    <i>ACM Transactions on Parallel Computing (TOPC)</i>, vol. 6, no. 3, 14, 2019,
    doi:<a href="https://doi.org/10.1145/3364204">10.1145/3364204</a>.
  short: B. Feldkord, F. Meyer auf der Heide, ACM Transactions on Parallel Computing
    (TOPC) 6 (2019).
date_created: 2019-10-16T07:06:22Z
date_updated: 2022-01-06T06:51:46Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.1145/3364204
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2020-01-24T08:12:58Z
  date_updated: 2020-01-24T08:12:58Z
  file_id: '15632'
  file_name: DissertationFeldkord.pdf
  file_size: 633652
  relation: main_file
  success: 1
file_date_updated: 2020-01-24T08:12:58Z
has_accepted_license: '1'
intvolume: '         6'
issue: '3'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '5'
  name: SFB 901 - Subproject A1
publication: ACM Transactions on Parallel Computing (TOPC)
publication_status: published
status: public
title: The Mobile Server Problem
type: journal_article
user_id: '15504'
volume: 6
year: '2019'
...
---
_id: '13942'
author:
- 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
citation:
  ama: 'Markarian C, Meyer auf der Heide F. Online Algorithms for Leasing Vertex Cover
    and Leasing Non-metric Facility Location. In: <i>Proceedings of the 8th International
    Conference on Operations Research and Enterprise Systems</i>. SciTePress; 2019:315-321.
    doi:<a href="https://doi.org/10.5220/0007369503150321">10.5220/0007369503150321</a>'
  apa: Markarian, C., &#38; Meyer auf der Heide, F. (2019). Online Algorithms for
    Leasing Vertex Cover and Leasing Non-metric Facility Location. In <i>Proceedings
    of the 8th International Conference on Operations Research and Enterprise Systems</i>
    (pp. 315–321). SciTePress. <a href="https://doi.org/10.5220/0007369503150321">https://doi.org/10.5220/0007369503150321</a>
  bibtex: '@inproceedings{Markarian_Meyer auf der Heide_2019, title={Online Algorithms
    for Leasing Vertex Cover and Leasing Non-metric Facility Location}, DOI={<a href="https://doi.org/10.5220/0007369503150321">10.5220/0007369503150321</a>},
    booktitle={Proceedings of the 8th International Conference on Operations Research
    and Enterprise Systems}, publisher={SciTePress}, author={Markarian, Christine
    and Meyer auf der Heide, Friedhelm}, year={2019}, pages={315–321} }'
  chicago: Markarian, Christine, and Friedhelm Meyer auf der Heide. “Online Algorithms
    for Leasing Vertex Cover and Leasing Non-Metric Facility Location.” In <i>Proceedings
    of the 8th International Conference on Operations Research and Enterprise Systems</i>,
    315–21. SciTePress, 2019. <a href="https://doi.org/10.5220/0007369503150321">https://doi.org/10.5220/0007369503150321</a>.
  ieee: C. Markarian and F. Meyer auf der Heide, “Online Algorithms for Leasing Vertex
    Cover and Leasing Non-metric Facility Location,” in <i>Proceedings of the 8th
    International Conference on Operations Research and Enterprise Systems</i>, 2019,
    pp. 315–321.
  mla: Markarian, Christine, and Friedhelm Meyer auf der Heide. “Online Algorithms
    for Leasing Vertex Cover and Leasing Non-Metric Facility Location.” <i>Proceedings
    of the 8th International Conference on Operations Research and Enterprise Systems</i>,
    SciTePress, 2019, pp. 315–21, doi:<a href="https://doi.org/10.5220/0007369503150321">10.5220/0007369503150321</a>.
  short: 'C. Markarian, F. Meyer auf der Heide, in: Proceedings of the 8th International
    Conference on Operations Research and Enterprise Systems, SciTePress, 2019, pp.
    315–321.'
date_created: 2019-10-21T13:42:50Z
date_updated: 2022-01-06T06:51:47Z
department:
- _id: '63'
doi: 10.5220/0007369503150321
language:
- iso: eng
page: 315-321
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 8th International Conference on Operations Research
  and Enterprise Systems
publisher: SciTePress
status: public
title: Online Algorithms for Leasing Vertex Cover and Leasing Non-metric Facility
  Location
type: conference
user_id: '477'
year: '2019'
...
---
_id: '13946'
author:
- first_name: Faisal N.
  full_name: Abu-Khzam, Faisal N.
  last_name: Abu-Khzam
- first_name: Shouwei
  full_name: Li, Shouwei
  last_name: Li
- 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: Pavel
  full_name: Podlipyan, Pavel
  last_name: Podlipyan
citation:
  ama: Abu-Khzam FN, Li S, Markarian C, Meyer auf der Heide F, Podlipyan P. Efficient
    parallel algorithms for parameterized problems. <i>Theoretical Computer Science</i>.
    2019;786:2-12. doi:<a href="https://doi.org/10.1016/j.tcs.2018.11.006">10.1016/j.tcs.2018.11.006</a>
  apa: Abu-Khzam, F. N., Li, S., Markarian, C., Meyer auf der Heide, F., &#38; Podlipyan,
    P. (2019). Efficient parallel algorithms for parameterized problems. <i>Theoretical
    Computer Science</i>, <i>786</i>, 2–12. <a href="https://doi.org/10.1016/j.tcs.2018.11.006">https://doi.org/10.1016/j.tcs.2018.11.006</a>
  bibtex: '@article{Abu-Khzam_Li_Markarian_Meyer auf der Heide_Podlipyan_2019, title={Efficient
    parallel algorithms for parameterized problems}, volume={786}, DOI={<a href="https://doi.org/10.1016/j.tcs.2018.11.006">10.1016/j.tcs.2018.11.006</a>},
    journal={Theoretical Computer Science}, author={Abu-Khzam, Faisal N. and Li, Shouwei
    and Markarian, Christine and Meyer auf der Heide, Friedhelm and Podlipyan, Pavel},
    year={2019}, pages={2–12} }'
  chicago: 'Abu-Khzam, Faisal N., Shouwei Li, Christine Markarian, Friedhelm Meyer
    auf der Heide, and Pavel Podlipyan. “Efficient Parallel Algorithms for Parameterized
    Problems.” <i>Theoretical Computer Science</i> 786 (2019): 2–12. <a href="https://doi.org/10.1016/j.tcs.2018.11.006">https://doi.org/10.1016/j.tcs.2018.11.006</a>.'
  ieee: F. N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, and P. Podlipyan,
    “Efficient parallel algorithms for parameterized problems,” <i>Theoretical Computer
    Science</i>, vol. 786, pp. 2–12, 2019.
  mla: Abu-Khzam, Faisal N., et al. “Efficient Parallel Algorithms for Parameterized
    Problems.” <i>Theoretical Computer Science</i>, vol. 786, 2019, pp. 2–12, doi:<a
    href="https://doi.org/10.1016/j.tcs.2018.11.006">10.1016/j.tcs.2018.11.006</a>.
  short: F.N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, P. Podlipyan,
    Theoretical Computer Science 786 (2019) 2–12.
date_created: 2019-10-21T13:57:06Z
date_updated: 2022-01-06T06:51:48Z
department:
- _id: '63'
doi: 10.1016/j.tcs.2018.11.006
intvolume: '       786'
language:
- iso: eng
page: 2-12
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subproject A1
- _id: '2'
  name: SFB 901 - Project Area A
publication: Theoretical Computer Science
status: public
title: Efficient parallel algorithms for parameterized problems
type: journal_article
user_id: '15415'
volume: 786
year: '2019'
...
---
_id: '14539'
author:
- first_name: Jannik
  full_name: Castenow, Jannik
  id: '38705'
  last_name: Castenow
- first_name: Christina
  full_name: Kolb, Christina
  id: '43647'
  last_name: Kolb
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
citation:
  ama: 'Castenow J, Kolb C, Scheideler C. A Bounding Box Overlay for Competitive Routing
    in Hybrid Communication Networks. In: <i>Proceedings of the 26th International
    Colloquium on Structural Information and Communication Complexity (SIROCCO)</i>.
    ; 2019:345-348. doi:<a href="https://doi.org/10.1007/978-3-030-24922-9\_26">10.1007/978-3-030-24922-9\_26</a>'
  apa: Castenow, J., Kolb, C., &#38; Scheideler, C. (2019). A Bounding Box Overlay
    for Competitive Routing in Hybrid Communication Networks. In <i>Proceedings of
    the 26th International Colloquium on Structural Information and Communication
    Complexity (SIROCCO)</i> (pp. 345–348). L’Aquila, Italy. <a href="https://doi.org/10.1007/978-3-030-24922-9\_26">https://doi.org/10.1007/978-3-030-24922-9\_26</a>
  bibtex: '@inproceedings{Castenow_Kolb_Scheideler_2019, title={A Bounding Box Overlay
    for Competitive Routing in Hybrid Communication Networks}, DOI={<a href="https://doi.org/10.1007/978-3-030-24922-9\_26">10.1007/978-3-030-24922-9\_26</a>},
    booktitle={Proceedings of the 26th International Colloquium on Structural Information
    and Communication Complexity (SIROCCO)}, author={Castenow, Jannik and Kolb, Christina
    and Scheideler, Christian}, year={2019}, pages={345–348} }'
  chicago: Castenow, Jannik, Christina Kolb, and Christian Scheideler. “A Bounding
    Box Overlay for Competitive Routing in Hybrid Communication Networks.” In <i>Proceedings
    of the 26th International Colloquium on Structural Information and Communication
    Complexity (SIROCCO)</i>, 345–48, 2019. <a href="https://doi.org/10.1007/978-3-030-24922-9\_26">https://doi.org/10.1007/978-3-030-24922-9\_26</a>.
  ieee: J. Castenow, C. Kolb, and C. Scheideler, “A Bounding Box Overlay for Competitive
    Routing in Hybrid Communication Networks,” in <i>Proceedings of the 26th International
    Colloquium on Structural Information and Communication Complexity (SIROCCO)</i>,
    L’Aquila, Italy, 2019, pp. 345–348.
  mla: Castenow, Jannik, et al. “A Bounding Box Overlay for Competitive Routing in
    Hybrid Communication Networks.” <i>Proceedings of the 26th International Colloquium
    on Structural Information and Communication Complexity (SIROCCO)</i>, 2019, pp.
    345–48, doi:<a href="https://doi.org/10.1007/978-3-030-24922-9\_26">10.1007/978-3-030-24922-9\_26</a>.
  short: 'J. Castenow, C. Kolb, C. Scheideler, in: Proceedings of the 26th International
    Colloquium on Structural Information and Communication Complexity (SIROCCO), 2019,
    pp. 345–348.'
conference:
  end_date: 2019-07-04
  location: L'Aquila, Italy
  name: SIROCCO 2019
  start_date: 2019-07-01
date_created: 2019-11-04T10:09:35Z
date_updated: 2022-01-06T06:52:00Z
department:
- _id: '79'
- _id: '63'
doi: 10.1007/978-3-030-24922-9\_26
language:
- iso: eng
page: 345-348
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subproject A1
- _id: '2'
  name: SFB 901 - Project Area A
publication: Proceedings of the 26th International Colloquium on Structural Information
  and Communication Complexity (SIROCCO)
status: public
title: A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks
type: conference
user_id: '477'
year: '2019'
...
---
_id: '13182'
abstract:
- lang: eng
  text: "We consider congestion control in peer-to-peer distributed systems. \r\nThe
    problem can be reduced to the following scenario: Consider a set $V$ of $n$ peers
    (called \\emph{clients} in this paper) that want to send messages to a fixed common
    peer (called \\emph{server} in this paper).\r\nWe assume that each client $v \\in
    V$ sends a message with probability $p(v) \\in [0,1)$ and the server has a capacity
    of $\\sigma \\in \\mathbb{N}$, i.e., it can recieve at most $\\sigma$ messages
    per round and excess messages are dropped.\r\nThe server can modify these probabilities
    when clients send messages.\r\nIdeally, we wish to converge to a state with $\\sum
    p(v) = \\sigma$ and $p(v) = p(w)$ for all $v,w \\in V$.\t\r\n\r\nWe propose a
    \\emph{loosely} self-stabilizing protocol with a slightly relaxed legitimate state.
    \  \r\nOur protocol lets the system converge from \\emph{any} initial state to
    a state where $\\sum p(v) \\in \\left[\\sigma \\pm \\epsilon\\right]$ and $|p(v)-p(w)|
    \\in O(\\frac{1}{n})$. \r\nThis property is then maintained for $\\Omega(n^{\\mathfrak{c}})$
    rounds in expectation.\r\nIn particular, the initial client probabilities and
    server variables are not necessarily well-defined, i.e., they may have arbitrary
    values.\r\n\r\nOur protocol uses only $O(W + \\log n)$ bits of memory where $W$
    is length of node identifiers, making it very lightweight.\r\nFinally we state
    a lower bound on the convergence time an see that our protocol performs asymptotically
    optimal (up to some polylogarithmic factor).\r\n"
author:
- first_name: Michael
  full_name: Feldmann, Michael
  id: '23538'
  last_name: Feldmann
- first_name: Thorsten
  full_name: Götte, Thorsten
  id: '34727'
  last_name: Götte
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
citation:
  ama: 'Feldmann M, Götte T, Scheideler C. A Loosely Self-stabilizing Protocol for
    Randomized Congestion Control with Logarithmic Memory. In: <i>Proceedings of the
    21st International Symposium on Stabilization, Safety, and Security of Distributed
    Systems (SSS)</i>. Lecture Notes in Computer Science. Springer, Cham; 2019:149-164.
    doi:<a href="https://doi.org/10.1007/978-3-030-34992-9_13">https://doi.org/10.1007/978-3-030-34992-9_13</a>'
  apa: Feldmann, M., Götte, T., &#38; Scheideler, C. (2019). A Loosely Self-stabilizing
    Protocol for Randomized Congestion Control with Logarithmic Memory. In <i>Proceedings
    of the 21st International Symposium on Stabilization, Safety, and Security of
    Distributed Systems (SSS)</i> (pp. 149–164). Springer, Cham. <a href="https://doi.org/10.1007/978-3-030-34992-9_13">https://doi.org/10.1007/978-3-030-34992-9_13</a>
  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={<a href="https://doi.org/10.1007/978-3-030-34992-9_13">https://doi.org/10.1007/978-3-030-34992-9_13</a>},
    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 <i>Proceedings of the 21st International Symposium on Stabilization, Safety,
    and Security of Distributed Systems (SSS)</i>, 149–64. Lecture Notes in Computer
    Science. Springer, Cham, 2019. <a href="https://doi.org/10.1007/978-3-030-34992-9_13">https://doi.org/10.1007/978-3-030-34992-9_13</a>.
  ieee: M. Feldmann, T. Götte, and C. Scheideler, “A Loosely Self-stabilizing Protocol
    for Randomized Congestion Control with Logarithmic Memory,” in <i>Proceedings
    of the 21st International Symposium on Stabilization, Safety, and Security of
    Distributed Systems (SSS)</i>, 2019, pp. 149–164.
  mla: Feldmann, Michael, et al. “A Loosely Self-Stabilizing Protocol for Randomized
    Congestion Control with Logarithmic Memory.” <i>Proceedings of the 21st International
    Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>,
    Springer, Cham, 2019, pp. 149–64, doi:<a href="https://doi.org/10.1007/978-3-030-34992-9_13">https://doi.org/10.1007/978-3-030-34992-9_13</a>.
  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'
...