---
_id: '270'
author:
- first_name: Sebastian
  full_name: Abshoff, Sebastian
  last_name: Abshoff
citation:
  ama: Abshoff S. <i>On the Complexity of Fundamental Problems in Dynamic Ad-Hoc Networks</i>.
    Universität Paderborn; 2015.
  apa: Abshoff, S. (2015). <i>On the Complexity of Fundamental Problems in Dynamic
    Ad-hoc Networks</i>. Universität Paderborn.
  bibtex: '@book{Abshoff_2015, title={On the Complexity of Fundamental Problems in
    Dynamic Ad-hoc Networks}, publisher={Universität Paderborn}, author={Abshoff,
    Sebastian}, year={2015} }'
  chicago: Abshoff, Sebastian. <i>On the Complexity of Fundamental Problems in Dynamic
    Ad-Hoc Networks</i>. Universität Paderborn, 2015.
  ieee: S. Abshoff, <i>On the Complexity of Fundamental Problems in Dynamic Ad-hoc
    Networks</i>. Universität Paderborn, 2015.
  mla: Abshoff, Sebastian. <i>On the Complexity of Fundamental Problems in Dynamic
    Ad-Hoc Networks</i>. Universität Paderborn, 2015.
  short: S. Abshoff, On the Complexity of Fundamental Problems in Dynamic Ad-Hoc Networks,
    Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:44Z
date_updated: 2022-01-06T06:57:32Z
ddc:
- '040'
department:
- _id: '63'
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-21T09:30:02Z
  date_updated: 2018-03-21T09:30:02Z
  file_id: '1476'
  file_name: 270-Dissertation_-_Abshoff.pdf
  file_size: 448614
  relation: main_file
  success: 1
file_date_updated: 2018-03-21T09:30:02Z
has_accepted_license: '1'
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subprojekt A1
- _id: '2'
  name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
title: On the Complexity of Fundamental Problems in Dynamic Ad-hoc Networks
type: dissertation
user_id: '477'
year: '2015'
...
---
_id: '275'
abstract:
- lang: eng
  text: 'We investigate a non-cooperative game-theoretic model for the formation of
    communication networks by selfish agents. Each agent aims for a central position
    at minimum cost for creating edges. In particular, the general model (Fabrikant
    et al., PODC''03) became popular for studying the structure of the Internet or
    social networks. Despite its significance, locality in this game was first studied
    only recently (Bilò et al., SPAA''14), where a worst case locality model was presented,
    which came with a high efficiency loss in terms of quality of equilibria. Our
    main contribution is a new and more optimistic view on locality: agents are limited
    in their knowledge and actions to their local view ranges, but can probe different
    strategies and finally choose the best. We study the influence of our locality
    notion on the hardness of computing best responses, convergence to equilibria,
    and quality of equilibria. Moreover, we compare the strength of local versus non-local
    strategy changes. Our results address the gap between the original model and the
    worst case locality variant. On the bright side, our efficiency results are in
    line with observations from the original model, yet we have a non-constant lower
    bound on the Price of Anarchy.'
author:
- first_name: Andreas
  full_name: Cord-Landwehr, Andreas
  last_name: Cord-Landwehr
- first_name: Pascal
  full_name: Lenzner, Pascal
  last_name: Lenzner
citation:
  ama: 'Cord-Landwehr A, Lenzner P. Network Creation Games: Think Global - Act Local.
    In: <i>Proceedings of the 40th Conference on Mathematical Foundations of Computer
    Science (MFCS)</i>. LNCS. ; 2015:248--260. doi:<a href="https://doi.org/10.1007/978-3-662-48054-0_21">10.1007/978-3-662-48054-0_21</a>'
  apa: 'Cord-Landwehr, A., &#38; Lenzner, P. (2015). Network Creation Games: Think
    Global - Act Local. In <i>Proceedings of the 40th Conference on Mathematical Foundations
    of Computer Science (MFCS)</i> (pp. 248--260). <a href="https://doi.org/10.1007/978-3-662-48054-0_21">https://doi.org/10.1007/978-3-662-48054-0_21</a>'
  bibtex: '@inproceedings{Cord-Landwehr_Lenzner_2015, series={LNCS}, title={Network
    Creation Games: Think Global - Act Local}, DOI={<a href="https://doi.org/10.1007/978-3-662-48054-0_21">10.1007/978-3-662-48054-0_21</a>},
    booktitle={Proceedings of the 40th Conference on Mathematical Foundations of Computer
    Science (MFCS)}, author={Cord-Landwehr, Andreas and Lenzner, Pascal}, year={2015},
    pages={248--260}, collection={LNCS} }'
  chicago: 'Cord-Landwehr, Andreas, and Pascal Lenzner. “Network Creation Games: Think
    Global - Act Local.” In <i>Proceedings of the 40th Conference on Mathematical
    Foundations of Computer Science (MFCS)</i>, 248--260. LNCS, 2015. <a href="https://doi.org/10.1007/978-3-662-48054-0_21">https://doi.org/10.1007/978-3-662-48054-0_21</a>.'
  ieee: 'A. Cord-Landwehr and P. Lenzner, “Network Creation Games: Think Global -
    Act Local,” in <i>Proceedings of the 40th Conference on Mathematical Foundations
    of Computer Science (MFCS)</i>, 2015, pp. 248--260.'
  mla: 'Cord-Landwehr, Andreas, and Pascal Lenzner. “Network Creation Games: Think
    Global - Act Local.” <i>Proceedings of the 40th Conference on Mathematical Foundations
    of Computer Science (MFCS)</i>, 2015, pp. 248--260, doi:<a href="https://doi.org/10.1007/978-3-662-48054-0_21">10.1007/978-3-662-48054-0_21</a>.'
  short: 'A. Cord-Landwehr, P. Lenzner, in: Proceedings of the 40th Conference on
    Mathematical Foundations of Computer Science (MFCS), 2015, pp. 248--260.'
date_created: 2017-10-17T12:41:45Z
date_updated: 2022-01-06T06:57:40Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1007/978-3-662-48054-0_21
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-21T09:27:12Z
  date_updated: 2018-03-21T09:27:12Z
  file_id: '1472'
  file_name: 275-978-3-662-48054-0_21.pdf
  file_size: 279995
  relation: main_file
  success: 1
file_date_updated: 2018-03-21T09:27:12Z
has_accepted_license: '1'
language:
- iso: eng
page: 248--260
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subprojekt A1
- _id: '2'
  name: SFB 901 - Project Area A
publication: Proceedings of the 40th Conference on Mathematical Foundations of Computer
  Science (MFCS)
series_title: LNCS
status: public
title: 'Network Creation Games: Think Global - Act Local'
type: conference
user_id: '477'
year: '2015'
...
---
_id: '276'
author:
- first_name: Till
  full_name: Hohenberger, Till
  last_name: Hohenberger
citation:
  ama: Hohenberger T. <i>Network Creation Games with Interest Groups</i>. Universität
    Paderborn; 2015.
  apa: Hohenberger, T. (2015). <i>Network Creation Games with Interest Groups</i>.
    Universität Paderborn.
  bibtex: '@book{Hohenberger_2015, title={Network Creation Games with Interest Groups},
    publisher={Universität Paderborn}, author={Hohenberger, Till}, year={2015} }'
  chicago: Hohenberger, Till. <i>Network Creation Games with Interest Groups</i>.
    Universität Paderborn, 2015.
  ieee: T. Hohenberger, <i>Network Creation Games with Interest Groups</i>. Universität
    Paderborn, 2015.
  mla: Hohenberger, Till. <i>Network Creation Games with Interest Groups</i>. Universität
    Paderborn, 2015.
  short: T. Hohenberger, Network Creation Games with Interest Groups, Universität
    Paderborn, 2015.
date_created: 2017-10-17T12:41:45Z
date_updated: 2022-01-06T06:57:43Z
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subprojekt A1
- _id: '2'
  name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: Network Creation Games with Interest Groups
type: mastersthesis
user_id: '477'
year: '2015'
...
---
_id: '278'
author:
- first_name: Michael
  full_name: Feldmann, Michael
  id: '23538'
  last_name: Feldmann
citation:
  ama: Feldmann M. <i>Monotonic Searchability for Distributed Sorted Lists and De
    Bruijn Graphs</i>. Universität Paderborn; 2015.
  apa: Feldmann, M. (2015). <i>Monotonic Searchability for distributed sorted Lists
    and De Bruijn Graphs</i>. Universität Paderborn.
  bibtex: '@book{Feldmann_2015, title={Monotonic Searchability for distributed sorted
    Lists and De Bruijn Graphs}, publisher={Universität Paderborn}, author={Feldmann,
    Michael}, year={2015} }'
  chicago: Feldmann, Michael. <i>Monotonic Searchability for Distributed Sorted Lists
    and De Bruijn Graphs</i>. Universität Paderborn, 2015.
  ieee: M. Feldmann, <i>Monotonic Searchability for distributed sorted Lists and De
    Bruijn Graphs</i>. Universität Paderborn, 2015.
  mla: Feldmann, Michael. <i>Monotonic Searchability for Distributed Sorted Lists
    and De Bruijn Graphs</i>. Universität Paderborn, 2015.
  short: M. Feldmann, Monotonic Searchability for Distributed Sorted Lists and De
    Bruijn Graphs, Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:46Z
date_updated: 2022-01-06T06:57:45Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subprojekt A1
- _id: '2'
  name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
title: Monotonic Searchability for distributed sorted Lists and De Bruijn Graphs
type: mastersthesis
user_id: '477'
year: '2015'
...
---
_id: '240'
abstract:
- lang: eng
  text: We consider online leasing problems in which demands arrive over time and
    need to be served by leasing resources. We introduce a new model for these problems
    such that a resource can be leased for K different durations each incurring a
    different cost (longer leases cost less per time unit). Each demand i can be served
    anytime between its arrival ai and its deadline ai+di by a leased resource. The
    objective is to meet all deadlines while minimizing the total leasing costs. This
    model is a natural generalization of Meyerson’s ParkingPermitProblem (FOCS 2005)
    in which di=0 for all i. We propose an online algorithm that is Θ(K+dmaxlmin)-competitive
    where dmax and lmin denote the largest di and the shortest available lease length,
    respectively. We also extend the SetCoverLeasing problem by deadlines and give
    a competitive online algorithm which also improves on existing solutions for the
    original SetCoverLeasing problem.
author:
- first_name: Shouwei
  full_name: Li, Shouwei
  last_name: Li
- first_name: Alexander
  full_name: Mäcker, Alexander
  id: '13536'
  last_name: Mäcker
- 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: Sören
  full_name: Riechers, Sören
  last_name: Riechers
citation:
  ama: 'Li S, Mäcker A, Markarian C, Meyer auf der Heide F, Riechers S. Towards Flexible
    Demands in Online Leasing Problems. In: <i>Proceedings of the 21st Annual International
    Computing and Combinatorics Conference (COCOON)</i>. Lecture Notes in Computer
    Science. ; 2015:277--288. doi:<a href="https://doi.org/10.1007/978-3-319-21398-9_22">10.1007/978-3-319-21398-9_22</a>'
  apa: Li, S., Mäcker, A., Markarian, C., Meyer auf der Heide, F., &#38; Riechers,
    S. (2015). Towards Flexible Demands in Online Leasing Problems. In <i>Proceedings
    of the 21st Annual International Computing and Combinatorics Conference (COCOON)</i>
    (pp. 277--288). <a href="https://doi.org/10.1007/978-3-319-21398-9_22">https://doi.org/10.1007/978-3-319-21398-9_22</a>
  bibtex: '@inproceedings{Li_Mäcker_Markarian_Meyer auf der Heide_Riechers_2015, series={Lecture
    Notes in Computer Science}, title={Towards Flexible Demands in Online Leasing
    Problems}, DOI={<a href="https://doi.org/10.1007/978-3-319-21398-9_22">10.1007/978-3-319-21398-9_22</a>},
    booktitle={Proceedings of the 21st Annual International Computing and Combinatorics
    Conference (COCOON)}, author={Li, Shouwei and Mäcker, Alexander and Markarian,
    Christine and Meyer auf der Heide, Friedhelm and Riechers, Sören}, year={2015},
    pages={277--288}, collection={Lecture Notes in Computer Science} }'
  chicago: Li, Shouwei, Alexander Mäcker, Christine Markarian, Friedhelm Meyer auf
    der Heide, and Sören Riechers. “Towards Flexible Demands in Online Leasing Problems.”
    In <i>Proceedings of the 21st Annual International Computing and Combinatorics
    Conference (COCOON)</i>, 277--288. Lecture Notes in Computer Science, 2015. <a
    href="https://doi.org/10.1007/978-3-319-21398-9_22">https://doi.org/10.1007/978-3-319-21398-9_22</a>.
  ieee: S. Li, A. Mäcker, C. Markarian, F. Meyer auf der Heide, and S. Riechers, “Towards
    Flexible Demands in Online Leasing Problems,” in <i>Proceedings of the 21st Annual
    International Computing and Combinatorics Conference (COCOON)</i>, 2015, pp. 277--288.
  mla: Li, Shouwei, et al. “Towards Flexible Demands in Online Leasing Problems.”
    <i>Proceedings of the 21st Annual International Computing and Combinatorics Conference
    (COCOON)</i>, 2015, pp. 277--288, doi:<a href="https://doi.org/10.1007/978-3-319-21398-9_22">10.1007/978-3-319-21398-9_22</a>.
  short: 'S. Li, A. Mäcker, C. Markarian, F. Meyer auf der Heide, S. Riechers, in:
    Proceedings of the 21st Annual International Computing and Combinatorics Conference
    (COCOON), 2015, pp. 277--288.'
date_created: 2017-10-17T12:41:38Z
date_updated: 2022-01-06T06:56:05Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1007/978-3-319-21398-9_22
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-21T10:28:50Z
  date_updated: 2018-03-21T10:28:50Z
  file_id: '1498'
  file_name: 240-chp_3A10.1007_2F978-3-319-21398-9_22.pdf
  file_size: 264482
  relation: main_file
  success: 1
file_date_updated: 2018-03-21T10:28:50Z
has_accepted_license: '1'
page: 277--288
project:
- _id: '1'
  name: SFB 901
- _id: '16'
  name: SFB 901 - Subprojekt C4
- _id: '5'
  name: SFB 901 - Subprojekt A1
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '4'
  name: SFB 901 - Project Area C
publication: Proceedings of the 21st Annual International Computing and Combinatorics
  Conference (COCOON)
series_title: Lecture Notes in Computer Science
status: public
title: Towards Flexible Demands in Online Leasing Problems
type: conference
user_id: '15504'
year: '2015'
...
---
_id: '18003'
author:
- first_name: Thorsten
  full_name: Götte, Thorsten
  id: '34727'
  last_name: Götte
citation:
  ama: Götte T. <i>Covering and Bridging Im Selbstorganisierenden Partikelsystem Amoebabot</i>.
    Universität Paderborn; 2015.
  apa: Götte, T. (2015). <i>Covering and Bridging im selbstorganisierenden Partikelsystem
    Amoebabot</i>. Universität Paderborn.
  bibtex: '@book{Götte_2015, title={Covering and Bridging im selbstorganisierenden
    Partikelsystem Amoebabot}, publisher={Universität Paderborn}, author={Götte, Thorsten},
    year={2015} }'
  chicago: Götte, Thorsten. <i>Covering and Bridging Im Selbstorganisierenden Partikelsystem
    Amoebabot</i>. Universität Paderborn, 2015.
  ieee: T. Götte, <i>Covering and Bridging im selbstorganisierenden Partikelsystem
    Amoebabot</i>. Universität Paderborn, 2015.
  mla: Götte, Thorsten. <i>Covering and Bridging Im Selbstorganisierenden Partikelsystem
    Amoebabot</i>. Universität Paderborn, 2015.
  short: T. Götte, Covering and Bridging Im Selbstorganisierenden Partikelsystem Amoebabot,
    Universität Paderborn, 2015.
date_created: 2020-08-17T08:18:04Z
date_updated: 2022-01-06T06:53:25Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '5'
  name: SFB 901 - Subproject A1
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
title: Covering and Bridging im selbstorganisierenden Partikelsystem Amoebabot
type: bachelorsthesis
user_id: '477'
year: '2015'
...
---
_id: '18005'
author:
- first_name: Christian
  full_name: Korfmacher, Christian
  last_name: Korfmacher
citation:
  ama: Korfmacher C. <i>Implementierung Und Analyse von Cone-DHT</i>. Universität
    Paderborn; 2015.
  apa: Korfmacher, C. (2015). <i>Implementierung und Analyse von Cone-DHT</i>. Universität
    Paderborn.
  bibtex: '@book{Korfmacher_2015, title={Implementierung und Analyse von Cone-DHT},
    publisher={Universität Paderborn}, author={Korfmacher, Christian}, year={2015}
    }'
  chicago: Korfmacher, Christian. <i>Implementierung Und Analyse von Cone-DHT</i>.
    Universität Paderborn, 2015.
  ieee: C. Korfmacher, <i>Implementierung und Analyse von Cone-DHT</i>. Universität
    Paderborn, 2015.
  mla: Korfmacher, Christian. <i>Implementierung Und Analyse von Cone-DHT</i>. Universität
    Paderborn, 2015.
  short: C. Korfmacher, Implementierung Und Analyse von Cone-DHT, Universität Paderborn,
    2015.
date_created: 2020-08-17T08:19:47Z
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: Implementierung und Analyse von Cone-DHT
type: bachelorsthesis
user_id: '477'
year: '2015'
...
---
_id: '18006'
author:
- first_name: Jannik
  full_name: Sundermeier, Jannik
  id: '38705'
  last_name: Sundermeier
citation:
  ama: Sundermeier J. <i>Implementierung Eines Selbststabilisierenden Verteilten Stacks</i>.
    Universität Paderborn; 2015.
  apa: Sundermeier, J. (2015). <i>Implementierung eines selbststabilisierenden verteilten
    Stacks</i>. Universität Paderborn.
  bibtex: '@book{Sundermeier_2015, title={Implementierung eines selbststabilisierenden
    verteilten Stacks}, publisher={Universität Paderborn}, author={Sundermeier, Jannik},
    year={2015} }'
  chicago: Sundermeier, Jannik. <i>Implementierung Eines Selbststabilisierenden Verteilten
    Stacks</i>. Universität Paderborn, 2015.
  ieee: J. Sundermeier, <i>Implementierung eines selbststabilisierenden verteilten
    Stacks</i>. Universität Paderborn, 2015.
  mla: Sundermeier, Jannik. <i>Implementierung Eines Selbststabilisierenden Verteilten
    Stacks</i>. Universität Paderborn, 2015.
  short: J. Sundermeier, Implementierung Eines Selbststabilisierenden Verteilten Stacks,
    Universität Paderborn, 2015.
date_created: 2020-08-17T08:20:59Z
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: Implementierung eines selbststabilisierenden verteilten Stacks
type: bachelorsthesis
user_id: '477'
year: '2015'
...
---
_id: '18024'
author:
- first_name: Till
  full_name: Knollmann, Till
  id: '39241'
  last_name: Knollmann
  orcid: 0000-0003-2014-4696
citation:
  ama: Knollmann T. <i>Implementierung Einer Selbststabilisierenden Datenstruktur
    Für Das Längste Gemeinsame Präfix</i>. Universität Paderborn; 2015.
  apa: Knollmann, T. (2015). <i>Implementierung einer selbststabilisierenden Datenstruktur
    für das längste gemeinsame Präfix</i>. Universität Paderborn.
  bibtex: '@book{Knollmann_2015, title={Implementierung einer selbststabilisierenden
    Datenstruktur für das längste gemeinsame Präfix}, publisher={Universität Paderborn},
    author={Knollmann, Till}, year={2015} }'
  chicago: Knollmann, Till. <i>Implementierung Einer Selbststabilisierenden Datenstruktur
    Für Das Längste Gemeinsame Präfix</i>. Universität Paderborn, 2015.
  ieee: T. Knollmann, <i>Implementierung einer selbststabilisierenden Datenstruktur
    für das längste gemeinsame Präfix</i>. Universität Paderborn, 2015.
  mla: Knollmann, Till. <i>Implementierung Einer Selbststabilisierenden Datenstruktur
    Für Das Längste Gemeinsame Präfix</i>. Universität Paderborn, 2015.
  short: T. Knollmann, Implementierung Einer Selbststabilisierenden Datenstruktur
    Für Das Längste Gemeinsame Präfix, Universität Paderborn, 2015.
date_created: 2020-08-18T08:37:33Z
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: Implementierung einer selbststabilisierenden Datenstruktur für das längste
  gemeinsame Präfix
type: bachelorsthesis
user_id: '477'
year: '2015'
...
---
_id: '694'
author:
- first_name: Georg
  full_name: Stilow, Georg
  last_name: Stilow
citation:
  ama: 'Stilow G. <i>Mobile Agenten in Netzwerken: Analyse von Hotspots</i>. Universität
    Paderborn; 2015.'
  apa: 'Stilow, G. (2015). <i>Mobile Agenten in Netzwerken: Analyse von Hotspots</i>.
    Universität Paderborn.'
  bibtex: '@book{Stilow_2015, title={Mobile Agenten in Netzwerken: Analyse von Hotspots},
    publisher={Universität Paderborn}, author={Stilow, Georg}, year={2015} }'
  chicago: 'Stilow, Georg. <i>Mobile Agenten in Netzwerken: Analyse von Hotspots</i>.
    Universität Paderborn, 2015.'
  ieee: 'G. Stilow, <i>Mobile Agenten in Netzwerken: Analyse von Hotspots</i>. Universität
    Paderborn, 2015.'
  mla: 'Stilow, Georg. <i>Mobile Agenten in Netzwerken: Analyse von Hotspots</i>.
    Universität Paderborn, 2015.'
  short: 'G. Stilow, Mobile Agenten in Netzwerken: Analyse von Hotspots, Universität
    Paderborn, 2015.'
date_created: 2017-11-14T06:55:56Z
date_updated: 2022-01-06T07:03:23Z
language:
- iso: ger
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subprojekt A1
- _id: '2'
  name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: 'Mobile Agenten in Netzwerken: Analyse von Hotspots'
type: bachelorsthesis
user_id: '477'
year: '2015'
...
---
_id: '356'
abstract:
- lang: eng
  text: 'Decentralized algorithms are often used in the cooperative robotics field,
    especially by large swarm systems. We present a distributed algorithm for a problem
    in which a group of autonomous mobile robots must surround a given target. These
    robots are oblivious, i.e., they have no memory of the past. They use only local
    sensing and need no dedicated communication among themselves. We introduce, then
    solve the problem in which the group of autonomous mobile robots must surround
    a given target – we call it the “discrete multiorbit target surrounding problem”
    (DMTSP). We evaluate our solution using simulation and prove that our solution
    invariably ensures that robots enclose the target in finite time. '
author:
- first_name: Laszlo
  full_name: Blazovics, Laszlo
  last_name: Blazovics
- first_name: Tamas
  full_name: Lukovszki, Tamas
  last_name: Lukovszki
- first_name: 'Bertalan '
  full_name: 'Forstner, Bertalan '
  last_name: Forstner
citation:
  ama: Blazovics L, Lukovszki T, Forstner B. Surrounding robots -- A discrete localized
    solution for the intruder problem. <i>Journal of Advanced Computational Intelligence
    and Intelligent Informatics</i>. 2014;(3):315--319. doi:<a href="https://doi.org/10.20965/jaciii.2014.p0315">10.20965/jaciii.2014.p0315</a>
  apa: Blazovics, L., Lukovszki, T., &#38; Forstner, B. (2014). Surrounding robots
    -- A discrete localized solution for the intruder problem. <i>Journal of Advanced
    Computational Intelligence and Intelligent Informatics</i>, (3), 315--319. <a
    href="https://doi.org/10.20965/jaciii.2014.p0315">https://doi.org/10.20965/jaciii.2014.p0315</a>
  bibtex: '@article{Blazovics_Lukovszki_Forstner_2014, title={Surrounding robots --
    A discrete localized solution for the intruder problem}, DOI={<a href="https://doi.org/10.20965/jaciii.2014.p0315">10.20965/jaciii.2014.p0315</a>},
    number={3}, journal={Journal of Advanced Computational Intelligence and Intelligent
    Informatics}, publisher={Fuji Technology Press Ltd.}, author={Blazovics, Laszlo
    and Lukovszki, Tamas and Forstner, Bertalan }, year={2014}, pages={315--319} }'
  chicago: 'Blazovics, Laszlo, Tamas Lukovszki, and Bertalan  Forstner. “Surrounding
    Robots -- A Discrete Localized Solution for the Intruder Problem.” <i>Journal
    of Advanced Computational Intelligence and Intelligent Informatics</i>, no. 3
    (2014): 315--319. <a href="https://doi.org/10.20965/jaciii.2014.p0315">https://doi.org/10.20965/jaciii.2014.p0315</a>.'
  ieee: L. Blazovics, T. Lukovszki, and B. Forstner, “Surrounding robots -- A discrete
    localized solution for the intruder problem,” <i>Journal of Advanced Computational
    Intelligence and Intelligent Informatics</i>, no. 3, pp. 315--319, 2014.
  mla: Blazovics, Laszlo, et al. “Surrounding Robots -- A Discrete Localized Solution
    for the Intruder Problem.” <i>Journal of Advanced Computational Intelligence and
    Intelligent Informatics</i>, no. 3, Fuji Technology Press Ltd., 2014, pp. 315--319,
    doi:<a href="https://doi.org/10.20965/jaciii.2014.p0315">10.20965/jaciii.2014.p0315</a>.
  short: L. Blazovics, T. Lukovszki, B. Forstner, Journal of Advanced Computational
    Intelligence and Intelligent Informatics (2014) 315--319.
date_created: 2017-10-17T12:42:01Z
date_updated: 2022-01-06T06:59:25Z
ddc:
- '040'
doi: 10.20965/jaciii.2014.p0315
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-20T07:21:58Z
  date_updated: 2018-03-20T07:21:58Z
  file_id: '1411'
  file_name: 356-Lukowski.pdf
  file_size: 323838
  relation: main_file
  success: 1
file_date_updated: 2018-03-20T07:21:58Z
has_accepted_license: '1'
issue: '3'
page: 315--319
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subprojekt A1
- _id: '2'
  name: SFB 901 - Project Area A
publication: Journal of Advanced Computational Intelligence and Intelligent Informatics
publisher: Fuji Technology Press Ltd.
status: public
title: Surrounding robots -- A discrete localized solution for the intruder problem
type: journal_article
user_id: '477'
year: '2014'
...
---
_id: '367'
abstract:
- lang: eng
  text: Online social networks are attracting billions of nowadays, both on a global
    scale as well as in social enterprise networks. Using distributed hash tables
    and peer-to-peer technology allows online social networks to be operated securely
    and efficiently only by using the resources of the user devices, thus alleviating
    censorship or data misuse by a single network operator. In this paper, we address
    the challenges that arise in implementing reliably and conveniently to use distributed
    data structures, such as lists or sets, in such a distributed hash-tablebased
    online social network. We present a secure, distributed list data structure that
    manages the list entries in several buckets in the distributed hash table. The
    list entries are authenticated, integrity is maintained and access control for
    single users and also groups is integrated. The approach for secure distributed
    lists is also applied for prefix trees and sets, and implemented and evaluated
    in a peer-to-peer framework for social networks. Evaluation shows that the distributed
    data structure is convenient and efficient to use and that the requirements on
    security hold.
author:
- first_name: Jens
  full_name: Janiuk, Jens
  last_name: Janiuk
- first_name: Alexander
  full_name: Mäcker, Alexander
  id: '13536'
  last_name: Mäcker
- first_name: Kalman
  full_name: Graffi, Kalman
  last_name: Graffi
citation:
  ama: 'Janiuk J, Mäcker A, Graffi K. Secure Distributed Data Structures for Peer-to-Peer-based
    Social Networks. In: <i>Proceedings of the International Conference on Collaboration
    Technologies and Systems (CTS)</i>. ; 2014:396-405. doi:<a href="https://doi.org/10.1109/CTS.2014.6867595">10.1109/CTS.2014.6867595</a>'
  apa: Janiuk, J., Mäcker, A., &#38; Graffi, K. (2014). Secure Distributed Data Structures
    for Peer-to-Peer-based Social Networks. In <i>Proceedings of the International
    Conference on Collaboration Technologies and Systems (CTS)</i> (pp. 396–405).
    <a href="https://doi.org/10.1109/CTS.2014.6867595">https://doi.org/10.1109/CTS.2014.6867595</a>
  bibtex: '@inproceedings{Janiuk_Mäcker_Graffi_2014, title={Secure Distributed Data
    Structures for Peer-to-Peer-based Social Networks}, DOI={<a href="https://doi.org/10.1109/CTS.2014.6867595">10.1109/CTS.2014.6867595</a>},
    booktitle={Proceedings of the International Conference on Collaboration Technologies
    and Systems (CTS)}, author={Janiuk, Jens and Mäcker, Alexander and Graffi, Kalman},
    year={2014}, pages={396–405} }'
  chicago: Janiuk, Jens, Alexander Mäcker, and Kalman Graffi. “Secure Distributed
    Data Structures for Peer-to-Peer-Based Social Networks.” In <i>Proceedings of
    the International Conference on Collaboration Technologies and Systems (CTS)</i>,
    396–405, 2014. <a href="https://doi.org/10.1109/CTS.2014.6867595">https://doi.org/10.1109/CTS.2014.6867595</a>.
  ieee: J. Janiuk, A. Mäcker, and K. Graffi, “Secure Distributed Data Structures for
    Peer-to-Peer-based Social Networks,” in <i>Proceedings of the International Conference
    on Collaboration Technologies and Systems (CTS)</i>, 2014, pp. 396–405.
  mla: Janiuk, Jens, et al. “Secure Distributed Data Structures for Peer-to-Peer-Based
    Social Networks.” <i>Proceedings of the International Conference on Collaboration
    Technologies and Systems (CTS)</i>, 2014, pp. 396–405, doi:<a href="https://doi.org/10.1109/CTS.2014.6867595">10.1109/CTS.2014.6867595</a>.
  short: 'J. Janiuk, A. Mäcker, K. Graffi, in: Proceedings of the International Conference
    on Collaboration Technologies and Systems (CTS), 2014, pp. 396–405.'
date_created: 2017-10-17T12:42:03Z
date_updated: 2022-01-06T06:59:29Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1109/CTS.2014.6867595
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-20T07:18:12Z
  date_updated: 2018-03-20T07:18:12Z
  file_id: '1404'
  file_name: 367-cts_conf.pdf
  file_size: 647997
  relation: main_file
  success: 1
file_date_updated: 2018-03-20T07:18:12Z
has_accepted_license: '1'
language:
- iso: eng
page: 396-405
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subprojekt A1
- _id: '2'
  name: SFB 901 - Project Area A
publication: Proceedings of the International Conference on Collaboration Technologies
  and Systems (CTS)
status: public
title: Secure Distributed Data Structures for Peer-to-Peer-based Social Networks
type: conference
user_id: '477'
year: '2014'
...
---
_id: '378'
abstract:
- lang: eng
  text: The Chord peer-to-peer system is considered, together with CAN, Tapestry and
    Pastry, as one of the pioneering works on peer-to-peer distributed hash tables
    (DHT) that inspired a large volume of papers and projects on DHTs as well as peer-to-peer
    systems in general. Chord, in particular, has been studied thoroughly, and many
    variants of Chord have been presented that optimize various criteria. Also, several
    implementations of Chord are available on various platforms. Though Chord is known
    to be very efficient and scalable and it can handle churn quite well, no protocol
    is known yet that guarantees that Chord is self-stabilizing, i.e., the Chord network
    can be recovered from any initial state in which the network is still weakly connected.
    This is not too surprising since it is known that the Chord network is not locally
    checkable for its current topology. We present a slight extension of the Chord
    network, called Re-Chord (reactive Chord), that turns out to be locally checkable,
    and we present a self-stabilizing distributed protocol for it that can recover
    the Re-Chord network from any initial state, in which the n peers are weakly connected,
    in O(nlogn) communication rounds. We also show that our protocol allows a new
    peer to join or an old peer to leave an already stable Re-Chord network so that
    within O(logn)^2) communication rounds the Re-Chord network is stable again.
author:
- first_name: Sebastian
  full_name: Kniesburges, Sebastian
  last_name: Kniesburges
- first_name: Andreas
  full_name: Koutsopoulos, Andreas
  last_name: Koutsopoulos
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
citation:
  ama: 'Kniesburges S, Koutsopoulos A, Scheideler C. Re-Chord: A Self-stabilizing
    Chord Overlay Network. <i>Theory of Computing Systems</i>. 2014;(3):591-612. doi:<a
    href="https://doi.org/10.1007/s00224-012-9431-2">10.1007/s00224-012-9431-2</a>'
  apa: 'Kniesburges, S., Koutsopoulos, A., &#38; Scheideler, C. (2014). Re-Chord:
    A Self-stabilizing Chord Overlay Network. <i>Theory of Computing Systems</i>,
    (3), 591–612. <a href="https://doi.org/10.1007/s00224-012-9431-2">https://doi.org/10.1007/s00224-012-9431-2</a>'
  bibtex: '@article{Kniesburges_Koutsopoulos_Scheideler_2014, title={Re-Chord: A Self-stabilizing
    Chord Overlay Network}, DOI={<a href="https://doi.org/10.1007/s00224-012-9431-2">10.1007/s00224-012-9431-2</a>},
    number={3}, journal={Theory of Computing Systems}, publisher={Springer}, author={Kniesburges,
    Sebastian and Koutsopoulos, Andreas and Scheideler, Christian}, year={2014}, pages={591–612}
    }'
  chicago: 'Kniesburges, Sebastian, Andreas Koutsopoulos, and Christian Scheideler.
    “Re-Chord: A Self-Stabilizing Chord Overlay Network.” <i>Theory of Computing Systems</i>,
    no. 3 (2014): 591–612. <a href="https://doi.org/10.1007/s00224-012-9431-2">https://doi.org/10.1007/s00224-012-9431-2</a>.'
  ieee: 'S. Kniesburges, A. Koutsopoulos, and C. Scheideler, “Re-Chord: A Self-stabilizing
    Chord Overlay Network,” <i>Theory of Computing Systems</i>, no. 3, pp. 591–612,
    2014.'
  mla: 'Kniesburges, Sebastian, et al. “Re-Chord: A Self-Stabilizing Chord Overlay
    Network.” <i>Theory of Computing Systems</i>, no. 3, Springer, 2014, pp. 591–612,
    doi:<a href="https://doi.org/10.1007/s00224-012-9431-2">10.1007/s00224-012-9431-2</a>.'
  short: S. Kniesburges, A. Koutsopoulos, C. Scheideler, Theory of Computing Systems
    (2014) 591–612.
date_created: 2017-10-17T12:42:05Z
date_updated: 2022-01-06T06:59:35Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/s00224-012-9431-2
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-20T07:13:36Z
  date_updated: 2018-03-20T07:13:36Z
  file_id: '1396'
  file_name: 378-re-chord_journal.pdf
  file_size: 310961
  relation: main_file
  success: 1
file_date_updated: 2018-03-20T07:13:36Z
has_accepted_license: '1'
issue: '3'
page: 591-612
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subprojekt A1
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '13'
  name: SFB 901 - Subproject C1
- _id: '2'
  name: SFB 901 - Project Area A
publication: Theory of Computing Systems
publisher: Springer
status: public
title: 'Re-Chord: A Self-stabilizing Chord Overlay Network'
type: journal_article
user_id: '477'
year: '2014'
...
---
_id: '379'
abstract:
- lang: eng
  text: In the leasing variant of Set Cover presented by Anthony et al.[1], elements
    U arrive over time and must be covered by sets from a familyF of subsets of U.
    Each set can be leased for K different periods of time.Let |U| = n and |F| = m.
    Leasing a set S for a period k incurs a cost ckS and allows S to cover its elements
    for the next lk time steps. The objectiveis to minimize the total cost of the
    sets leased, such that elements arrivingat any time t are covered by sets which
    contain them and are leased duringtime t. Anthony et al. [1] gave an optimal O(log
    n)-approximation forthe problem in the offline setting, unless P = NP [22]. In
    this paper, wegive randomized algorithms for variants of Set Cover Leasing in
    the onlinesetting, including a generalization of Online Set Cover with Repetitionspresented
    by Alon et al. [2], where elements appear multiple times andmust be covered by
    a different set at each arrival. Our results improve theO(log2(mn)) competitive
    factor of Online Set Cover with Repetitions [2]to O(log d log(dn)) = O(logmlog(mn)),
    where d is the maximum numberof sets an element belongs to.
author:
- first_name: Sebastian
  full_name: Abshoff, Sebastian
  last_name: Abshoff
- 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: 'Abshoff S, Markarian C, Meyer auf der Heide F. Randomized Online Algorithms
    for Set Cover Leasing Problems. In: <i>Proceedings of the 8th Annual International
    Conference on Combinatorial Optimization and Applications (COCOA)</i>. LNCS. ;
    2014:25-34. doi:<a href="https://doi.org/10.1007/978-3-319-12691-3_3">10.1007/978-3-319-12691-3_3</a>'
  apa: Abshoff, S., Markarian, C., &#38; Meyer auf der Heide, F. (2014). Randomized
    Online Algorithms for Set Cover Leasing Problems. In <i>Proceedings of the 8th
    Annual International Conference on Combinatorial Optimization and Applications
    (COCOA)</i> (pp. 25–34). <a href="https://doi.org/10.1007/978-3-319-12691-3_3">https://doi.org/10.1007/978-3-319-12691-3_3</a>
  bibtex: '@inproceedings{Abshoff_Markarian_Meyer auf der Heide_2014, series={LNCS},
    title={Randomized Online Algorithms for Set Cover Leasing Problems}, DOI={<a href="https://doi.org/10.1007/978-3-319-12691-3_3">10.1007/978-3-319-12691-3_3</a>},
    booktitle={Proceedings of the 8th Annual International Conference on Combinatorial
    Optimization and Applications (COCOA)}, author={Abshoff, Sebastian and Markarian,
    Christine and Meyer auf der Heide, Friedhelm}, year={2014}, pages={25–34}, collection={LNCS}
    }'
  chicago: Abshoff, Sebastian, Christine Markarian, and Friedhelm Meyer auf der Heide.
    “Randomized Online Algorithms for Set Cover Leasing Problems.” In <i>Proceedings
    of the 8th Annual International Conference on Combinatorial Optimization and Applications
    (COCOA)</i>, 25–34. LNCS, 2014. <a href="https://doi.org/10.1007/978-3-319-12691-3_3">https://doi.org/10.1007/978-3-319-12691-3_3</a>.
  ieee: S. Abshoff, C. Markarian, and F. Meyer auf der Heide, “Randomized Online Algorithms
    for Set Cover Leasing Problems,” in <i>Proceedings of the 8th Annual International
    Conference on Combinatorial Optimization and Applications (COCOA)</i>, 2014, pp.
    25–34.
  mla: Abshoff, Sebastian, et al. “Randomized Online Algorithms for Set Cover Leasing
    Problems.” <i>Proceedings of the 8th Annual International Conference on Combinatorial
    Optimization and Applications (COCOA)</i>, 2014, pp. 25–34, doi:<a href="https://doi.org/10.1007/978-3-319-12691-3_3">10.1007/978-3-319-12691-3_3</a>.
  short: 'S. Abshoff, C. Markarian, F. Meyer auf der Heide, in: Proceedings of the
    8th Annual International Conference on Combinatorial Optimization and Applications
    (COCOA), 2014, pp. 25–34.'
date_created: 2017-10-17T12:42:06Z
date_updated: 2022-01-06T06:59:36Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1007/978-3-319-12691-3_3
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-20T07:12:57Z
  date_updated: 2018-03-20T07:12:57Z
  file_id: '1395'
  file_name: 379-COCOA14.pdf
  file_size: 214299
  relation: main_file
  success: 1
file_date_updated: 2018-03-20T07:12:57Z
has_accepted_license: '1'
page: 25-34
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subprojekt A1
- _id: '2'
  name: SFB 901 - Project Area A
publication: Proceedings of the 8th Annual International Conference on Combinatorial
  Optimization and Applications (COCOA)
series_title: LNCS
status: public
title: Randomized Online Algorithms for Set Cover Leasing Problems
type: conference
user_id: '15504'
year: '2014'
...
---
_id: '380'
abstract:
- lang: eng
  text: 'Network creation games model the creation and usage costs of networks formed
    by n selfish nodes. Each node v can buy a set of edges, each for a fixed price
    α > 0. Its goal is to minimize its private costs, i.e., the sum (SUM-game, Fabrikant
    et al., PODC 2003) or maximum (MAX-game, Demaine et al., PODC 2007) of distances
    from v to all other nodes plus the prices of the bought edges. The above papers
    show the existence of Nash equilibria as well as upper and lower bounds for the
    prices of anarchy and stability. In several subsequent papers, these bounds were
    improved for a wide range of prices α. In this paper, we extend these models by
    incorporating quality-of-service aspects: Each edge cannot only be bought at a
    fixed quality (edge length one) for a fixed price α. Instead, we assume that quality
    levels (i.e., edge lengths) are varying in a fixed interval [βˇ,β^] , 0 series
    = {LNCS}'
author:
- first_name: Andreas
  full_name: Cord-Landwehr, Andreas
  last_name: Cord-Landwehr
- first_name: Alexander
  full_name: Mäcker, Alexander
  id: '13536'
  last_name: Mäcker
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
citation:
  ama: 'Cord-Landwehr A, Mäcker A, Meyer auf der Heide F. Quality of Service in Network
    Creation Games. In: <i>Proceedings of the 10th International Conference on Web
    and Internet Economics (WINE)</i>. ; 2014:423-428. doi:<a href="https://doi.org/10.1007/978-3-319-13129-0_34">10.1007/978-3-319-13129-0_34</a>'
  apa: Cord-Landwehr, A., Mäcker, A., &#38; Meyer auf der Heide, F. (2014). Quality
    of Service in Network Creation Games. In <i>Proceedings of the 10th International
    Conference on Web and Internet Economics (WINE)</i> (pp. 423–428). <a href="https://doi.org/10.1007/978-3-319-13129-0_34">https://doi.org/10.1007/978-3-319-13129-0_34</a>
  bibtex: '@inproceedings{Cord-Landwehr_Mäcker_Meyer auf der Heide_2014, title={Quality
    of Service in Network Creation Games}, DOI={<a href="https://doi.org/10.1007/978-3-319-13129-0_34">10.1007/978-3-319-13129-0_34</a>},
    booktitle={Proceedings of the 10th International Conference on Web and Internet
    Economics (WINE)}, author={Cord-Landwehr, Andreas and Mäcker, Alexander and Meyer
    auf der Heide, Friedhelm}, year={2014}, pages={423–428} }'
  chicago: Cord-Landwehr, Andreas, Alexander Mäcker, and Friedhelm Meyer auf der Heide.
    “Quality of Service in Network Creation Games.” In <i>Proceedings of the 10th
    International Conference on Web and Internet Economics (WINE)</i>, 423–28, 2014.
    <a href="https://doi.org/10.1007/978-3-319-13129-0_34">https://doi.org/10.1007/978-3-319-13129-0_34</a>.
  ieee: A. Cord-Landwehr, A. Mäcker, and F. Meyer auf der Heide, “Quality of Service
    in Network Creation Games,” in <i>Proceedings of the 10th International Conference
    on Web and Internet Economics (WINE)</i>, 2014, pp. 423–428.
  mla: Cord-Landwehr, Andreas, et al. “Quality of Service in Network Creation Games.”
    <i>Proceedings of the 10th International Conference on Web and Internet Economics
    (WINE)</i>, 2014, pp. 423–28, doi:<a href="https://doi.org/10.1007/978-3-319-13129-0_34">10.1007/978-3-319-13129-0_34</a>.
  short: 'A. Cord-Landwehr, A. Mäcker, F. Meyer auf der Heide, in: Proceedings of
    the 10th International Conference on Web and Internet Economics (WINE), 2014,
    pp. 423–428.'
date_created: 2017-10-17T12:42:06Z
date_updated: 2022-01-06T06:59:36Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1007/978-3-319-13129-0_34
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-20T07:05:59Z
  date_updated: 2018-03-20T07:05:59Z
  file_id: '1394'
  file_name: 380-WINE2014.pdf
  file_size: 166640
  relation: main_file
  success: 1
file_date_updated: 2018-03-20T07:05:59Z
has_accepted_license: '1'
page: 423-428
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 10th International Conference on Web and Internet
  Economics (WINE)
status: public
title: Quality of Service in Network Creation Games
type: conference
user_id: '15504'
year: '2014'
...
---
_id: '391'
author:
- first_name: Björn
  full_name: Feldkord, Björn
  id: '22704'
  last_name: Feldkord
citation:
  ama: Feldkord B. <i>On Variants of the Page Migration Problem</i>. Universität Paderborn;
    2014.
  apa: Feldkord, B. (2014). <i>On Variants of the Page Migration Problem</i>. Universität
    Paderborn.
  bibtex: '@book{Feldkord_2014, title={On Variants of the Page Migration Problem},
    publisher={Universität Paderborn}, author={Feldkord, Björn}, year={2014} }'
  chicago: Feldkord, Björn. <i>On Variants of the Page Migration Problem</i>. Universität
    Paderborn, 2014.
  ieee: B. Feldkord, <i>On Variants of the Page Migration Problem</i>. Universität
    Paderborn, 2014.
  mla: Feldkord, Björn. <i>On Variants of the Page Migration Problem</i>. Universität
    Paderborn, 2014.
  short: B. Feldkord, On Variants of the Page Migration Problem, Universität Paderborn,
    2014.
date_created: 2017-10-17T12:42:08Z
date_updated: 2022-01-06T06:59:54Z
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subprojekt A1
- _id: '2'
  name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: On Variants of the Page Migration Problem
type: mastersthesis
user_id: '477'
year: '2014'
...
---
_id: '452'
abstract:
- lang: eng
  text: Today's networks, like the Internet, do not consist of one but a mixture of
    several interconnected networks. Each has individual qualities and hence the performance
    of a network node results from the networks' interplay.We introduce a new game
    theoretic model capturing the interplay between a high-speed backbone network
    and a low-speed general purpose network. In our model, n nodes are connected by
    a static network and each node can decide individually to become a gateway node.
    A gateway node pays a fixed price for its connection to the high-speed network,
    but can utilize the high-speed network to gain communication distance 0 to all
    other gateways. Communication distances in the low-speed network are given by
    the hop distances. The effective communication distance between any two nodes
    then is given by the shortest path, which is possibly improved by using gateways
    as shortcuts.Every node v has the objective to minimize its communication costs,
    given by the sum (SUM-game) or maximum (MAX-game) of the effective communication
    distances from v to all other nodes plus a fixed price \alpha > 0, if it decides
    to be a gateway. For both games and different ranges of \alpha, we study the existence
    of equilibria, the price of anarchy, and convergence properties of best-response
    dynamics.
author:
- first_name: Sebastian
  full_name: Abshoff, Sebastian
  last_name: Abshoff
- first_name: Andreas
  full_name: Cord-Landwehr, Andreas
  last_name: Cord-Landwehr
- first_name: Daniel
  full_name: Jung, Daniel
  id: '37827'
  last_name: Jung
- first_name: Alexander
  full_name: Skopalik, Alexander
  id: '40384'
  last_name: Skopalik
citation:
  ama: 'Abshoff S, Cord-Landwehr A, Jung D, Skopalik A. Brief Announcement: A Model
    for Multilevel Network Games. In: Lavi R, ed. <i>Proceedings of the 7th International
    Symposium on Algorithmic Game Theory (SAGT)</i>. LNCS. ; 2014:294.'
  apa: 'Abshoff, S., Cord-Landwehr, A., Jung, D., &#38; Skopalik, A. (2014). Brief
    Announcement: A Model for Multilevel Network Games. In R. Lavi (Ed.), <i>Proceedings
    of the 7th International Symposium on Algorithmic Game Theory (SAGT)</i> (p. 294).'
  bibtex: '@inproceedings{Abshoff_Cord-Landwehr_Jung_Skopalik_2014, series={LNCS},
    title={Brief Announcement: A Model for Multilevel Network Games}, booktitle={Proceedings
    of the 7th International Symposium on Algorithmic Game Theory (SAGT)}, author={Abshoff,
    Sebastian and Cord-Landwehr, Andreas and Jung, Daniel and Skopalik, Alexander},
    editor={Lavi, RonEditor}, year={2014}, pages={294}, collection={LNCS} }'
  chicago: 'Abshoff, Sebastian, Andreas Cord-Landwehr, Daniel Jung, and Alexander
    Skopalik. “Brief Announcement: A Model for Multilevel Network Games.” In <i>Proceedings
    of the 7th International Symposium on Algorithmic Game Theory (SAGT)</i>, edited
    by Ron Lavi, 294. LNCS, 2014.'
  ieee: 'S. Abshoff, A. Cord-Landwehr, D. Jung, and A. Skopalik, “Brief Announcement:
    A Model for Multilevel Network Games,” in <i>Proceedings of the 7th International
    Symposium on Algorithmic Game Theory (SAGT)</i>, 2014, p. 294.'
  mla: 'Abshoff, Sebastian, et al. “Brief Announcement: A Model for Multilevel Network
    Games.” <i>Proceedings of the 7th International Symposium on Algorithmic Game
    Theory (SAGT)</i>, edited by Ron Lavi, 2014, p. 294.'
  short: 'S. Abshoff, A. Cord-Landwehr, D. Jung, A. Skopalik, in: R. Lavi (Ed.), Proceedings
    of the 7th International Symposium on Algorithmic Game Theory (SAGT), 2014, p.
    294.'
date_created: 2017-10-17T12:42:20Z
date_updated: 2022-01-06T07:01:08Z
ddc:
- '040'
department:
- _id: '63'
- _id: '541'
editor:
- first_name: Ron
  full_name: Lavi, Ron
  last_name: Lavi
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-16T11:24:40Z
  date_updated: 2018-03-16T11:24:40Z
  file_id: '1343'
  file_name: 452-title_multilevel-sagt.pdf
  file_size: 84783
  relation: main_file
  success: 1
file_date_updated: 2018-03-16T11:24:40Z
has_accepted_license: '1'
language:
- iso: eng
page: '294'
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subproject A1
- _id: '7'
  name: SFB 901 - Subproject A3
- _id: '2'
  name: SFB 901 - Project Area A
publication: Proceedings of the 7th International Symposium on Algorithmic Game Theory
  (SAGT)
series_title: LNCS
status: public
title: 'Brief Announcement: A Model for Multilevel Network Games'
type: conference
user_id: '15415'
year: '2014'
...
---
_id: '459'
abstract:
- lang: eng
  text: In this survey article, we discuss two algorithmic research areas that emerge
    from problems that arise when resources are offered in the cloud. The first area,
    online leasing, captures problems arising from the fact that resources in the
    cloud are not bought, but leased by cloud vendors. The second area, Distributed
    Storage Systems, deals with problems arising from so-called cloud federations,
    i.e., when several cloud providers are needed to fulfill a given task.
author:
- first_name: Sebastian
  full_name: Kniesburges, Sebastian
  last_name: Kniesburges
- 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: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
citation:
  ama: 'Kniesburges S, Markarian C, Meyer auf der Heide F, Scheideler C. Algorithmic
    Aspects of Resource Management in the Cloud. In: <i>Proceedings of the 21st International
    Colloquium on Structural Information and Communication Complexity (SIROCCO)</i>.
    LNCS. ; 2014:1-13. doi:<a href="https://doi.org/10.1007/978-3-319-09620-9_1">10.1007/978-3-319-09620-9_1</a>'
  apa: Kniesburges, S., Markarian, C., Meyer auf der Heide, F., &#38; Scheideler,
    C. (2014). Algorithmic Aspects of Resource Management in the Cloud. In <i>Proceedings
    of the 21st International Colloquium on Structural Information and Communication
    Complexity (SIROCCO)</i> (pp. 1–13). <a href="https://doi.org/10.1007/978-3-319-09620-9_1">https://doi.org/10.1007/978-3-319-09620-9_1</a>
  bibtex: '@inproceedings{Kniesburges_Markarian_Meyer auf der Heide_Scheideler_2014,
    series={LNCS}, title={Algorithmic Aspects of Resource Management in the Cloud},
    DOI={<a href="https://doi.org/10.1007/978-3-319-09620-9_1">10.1007/978-3-319-09620-9_1</a>},
    booktitle={Proceedings of the 21st International Colloquium on Structural Information
    and Communication Complexity (SIROCCO)}, author={Kniesburges, Sebastian and Markarian,
    Christine and Meyer auf der Heide, Friedhelm and Scheideler, Christian}, year={2014},
    pages={1–13}, collection={LNCS} }'
  chicago: Kniesburges, Sebastian, Christine Markarian, Friedhelm Meyer auf der Heide,
    and Christian Scheideler. “Algorithmic Aspects of Resource Management in the Cloud.”
    In <i>Proceedings of the 21st International Colloquium on Structural Information
    and Communication Complexity (SIROCCO)</i>, 1–13. LNCS, 2014. <a href="https://doi.org/10.1007/978-3-319-09620-9_1">https://doi.org/10.1007/978-3-319-09620-9_1</a>.
  ieee: S. Kniesburges, C. Markarian, F. Meyer auf der Heide, and C. Scheideler, “Algorithmic
    Aspects of Resource Management in the Cloud,” in <i>Proceedings of the 21st International
    Colloquium on Structural Information and Communication Complexity (SIROCCO)</i>,
    2014, pp. 1–13.
  mla: Kniesburges, Sebastian, et al. “Algorithmic Aspects of Resource Management
    in the Cloud.” <i>Proceedings of the 21st International Colloquium on Structural
    Information and Communication Complexity (SIROCCO)</i>, 2014, pp. 1–13, doi:<a
    href="https://doi.org/10.1007/978-3-319-09620-9_1">10.1007/978-3-319-09620-9_1</a>.
  short: 'S. Kniesburges, C. Markarian, F. Meyer auf der Heide, C. Scheideler, in:
    Proceedings of the 21st International Colloquium on Structural Information and
    Communication Complexity (SIROCCO), 2014, pp. 1–13.'
date_created: 2017-10-17T12:42:21Z
date_updated: 2022-01-06T07:01:14Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
doi: 10.1007/978-3-319-09620-9_1
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-16T11:21:54Z
  date_updated: 2018-03-16T11:21:54Z
  file_id: '1338'
  file_name: 459-SIROCCO2014.pdf
  file_size: 274496
  relation: main_file
  success: 1
file_date_updated: 2018-03-16T11:21:54Z
has_accepted_license: '1'
page: 1-13
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subprojekt A1
- _id: '2'
  name: SFB 901 - Project Area A
publication: Proceedings of the 21st International Colloquium on Structural Information
  and Communication Complexity (SIROCCO)
series_title: LNCS
status: public
title: Algorithmic Aspects of Resource Management in the Cloud
type: conference
user_id: '477'
year: '2014'
...
---
_id: '464'
abstract:
- lang: eng
  text: Topological self-stabilization is an important concept to build robust open
    distributed systems (such as peer-to-peer systems) where nodes can organize themselves
    into meaningful network topologies. The goal is to devise distributed algorithms
    where nodes forward, insert, and delete links to neighboring nodes, and that converge
    quickly to such a desirable topology, independently of the initial network configuration.
    This article proposes a new model to study the parallel convergence time. Our
    model sheds light on the achievable parallelism by avoiding bottlenecks of existing
    models that can yield a distorted picture. As a case study, we consider local
    graph linearization—i.e., how to build a sorted list of the nodes of a connected
    graph in a distributed and self-stabilizing manner. In order to study the main
    structure and properties of our model, we propose two variants of a most simple
    local linearization algorithm. For each of these variants, we present analyses
    of the worst-case and bestcase parallel time complexities, as well as the performance
    under a greedy selection of the actions to be executed. It turns out that the
    analysis is non-trivial despite the simple setting, and to complement our formal
    insights we report on our experiments which indicate that the runtimes may be
    better in the average case.
author:
- first_name: Dominik
  full_name: Gall, Dominik
  last_name: Gall
- first_name: Riko
  full_name: Jacob, Riko
  last_name: Jacob
- first_name: Andrea W.
  full_name: Richa, Andrea W.
  last_name: Richa
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
- first_name: Stefan
  full_name: Schmid, Stefan
  last_name: Schmid
- first_name: 'Hanjo '
  full_name: 'Täubig, Hanjo '
  last_name: Täubig
citation:
  ama: Gall D, Jacob R, Richa AW, Scheideler C, Schmid S, Täubig H. A Note on the
    Parallel Runtime of Self-Stabilizing Graph Linearization. <i>Theory of Computing
    Systems</i>. 2014;(1):110-135. doi:<a href="https://doi.org/10.1007/s00224-013-9504-x">10.1007/s00224-013-9504-x</a>
  apa: Gall, D., Jacob, R., Richa, A. W., Scheideler, C., Schmid, S., &#38; Täubig,
    H. (2014). A Note on the Parallel Runtime of Self-Stabilizing Graph Linearization.
    <i>Theory of Computing Systems</i>, (1), 110–135. <a href="https://doi.org/10.1007/s00224-013-9504-x">https://doi.org/10.1007/s00224-013-9504-x</a>
  bibtex: '@article{Gall_Jacob_Richa_Scheideler_Schmid_Täubig_2014, title={A Note
    on the Parallel Runtime of Self-Stabilizing Graph Linearization}, DOI={<a href="https://doi.org/10.1007/s00224-013-9504-x">10.1007/s00224-013-9504-x</a>},
    number={1}, journal={Theory of Computing Systems}, publisher={Springer}, author={Gall,
    Dominik and Jacob, Riko and Richa, Andrea W. and Scheideler, Christian and Schmid,
    Stefan and Täubig, Hanjo }, year={2014}, pages={110–135} }'
  chicago: 'Gall, Dominik, Riko Jacob, Andrea W. Richa, Christian Scheideler, Stefan
    Schmid, and Hanjo  Täubig. “A Note on the Parallel Runtime of Self-Stabilizing
    Graph Linearization.” <i>Theory of Computing Systems</i>, no. 1 (2014): 110–35.
    <a href="https://doi.org/10.1007/s00224-013-9504-x">https://doi.org/10.1007/s00224-013-9504-x</a>.'
  ieee: D. Gall, R. Jacob, A. W. Richa, C. Scheideler, S. Schmid, and H. Täubig, “A
    Note on the Parallel Runtime of Self-Stabilizing Graph Linearization,” <i>Theory
    of Computing Systems</i>, no. 1, pp. 110–135, 2014.
  mla: Gall, Dominik, et al. “A Note on the Parallel Runtime of Self-Stabilizing Graph
    Linearization.” <i>Theory of Computing Systems</i>, no. 1, Springer, 2014, pp.
    110–35, doi:<a href="https://doi.org/10.1007/s00224-013-9504-x">10.1007/s00224-013-9504-x</a>.
  short: D. Gall, R. Jacob, A.W. Richa, C. Scheideler, S. Schmid, H. Täubig, Theory
    of Computing Systems (2014) 110–135.
date_created: 2017-10-17T12:42:22Z
date_updated: 2022-01-06T07:01:16Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/s00224-013-9504-x
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-16T11:19:45Z
  date_updated: 2018-03-16T11:19:45Z
  file_id: '1334'
  file_name: 464-GJRSST2014.pdf
  file_size: 947484
  relation: main_file
  success: 1
file_date_updated: 2018-03-16T11:19:45Z
has_accepted_license: '1'
issue: '1'
page: 110-135
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subprojekt A1
- _id: '2'
  name: SFB 901 - Project Area A
publication: Theory of Computing Systems
publisher: Springer
status: public
title: A Note on the Parallel Runtime of Self-Stabilizing Graph Linearization
type: journal_article
user_id: '477'
year: '2014'
...
---
_id: '393'
abstract:
- lang: eng
  text: 'A fundamental problem for peer-to-peer systems is to maintain connectivity
    while nodes are leaving, i.e., the nodes requesting to leave the peer-to-peer
    system are excluded from the overlay network without affecting its connectivity.
    There are a number of studies for safe node exclusion if the overlay is in a well-defined
    state initially. Surprisingly, the problem is not formally studied yet for the
    case in which the overlay network is in an arbitrary initial state, i.e., when
    looking for a self-stabilizing solution for excluding leaving nodes. We study
    this problem in two variants: the Finite Departure Problem (FDP) ) and the Finite
    Sleep Problem (FSP). In the FDP the leaving nodes have to irrevocably decide when
    it is safe to leave the network, whereas in the FSP, this leaving decision does
    not have to be final: the nodes may resume computation if necessary. We show that
    there is no self-stabilizing distributed algorithm for the FDP, even in a synchronous
    message passing model. To allow a solution, we introduce an oracle called NIDEC
    and show that it is sufficient even for the asynchronous message passing model
    by proposing an algorithm that can solve the FDP using NIDEC. We also show that
    a solution to the FSP does not require an oracle.'
author:
- first_name: Dianne
  full_name: Foreback, Dianne
  last_name: Foreback
- first_name: Andreas
  full_name: Koutsopoulos, Andreas
  last_name: Koutsopoulos
- first_name: Mikhail
  full_name: Nesterenko, Mikhail
  last_name: Nesterenko
- 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: 'Foreback D, Koutsopoulos A, Nesterenko M, Scheideler C, Strothmann TF. On
    Stabilizing Departures in Overlay Networks. In: <i>Proceedings of the 16th International
    Symposium on Stabilization, Safety, and Security of Distributed Systems</i>. LNCS.
    ; 2014:48--62. doi:<a href="https://doi.org/10.1007/978-3-319-11764-5_4">10.1007/978-3-319-11764-5_4</a>'
  apa: Foreback, D., Koutsopoulos, A., Nesterenko, M., Scheideler, C., &#38; Strothmann,
    T. F. (2014). On Stabilizing Departures in Overlay Networks. In <i>Proceedings
    of the 16th International Symposium on Stabilization, Safety, and Security of
    Distributed Systems</i> (pp. 48--62). <a href="https://doi.org/10.1007/978-3-319-11764-5_4">https://doi.org/10.1007/978-3-319-11764-5_4</a>
  bibtex: '@inproceedings{Foreback_Koutsopoulos_Nesterenko_Scheideler_Strothmann_2014,
    series={LNCS}, title={On Stabilizing Departures in Overlay Networks}, DOI={<a
    href="https://doi.org/10.1007/978-3-319-11764-5_4">10.1007/978-3-319-11764-5_4</a>},
    booktitle={Proceedings of the 16th International Symposium on Stabilization, Safety,
    and Security of Distributed Systems}, author={Foreback, Dianne and Koutsopoulos,
    Andreas and Nesterenko, Mikhail and Scheideler, Christian and Strothmann, Thim
    Frederik}, year={2014}, pages={48--62}, collection={LNCS} }'
  chicago: Foreback, Dianne, Andreas Koutsopoulos, Mikhail Nesterenko, Christian Scheideler,
    and Thim Frederik Strothmann. “On Stabilizing Departures in Overlay Networks.”
    In <i>Proceedings of the 16th International Symposium on Stabilization, Safety,
    and Security of Distributed Systems</i>, 48--62. LNCS, 2014. <a href="https://doi.org/10.1007/978-3-319-11764-5_4">https://doi.org/10.1007/978-3-319-11764-5_4</a>.
  ieee: D. Foreback, A. Koutsopoulos, M. Nesterenko, C. Scheideler, and T. F. Strothmann,
    “On Stabilizing Departures in Overlay Networks,” in <i>Proceedings of the 16th
    International Symposium on Stabilization, Safety, and Security of Distributed
    Systems</i>, 2014, pp. 48--62.
  mla: Foreback, Dianne, et al. “On Stabilizing Departures in Overlay Networks.” <i>Proceedings
    of the 16th International Symposium on Stabilization, Safety, and Security of
    Distributed Systems</i>, 2014, pp. 48--62, doi:<a href="https://doi.org/10.1007/978-3-319-11764-5_4">10.1007/978-3-319-11764-5_4</a>.
  short: 'D. Foreback, A. Koutsopoulos, M. Nesterenko, C. Scheideler, T.F. Strothmann,
    in: Proceedings of the 16th International Symposium on Stabilization, Safety,
    and Security of Distributed Systems, 2014, pp. 48--62.'
date_created: 2017-10-17T12:42:08Z
date_updated: 2022-01-06T06:59:56Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/978-3-319-11764-5_4
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-20T07:00:28Z
  date_updated: 2018-03-20T07:00:28Z
  file_id: '1384'
  file_name: 393-departures.pdf
  file_size: 287539
  relation: main_file
  success: 1
file_date_updated: 2018-03-20T07:00:28Z
has_accepted_license: '1'
language:
- iso: eng
page: 48--62
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subprojekt A1
- _id: '2'
  name: SFB 901 - Project Area A
publication: Proceedings of the 16th International Symposium on Stabilization, Safety,
  and Security of Distributed Systems
series_title: LNCS
status: public
title: On Stabilizing Departures in Overlay Networks
type: conference
user_id: '477'
year: '2014'
...