LP-based flow rate control and modeling of capacity collapse propagation over long links

The main focus of this paper is to understand how congestion due to link failure propagates to successive links, and how well the network maintains system flow under abnormal conditions. We consider the multi-commodity flow problem, in which each commodity (origin-destination pair) uses k link-disjoint paths to satisfy flow rate demands. The congestion in the links is used to calculate the prices of the links which affect the cost of travelling. We solve minimum-cost linear-programming to control path flow rate routing decisions triggered by the changes in the cost coefficients. We conclude that efficient path flow rate re-routing in response to the congestion in the links could contribute significantly to network survivability.