Best-effort group service in dynamic networks

Authors:
Bertrand Ducourthial;Sofiane Khalfallah;Franck Petit
Affiliations:
Université de Technologie de Compiègne, Compiègne, France;Université de Technologie de Compiègne, Compiègne, France;Université Pierre et Marie Curie, Paris, France
Venue:
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Year:
2010

Citing 19
Cited 2

Implementing fault-tolerant services using the state machine approach: a tutorial

ACM Computing Surveys (CSUR)
The process group approach to reliable distributed computing

Communications of the ACM
SuperStabilizing protocols for dynamic distributed systems

Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Fast distributed construction of small k-dominating sets and applications

Journal of Algorithms
Self-stabilization

Self-stabilization
Time, clocks, and the ordering of events in a distributed system

Communications of the ACM
Group communication specifications: a comprehensive study

ACM Computing Surveys (CSUR)
Software-Based Replication for Fault Tolerance

Computer
Self-stabilization with path algebra

Theoretical Computer Science
A distributed algorithm to find k-dominating sets

Discrete Applied Mathematics - Brazilian symposium on graphs, algorithms and combinatorics
Random Walk for Self-Stabilizing Group Communication in Ad Hoc Networks

IEEE Transactions on Mobile Computing
A Fault-Local Self-Stabilizing Clustering Service for Wireless Ad Hoc Networks

IEEE Transactions on Parallel and Distributed Systems
Self-Stabilization as a Foundation for Autonomic Computing

ARES '07 Proceedings of the The Second International Conference on Availability, Reliability and Security
Robust self-stabilizing weight-based clustering algorithm

Theoretical Computer Science
A Self-Stabilizing O(k)-Time k-Clustering Algorithm

The Computer Journal
On the design of mobility-tolerant TDMA-based media access control (MAC) protocol for mobile sensor networks

ICDCIT'07 Proceedings of the 4th international conference on Distributed computing and internet technology
r-semi-groups: a generic approach for designing stabilizing silent tasks

SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
A self-stabilizing minimal dominating set algorithm with safe convergence

IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Challenges of intervehicle ad hoc networks

IEEE Transactions on Intelligent Transportation Systems

Nested clusters with intercluster routing

The Journal of Supercomputing
Self-stabilizing with service guarantee construction of 1-hop weight-based bounded size clusters

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a group membership service for dynamic ad hoc networks. It maintains as long as possible the existing groups and ensures that each group diameter is always smaller than a constant, fixed according to the application using the groups. The proposed protocol is self-stabilizing and works in dynamic distributed systems. Moreover, it ensures a kind of continuity in the service offer to the application while the system is converging, except if too strong topology changes happen. Such a best effort behavior allows applications to rely on the groups while the stabilization has not been reached, which is very useful in dynamic ad hoc networks.