Integrating routing and survivability in fault-tolerant computer network design

Authors:
S Pierre;R Beaubrun
Affiliations:
Department of Electrical and Computer Engineering, ícole Polytechnique de Montréal, C.P. 6079, Succ. Centre-Ville, Montréal, Québec H3C 3A7, Canada;Department of Electrical and Computer Engineering, ícole Polytechnique de Montréal, C.P. 6079, Succ. Centre-Ville, Montréal, Québec H3C 3A7, Canada
Venue:
Computer Communications
Year:
2000

Citing 4
Cited 0

Multicommodity flow models, failure propagation, and reliable loss network design

IEEE/ACM Transactions on Networking (TON)
A routing algorithm for distributed communication networks

LCN '97 Proceedings of the 22nd Annual IEEE Conference on Local Computer Networks
A genetic algorithm for designing distributed computer networktopologies

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Inferring new design rules by machine learning: a case study of topological optimization

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans

Quantified Score

Hi-index	0.24

Visualization

Abstract

In the context of computer networks, most conventional algorithms are designed to work under no-failure conditions for dealing with the routing problem. This paper investigates a more realistic situation where the flow assignment takes into account the possibility of a link failure. The method proposed to deal with this problem guarantees the survivability and allows analyzing the network behavior after a link failure. Further, it can be applicable to networks during their design phase as well as during the operational phase. Result analysis reveals the capacity of this method to design networks which satisfy the survivability constraints and to largely improve the delay obtained by other methods.