A Self-Stabilization Process for Small-World Networks

Kniesburges, Sebastian; Koutsopoulos, Andreas; Scheideler, Christian

doi:10.1109/ipdps.2012.115

Cited by 11 publications

(11 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…While we are interested in structured topologies, there has been work in semistructured networks. For instance, self-stabilizing semi-structured networks such as a small world network [14] or a power law network [1] have been proposed. Götte et al [7] recently presented an algorithm for quickly converting certain topologies into ones with a logarithmic diameter.…”

Section: Related Work and Comparisonsmentioning

confidence: 99%

Network Scaffolding for Efficient Stabilization of the Chord Overlay Network

Berns¹

2021

Preprint

View full text Add to dashboard Cite

Overlay networks, where nodes communicate with neighbors over logical links consisting of zero or more physical links, have become an important part of modern networking. From data centers to IoT devices, overlay networks are used to organize a diverse set of processes for efficient operations like searching and routing. Many of these overlay networks operate in fragile environments where faults that perturb the logical network topology are commonplace. Self-stabilizing overlay networks offer one approach for managing these faults, promising to build or restore a particular topology from any weakly-connected initial configuration. Designing efficient self-stabilizing algorithms for many topologies, however, is not an easy task. For non-trivial topologies that have desirable properties like low diameter and robust routing in the face of node or link failures, self-stabilizing algorithms to date have had at least linear running time or space requirements. In this work, we address this issue by presenting an algorithm for building a Chord network that has polylogarithmic time and space complexity. Furthermore, we discuss how the technique we use for building this Chord network can be generalized into a "design pattern" for other desirable overlay network topologies.

show abstract

Section: Related Work and Comparisonsmentioning

confidence: 99%

Network Scaffolding for Efficient Stabilization of the Chord Overlay Network

Berns¹

2021

Preprint

View full text Add to dashboard Cite

show abstract

“…The cycle topology is particularly important for our work. Our cycle protocol is based on [12], in which the authors construct a self-stabilizing cycle that acts as a base for additional long-range links, both together forming a small-world network.…”

Section: Related Workmentioning

confidence: 99%

Self-Stabilizing Supervised Publish-Subscribe Systems

Feldmann

Kolb

Scheideler

et al. 2018

2018 IEEE International Parallel and Distributed Processing Symposium (IPDPS)

Self Cite

View full text Add to dashboard Cite

In this paper we present two major results: First, we introduce the first self-stabilizing version of a supervised overlay network (as introduced in [14]) 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. ACM Subject Classification C.2.4 Distributed SystemsSelf-Stabilizing Supervised Publish-Subscribe Systems 1:4 Self-Stabilizing Supervised Publish-Subscribe Systems new publications for topics to subscribers only after O(n) steps. Subscribe and unsubscribe requests are processed by updating the routing table at nodes. Both systems described above differ from our approach, as they solely focus on the routing scheme and updates of the routing tables, while we focus on updating the topology upon subscribe/unsubscribe requests. Additionally, our system is able to deliver publications in O(log n) steps, if we use flooding, since we use a network with logarithmic diameter. Furthermore, we are also able to deliver all publications of a domain to a new subscriber after only a constant number of rounds.There is a close relationship between group communication services (e.g., [9,1]) and publish-subscribe systems. Processes are ordered in groups in both paradigms and groupmessages are only distributed among all members of some group. Self-stabilizing group communication services are proposed in [6] for ad-hoc networks and in [5] for directed networks. However, there are some key differences: In group communication services, participants have to agree on group membership views. This results in a high memory overhead for each member of a group, as nodes in a group technically form a clique. On the other hand subscribers of topics in publish-subscribe systems are in general not interested in any other members of the topic. For our approach, this results in logarithmic worst-case and constant average case degree for subscribers.

show abstract

“…On the one hand, small-world networks model real world complex systems such as neural networks, food webs, scientific-collaboration networks, and computer networks [Kniesburges et al 2012]. These networks are characterized by the small-world phenomenon, in which nodes have small neighborhoods, and yet it is possible to reach any other node in a small number of hops.…”

Section: Empirical Settingsmentioning

confidence: 99%

Fostering Cooperation through Dynamic Coalition Formation and Partner Switching

Peleteiro

Burguillo

Arcos

et al. 2014

ACM Trans. Auton. Adapt. Syst.

View full text Add to dashboard Cite

In this paper we tackle the problem of maximizing cooperation among self-interested agents in a resource exchange environment. Our main concern is the design of mechanisms for maximizing cooperation among self-interested agents in a way that their profits increase by exchanging or trading with resources. Although dynamic coalition formation and partner switching (rewiring) have been shown to promote the emergence and maintenance of cooperation for self-interested agents, no prior work in the literature has investigated whether merging both mechanisms exhibits positive synergies that lead to increase cooperation even further. Therefore, we introduce and analyze a novel dynamic coalition formation mechanism, that uses partner switching, to help self-interested agents to increase their profits in a resource exchange environment. Our experiments show the effectiveness of our mechanism at increasing the agents' profits, as well as the emergence of trading as the preferred behavior over different types of complex networks.

show abstract

A Self-Stabilization Process for Small-World Networks

Cited by 11 publications

References 27 publications

Network Scaffolding for Efficient Stabilization of the Chord Overlay Network

Network Scaffolding for Efficient Stabilization of the Chord Overlay Network

Self-Stabilizing Supervised Publish-Subscribe Systems

Fostering Cooperation through Dynamic Coalition Formation and Partner Switching

Contact Info

Product

Resources

About