Package es.uam.eps.ir.relison.diffusion.selections

Class PullPushSelectionMechanism<U extends java.io.Serializable,​I extends java.io.Serializable,​P>

java.lang.Object
es.uam.eps.ir.relison.diffusion.selections.AbstractSelectionMechanism<U,​I,​P>
es.uam.eps.ir.relison.diffusion.selections.CountSelectionMechanism<U,​I,​P>
es.uam.eps.ir.relison.diffusion.selections.PullPushSelectionMechanism<U,​I,​P>
Type Parameters:
U - type of the users.
I - type of the information pieces.
P - type of the parameters.
All Implemented Interfaces:
SelectionMechanism<U,​I,​P>
public class PullPushSelectionMechanism<U extends java.io.Serializable,​I extends java.io.Serializable,​P>
extends CountSelectionMechanism<U,​I,​P>
Selection mechanism following the original one proposed by the push, pull and push-pull models: all the known information (i.e. all the received and already propagated pieces) is shared with the receivers.

Reference: A. Demers, D. Greene, C. Hauser, W. Irish, J. Larson. Epidemic algorithms for replicated database maintenance. ACM PODC 1987, pp. 1-12 (1987)

  • Constructor Details

    • PullPushSelectionMechanism

      public PullPushSelectionMechanism​(int numOwn)
      Constructor.
      Parameters:
      numOwn - number of own pieces of information to propagate.