In this paper, we address the maximization of the protected demand of a set of commodities that must be routed on a given capacitated network. We define the protected demand of a given routing solution as the demand that is protected, on average, when a single link fails. We consider that the protection paths might be partial link disjoint. The aim is to find a routing solution, which includes the decision on whose commodities are to be protected, that maximizes the total protected demand. We propose integer linear programming models considering three types of path protection: 1+1, 1:1 and 1:1 with preemption. We present computational results showing that the use of partial disjoint protection paths enables to protect more demand for the same network resources on all three types of protection.