User login

Weekly report

14

Sep

2015

The differences between the two algorithms that I used to generate stopping values were further examined. The Veitch algorithm I mentioned last week uses a universal bound on failure probability. This seems to justify the higher conditional failure probabilities it allows for the lower numbers of successors. This makes its stopping values smaller than those I obtained using a Monte Carlo algorithm based on assuming a maximum of thirty nodes in a path and conditional failure probabilities set according to that assumption.

The chapters on Megatree and Efficient discovery of load balancer successors were updated based on feedback.