Sequential and Parallel Approaches to Incorporate Reliability in the [Vol. 5, No. 2, 1997]

Sequential and Parallel Approaches to Incorporate Reliability in the

Steven Chamberland
GERAD
CRT and Department of Mathematics and Industrial Engineering
Ecole Polytechnique de Montreal
C.P.6079 Succ.
Centre-Ville, Montreal (Quebec), Canada H3C 3A7

Brunilde Sanso
GERAD
CRT and Department of Mathematics and Industrial Engineering
Ecole Polytechnique de Montreal
C.P.6079 Succ.
Centre-Ville, Montreal (Quebec), Canada H3C 3A7

Abstract
This paper presents a scenario-oriented optimization model and solution algorithm to solve the joint routing/capacity assignment problem for computer networks. The advantage of this model is that failures are directly dealt with at the design stage. The model helps to find a suitable trade-off between capacity assignment and performance in the event of failures. As accounting for major failures can be very time consuming, we introduce parallelism as a tool to solve this type of problem. Two parallel versions of the algorithm were implemented. Both parallel versions were found to be extremely efficient in reducing computational time, the one presenting two levels of parallelization was found more suitable for larger networks.

Keywords: Parallelism; performability; failure scenarios; computer networks; routing; capacity assignment.

JNSM: Vol. 5, No. 2, 1997 Sequential and Parallel Approaches to Incorporate Reliability in the [Vol. 5, No. 2, 1997]

NOTE: only abstract of paper available on-line

Back to JNSM main page