AbstractSeveral distributed peer-to

Abstract
Several distributed peer-to-peer applications require
weakly-consistent knowledge of process group membership
information at all participating processes. SWIM is a
generic software module that offers this service for largescale
process groups. The SWIM effort is motivated by the
unscalability of traditional heart-beating protocols, which
either impose network loads that grow quadratically with
group size, or compromise response times or false positive
frequency w.r.t. detecting process crashes. This paper reports
on the design, implementation and performance of the
SWIM sub-system on a large cluster of commodity PCs.
Unlike traditional heartbeating protocols, SWIM separates
the failure detection and membership update dissemination
functionalities of the membership protocol. Processes
are monitored through an efficient peer-to-peer periodic
randomized probing protocol. Both the expected time
to first detection of each process failure, and the expected
message load per member, do not vary with group size.
Information about membership changes, such as process
joins, drop-outs and failures, is propagated via piggybacking
on ping messages and acknowledgments. This results in
a robust and fast infection style (also epidemic or gossipstyle)
of dissemination.
The rate of false failure detections in the SWIM system
is reduced by modifying the protocol to allow group members
to suspect a process before declaring it as failed - this
allows the system to discover and rectify false failure detections.
Finally, the protocol guarantees a deterministic time
bound to detect failures.
Experimental results from the SWIM prototype are presented.
We discuss the extensibility of the design to a WAN

ผลลัพธ์ (อังกฤษ) 2:

Abstract
peer-to-peer Several Distributed Applications Require
Knowledge of Process Group membership weakly-consistent
information at all participating processes. SWIM is a
Generic Software Module that offers this Service for largescale
Process groups. The SWIM effort is motivated by the
Unscalability of Traditional Heart-beating protocols, which
either Network Impose loads that quadratically with Grow
Group Size, or compromise response times or false positive
frequency detecting WRT Process crashes. Paper reports this
on the Design, Performance and implementation of the
SWIM Sub-System on a Large Cluster of Commodity PCs.
Unlike Traditional Heartbeating protocols, SWIM separates
the dissemination Failure Detection and membership update
functionalities membership of the Protocol. Processes
are monitored Through an efficient peer-to-peer periodic
probing randomized Protocol. Both the expected time
to First Detection of each Process Failure, and the expected
message Load per Member, do not Vary with Group Size.
Information About membership Changes, such as Process
joins, Drop-outs and failures, is propagated via piggybacking
on ping Messages. and acknowledgments. This results in
a Robust and fast infection style (also Epidemic or Gossipstyle)
of dissemination.
The rate of false Failure detections in the SWIM System
is reduced by modifying the Protocol to Allow Group Members
to suspect a Process before declaring it as failed - this
Allows. System Failure to Discover and rectify the false detections.
Finally, the Protocol guarantees a deterministic time
bound to detect failures.
Experimental results from the prototype SWIM Presented are.
We Discuss the Extensibility of the Design to a WAN.