---
_id: '4563'
abstract:
- lang: eng
text: "Routing is a challenging problem for wireless ad hoc networks, especially
when the nodes are mobile and spread so widely that in most cases multiple hops
are needed to route a message from one node to another. In fact, it is known that
any online routing protocol has a poor performance in the worst case, in a sense
that there is a distribution of nodes resulting in bad routing paths for that
protocol, even if the nodes know their geographic positions and the geographic
position of the destination of a message is known. The reason for that is that
radio holes in the ad hoc network may require messages to take long detours in
order to get to a destination, which are hard to find in an online fashion.\r\n\r\nIn
this paper, we assume that the wireless ad hoc network can make limited use of
long-range links provided by a global communication infrastructure like a cellular
infrastructure or a satellite in order to compute an abstraction of the wireless
ad hoc network that allows the messages to be sent along near-shortest paths in
the ad hoc network. We present distributed algorithms that compute an abstraction
of the ad hoc network in $\\mathcal{O}\\left(\\log ^2 n\\right)$ time using long-range
links, which results in $c$-competitive routing paths between any two nodes of
the ad hoc network for some constant $c$ if the convex hulls of the radio holes
do not intersect. We also show that the storage needed for the abstraction just
depends on the number and size of the radio holes in the wireless ad hoc network
and is independent on the total number of nodes, and this information just has
to be known to a few nodes for the routing to work.\r\n"
author:
- first_name: Daniel
full_name: Jung, Daniel
id: '37827'
last_name: Jung
- first_name: Christina
full_name: Kolb, Christina
id: '43647'
last_name: Kolb
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Jannik
full_name: Sundermeier, Jannik
id: '38705'
last_name: Sundermeier
citation:
ama: 'Jung D, Kolb C, Scheideler C, Sundermeier J. Competitive Routing in Hybrid
Communication Networks. In: Proceedings of the 14th International Symposium
on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) . Springer;
2018.'
apa: 'Jung, D., Kolb, C., Scheideler, C., & Sundermeier, J. (2018). Competitive
Routing in Hybrid Communication Networks. In Proceedings of the 14th International
Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) .
Helsinki: Springer.'
bibtex: '@inproceedings{Jung_Kolb_Scheideler_Sundermeier_2018, title={Competitive
Routing in Hybrid Communication Networks}, booktitle={Proceedings of the 14th
International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS)
}, publisher={Springer}, author={Jung, Daniel and Kolb, Christina and Scheideler,
Christian and Sundermeier, Jannik}, year={2018} }'
chicago: Jung, Daniel, Christina Kolb, Christian Scheideler, and Jannik Sundermeier.
“Competitive Routing in Hybrid Communication Networks.” In Proceedings of the
14th International Symposium on Algorithms and Experiments for Wireless Networks
(ALGOSENSORS) . Springer, 2018.
ieee: D. Jung, C. Kolb, C. Scheideler, and J. Sundermeier, “Competitive Routing
in Hybrid Communication Networks,” in Proceedings of the 14th International
Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) ,
Helsinki, 2018.
mla: Jung, Daniel, et al. “Competitive Routing in Hybrid Communication Networks.”
Proceedings of the 14th International Symposium on Algorithms and Experiments
for Wireless Networks (ALGOSENSORS) , Springer, 2018.
short: 'D. Jung, C. Kolb, C. Scheideler, J. Sundermeier, in: Proceedings of the
14th International Symposium on Algorithms and Experiments for Wireless Networks
(ALGOSENSORS) , Springer, 2018.'
conference:
end_date: 2018-08-24
location: Helsinki
name: '14th International Symposium on Algorithms and Experiments for Wireless Networks
(ALGOSENSORS) '
start_date: 2018-08-23
date_created: 2018-10-02T07:06:05Z
date_updated: 2022-01-06T07:01:11Z
ddc:
- '000'
department:
- _id: '63'
- _id: '79'
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2019-01-11T10:32:38Z
date_updated: 2019-01-11T10:32:38Z
file_id: '6621'
file_name: 23hybrid.pdf
file_size: 349034
relation: main_file
success: 1
file_date_updated: 2019-01-11T10:32:38Z
has_accepted_license: '1'
keyword:
- greedy routing
- ad hoc networks
- convex hulls
- c-competitiveness
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
publication: 'Proceedings of the 14th International Symposium on Algorithms and Experiments
for Wireless Networks (ALGOSENSORS) '
publisher: Springer
status: public
title: Competitive Routing in Hybrid Communication Networks
type: conference
user_id: '38705'
year: '2018'
...
---
_id: '4565'
author:
- first_name: Daniel
full_name: Jung, Daniel
id: '37827'
last_name: Jung
- first_name: Christina
full_name: Kolb, Christina
id: '43647'
last_name: Kolb
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Jannik
full_name: Sundermeier, Jannik
id: '38705'
last_name: Sundermeier
citation:
ama: 'Jung D, Kolb C, Scheideler C, Sundermeier J. Brief Announcement: Competitive
Routing in Hybrid Communication Networks. In: Proceedings of the 30th on Symposium
on Parallelism in Algorithms and Architectures (SPAA). ACM Press; 2018. doi:10.1145/3210377.3210663'
apa: 'Jung, D., Kolb, C., Scheideler, C., & Sundermeier, J. (2018). Brief Announcement:
Competitive Routing in Hybrid Communication Networks. In Proceedings of the
30th on Symposium on Parallelism in Algorithms and Architectures (SPAA). Wien:
ACM Press. https://doi.org/10.1145/3210377.3210663'
bibtex: '@inproceedings{Jung_Kolb_Scheideler_Sundermeier_2018, title={Brief Announcement:
Competitive Routing in Hybrid Communication Networks}, DOI={10.1145/3210377.3210663},
booktitle={Proceedings of the 30th on Symposium on Parallelism in Algorithms and
Architectures (SPAA)}, publisher={ACM Press}, author={Jung, Daniel and Kolb, Christina
and Scheideler, Christian and Sundermeier, Jannik}, year={2018} }'
chicago: 'Jung, Daniel, Christina Kolb, Christian Scheideler, and Jannik Sundermeier.
“Brief Announcement: Competitive Routing in Hybrid Communication Networks.” In
Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures
(SPAA). ACM Press, 2018. https://doi.org/10.1145/3210377.3210663.'
ieee: 'D. Jung, C. Kolb, C. Scheideler, and J. Sundermeier, “Brief Announcement:
Competitive Routing in Hybrid Communication Networks,” in Proceedings of the
30th on Symposium on Parallelism in Algorithms and Architectures (SPAA), Wien,
2018.'
mla: 'Jung, Daniel, et al. “Brief Announcement: Competitive Routing in Hybrid Communication
Networks.” Proceedings of the 30th on Symposium on Parallelism in Algorithms
and Architectures (SPAA), ACM Press, 2018, doi:10.1145/3210377.3210663.'
short: 'D. Jung, C. Kolb, C. Scheideler, J. Sundermeier, in: Proceedings of the
30th on Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM Press,
2018.'
conference:
end_date: 2018-07-18
location: Wien
name: SPAA'18
start_date: 2018-07-17
date_created: 2018-10-02T07:34:47Z
date_updated: 2022-01-06T07:01:12Z
ddc:
- '000'
department:
- _id: '63'
- _id: '79'
doi: 10.1145/3210377.3210663
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T13:48:10Z
date_updated: 2018-11-02T13:48:10Z
file_id: '5254'
file_name: p231-jung-1.pdf
file_size: 1025077
relation: main_file
success: 1
file_date_updated: 2018-11-02T13:48:10Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
publication: Proceedings of the 30th on Symposium on Parallelism in Algorithms and
Architectures (SPAA)
publication_identifier:
isbn:
- '9781450357999'
publication_status: published
publisher: ACM Press
status: public
title: 'Brief Announcement: Competitive Routing in Hybrid Communication Networks'
type: conference
user_id: '38705'
year: '2018'
...
---
_id: '4351'
abstract:
- lang: eng
text: "\tWe extend the concept of monotonic searchability~\\cite{DBLP:conf/opodis/ScheidelerSS15}~\\cite{DBLP:conf/wdag/ScheidelerSS16}
for self-stabilizing systems from one to multiple dimensions.\r\n\tA system is
self-stabilizing if it can recover to a legitimate state from any initial illegal
state.\r\n\tThese kind of systems are most often used in distributed applications.\r\n\tMonotonic
searchability provides guarantees when searching for nodes while the recovery
process is going on.\r\n\tMore precisely, if a search request started at some
node $u$ succeeds in reaching its destination $v$, then all future search requests
from $u$ to $v$ succeed as well.\r\n\tAlthough there already exists a self-stabilizing
protocol for a two-dimensional topology~\\cite{DBLP:journals/tcs/JacobRSS12} and
an universal approach for monotonic searchability~\\cite{DBLP:conf/wdag/ScheidelerSS16},
it is not clear how both of these concepts fit together effectively.\r\n\tThe
latter concept even comes with some restrictive assumptions on messages, which
is not the case for our protocol.\r\n\tWe propose a simple novel protocol for
a self-stabilizing two-dimensional quadtree that satisfies monotonic searchability.\r\n\tOur
protocol can easily be extended to higher dimensions and offers routing in $\\mathcal
O(\\log n)$ hops for any search request.\r\n"
author:
- first_name: Michael
full_name: Feldmann, Michael
id: '23538'
last_name: Feldmann
- first_name: Christina
full_name: Kolb, Christina
id: '43647'
last_name: Kolb
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Feldmann M, Kolb C, Scheideler C. Self-stabilizing Overlays for high-dimensional
Monotonic Searchability. In: Proceedings of the 20th International Symposium
on Stabilization, Safety, and Security of Distributed Systems (SSS). Vol 11201.
Lecture Notes in Computer Science. Springer, Cham; 2018:16-31. doi:10.1007/978-3-030-03232-6_2'
apa: Feldmann, M., Kolb, C., & Scheideler, C. (2018). Self-stabilizing Overlays
for high-dimensional Monotonic Searchability. In Proceedings of the 20th International
Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)
(Vol. 11201, pp. 16–31). Springer, Cham. https://doi.org/10.1007/978-3-030-03232-6_2
bibtex: '@inproceedings{Feldmann_Kolb_Scheideler_2018, series={Lecture Notes in
Computer Science}, title={Self-stabilizing Overlays for high-dimensional Monotonic
Searchability}, volume={11201}, DOI={10.1007/978-3-030-03232-6_2},
booktitle={Proceedings of the 20th International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS)}, publisher={Springer, Cham}, author={Feldmann,
Michael and Kolb, Christina and Scheideler, Christian}, year={2018}, pages={16–31},
collection={Lecture Notes in Computer Science} }'
chicago: Feldmann, Michael, Christina Kolb, and Christian Scheideler. “Self-Stabilizing
Overlays for High-Dimensional Monotonic Searchability.” In Proceedings of the
20th International Symposium on Stabilization, Safety, and Security of Distributed
Systems (SSS), 11201:16–31. Lecture Notes in Computer Science. Springer, Cham,
2018. https://doi.org/10.1007/978-3-030-03232-6_2.
ieee: M. Feldmann, C. Kolb, and C. Scheideler, “Self-stabilizing Overlays for high-dimensional
Monotonic Searchability,” in Proceedings of the 20th International Symposium
on Stabilization, Safety, and Security of Distributed Systems (SSS), 2018,
vol. 11201, pp. 16–31.
mla: Feldmann, Michael, et al. “Self-Stabilizing Overlays for High-Dimensional Monotonic
Searchability.” Proceedings of the 20th International Symposium on Stabilization,
Safety, and Security of Distributed Systems (SSS), vol. 11201, Springer, Cham,
2018, pp. 16–31, doi:10.1007/978-3-030-03232-6_2.
short: 'M. Feldmann, C. Kolb, C. Scheideler, in: Proceedings of the 20th International
Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS),
Springer, Cham, 2018, pp. 16–31.'
date_created: 2018-09-04T14:15:39Z
date_updated: 2022-01-06T07:00:58Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/978-3-030-03232-6_2
external_id:
arxiv:
- '1808.10300'
file:
- access_level: closed
content_type: application/pdf
creator: mfeldma2
date_created: 2018-10-31T13:24:17Z
date_updated: 2018-10-31T13:24:17Z
file_id: '5210'
file_name: Feldmann2018_Chapter_Self-stabilizingOverlaysForHig.pdf
file_size: 329823
relation: main_file
success: 1
file_date_updated: 2018-10-31T13:24:17Z
has_accepted_license: '1'
intvolume: ' 11201'
language:
- iso: eng
page: '16-31 '
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
publication: Proceedings of the 20th International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS)
publication_identifier:
unknown:
- 978-3-030-03231-9
publisher: Springer, Cham
series_title: Lecture Notes in Computer Science
status: public
title: Self-stabilizing Overlays for high-dimensional Monotonic Searchability
type: conference
user_id: '23538'
volume: 11201
year: '2018'
...
---
_id: '5216'
abstract:
- lang: eng
text: A fundamental problem for overlay networks is to safely exclude leaving nodes,
i.e., the nodes requesting to leave the overlay network are excluded from it without
affecting its connectivity. To rigorously study self-stabilizing solutions to
this problem, the Finite Departure Problem (FDP) has been proposed [9]. In the
FDP we are given a network of processes in an arbitrary state, and the goal is
to eventually arrive at (and stay in) a state in which all leaving processes irrevocably
decided to leave the system while for all weakly-connected components in the initial
overlay network, all staying processes in that component will still form a weakly
connected component. In the standard interconnection model, the FDP is known to
be unsolvable by local control protocols, so oracles have been investigated that
allow the problem to be solved [9]. To avoid the use of oracles, we introduce
a new interconnection model based on relays. Despite the relay model appearing
to be rather restrictive, we show that it is universal, i.e., it is possible to
transform any weakly-connected topology into any other weakly-connected topology,
which is important for being a useful interconnection model for overlay networks.
Apart from this, our model allows processes to grant and revoke access rights,
which is why we believe it to be of interest beyond the scope of this paper. We
show how to implement the relay layer in a self-stabilizing way and identify properties
protocols need to satisfy so that the relay layer can recover while serving protocol
requests.
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. Relays: A New Approach for the Finite Departure Problem
in Overlay Networks. In: Proceedings of the 20th International Symposium on
Stabilization, Safety, and Security of Distributed Systems (SSS 2018). ; 2018.
doi:10.1007/978-3-030-03232-6_16'
apa: 'Scheideler, C., & Setzer, A. (2018). Relays: A New Approach for the Finite
Departure Problem in Overlay Networks. In Proceedings of the 20th International
Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018).
Tokyo, Japan. https://doi.org/10.1007/978-3-030-03232-6_16'
bibtex: '@inproceedings{Scheideler_Setzer_2018, title={Relays: A New Approach for
the Finite Departure Problem in Overlay Networks}, DOI={10.1007/978-3-030-03232-6_16},
booktitle={Proceedings of the 20th International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS 2018)}, author={Scheideler, Christian
and Setzer, Alexander}, year={2018} }'
chicago: 'Scheideler, Christian, and Alexander Setzer. “Relays: A New Approach for
the Finite Departure Problem in Overlay Networks.” In Proceedings of the 20th
International Symposium on Stabilization, Safety, and Security of Distributed
Systems (SSS 2018), 2018. https://doi.org/10.1007/978-3-030-03232-6_16.'
ieee: 'C. Scheideler and A. Setzer, “Relays: A New Approach for the Finite Departure
Problem in Overlay Networks,” in Proceedings of the 20th International Symposium
on Stabilization, Safety, and Security of Distributed Systems (SSS 2018),
Tokyo, Japan, 2018.'
mla: 'Scheideler, Christian, and Alexander Setzer. “Relays: A New Approach for the
Finite Departure Problem in Overlay Networks.” Proceedings of the 20th International
Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018),
2018, doi:10.1007/978-3-030-03232-6_16.'
short: 'C. Scheideler, A. Setzer, in: Proceedings of the 20th International Symposium
on Stabilization, Safety, and Security of Distributed Systems (SSS 2018), 2018.'
conference:
location: Tokyo, Japan
name: 20th International Symposium on Stabilization, Safety, and Security of Distributed
Systems (SSS 2018)
date_created: 2018-10-31T13:33:05Z
date_updated: 2022-01-06T07:01:47Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/978-3-030-03232-6_16
file:
- access_level: closed
content_type: application/pdf
creator: asetzer
date_created: 2018-10-31T15:51:45Z
date_updated: 2018-10-31T16:09:48Z
file_id: '5223'
file_name: Scheideler-Setzer2018_Chapter_RelaysANewApproachForTheFinite.pdf
file_size: 369818
relation: main_file
file_date_updated: 2018-10-31T16:09:48Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '13'
name: SFB 901 - Subproject C1
publication: Proceedings of the 20th International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS 2018)
publication_status: published
status: public
title: 'Relays: A New Approach for the Finite Departure Problem in Overlay Networks'
type: conference
user_id: '11108'
year: '2018'
...
---
_id: '5222'
abstract:
- lang: eng
text: 'We present a self-stabilizing protocol for an overlay network that constructs
the Minimum Spanning Tree (MST) for an underlay that is modeled by a weighted
tree. The weight of an overlay edge between two nodes is the weighted length of
their shortest path in the tree. We rigorously prove that our protocol works correctly
under asynchronous and non-FIFO message delivery. Further, the protocol stabilizes
after O(N^2) asynchronous rounds where N is the number of nodes in the overlay. '
author:
- first_name: Thorsten
full_name: Götte, Thorsten
id: '34727'
last_name: Götte
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Alexander
full_name: Setzer, Alexander
id: '11108'
last_name: Setzer
citation:
ama: 'Götte T, Scheideler C, Setzer A. On Underlay-Aware Self-Stabilizing Overlay
Networks. In: Proceedings of the 20th International Symposium on Stabilization,
Safety, and Security of Distributed Systems (SSS 2018). Vol 11201. Lecture
Notes in Computer Science. Springer; 2018:50-64.'
apa: 'Götte, T., Scheideler, C., & Setzer, A. (2018). On Underlay-Aware Self-Stabilizing
Overlay Networks. In Proceedings of the 20th International Symposium on Stabilization,
Safety, and Security of Distributed Systems (SSS 2018) (Vol. 11201, pp. 50–64).
Tokyo, Japan: Springer.'
bibtex: '@inproceedings{Götte_Scheideler_Setzer_2018, series={Lecture Notes in Computer
Science}, title={On Underlay-Aware Self-Stabilizing Overlay Networks}, volume={11201},
booktitle={Proceedings of the 20th International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS 2018)}, publisher={Springer}, author={Götte,
Thorsten and Scheideler, Christian and Setzer, Alexander}, year={2018}, pages={50–64},
collection={Lecture Notes in Computer Science} }'
chicago: Götte, Thorsten, Christian Scheideler, and Alexander Setzer. “On Underlay-Aware
Self-Stabilizing Overlay Networks.” In Proceedings of the 20th International
Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018),
11201:50–64. Lecture Notes in Computer Science. Springer, 2018.
ieee: T. Götte, C. Scheideler, and A. Setzer, “On Underlay-Aware Self-Stabilizing
Overlay Networks,” in Proceedings of the 20th International Symposium on Stabilization,
Safety, and Security of Distributed Systems (SSS 2018), Tokyo, Japan, 2018,
vol. 11201, pp. 50–64.
mla: Götte, Thorsten, et al. “On Underlay-Aware Self-Stabilizing Overlay Networks.”
Proceedings of the 20th International Symposium on Stabilization, Safety, and
Security of Distributed Systems (SSS 2018), vol. 11201, Springer, 2018, pp.
50–64.
short: 'T. Götte, C. Scheideler, A. Setzer, in: Proceedings of the 20th International
Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018),
Springer, 2018, pp. 50–64.'
conference:
location: Tokyo, Japan
name: ' 20th International Symposium on Stabilization, Safety, and Security of Distributed
Systems (SSS 2018)'
date_created: 2018-10-31T15:44:30Z
date_updated: 2022-01-06T07:01:47Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: closed
content_type: application/pdf
creator: thgoette
date_created: 2018-10-31T15:59:26Z
date_updated: 2018-10-31T15:59:26Z
file_id: '5224'
file_name: sss18_camera.pdf
file_size: 367812
relation: main_file
success: 1
file_date_updated: 2018-10-31T15:59:26Z
has_accepted_license: '1'
intvolume: ' 11201'
language:
- iso: eng
page: 50-64
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
publication: Proceedings of the 20th International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS 2018)
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: On Underlay-Aware Self-Stabilizing Overlay Networks
type: conference
user_id: '477'
volume: 11201
year: '2018'
...
---
_id: '3872'
abstract:
- lang: eng
text: 'This paper considers the problem of how to efficiently share a wireless medium
which is subject to harsh external interference or even jamming. So far, this
problem is understood only in simplistic single-hop or unit disk graph models.
We in this paper initiate the study of MAC protocols for the SINR interference
model (a.k.a. physical model). This paper makes two contributions. First, we introduce
a new adversarial SINR model which captures a wide range of interference phenomena.
Concretely, we consider a powerful, adaptive adversary which can jam nodes at
arbitrary times and which is only limited by some energy budget. Our second contribution
is a distributed MAC protocol called Sade which provably achieves a constant competitive
throughput in this environment: we show that, with high probability, the protocol
ensures that a constant fraction of the non-blocked time periods is used for successful
transmissions.'
author:
- first_name: Adrian
full_name: Ogierman, Adrian
last_name: Ogierman
- first_name: Andrea
full_name: Richa, Andrea
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: Jin
full_name: Zhang, Jin
last_name: Zhang
citation:
ama: 'Ogierman A, Richa A, Scheideler C, Schmid S, Zhang J. Sade: competitive MAC
under adversarial SINR. Distributed Computing. 2017;31(3):241-254. doi:10.1007/s00446-017-0307-1'
apa: 'Ogierman, A., Richa, A., Scheideler, C., Schmid, S., & Zhang, J. (2017).
Sade: competitive MAC under adversarial SINR. Distributed Computing, 31(3),
241–254. https://doi.org/10.1007/s00446-017-0307-1'
bibtex: '@article{Ogierman_Richa_Scheideler_Schmid_Zhang_2017, title={Sade: competitive
MAC under adversarial SINR}, volume={31}, DOI={10.1007/s00446-017-0307-1},
number={3}, journal={Distributed Computing}, publisher={Springer Nature}, author={Ogierman,
Adrian and Richa, Andrea and Scheideler, Christian and Schmid, Stefan and Zhang,
Jin}, year={2017}, pages={241–254} }'
chicago: 'Ogierman, Adrian, Andrea Richa, Christian Scheideler, Stefan Schmid, and
Jin Zhang. “Sade: Competitive MAC under Adversarial SINR.” Distributed Computing
31, no. 3 (2017): 241–54. https://doi.org/10.1007/s00446-017-0307-1.'
ieee: 'A. Ogierman, A. Richa, C. Scheideler, S. Schmid, and J. Zhang, “Sade: competitive
MAC under adversarial SINR,” Distributed Computing, vol. 31, no. 3, pp.
241–254, 2017.'
mla: 'Ogierman, Adrian, et al. “Sade: Competitive MAC under Adversarial SINR.” Distributed
Computing, vol. 31, no. 3, Springer Nature, 2017, pp. 241–54, doi:10.1007/s00446-017-0307-1.'
short: A. Ogierman, A. Richa, C. Scheideler, S. Schmid, J. Zhang, Distributed Computing
31 (2017) 241–254.
date_created: 2018-08-10T07:05:12Z
date_updated: 2022-01-06T06:59:47Z
department:
- _id: '79'
doi: 10.1007/s00446-017-0307-1
intvolume: ' 31'
issue: '3'
page: 241-254
publication: Distributed Computing
publication_identifier:
issn:
- 0178-2770
- 1432-0452
publication_status: published
publisher: Springer Nature
status: public
title: 'Sade: competitive MAC under adversarial SINR'
type: journal_article
user_id: '15504'
volume: 31
year: '2017'
...
---
_id: '1812'
author:
- first_name: Andreas
full_name: Koutsopoulos, Andreas
last_name: Koutsopoulos
- 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: Koutsopoulos A, Scheideler C, Strothmann TF. Towards a universal approach for
the finite departure problem in overlay networks. Inf Comput. 2017:408--424.
doi:10.1016/j.ic.2016.12.006
apa: Koutsopoulos, A., Scheideler, C., & Strothmann, T. F. (2017). Towards a
universal approach for the finite departure problem in overlay networks. Inf.
Comput., 408--424. https://doi.org/10.1016/j.ic.2016.12.006
bibtex: '@article{Koutsopoulos_Scheideler_Strothmann_2017, title={Towards a universal
approach for the finite departure problem in overlay networks}, DOI={10.1016/j.ic.2016.12.006},
journal={Inf. Comput.}, author={Koutsopoulos, Andreas and Scheideler, Christian
and Strothmann, Thim Frederik}, year={2017}, pages={408--424} }'
chicago: Koutsopoulos, Andreas, Christian Scheideler, and Thim Frederik Strothmann.
“Towards a Universal Approach for the Finite Departure Problem in Overlay Networks.”
Inf. Comput., 2017, 408--424. https://doi.org/10.1016/j.ic.2016.12.006.
ieee: A. Koutsopoulos, C. Scheideler, and T. F. Strothmann, “Towards a universal
approach for the finite departure problem in overlay networks,” Inf. Comput.,
pp. 408--424, 2017.
mla: Koutsopoulos, Andreas, et al. “Towards a Universal Approach for the Finite
Departure Problem in Overlay Networks.” Inf. Comput., 2017, pp. 408--424,
doi:10.1016/j.ic.2016.12.006.
short: A. Koutsopoulos, C. Scheideler, T.F. Strothmann, Inf. Comput. (2017) 408--424.
date_created: 2018-03-27T11:23:36Z
date_updated: 2022-01-06T06:53:26Z
department:
- _id: '79'
doi: 10.1016/j.ic.2016.12.006
language:
- iso: eng
page: 408--424
publication: Inf. Comput.
status: public
title: Towards a universal approach for the finite departure problem in overlay networks
type: journal_article
user_id: '15504'
year: '2017'
...
---
_id: '1813'
author:
- first_name: Sandor
full_name: P. Fekete, Sandor
last_name: P. Fekete
- first_name: Andrea
full_name: W. Richa, Andrea
last_name: W. Richa
- first_name: Kay
full_name: Römer, Kay
last_name: Römer
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: P. Fekete S, W. Richa A, Römer K, Scheideler C. Algorithmic Foundations of
Programmable Matter Dagstuhl Seminar 16271. SIGACT News. 2017;(2):87--94.
doi:10.1145/3106700.3106713
apa: P. Fekete, S., W. Richa, A., Römer, K., & Scheideler, C. (2017). Algorithmic
Foundations of Programmable Matter Dagstuhl Seminar 16271. SIGACT News,
(2), 87--94. https://doi.org/10.1145/3106700.3106713
bibtex: '@article{P. Fekete_W. Richa_Römer_Scheideler_2017, title={Algorithmic Foundations
of Programmable Matter Dagstuhl Seminar 16271}, DOI={10.1145/3106700.3106713},
number={2}, journal={SIGACT News}, author={P. Fekete, Sandor and W. Richa, Andrea
and Römer, Kay and Scheideler, Christian}, year={2017}, pages={87--94} }'
chicago: 'P. Fekete, Sandor, Andrea W. Richa, Kay Römer, and Christian Scheideler.
“Algorithmic Foundations of Programmable Matter Dagstuhl Seminar 16271.” SIGACT
News, no. 2 (2017): 87--94. https://doi.org/10.1145/3106700.3106713.'
ieee: S. P. Fekete, A. W. Richa, K. Römer, and C. Scheideler, “Algorithmic Foundations
of Programmable Matter Dagstuhl Seminar 16271,” SIGACT News, no. 2, pp.
87--94, 2017.
mla: P. Fekete, Sandor, et al. “Algorithmic Foundations of Programmable Matter Dagstuhl
Seminar 16271.” SIGACT News, no. 2, 2017, pp. 87--94, doi:10.1145/3106700.3106713.
short: S. P. Fekete, A. W. Richa, K. Römer, C. Scheideler, SIGACT News (2017) 87--94.
date_created: 2018-03-27T11:24:15Z
date_updated: 2022-01-06T06:53:26Z
department:
- _id: '79'
doi: 10.1145/3106700.3106713
issue: '2'
page: 87--94
publication: SIGACT News
status: public
title: Algorithmic Foundations of Programmable Matter Dagstuhl Seminar 16271
type: journal_article
user_id: '15504'
year: '2017'
...
---
_id: '1814'
author:
- first_name: Zahra
full_name: Derakhshandeh, Zahra
last_name: Derakhshandeh
- first_name: Robert
full_name: Gmyr, Robert
last_name: Gmyr
- first_name: Andrea
full_name: W. Richa, Andrea
last_name: W. Richa
- 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: Derakhshandeh Z, Gmyr R, W. Richa A, Scheideler C, Strothmann TF. Universal
coating for programmable matter. Theor Comput Sci. 2017:56--68. doi:10.1016/j.tcs.2016.02.039
apa: Derakhshandeh, Z., Gmyr, R., W. Richa, A., Scheideler, C., & Strothmann,
T. F. (2017). Universal coating for programmable matter. Theor. Comput. Sci.,
56--68. https://doi.org/10.1016/j.tcs.2016.02.039
bibtex: '@article{Derakhshandeh_Gmyr_W. Richa_Scheideler_Strothmann_2017, title={Universal
coating for programmable matter}, DOI={10.1016/j.tcs.2016.02.039},
journal={Theor. Comput. Sci.}, author={Derakhshandeh, Zahra and Gmyr, Robert and
W. Richa, Andrea and Scheideler, Christian and Strothmann, Thim Frederik}, year={2017},
pages={56--68} }'
chicago: Derakhshandeh, Zahra, Robert Gmyr, Andrea W. Richa, Christian Scheideler,
and Thim Frederik Strothmann. “Universal Coating for Programmable Matter.” Theor.
Comput. Sci., 2017, 56--68. https://doi.org/10.1016/j.tcs.2016.02.039.
ieee: Z. Derakhshandeh, R. Gmyr, A. W. Richa, C. Scheideler, and T. F. Strothmann,
“Universal coating for programmable matter,” Theor. Comput. Sci., pp. 56--68,
2017.
mla: Derakhshandeh, Zahra, et al. “Universal Coating for Programmable Matter.” Theor.
Comput. Sci., 2017, pp. 56--68, doi:10.1016/j.tcs.2016.02.039.
short: Z. Derakhshandeh, R. Gmyr, A. W. Richa, C. Scheideler, T.F. Strothmann, Theor.
Comput. Sci. (2017) 56--68.
date_created: 2018-03-27T11:24:57Z
date_updated: 2022-01-06T06:53:26Z
department:
- _id: '79'
doi: 10.1016/j.tcs.2016.02.039
language:
- iso: eng
page: 56--68
publication: Theor. Comput. Sci.
status: public
title: Universal coating for programmable matter
type: journal_article
user_id: '15504'
year: '2017'
...
---
_id: '1815'
author:
- first_name: Joshua
full_name: J. Daymude, Joshua
last_name: J. Daymude
- first_name: Robert
full_name: Gmyr, Robert
last_name: Gmyr
- first_name: Andrea
full_name: W. Richa, Andrea
last_name: W. Richa
- 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: 'J. Daymude J, Gmyr R, W. Richa A, Scheideler C, Strothmann TF. Improved Leader
Election for Self-organizing Programmable Matter. In: Algorithms for Sensor
Systems - 13th International Symposium on Algorithms and Experiments for Wireless
Sensor Networks, ALGOSENSORS 2017, Vienna, Austria, September 7-8, 2017, Revised
Selected Papers. ; 2017:127--140. doi:10.1007/978-3-319-72751-6_10'
apa: J. Daymude, J., Gmyr, R., W. Richa, A., Scheideler, C., & Strothmann, T.
F. (2017). Improved Leader Election for Self-organizing Programmable Matter. In
Algorithms for Sensor Systems - 13th International Symposium on Algorithms
and Experiments for Wireless Sensor Networks, ALGOSENSORS 2017, Vienna, Austria,
September 7-8, 2017, Revised Selected Papers (pp. 127--140). https://doi.org/10.1007/978-3-319-72751-6_10
bibtex: '@inproceedings{J. Daymude_Gmyr_W. Richa_Scheideler_Strothmann_2017, title={Improved
Leader Election for Self-organizing Programmable Matter}, DOI={10.1007/978-3-319-72751-6_10},
booktitle={Algorithms for Sensor Systems - 13th International Symposium on Algorithms
and Experiments for Wireless Sensor Networks, ALGOSENSORS 2017, Vienna, Austria,
September 7-8, 2017, Revised Selected Papers}, author={J. Daymude, Joshua and
Gmyr, Robert and W. Richa, Andrea and Scheideler, Christian and Strothmann, Thim
Frederik}, year={2017}, pages={127--140} }'
chicago: J. Daymude, Joshua, Robert Gmyr, Andrea W. Richa, Christian Scheideler,
and Thim Frederik Strothmann. “Improved Leader Election for Self-Organizing Programmable
Matter.” In Algorithms for Sensor Systems - 13th International Symposium on
Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2017, Vienna,
Austria, September 7-8, 2017, Revised Selected Papers, 127--140, 2017. https://doi.org/10.1007/978-3-319-72751-6_10.
ieee: J. J. Daymude, R. Gmyr, A. W. Richa, C. Scheideler, and T. F. Strothmann,
“Improved Leader Election for Self-organizing Programmable Matter,” in Algorithms
for Sensor Systems - 13th International Symposium on Algorithms and Experiments
for Wireless Sensor Networks, ALGOSENSORS 2017, Vienna, Austria, September 7-8,
2017, Revised Selected Papers, 2017, pp. 127--140.
mla: J. Daymude, Joshua, et al. “Improved Leader Election for Self-Organizing Programmable
Matter.” Algorithms for Sensor Systems - 13th International Symposium on Algorithms
and Experiments for Wireless Sensor Networks, ALGOSENSORS 2017, Vienna, Austria,
September 7-8, 2017, Revised Selected Papers, 2017, pp. 127--140, doi:10.1007/978-3-319-72751-6_10.
short: 'J. J. Daymude, R. Gmyr, A. W. Richa, C. Scheideler, T.F. Strothmann, in:
Algorithms for Sensor Systems - 13th International Symposium on Algorithms and
Experiments for Wireless Sensor Networks, ALGOSENSORS 2017, Vienna, Austria, September
7-8, 2017, Revised Selected Papers, 2017, pp. 127--140.'
date_created: 2018-03-27T11:25:58Z
date_updated: 2022-01-06T06:53:26Z
department:
- _id: '79'
doi: 10.1007/978-3-319-72751-6_10
language:
- iso: eng
page: 127--140
publication: Algorithms for Sensor Systems - 13th International Symposium on Algorithms
and Experiments for Wireless Sensor Networks, ALGOSENSORS 2017, Vienna, Austria,
September 7-8, 2017, Revised Selected Papers
status: public
title: Improved Leader Election for Self-organizing Programmable Matter
type: conference
user_id: '15504'
year: '2017'
...
---
_id: '105'
abstract:
- lang: eng
text: We initiate the study of network monitoring algorithms in a class of hybrid
networks in which the nodes are connected by an external network and an internal
network (as a short form for externally and internally controlled network). While
the external network lies outside of the control of the nodes (or in our case,
the monitoring protocol running in them) and might be exposed to continuous changes,
the internal network is fully under the control of the nodes. As an example, consider
a group of users with mobile devices having access to the cell phone infrastructure.
While the network formed by the WiFi connections of the devices is an external
network (as its structure is not necessarily under the control of the monitoring
protocol), the connections between the devices via the cell phone infrastructure
represent an internal network (as it can be controlled by the monitoring protocol).
Our goal is to continuously monitor properties of the external network with the
help of the internal network. We present scalable distributed algorithms that
efficiently monitor the number of edges, the average node degree, the clustering
coefficient, the bipartiteness, and the weight of a minimum spanning tree. Their
performance bounds demonstrate that monitoring the external network state with
the help of an internal network can be done much more efficiently than just using
the external network, as is usually done in the literature.
author:
- first_name: Robert
full_name: Gmyr, Robert
last_name: Gmyr
- first_name: Kristian
full_name: Hinnenthal, Kristian
id: '32229'
last_name: Hinnenthal
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Christian
full_name: Sohler, Christian
last_name: Sohler
citation:
ama: 'Gmyr R, Hinnenthal K, Scheideler C, Sohler C. Distributed Monitoring of Network
Properties: The Power of Hybrid Networks. In: Proceedings of the 44th International
Colloquium on Automata, Languages, and Programming (ICALP). Leibniz International
Proceedings in Informatics (LIPIcs). ; 2017:137:1--137:15. doi:10.4230/LIPIcs.ICALP.2017.137'
apa: 'Gmyr, R., Hinnenthal, K., Scheideler, C., & Sohler, C. (2017). Distributed
Monitoring of Network Properties: The Power of Hybrid Networks. In Proceedings
of the 44th International Colloquium on Automata, Languages, and Programming (ICALP)
(pp. 137:1--137:15). https://doi.org/10.4230/LIPIcs.ICALP.2017.137'
bibtex: '@inproceedings{Gmyr_Hinnenthal_Scheideler_Sohler_2017, series={Leibniz
International Proceedings in Informatics (LIPIcs)}, title={Distributed Monitoring
of Network Properties: The Power of Hybrid Networks}, DOI={10.4230/LIPIcs.ICALP.2017.137},
booktitle={Proceedings of the 44th International Colloquium on Automata, Languages,
and Programming (ICALP)}, author={Gmyr, Robert and Hinnenthal, Kristian and Scheideler,
Christian and Sohler, Christian}, year={2017}, pages={137:1--137:15}, collection={Leibniz
International Proceedings in Informatics (LIPIcs)} }'
chicago: 'Gmyr, Robert, Kristian Hinnenthal, Christian Scheideler, and Christian
Sohler. “Distributed Monitoring of Network Properties: The Power of Hybrid Networks.”
In Proceedings of the 44th International Colloquium on Automata, Languages,
and Programming (ICALP), 137:1--137:15. Leibniz International Proceedings
in Informatics (LIPIcs), 2017. https://doi.org/10.4230/LIPIcs.ICALP.2017.137.'
ieee: 'R. Gmyr, K. Hinnenthal, C. Scheideler, and C. Sohler, “Distributed Monitoring
of Network Properties: The Power of Hybrid Networks,” in Proceedings of the
44th International Colloquium on Automata, Languages, and Programming (ICALP),
2017, pp. 137:1--137:15.'
mla: 'Gmyr, Robert, et al. “Distributed Monitoring of Network Properties: The Power
of Hybrid Networks.” Proceedings of the 44th International Colloquium on Automata,
Languages, and Programming (ICALP), 2017, pp. 137:1--137:15, doi:10.4230/LIPIcs.ICALP.2017.137.'
short: 'R. Gmyr, K. Hinnenthal, C. Scheideler, C. Sohler, in: Proceedings of the
44th International Colloquium on Automata, Languages, and Programming (ICALP),
2017, pp. 137:1--137:15.'
date_created: 2017-10-17T12:41:12Z
date_updated: 2022-01-06T06:50:42Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.4230/LIPIcs.ICALP.2017.137
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-13T09:23:11Z
date_updated: 2018-03-13T09:23:11Z
file_id: '1207'
file_name: 105-ICALP17-GHSS.pdf
file_size: 504161
relation: main_file
success: 1
file_date_updated: 2018-03-13T09:23:11Z
has_accepted_license: '1'
language:
- iso: eng
page: 137:1--137:15
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 44th International Colloquium on Automata, Languages,
and Programming (ICALP)
series_title: Leibniz International Proceedings in Informatics (LIPIcs)
status: public
title: 'Distributed Monitoring of Network Properties: The Power of Hybrid Networks'
type: conference
user_id: '20792'
year: '2017'
...
---
_id: '125'
abstract:
- lang: eng
text: 'Searching for other participants is one of the most important operations
in a distributed system.We are interested in topologies in which it is possible
to route a packet in a fixed number of hops until it arrives at its destination.Given
a constant $d$, this paper introduces a new self-stabilizing protocol for the
$q$-ary $d$-dimensional de Bruijn graph ($q = \sqrt[d]{n}$) that is able to route
any search request in at most $d$ hops w.h.p., while significantly lowering the
node degree compared to the clique: We require nodes to have a degree of $\mathcal
O(\sqrt[d]{n})$, which is asymptotically optimal for a fixed diameter $d$.The
protocol keeps the expected amount of edge redirections per node in $\mathcal
O(\sqrt[d]{n})$, when the number of nodes in the system increases by factor $2^d$.The
number of messages that are periodically sent out by nodes is constant.'
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. A Self-Stabilizing General De Bruijn Graph. In:
Proceedings of the 19th International Symposium on Stabilization, Safety, and
Security of Distributed Systems (SSS). Vol 10616. Lecture Notes in Computer
Science. Springer, Cham; 2017:250-264. doi:10.1007/978-3-319-69084-1_17'
apa: Feldmann, M., & Scheideler, C. (2017). A Self-Stabilizing General De Bruijn
Graph. In Proceedings of the 19th International Symposium on Stabilization,
Safety, and Security of Distributed Systems (SSS) (Vol. 10616, pp. 250–264).
Springer, Cham. https://doi.org/10.1007/978-3-319-69084-1_17
bibtex: '@inproceedings{Feldmann_Scheideler_2017, series={Lecture Notes in Computer
Science}, title={A Self-Stabilizing General De Bruijn Graph}, volume={10616},
DOI={10.1007/978-3-319-69084-1_17},
booktitle={Proceedings of the 19th International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS)}, publisher={Springer, Cham}, author={Feldmann,
Michael and Scheideler, Christian}, year={2017}, pages={250–264}, collection={Lecture
Notes in Computer Science} }'
chicago: Feldmann, Michael, and Christian Scheideler. “A Self-Stabilizing General
De Bruijn Graph.” In Proceedings of the 19th International Symposium on Stabilization,
Safety, and Security of Distributed Systems (SSS), 10616:250–64. Lecture Notes
in Computer Science. Springer, Cham, 2017. https://doi.org/10.1007/978-3-319-69084-1_17.
ieee: M. Feldmann and C. Scheideler, “A Self-Stabilizing General De Bruijn Graph,”
in Proceedings of the 19th International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS), 2017, vol. 10616, pp. 250–264.
mla: Feldmann, Michael, and Christian Scheideler. “A Self-Stabilizing General De
Bruijn Graph.” Proceedings of the 19th International Symposium on Stabilization,
Safety, and Security of Distributed Systems (SSS), vol. 10616, Springer, Cham,
2017, pp. 250–64, doi:10.1007/978-3-319-69084-1_17.
short: 'M. Feldmann, C. Scheideler, in: Proceedings of the 19th International Symposium
on Stabilization, Safety, and Security of Distributed Systems (SSS), Springer,
Cham, 2017, pp. 250–264.'
date_created: 2017-10-17T12:41:16Z
date_updated: 2022-01-06T06:51:19Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/978-3-319-69084-1_17
external_id:
arxiv:
- '1708.06542'
file:
- access_level: closed
content_type: application/pdf
creator: mfeldma2
date_created: 2018-10-31T13:30:13Z
date_updated: 2018-10-31T13:30:13Z
file_id: '5214'
file_name: Feldmann-Scheideler2017_Chapter_ASelf-stabilizingGeneralDeBrui.pdf
file_size: 311204
relation: main_file
success: 1
file_date_updated: 2018-10-31T13:30:13Z
has_accepted_license: '1'
intvolume: ' 10616'
language:
- iso: eng
page: '250-264 '
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 19th International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS)
publication_identifier:
isbn:
- 978-3-319-69083-4
publication_status: published
publisher: Springer, Cham
series_title: Lecture Notes in Computer Science
status: public
title: A Self-Stabilizing General De Bruijn Graph
type: conference
user_id: '23538'
volume: 10616
year: '2017'
...
---
_id: '215'
abstract:
- lang: eng
text: 'We present three robust overlay networks: First, we present a network that
organizes the nodes into an expander and is resistant to even massive adversarial
churn. Second, we develop a network based on the hypercube that maintains connectivity
under adversarial DoS-attacks. For the DoS-attacks we use the notion of a Omega(log
log n)-late adversary which only has access to topological information that is
at least Omega(log log n) rounds old. Finally, we develop a network that combines
both churn- and DoS-resistance. The networks gain their robustness through constant
network reconfiguration, i.e., the topology of the networks changes constantly.
Our reconguration algorithms are based on node sampling primitives for expanders
and hypercubes that allow each node to sample a logarithmic number of nodes uniformly
at random in O(log log n) communication rounds. These primitives are specific
to overlay networks and their optimal runtime represents an exponential improvement
over known techniques. Our results have a wide range of applications, for example
in the area of scalable and robust peer-to-peer systems.'
author:
- first_name: Maximilian
full_name: Drees, Maximilian
last_name: Drees
- first_name: Robert
full_name: Gmyr, Robert
last_name: Gmyr
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Drees M, Gmyr R, Scheideler C. Churn- and DoS-resistant Overlay Networks Based
on Network Reconfiguration. In: Proceedings of the 28th ACM Symposium on Parallelism
in Algorithms and Architectures (SPAA). ; 2016:417--427. doi:10.1145/2935764.2935783'
apa: Drees, M., Gmyr, R., & Scheideler, C. (2016). Churn- and DoS-resistant
Overlay Networks Based on Network Reconfiguration. In Proceedings of the 28th
ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) (pp. 417--427).
https://doi.org/10.1145/2935764.2935783
bibtex: '@inproceedings{Drees_Gmyr_Scheideler_2016, title={Churn- and DoS-resistant
Overlay Networks Based on Network Reconfiguration}, DOI={10.1145/2935764.2935783},
booktitle={Proceedings of the 28th ACM Symposium on Parallelism in Algorithms
and Architectures (SPAA)}, author={Drees, Maximilian and Gmyr, Robert and Scheideler,
Christian}, year={2016}, pages={417--427} }'
chicago: Drees, Maximilian, Robert Gmyr, and Christian Scheideler. “Churn- and DoS-Resistant
Overlay Networks Based on Network Reconfiguration.” In Proceedings of the 28th
ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 417--427,
2016. https://doi.org/10.1145/2935764.2935783.
ieee: M. Drees, R. Gmyr, and C. Scheideler, “Churn- and DoS-resistant Overlay Networks
Based on Network Reconfiguration,” in Proceedings of the 28th ACM Symposium
on Parallelism in Algorithms and Architectures (SPAA), 2016, pp. 417--427.
mla: Drees, Maximilian, et al. “Churn- and DoS-Resistant Overlay Networks Based
on Network Reconfiguration.” Proceedings of the 28th ACM Symposium on Parallelism
in Algorithms and Architectures (SPAA), 2016, pp. 417--427, doi:10.1145/2935764.2935783.
short: 'M. Drees, R. Gmyr, C. Scheideler, in: Proceedings of the 28th ACM Symposium
on Parallelism in Algorithms and Architectures (SPAA), 2016, pp. 417--427.'
date_created: 2017-10-17T12:41:33Z
date_updated: 2022-01-06T06:55:02Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
doi: 10.1145/2935764.2935783
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T10:41:40Z
date_updated: 2018-03-21T10:41:40Z
file_id: '1518'
file_name: 215-SPAA16-Drees_Gmyr_Scheideler.pdf
file_size: 352996
relation: main_file
success: 1
file_date_updated: 2018-03-21T10:41:40Z
has_accepted_license: '1'
language:
- iso: eng
page: 417--427
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and
Architectures (SPAA)
status: public
title: Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration
type: conference
user_id: '14955'
year: '2016'
...
---
_id: '1835'
author:
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
- first_name: Chen
full_name: Avin, Chen
last_name: Avin
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Michael
full_name: Borokhovich, Michael
last_name: Borokhovich
- first_name: Bernhard
full_name: Haeupler, Bernhard
last_name: Haeupler
- first_name: Zvi
full_name: Lotker, Zvi
last_name: Lotker
citation:
ama: 'Schmid S, Avin C, Scheideler C, Borokhovich M, Haeupler B, Lotker Z. SplayNet:
Towards Locally Self-Adjusting Networks. IEEE/ACM Trans Netw. 2016;(3):1421--1433.
doi:10.1109/TNET.2015.2410313'
apa: 'Schmid, S., Avin, C., Scheideler, C., Borokhovich, M., Haeupler, B., &
Lotker, Z. (2016). SplayNet: Towards Locally Self-Adjusting Networks. IEEE/ACM
Trans. Netw., (3), 1421--1433. https://doi.org/10.1109/TNET.2015.2410313'
bibtex: '@article{Schmid_Avin_Scheideler_Borokhovich_Haeupler_Lotker_2016, title={SplayNet:
Towards Locally Self-Adjusting Networks}, DOI={10.1109/TNET.2015.2410313},
number={3}, journal={IEEE/ACM Trans. Netw.}, author={Schmid, Stefan and Avin,
Chen and Scheideler, Christian and Borokhovich, Michael and Haeupler, Bernhard
and Lotker, Zvi}, year={2016}, pages={1421--1433} }'
chicago: 'Schmid, Stefan, Chen Avin, Christian Scheideler, Michael Borokhovich,
Bernhard Haeupler, and Zvi Lotker. “SplayNet: Towards Locally Self-Adjusting Networks.”
IEEE/ACM Trans. Netw., no. 3 (2016): 1421--1433. https://doi.org/10.1109/TNET.2015.2410313.'
ieee: 'S. Schmid, C. Avin, C. Scheideler, M. Borokhovich, B. Haeupler, and Z. Lotker,
“SplayNet: Towards Locally Self-Adjusting Networks,” IEEE/ACM Trans. Netw.,
no. 3, pp. 1421--1433, 2016.'
mla: 'Schmid, Stefan, et al. “SplayNet: Towards Locally Self-Adjusting Networks.”
IEEE/ACM Trans. Netw., no. 3, 2016, pp. 1421--1433, doi:10.1109/TNET.2015.2410313.'
short: S. Schmid, C. Avin, C. Scheideler, M. Borokhovich, B. Haeupler, Z. Lotker,
IEEE/ACM Trans. Netw. (2016) 1421--1433.
date_created: 2018-03-27T12:40:24Z
date_updated: 2022-01-06T06:53:29Z
department:
- _id: '79'
doi: 10.1109/TNET.2015.2410313
issue: '3'
page: 1421--1433
publication: IEEE/ACM Trans. Netw.
status: public
title: 'SplayNet: Towards Locally Self-Adjusting Networks'
type: journal_article
user_id: '15504'
year: '2016'
...
---
_id: '1836'
author:
- first_name: Zahra
full_name: Derakhshandeh, Zahra
last_name: Derakhshandeh
- first_name: Robert
full_name: Gmyr, Robert
last_name: Gmyr
- first_name: Alexandra
full_name: Porter, Alexandra
last_name: Porter
- first_name: Andrea
full_name: W. Richa, Andrea
last_name: W. Richa
- 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: 'Derakhshandeh Z, Gmyr R, Porter A, W. Richa A, Scheideler C, Strothmann TF.
On the Runtime of Universal Coating for Programmable Matter. In: DNA Computing
and Molecular Programming - 22nd International Conference, DNA 22, Munich, Germany,
September 4-8, 2016, Proceedings. Vol 9818. Lecture Notes in Computer Science.
; 2016:148--164. doi:10.1007/978-3-319-43994-5_10'
apa: Derakhshandeh, Z., Gmyr, R., Porter, A., W. Richa, A., Scheideler, C., &
Strothmann, T. F. (2016). On the Runtime of Universal Coating for Programmable
Matter. In DNA Computing and Molecular Programming - 22nd International Conference,
DNA 22, Munich, Germany, September 4-8, 2016, Proceedings (Vol. 9818, pp.
148--164). https://doi.org/10.1007/978-3-319-43994-5_10
bibtex: '@inproceedings{Derakhshandeh_Gmyr_Porter_W. Richa_Scheideler_Strothmann_2016,
series={Lecture Notes in Computer Science}, title={On the Runtime of Universal
Coating for Programmable Matter}, volume={9818}, DOI={10.1007/978-3-319-43994-5_10},
booktitle={DNA Computing and Molecular Programming - 22nd International Conference,
DNA 22, Munich, Germany, September 4-8, 2016, Proceedings}, author={Derakhshandeh,
Zahra and Gmyr, Robert and Porter, Alexandra and W. Richa, Andrea and Scheideler,
Christian and Strothmann, Thim Frederik}, year={2016}, pages={148--164}, collection={Lecture
Notes in Computer Science} }'
chicago: Derakhshandeh, Zahra, Robert Gmyr, Alexandra Porter, Andrea W. Richa, Christian
Scheideler, and Thim Frederik Strothmann. “On the Runtime of Universal Coating
for Programmable Matter.” In DNA Computing and Molecular Programming - 22nd
International Conference, DNA 22, Munich, Germany, September 4-8, 2016, Proceedings,
9818:148--164. Lecture Notes in Computer Science, 2016. https://doi.org/10.1007/978-3-319-43994-5_10.
ieee: Z. Derakhshandeh, R. Gmyr, A. Porter, A. W. Richa, C. Scheideler, and T. F.
Strothmann, “On the Runtime of Universal Coating for Programmable Matter,” in
DNA Computing and Molecular Programming - 22nd International Conference, DNA
22, Munich, Germany, September 4-8, 2016, Proceedings, 2016, vol. 9818, pp.
148--164.
mla: Derakhshandeh, Zahra, et al. “On the Runtime of Universal Coating for Programmable
Matter.” DNA Computing and Molecular Programming - 22nd International Conference,
DNA 22, Munich, Germany, September 4-8, 2016, Proceedings, vol. 9818, 2016,
pp. 148--164, doi:10.1007/978-3-319-43994-5_10.
short: 'Z. Derakhshandeh, R. Gmyr, A. Porter, A. W. Richa, C. Scheideler, T.F. Strothmann,
in: DNA Computing and Molecular Programming - 22nd International Conference, DNA
22, Munich, Germany, September 4-8, 2016, Proceedings, 2016, pp. 148--164.'
date_created: 2018-03-27T12:41:45Z
date_updated: 2022-01-06T06:53:30Z
department:
- _id: '79'
doi: 10.1007/978-3-319-43994-5_10
intvolume: ' 9818'
language:
- iso: eng
page: 148--164
publication: DNA Computing and Molecular Programming - 22nd International Conference,
DNA 22, Munich, Germany, September 4-8, 2016, Proceedings
publication_identifier:
unknown:
- 978-3-319-43993-8
series_title: Lecture Notes in Computer Science
status: public
title: On the Runtime of Universal Coating for Programmable Matter
type: conference
user_id: '15504'
volume: 9818
year: '2016'
...
---
_id: '1837'
author:
- first_name: Zahra
full_name: Derakhshandeh, Zahra
last_name: Derakhshandeh
- first_name: Robert
full_name: Gmyr, Robert
last_name: Gmyr
- first_name: Andrea
full_name: W. Richa, Andrea
last_name: W. Richa
- 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: 'Derakhshandeh Z, Gmyr R, W. Richa A, Scheideler C, Strothmann TF. Universal
Shape Formation for Programmable Matter. In: Proceedings of the 28th ACM Symposium
on Parallelism in Algorithms and Architectures, SPAA 2016, Asilomar State Beach/Pacific
Grove, CA, USA, July 11-13, 2016. ACM; 2016:289--299. doi:10.1145/2935764.2935784'
apa: Derakhshandeh, Z., Gmyr, R., W. Richa, A., Scheideler, C., & Strothmann,
T. F. (2016). Universal Shape Formation for Programmable Matter. In Proceedings
of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA
2016, Asilomar State Beach/Pacific Grove, CA, USA, July 11-13, 2016 (pp. 289--299).
ACM. https://doi.org/10.1145/2935764.2935784
bibtex: '@inproceedings{Derakhshandeh_Gmyr_W. Richa_Scheideler_Strothmann_2016,
title={Universal Shape Formation for Programmable Matter}, DOI={10.1145/2935764.2935784},
booktitle={Proceedings of the 28th ACM Symposium on Parallelism in Algorithms
and Architectures, SPAA 2016, Asilomar State Beach/Pacific Grove, CA, USA, July
11-13, 2016}, publisher={ACM}, author={Derakhshandeh, Zahra and Gmyr, Robert and
W. Richa, Andrea and Scheideler, Christian and Strothmann, Thim Frederik}, year={2016},
pages={289--299} }'
chicago: Derakhshandeh, Zahra, Robert Gmyr, Andrea W. Richa, Christian Scheideler,
and Thim Frederik Strothmann. “Universal Shape Formation for Programmable Matter.”
In Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures,
SPAA 2016, Asilomar State Beach/Pacific Grove, CA, USA, July 11-13, 2016,
289--299. ACM, 2016. https://doi.org/10.1145/2935764.2935784.
ieee: Z. Derakhshandeh, R. Gmyr, A. W. Richa, C. Scheideler, and T. F. Strothmann,
“Universal Shape Formation for Programmable Matter,” in Proceedings of the
28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016,
Asilomar State Beach/Pacific Grove, CA, USA, July 11-13, 2016, 2016, pp. 289--299.
mla: Derakhshandeh, Zahra, et al. “Universal Shape Formation for Programmable Matter.”
Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures,
SPAA 2016, Asilomar State Beach/Pacific Grove, CA, USA, July 11-13, 2016,
ACM, 2016, pp. 289--299, doi:10.1145/2935764.2935784.
short: 'Z. Derakhshandeh, R. Gmyr, A. W. Richa, C. Scheideler, T.F. Strothmann,
in: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures,
SPAA 2016, Asilomar State Beach/Pacific Grove, CA, USA, July 11-13, 2016, ACM,
2016, pp. 289--299.'
date_created: 2018-03-27T12:44:09Z
date_updated: 2022-01-06T06:53:30Z
department:
- _id: '79'
doi: 10.1145/2935764.2935784
language:
- iso: eng
page: 289--299
publication: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and
Architectures, SPAA 2016, Asilomar State Beach/Pacific Grove, CA, USA, July 11-13,
2016
publication_identifier:
unknown:
- 978-1-4503-4210-0
publisher: ACM
status: public
title: Universal Shape Formation for Programmable Matter
type: conference
user_id: '15504'
year: '2016'
...
---
_id: '1845'
author:
- first_name: Andrea
full_name: W. Richa, Andrea
last_name: W. Richa
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'W. Richa A, Scheideler C. Jamming-Resistant MAC Protocols for Wireless Networks.
In: Encyclopedia of Algorithms. ; 2016:999--1002. doi:10.1007/978-1-4939-2864-4_593'
apa: W. Richa, A., & Scheideler, C. (2016). Jamming-Resistant MAC Protocols
for Wireless Networks. In Encyclopedia of Algorithms (pp. 999--1002). https://doi.org/10.1007/978-1-4939-2864-4_593
bibtex: '@inbook{W. Richa_Scheideler_2016, title={Jamming-Resistant MAC Protocols
for Wireless Networks}, DOI={10.1007/978-1-4939-2864-4_593},
booktitle={Encyclopedia of Algorithms}, author={W. Richa, Andrea and Scheideler,
Christian}, year={2016}, pages={999--1002} }'
chicago: W. Richa, Andrea, and Christian Scheideler. “Jamming-Resistant MAC Protocols
for Wireless Networks.” In Encyclopedia of Algorithms, 999--1002, 2016.
https://doi.org/10.1007/978-1-4939-2864-4_593.
ieee: A. W. Richa and C. Scheideler, “Jamming-Resistant MAC Protocols for Wireless
Networks,” in Encyclopedia of Algorithms, 2016, pp. 999--1002.
mla: W. Richa, Andrea, and Christian Scheideler. “Jamming-Resistant MAC Protocols
for Wireless Networks.” Encyclopedia of Algorithms, 2016, pp. 999--1002,
doi:10.1007/978-1-4939-2864-4_593.
short: 'A. W. Richa, C. Scheideler, in: Encyclopedia of Algorithms, 2016, pp. 999--1002.'
date_created: 2018-03-28T05:45:04Z
date_updated: 2022-01-06T06:53:32Z
department:
- _id: '79'
doi: 10.1007/978-1-4939-2864-4_593
page: 999--1002
publication: Encyclopedia of Algorithms
status: public
title: Jamming-Resistant MAC Protocols for Wireless Networks
type: book_chapter
user_id: '15504'
year: '2016'
...
---
_id: '155'
abstract:
- lang: eng
text: We present a self-stabilizing algorithm for overlay networks that, for an
arbitrary metric given by a distance oracle, constructs the graph representing
that metric. The graph representing a metric is the unique minimal undirected
graph such that for any pair of nodes the length of a shortest path between the
nodes corresponds to the distance between the nodes according to the metric. The
algorithm works under both an asynchronous and a synchronous daemon. In the synchronous
case, the algorithm stablizes in time O(n) and it is almost silent in that after
stabilization a node sends and receives a constant number of messages per round.
author:
- first_name: Robert
full_name: Gmyr, Robert
last_name: Gmyr
- first_name: Jonas
full_name: Lefèvre, Jonas
last_name: Lefèvre
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Gmyr R, Lefèvre J, Scheideler C. Self-stabilizing Metric Graphs. In: Proceedings
of the 18th International Symposium on Stabilization, Safety, and Security of
Distributed Systems (SSS). LNCS. ; 2016:248--262. doi:10.1007/978-3-319-49259-9_20'
apa: Gmyr, R., Lefèvre, J., & Scheideler, C. (2016). Self-stabilizing Metric
Graphs. In Proceedings of the 18th International Symposium on Stabilization,
Safety, and Security of Distributed Systems (SSS) (pp. 248--262). https://doi.org/10.1007/978-3-319-49259-9_20
bibtex: '@inproceedings{Gmyr_Lefèvre_Scheideler_2016, series={LNCS}, title={Self-stabilizing
Metric Graphs}, DOI={10.1007/978-3-319-49259-9_20},
booktitle={Proceedings of the 18th International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS)}, author={Gmyr, Robert and Lefèvre,
Jonas and Scheideler, Christian}, year={2016}, pages={248--262}, collection={LNCS}
}'
chicago: Gmyr, Robert, Jonas Lefèvre, and Christian Scheideler. “Self-Stabilizing
Metric Graphs.” In Proceedings of the 18th International Symposium on Stabilization,
Safety, and Security of Distributed Systems (SSS), 248--262. LNCS, 2016. https://doi.org/10.1007/978-3-319-49259-9_20.
ieee: R. Gmyr, J. Lefèvre, and C. Scheideler, “Self-stabilizing Metric Graphs,”
in Proceedings of the 18th International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS), 2016, pp. 248--262.
mla: Gmyr, Robert, et al. “Self-Stabilizing Metric Graphs.” Proceedings of the
18th International Symposium on Stabilization, Safety, and Security of Distributed
Systems (SSS), 2016, pp. 248--262, doi:10.1007/978-3-319-49259-9_20.
short: 'R. Gmyr, J. Lefèvre, C. Scheideler, in: Proceedings of the 18th International
Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS),
2016, pp. 248--262.'
date_created: 2017-10-17T12:41:22Z
date_updated: 2022-01-06T06:52:28Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/978-3-319-49259-9_20
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T12:51:24Z
date_updated: 2018-03-21T12:51:24Z
file_id: '1550'
file_name: 155-SSS16-GLS.pdf
file_size: 389136
relation: main_file
success: 1
file_date_updated: 2018-03-21T12:51:24Z
has_accepted_license: '1'
page: 248--262
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 18th International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS)
series_title: LNCS
status: public
title: Self-stabilizing Metric Graphs
type: conference
user_id: '15504'
year: '2016'
...
---
_id: '142'
abstract:
- lang: eng
text: For overlay networks, the ability to recover from a variety of problems like
membership changes or faults is a key element to preserve their functionality.
In recent years, various self-stabilizing overlay networks have been proposed
that have the advantage of being able to recover from any illegal state. However,
the vast majority of these networks cannot give any guarantees on its functionality
while the recovery process is going on. We are especially interested in searchability,
i.e., the functionality that search messages for a specific identifier are answered
successfully if a node with that identifier exists in the network. We investigate
overlay networks that are not only self-stabilizing but that also ensure that
monotonic searchability is maintained while the recovery process is going on,
as long as there are no corrupted messages in the system. More 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. Monotonic searchability was
recently introduced in OPODIS 2015, in which the authors provide a solution for
a simple line topology.We present the first universal approach to maintain monotonic
searchability that is applicable to a wide range of topologies. As the base for
our approach, we introduce a set of primitives for manipulating overlay networks
that allows us to maintain searchability and show how existing protocols can be
transformed to use theses primitives.We complement this result with a generic
search protocol that together with the use of our primitives guarantees monotonic
searchability.As an additional feature, searching existing nodes with the generic
search protocol is as fast as searching a node with any other fixed routing protocol
once the topology has stabilized.
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
- first_name: Thim Frederik
full_name: Strothmann, Thim Frederik
id: '11319'
last_name: Strothmann
citation:
ama: 'Scheideler C, Setzer A, Strothmann TF. Towards a Universal Approach for Monotonic
Searchability in Self-stabilizing Overlay Networks. In: Proceedings of the
30th International Symposium on Distributed Computing (DISC). LNCS. ; 2016:71--84.
doi:10.1007/978-3-662-53426-7_6'
apa: Scheideler, C., Setzer, A., & Strothmann, T. F. (2016). Towards a Universal
Approach for Monotonic Searchability in Self-stabilizing Overlay Networks. In
Proceedings of the 30th International Symposium on Distributed Computing (DISC)
(pp. 71--84). https://doi.org/10.1007/978-3-662-53426-7_6
bibtex: '@inproceedings{Scheideler_Setzer_Strothmann_2016, series={LNCS}, title={Towards
a Universal Approach for Monotonic Searchability in Self-stabilizing Overlay Networks},
DOI={10.1007/978-3-662-53426-7_6},
booktitle={Proceedings of the 30th International Symposium on Distributed Computing
(DISC)}, author={Scheideler, Christian and Setzer, Alexander and Strothmann, Thim
Frederik}, year={2016}, pages={71--84}, collection={LNCS} }'
chicago: Scheideler, Christian, Alexander Setzer, and Thim Frederik Strothmann.
“Towards a Universal Approach for Monotonic Searchability in Self-Stabilizing
Overlay Networks.” In Proceedings of the 30th International Symposium on Distributed
Computing (DISC), 71--84. LNCS, 2016. https://doi.org/10.1007/978-3-662-53426-7_6.
ieee: C. Scheideler, A. Setzer, and T. F. Strothmann, “Towards a Universal Approach
for Monotonic Searchability in Self-stabilizing Overlay Networks,” in Proceedings
of the 30th International Symposium on Distributed Computing (DISC), 2016,
pp. 71--84.
mla: Scheideler, Christian, et al. “Towards a Universal Approach for Monotonic Searchability
in Self-Stabilizing Overlay Networks.” Proceedings of the 30th International
Symposium on Distributed Computing (DISC), 2016, pp. 71--84, doi:10.1007/978-3-662-53426-7_6.
short: 'C. Scheideler, A. Setzer, T.F. Strothmann, in: Proceedings of the 30th International
Symposium on Distributed Computing (DISC), 2016, pp. 71--84.'
date_created: 2017-10-17T12:41:19Z
date_updated: 2022-01-06T06:51:56Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/978-3-662-53426-7_6
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T12:59:29Z
date_updated: 2018-03-21T12:59:29Z
file_id: '1558'
file_name: 142-SchSetStrDISC16.pdf
file_size: 209638
relation: main_file
success: 1
file_date_updated: 2018-03-21T12:59:29Z
has_accepted_license: '1'
language:
- iso: eng
page: 71--84
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 30th International Symposium on Distributed Computing
(DISC)
series_title: LNCS
status: public
title: Towards a Universal Approach for Monotonic Searchability in Self-stabilizing
Overlay Networks
type: conference
user_id: '477'
year: '2016'
...
---
_id: '284'
abstract:
- lang: eng
text: In this work, we present the first scalable distributed information system,
that is, a system with low storage overhead, that is provably robust against denial-of-service
(DoS) attacks by a current insider. We allow a current insider to have complete
knowledge about the information system and to have the power to block any ϵ-fraction
of its servers by a DoS attack, where ϵ can be chosen up to a constant. The task
of the system is to serve any collection of lookup requests with at most one per
nonblocked server in an efficient way despite this attack. Previously, scalable
solutions were only known for DoS attacks of past insiders, where a past insider
only has complete knowledge about some past time point t0 of the information system.
Scheideler et al. [Awerbuch and Scheideler 2007; Baumgart et al. 2009] showed
that in this case, it is possible to design an information system so that any
information that was inserted or last updated after t0 is safe against a DoS attack.
But their constructions would not work at all for a current insider. The key idea
behind our IRIS system is to make extensive use of coding. More precisely, we
present two alternative distributed coding strategies with an at most logarithmic
storage overhead that can handle up to a constant fraction of blocked servers.
author:
- first_name: Martina
full_name: Eikel, Martina
last_name: Eikel
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Eikel M, Scheideler C. IRIS: A Robust Information System Against Insider DoS
Attacks. Transactions on Parallel Computing. 2015;(3):18:1--18:33. doi:10.1145/2809806'
apa: 'Eikel, M., & Scheideler, C. (2015). IRIS: A Robust Information System
Against Insider DoS Attacks. Transactions on Parallel Computing, (3), 18:1--18:33.
https://doi.org/10.1145/2809806'
bibtex: '@article{Eikel_Scheideler_2015, title={IRIS: A Robust Information System
Against Insider DoS Attacks}, DOI={10.1145/2809806},
number={3}, journal={Transactions on Parallel Computing}, publisher={ACM}, author={Eikel,
Martina and Scheideler, Christian}, year={2015}, pages={18:1--18:33} }'
chicago: 'Eikel, Martina, and Christian Scheideler. “IRIS: A Robust Information
System Against Insider DoS Attacks.” Transactions on Parallel Computing,
no. 3 (2015): 18:1--18:33. https://doi.org/10.1145/2809806.'
ieee: 'M. Eikel and C. Scheideler, “IRIS: A Robust Information System Against Insider
DoS Attacks,” Transactions on Parallel Computing, no. 3, pp. 18:1--18:33,
2015.'
mla: 'Eikel, Martina, and Christian Scheideler. “IRIS: A Robust Information System
Against Insider DoS Attacks.” Transactions on Parallel Computing, no. 3,
ACM, 2015, pp. 18:1--18:33, doi:10.1145/2809806.'
short: M. Eikel, C. Scheideler, Transactions on Parallel Computing (2015) 18:1--18:33.
date_created: 2017-10-17T12:41:47Z
date_updated: 2022-01-06T06:58:03Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1145/2809806
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:25:04Z
date_updated: 2018-03-21T09:25:04Z
file_id: '1468'
file_name: 284-Eikel-Scheideler-ACM2015.pdf
file_size: 651726
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:25:04Z
has_accepted_license: '1'
issue: '3'
page: 18:1--18:33
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
publication: Transactions on Parallel Computing
publisher: ACM
status: public
title: 'IRIS: A Robust Information System Against Insider DoS Attacks'
type: journal_article
user_id: '477'
year: '2015'
...