Self-stabilizing group communication in directed networks (extended abstract)

Shlomi Dolev, Elad Schiller

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

2 Scopus citations

Abstract

Self-stabilizing group membership service, multicast service, and resource allocation service in directed network are presented. 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 that emulates, in a self-stabilizing fashion, any undirected communication network over strongly connected directed network, is presented.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsShing-Tsaan Huang, Ted Herman
PublisherSpringer Verlag
Pages61-76
Number of pages16
ISBN (Print)3540404538, 9783540404538
DOIs
StatePublished - 1 Jan 2003

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2704
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Keywords

  • Directed Networks
  • Group Communication
  • Self-Stabilization

Fingerprint

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

Cite this