Lexicographical minimization of routing hops in hop-constrained node survivable networks
Given an undirected network with link capacities and a set of commodities with known demands, this paper addresses the problem of determining D (with D5 2, 3, 4) hop-constrained node disjoint paths for each commodity while minimizing the average or the maximum number of hops. These paths are defined according to two survivability mechanisms Path Diversity and Path Protection, the latter guaranteeing total demand protection in the event of n failures (with noD). We study these problems in the context of a traffic engineering task over pre-dimensioned networks where the real traffic demands are inevitably different from the estimated traffic demands that were assumed in the network dimensioning task. We present two classes of ILP models, disaggregated and aggregated, for both problems, study the relationship between their linear programming relaxations and compare their effectiveness through a set of computational experiments. The results show that, in practice, there is no gain in using the disaggregated models.