Premium
On the complexity of resilient network design
Author(s) -
Tomaszewski Artur,
Pióro Michał,
Żotkiewicz Mateusz
Publication year - 2010
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.20321
Subject(s) - backup , path (computing) , computer science , mathematical optimization , flow network , flow (mathematics) , graph , distributed computing , mathematics , theoretical computer science , computer network , geometry , database
In this article we prove ‐hardness of two well‐known optimization problems related to the design of multicommodity flow networks with two different methods for providing network resiliency against failures: path diversity and flow restoration. Path diversity is a static mechanism that consists of using, for each demand, a number of paths and oversizing the flows assigned to these paths so that for any failure the total surviving flow is not less than the volume of the demand. By contrast, flow restoration is a dynamic mechanism that consists of reassigning the failed flows to backup paths when a failure occurs. Both mechanisms are of practical interest because although flow restoration is in general superior to path diversity in terms of the required amount of resource capacity, it might be too complicated to implement. By providing an appropriate reduction from the fractional graph coloring problem, we show that both problems are ‐hard in the general case of failure scenarios that admit simultaneous failures of multiple links. Finally, we discuss how to efficiently solve the two problems using path generation techniques. © 2009 Wiley Periodicals, Inc. NETWORKS, 2010