Best-effort Group Service in Dynamic Networks

Computer Science – Distributed – Parallel – and Cluster Computing

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

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.

Rate now

     

Profile ID: LFWR-SCP-O-573271

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.