Sample Path Selection Probabilities
b - request size (bmax - max request size, if known)
hmin - length of the shortest (apparently) feasible path
B(p) - bandwidth of the path
? - penalty parameter for moving to longer paths
Discount factor C=1-?*b/bmax for each extra hop
For a path of hop length h D(p) = C|h - hmin|
Then the weight assigned to path p is W(p) = B(p)*D(p)
Pick a path randomly with probability weighted by W(p)