Computer Science – Distributed – Parallel – and Cluster Computing
Scientific paper
2008-10-21
Computer Science
Distributed, Parallel, and Cluster Computing
Scientific paper
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.
Ducourthial Bertrand
Khalfallah Sofiane
Petit Franck
No associations
LandOfFree
Best-effort Group Service in Dynamic Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Best-effort Group Service in Dynamic Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Best-effort Group Service in Dynamic Networks will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-573271