--- res: bibo_abstract: - '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. There are a number of studies for safe node exclusion if the overlay is in a well-defined state, but almost no formal results are known 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 when woken up by an incoming message. We are the first to present a self-stabilizing protocol for the FDP and the FSP that can be combined with a large class of overlay maintenance protocols so that these are then guaranteed to safely exclude leaving nodes from the system from any initial state while operating as specified for the staying nodes. In order to formally define the properties these overlay maintenance protocols have to satisfy, we identify four basic primitives for manipulating edges in an overlay network that might be of independent interest.@eng' bibo_authorlist: - foaf_Person: foaf_givenName: Andreas foaf_name: Koutsopoulos, Andreas foaf_surname: Koutsopoulos - foaf_Person: foaf_givenName: Christian foaf_name: Scheideler, Christian foaf_surname: Scheideler foaf_workInfoHomepage: http://www.librecat.org/personId=20792 - foaf_Person: foaf_givenName: Thim Frederik foaf_name: Strothmann, Thim Frederik foaf_surname: Strothmann foaf_workInfoHomepage: http://www.librecat.org/personId=11319 bibo_doi: 10.1007/978-3-319-21741-3_14 dct_date: 2015^xs_gYear dct_language: eng dct_title: Towards a Universal Approach for the Finite Departure Problem in Overlay Networks@ ...