On the Power of the Adversary to Solve the Node Sampling Problem

@article{Anceaume2013OnTP,
  title={On the Power of the Adversary to Solve the Node Sampling Problem},
  author={Emmanuelle Anceaume and Yann Busnel and S{\'e}bastien Gambs},
  journal={Trans. Large-Scale Data- and Knowledge-Centered Systems},
  year={2013},
  volume={11},
  pages={102-126}
}
We study the problem of achieving uniform and fresh peer sampling in large scale dynamic systems under adversarial behaviors. Briefly, uniform and fresh peer sampling guarantees that any node in the system is equally likely to appear as a sample at any non malicious node in the system and that infinitely often any node has a non-null probability to appear… CONTINUE READING