In this paper we focus on issues of restorable dynamic routing in MPLS networks. We assume that the considered MPLS network must provide reliable service including restorable routing. Thus, for each arriving request two paths are required: active path and link-disjoint backup path. We apply the no-sharing information model, in which the only information available for routing is the total bandwidth that has been allocated on each link. Previous works use the idea of maximum 2-route flow. We formulate a new approach called adjacent 2-route flow that offers comparable performance to maximum 2-route flow and much lower time complexity. We propose a framework, in which adjacent 2-route flow can be applied as a scaling factor for a wide number of existing algorithms. Obtained results of extensive simulations show that adjacent 2-route flow can improve the performance of restorable routing for each tested algorithm.