Design of Survivable Networks

ISBN-13: 9783540562719 / Angielski / Miękka / 1992 / 204 str.

Mechthild Stoer

Opis

The problem of designing a cost-efficient network thatsurvives the failure of one or more nodes or edges of thenetwork is critical to modern telecommunicationsengineering. The method developed in this book is designedto solve such problems to optimality. In particular, acutting plane approach is described, based on polyhedralcombinatorics, that is ableto solve real-world problems ofthis type in short computation time. These results are ofinterest for practitioners in the area of communicationnetwork design.The book is addressed especially to the combinatorialoptimization community, but also to those who want to learnpolyhedral methods. In addition, interesting new researchproblemsare formulated.

Spis treści

Motivation.- Network survivability models using node types.- Survivable network design under connectivity constraints — a survey.- Decomposition.- Basic inequalities.- Lifting theorems.- Partition inequalities.- Node partition inequalities.- Lifted r-cover inequalities.- Comb inequalities.- How to find valid inequalities.- Implementation of the cutting plane algorithm.- Computational results.