A faster approximation algorithm for the Steiner problem in graphs
Acta Informatica
The Steiner problem in distributed computing systems
Information Sciences: an International Journal
Self-stabilization
Self-stabilizing systems in spite of distributed control
Communications of the ACM
A Self-Stabilizing Algorithm for the Steiner Tree Problem
SRDS '02 Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems
Superstabilizing Protocols for Dynamic Distributed Systems
Superstabilizing Protocols for Dynamic Distributed Systems
Gossiping in distributed systems
ACM SIGOPS Operating Systems Review - Gossip-based computer networking
Brief Announcement: Eventual Leader Election in the Infinite Arrival Message-Passing System Model
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
An asynchronous leader election algorithm for dynamic networks
IPDPS '09 Proceedings of the 2009 IEEE International Symposium on Parallel&Distributed Processing
Robust stabilizing leader election
SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
Topology-aware routing in structured peer-to-peer overlay networks
Future directions in distributed computing
A dynamic distributed algorithm for multicast path setup
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
Time optimal asynchronous self-stabilizing spanning tree
DISC'07 Proceedings of the 21st international conference on Distributed Computing
A super-stabilizing log(n)-approximation algorithm for dynamic Steiner trees
Theoretical Computer Science
| Hi-index | 0.01 |
This paper proposes a fully dynamic self-stabilizing algorithm for the Steiner tree problem. The Steiner tree problem aims at constructing a Minimum Spanning Tree (MST) over a subset of nodes called Steiner members, or Steiner group usually denoted S . Steiner trees are good candidates to efficiently implement communication primitives such as publish/subscribe or multicast, essential building blocks in the design of middleware architectures for the new emergent networks (e.g. P2P, sensor or adhoc networks). Our algorithm returns a log|S |-approximation of the optimal Steiner tree. It improves over existing solutions in several ways. First, it is fully dynamic, in other words it withstands the dynamism when both the group members and ordinary nodes can join or leave the network. Next, our algorithm is self-stabilizing, that is, it copes with nodes memory corruption. Last but not least, our algorithm is superstabilizing . That is, while converging to a correct configuration (i.e., a Steiner tree) after a modification of the network, it keeps offering the Steiner tree service during the stabilization time to all members that have not been affected by this modification.