Beating the logarithmic lower bound: randomized preemptive disjoint paths and call control algorithms