Volume oriented routing
Mateusz Żotkiewicz, Walid Ben‐Ameur · 2010
Assuming that the traffic matrix belongs to a polytope, we present a new routing paradigm where each traffic demand is routed independently of the other demands. The routing of each demand is a combination of two extreme routing depending on the current volume of the demand. This new routing paradigm is easy to implement in networks and quite efficient in terms of network cost.