Self-stabilizing group communication in directed networks

Shlomi Dolev, Elad Schiller

Research output: Contribution to journalArticlepeer-review

14 Scopus citations

Abstract

This paper presents the first self-stabilizing group membership service, multicast service, and resource allocation service for directed networks. The first group communication algorithm is based on a token circulation over a virtual ring. The second algorithm is based on construction of distributed spanning trees. In addition, a technique is presented that emulates, in a self-stabilizing fashion, any undirected communication network over strongly connected directed networks, is presented. A resource allocation asynchronous algorithm for strongly connected directed networks is presented.

Original languageEnglish
Pages (from-to)609-636
Number of pages28
JournalActa Informatica
Volume40
Issue number9
DOIs
StatePublished - 1 Sep 2004

Keywords

  • Directed networks
  • Group communication
  • Self-stabilization

Fingerprint

Dive into the research topics of 'Self-stabilizing group communication in directed networks'. Together they form a unique fingerprint.

Cite this