Path congestion
= Path congestion
{title2=$\rho$}
For a family of transition <graph paths>, path congestion is the largest, over transitions, ratio of routed pair weight times <path> length to stationary transition capacity. The <canonical paths Poincare bound> makes this an upper bound on the <relaxation time>.