es.uam.eps.ir.relison.diffusion.selections.PullPushSelectionMechanism Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of RELISON-diffusion Show documentation

The newest version!

/* 
 *  Copyright (C) 2020 Information Retrieval Group at Universidad Autónoma
 *  de Madrid, http://ir.ii.uam.es
 * 
 *  This Source Code Form is subject to the terms of the Mozilla Public
 *  License, v. 2.0. If a copy of the MPL was not distributed with this
 *  file, You can obtain one at http://mozilla.org/MPL/2.0/.
 */
package es.uam.eps.ir.relison.diffusion.selections;

import java.io.Serializable;

/**
 * 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)
 * 
 *
 * @author Javier Sanz-Cruzado ([email protected])
 * @author Pablo Castells ([email protected])
 *
 * @param  type of the users.
 * @param  type of the information pieces.
 * @param  type of the parameters.
 *
 */
public class PullPushSelectionMechanism extends CountSelectionMechanism
{
    /**
     * Constructor.
     * @param numOwn number of own pieces of information to propagate.
     */
    public PullPushSelectionMechanism(int numOwn)
    {
        super(numOwn, SelectionConstants.ALL, SelectionConstants.ALL);
    }    
}