Unsettled – Reconsidering the Notion of ‘Homelessness’ through the Lens of Urban Movement

This paper proposes to reconsider the notion of ‘homelessness’ under the lens of urban movement, suggesting that the long prevailing stigma against people experiencing homelessness is a repercussion of the idea that living an unsettled life can destabilize capitalist societies. Living on the move, by choice or, most commonly, without one, embodies a resistance to the capitalist valorization of land: Transient lifestyles resist the precept of property ownership, and hint at alternative ways of living in cities, beyond capitalist norms. Simultaneously, they are bodily evidence of the mechanisms of urban displacement further triggered by real estate speculation, as it is the socio-economic and political system of capitalism which produces contemporary conditions of unchosen homelessness. Thus, the paper links the stigmatization of homelessness to notions of urban movement and capitalist urban logics. Untangling these complex dependencies, then, becomes also a way to reconsider notions of making a home in cities

Self-Stabilizing Supervised Publish-Subscribe Systems

In this paper we present two major results: First, we introduce the first self-stabilizing version of a supervised overlay network by presenting a self-stabilizing supervised skip ring. Secondly, we show how to use the self-stabilizing supervised skip ring to construct an efficient self-stabilizing publish-subscribe system. That is, in addition to stabilizing the overlay network, every subscriber of a topic will eventually know all of the publications that have been issued so far for that topic. The communication work needed to processes a subscribe or unsubscribe operation is just a constant in a legitimate state, and the communication work of checking whether the system is still in a legitimate state is just a constant on expectation for the supervisor as well as any process in the system

Towards Establishing Monotonic Searchability in Self-Stabilizing Data Structures

Distributed applications are commonly based on overlay networks interconnecting their sites so that they can exchange information. For these overlay networks to preserve their functionality, they should be able to recover from various problems like membership changes or faults. Various self-stabilizing overlay networks have already been proposed in recent years, which have the advantage of being able to recover from any illegal state, but none of these networks can give any guarantees on its functionality while the recovery process is going on. We initiate research on overlay networks that are not only self-stabilizing but that also ensure that 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. We call this property monotonic searchability. We show that in general it is impossible to provide monotonic searchability if corrupted messages are present in the system, which justifies the restriction to system states without corrupted messages. Furthermore, we provide a self-stabilizing protocol for the line for which we can also show monotonic searchability. It turns out that even for the line it is non-trivial to achieve this property. Additionally, we extend our protocol to deal with node departures in terms of the Finite Departure Problem of Foreback et al. (SSS 2014). This makes our protocol even capable of handling node dynamics