Package com.sun.sgs.impl.service.nodemap.affinity.dlpa

Provides classes for a multi-node, distributed algorithm implementation of the label propagation algorithm described in "Near linear time algorithm to detect community structures in large-scale networks" by Raghavan, Albert and Kumara (2007).

See:
Description

Interface Summary

LPAClient	The label propagation algorithm clients, which can be called by the LPAServer to coordinate runs of the algorithm.
LPAServer	The label propagation algorithm server.

Class Summary

LabelPropagation	A distributed implementation of the algorithm presented in "Near linear time algorithm to detect community structures in large-scale networks" by U.N.
LabelPropagationServer	The server portion of the distributed label propagation algorithm.

Package com.sun.sgs.impl.service.nodemap.affinity.dlpa Description

Provides classes for a multi-node, distributed algorithm implementation of the label propagation algorithm described in "Near linear time algorithm to detect community structures in large-scale networks" by Raghavan, Albert and Kumara (2007).

In this implementation, the algorithm is distributed. Each node's builder maintains a portion of the graph of identities linked by common object uses. The builders also are notified of data cache conflicts, as reported by the caching data store.

The algorithm is driven by the LPAServer, which instructs each LPAClient when to start an algorithm run and synchronizes each iteration of the algorithm. Information about affinity groups are communicated as the serializable AffinitySet.

Affinity groups returned by this implementation are of type RelocatingAffinityGroup.

If a node fails or becomes unreachable during a run of the algorithm, the run is deemed failed and invalid. No attempt is made to mark unreachable nodes as failed within the Darkstar cluster.