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 volume-oriented routing. The routing of each demand is a combination of two extreme routing schemes 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. However, computing an optimal volume-oriented routing is generally difficult. Then, we introduce two modifications of the presented routing paradigm such that an optimal solution can be computed in polynomial time. Numerical experiments are also provided to compare volume-oriented routing with the best routing strategy in term of costs, i.e, dynamic routing.