skip to main content
10.1145/3350546.3352536acmotherconferencesArticle/Chapter ViewAbstractPublication PageswiConference Proceedingsconference-collections
short-paper

Self-Stabilizing Topology Computation (Identification) of Cactus Graphs Using Master Slave Token Circulation

Published: 14 October 2019 Publication History

Abstract

In this paper we propose a self stabilizing algorithm to compute the topology of a given arbitrary cactus graph; we use the most recent self stabilizing algorithm for token circulation in Cactus graphs [2] and design the proposed algorithm by making a single token traverse the graph multiple times and accumulating the topology information at the master node incrementally after each round in a space efficient way. The topology computation is completed in O(n2) steps with O(Δ) bits extra storage at each node, where n is the number of nodes in the graph, and Δ is the maximum degree of the cactus graph.

References

[1]
Y. Afek and G.M. Brown. 1993. Self-Stabilization Over Unreliable Communication Media. Distributed Computing 7, 1 (Nov. 1993), 27–34.
[2]
Yihua Ding, James Z. Wang, and Pradip K Srimani. 2018. Self-Stabilizing Master-Slave Token Circulation in Unoriented Cactus Graphs. In 2018 IEEE/WIC/ACM International Conference on Web Intelligence (WI). 41–48.

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences
WI '19: IEEE/WIC/ACM International Conference on Web Intelligence
October 2019
507 pages
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 14 October 2019

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Short-paper
  • Research
  • Refereed limited

Conference

WI '19

Acceptance Rates

Overall Acceptance Rate 118 of 178 submissions, 66%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 26
    Total Downloads
  • Downloads (Last 12 months)2
  • Downloads (Last 6 weeks)0
Reflects downloads up to 14 Feb 2025

Other Metrics

Citations

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

HTML Format

View this article in HTML Format.

HTML Format

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media