A self-stabilizing algorithm for the st-order problem

Authors:
Pranay Chaudhuri;Hussein Thompson
Affiliations:
Department of Computer Science, Mathematics and Physics, University of the West Indies, Bridgetown, Barbados;Department of Computer Science, Mathematics and Physics, University of the West Indies, Bridgetown, Barbados
Venue:
International Journal of Parallel, Emergent and Distributed Systems
Year:
2008

Citing 15
Cited 1

A self-stabilizing algorithm for constructing spanning trees

Information Processing Letters
A self-stabilizing algorithm for constructing breadth-first trees

Information Processing Letters
A self-stabilizing algorithm for maximal matching

Information Processing Letters
Self-stabilization

ACM Computing Surveys (CSUR)
Self-stabilizing depth-first search

Information Processing Letters
A transformation of self-stabilizing serial model programs for asynchronous parallel computing environments

Information Processing Letters
A self-stabilizing algorithm for detecting fundamental cycles in a graph

Journal of Computer and System Sciences
Self-stabilization

Self-stabilization
Self-stabilizing systems in spite of distributed control

Communications of the ACM
A dynamic self-stabilizing algorithm for constructing a transport net

Computing
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
Distributed Self-Stabilizing Algorithm for Minimum Spanning Tree Construction

Euro-Par '97 Proceedings of the Third International Euro-Par Conference on Parallel Processing
Linear time self-stabilizing colorings

Information Processing Letters
A self-stabilizing algorithm for bridge finding

Distributed Computing
Self-stabilization of dynamic systems assuming only read/write atomicity

Distributed Computing - Special issue: Self-stabilization

REUSE: A combined routing and link scheduling mechanism for wireless mesh networks

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Given a biconnected graph G with n nodes and a pair of unique nodes s and t, an st-ordering assigns s with 1 and t with n, and every other node with an integer between 2 and n - 1 (inclusive) such that it has at least one neighbor with a smaller number and at least one neighbor with a larger number. This paper presents a self-stabilizing distributed algorithm which assigns an st-ordering to G. The algorithm is shown to require at most O(n log n) rounds to converge to a correct solution.