Goals

Budgets and preloading are an inherently challenging area, but we can probably do better than the current approach.

Right now, for a link budget of N, we can preload up to N^2 / 2 links I think (essentially, I'm imagining a depth N graph, with N links at each level. We would essentially preload (n-1)+(n-2)+(n-3)... as we walked down the left edge of the graph).

I wonder if it would make sense to treat the budget as simply seperate for preloading. A budget is given to the preloader with the same initial target, and when the budget is expended, we shift to just doing no preloading.

This would wait preloading towards the top of the graph, but perhaps that's what's most important?