#include "loba_fairstrategy.h"
-/* simple version:
- * load balance with a least-loaded neighbor,
- * without breaking the ping-pong condition
- */
-
class compare {
public:
bool operator()(const neighbor*a, const neighbor*b) {
while (found) {
found = false;
for (unsigned i = 0 ; i < pneigh.size() ; ++i) {
- if (pneigh[i]->get_load() <= get_load() - 2) {
+ if (pneigh[i]->get_load() <= get_load() - .002) {
found = true;
- send(pneigh[i], 1);
+ send(pneigh[i], .001);
DEBUG1("sent to %s", pneigh[i]->get_name());
}
}