Open Access
An algorithm for network dimensioning under reliability consideration
B Sanso,Michel Gendreau,F Soumis +2 more
- 01 Jan 1990
Iss: 736
21
TL;DR: In this article, a cyclic decomposition algorithm is proposed to adjust link capacities in circuit switched networks taking into account the costing policy and reliability considerations, which converges to a global optimum for the dimensioning/routing problem.
read more
Abstract: In this paper the authors introduce a new methodology to adjust link capacities in circuit switched networks taking into account the costing policy and reliability considerations. This methodology, which is an extension of previous work on reliability evaluation using routing models, is based on a cyclic decomposition algorithm which alternates between a routing sub problem and a link capacity adjustment sub problem. The proposed procedure which is shown to converge to a global optimum for the dimensioning/routing problem, has been tested on a 14 undirected arc problem for various levels of link failure probability. The numerical results are extremely satisfactory and they demonstrate the usefulness of the proposed method for proper network dimensioning. (A)
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Joint configuration of backbone and logical networks on a reconfigurable packet-switched network with unreliable links
Jong Hyup Lee,Chang Sup Sung +1 more
TL;DR: The objective is to design feasible backbone and logical networks at least cost where the network cost includes backbone link capacity expansion cost and average packet delay penalty cost due to link failures.
1
Centralized and decentralized stochastic routing models in telecommunication networks
TL;DR: This work presents a decentralized routing model to be used in network planning and compares it theoretically and empirically with a centralized multicommodity flow model previously presented.
1
Network Reliability Optimization
Abdullah Konak,Alice E. Smith +1 more
- 01 Jan 2006
TL;DR: This chapter discusses various network reliability measures and efficient techniques to evaluate them and two genetic algorithms are presented to demonstrate how these techniques to estimate and compute network reliability can be incorporated within an optimization algorithm.
Case study of the evolution of routing algorithms in a network planning tool
Jyrki Akkanen,Jukka K. Nurminen +1 more
TL;DR: This paper concentrates on the routing algorithms and follows their evolution over multiple releases of a planning tool during a period of six years, and emphasizes the practical aspects: how previous algorithms were reused and what were the practical experiences of using the algorithms.
Multicommodity flow models, failure propagation, and reliable loss network design
André Girard,Brunilde Sansò +1 more
TL;DR: This work investigates the usefulness of multicommodity models both as routing models and as an integral part of design models conceived under the failure propagation strategy, and finds that the MF models compare favorably with exact dimensioning algorithms when failures are considered.
References
Some properties of the erlang loss function
TL;DR: In this paper, the authors developed the properties of the Erlang loss function, B (N, a), used in telephone traffic engineering, and the extension to a transcendental function of two complex variables was constructed, thus permitting the methods of complex analysis to be employed for the further study of its properties.
292
A Boolean algebra method for computing the terminal reliability in a communication network
Luigi Fratta,U. Montanari +1 more
TL;DR: This work has proposed a new approach to the computation of the terminal reliability of a network by transforming a Boolean sum of products into an equivalent form in which all terms are disjoint.
222
•Proceedings Article
Performance analysis of networks with unreliable components
Victor O. K. Li,John A. Silvester +1 more
- 01 Jan 1983
TL;DR: In this paper, instead of enumerating all possible fail states, the authors consider only the most probable states of a communication network and obtain upper and lower bounds on the expected number of communicating pairs.
172
Computing Network Reliability
TL;DR: An algorithm to compute reliability measures on a stochastic network in which both nodes and links can fail, and also computes the latter two measures when all communication must proceed through a root node.
165
An Algorithm for Optimal Route Selection in SNA Networks
B. Gavish,Sidney L. Hantler +1 more
TL;DR: A tight lower bound is obtained on the minimal expected delay as well as sets of feasible solutions for the problem of selecting a set of routes which minimizes the expected network end-to-end queueing and transmission delay.
129