Sequential and Parallel Approaches to IncorporateReliability in the Synthesis of Computer Networks

Authors:
Steven Chamberland;Brunilde Sanso
Affiliations:
-;-
Venue:
Journal of Network and Systems Management
Year:
1997

Citing 7
Cited 1

Data networks

Data networks
A multiperiod capacity planning model for backbone computer communication networks

Operations Research
An algorithm for network dimensioning under reliability considerations

Annals of Operations Research - Special issue on operations research in telecommunications
Impact of a transmission facility link failure on dynamic call routing circuit-switched networks under various circuit layout policies

Journal of Network and Systems Management
Wide area traffic: the failure of Poisson modeling

IEEE/ACM Transactions on Networking (TON)
Multicommodity flow models, failure propagation, and reliable loss network design

IEEE/ACM Transactions on Networking (TON)
A Methodology for Network Topology Design with Link and Node Failures Tolerance

International Journal of Network Management

A tabu search algorithm for the routing and capacity assignment problem in computer networks

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a scenario-orientedoptimization model and solution algorithm to solve thejoint routing/capacity assignment problem for computernetworks. 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 betweencapacity assignment and performance in the event offailures. As accounting for major failures can be very time consuming, we introduce parallelism as atool to solve this type of problem. Two parallelversions of the algorithm were implemented. Bothparallel versions were found to be extremely efficientin reducing computational time, the one presentingtwo levels of parallelization was found more suitablefor larger networks.