3bf0fb6f33
Send probes to all the unprobed fileservers in a fileserver list on all addresses simultaneously in an attempt to find out the fastest route whilst not getting stuck for 20s on any server or address that we don't get a reply from. This alleviates the problem whereby attempting to access a new server can take a long time because the rotation algorithm ends up rotating through all servers and addresses until it finds one that responds. Signed-off-by: David Howells <dhowells@redhat.com> |
||
|---|---|---|
| .. | ||
| events | ||
| bpf_probe.h | ||
| define_trace.h | ||
| perf.h | ||
| syscall.h | ||
| trace_events.h | ||