Routing and capacity assignment in backbone communication networks
Ali Amiri,Hasan Pirkul +1 more
TLDR
This dissertation addresses several problems in the area of routing and capacity assignment in backbone communication networks and efficient solution procedures based on Lagrangean relaxations of the problems are developed.About:
This article is published in Computers & Operations Research.The article was published on 1997-03-01 and is currently open access. It has received 39 citations till now. The article focuses on the topics: Backbone network & Node (networking).read more
Citations
More filters
Journal ArticleDOI
Multi-objective optimization for stochastic computer networks using NSGA-II and TOPSIS
Yi-Kuei Lin,Cheng-Ta Yeh +1 more
TL;DR: This study attempts to maximize network reliability with minimal cost by finding the optimal transmission line assignment by integrating Non-dominated Sorting Genetic Algorithm II (NSGA-II) and Technique for Order Preference by Similarity to Ideal Solution (TOPSIS).
Journal ArticleDOI
Optimal redundancy allocation to maximize multi-state computer network reliability subject to correlated failures
Cheng-Ta Yeh,Lance Fiondella +1 more
TL;DR: This study applies a correlated binomial distribution to characterize the state distribution of each edge within a network and a redundancy optimization approach integrating simulated annealing (SA), minimal paths, and correlated Binomial distribution is proposed.
Proceedings ArticleDOI
Optimal Location of Data Centers and Software Components in Cloud Computing Network Design
Federico Larumbe,Brunilde Sansò +1 more
TL;DR: In this paper, the authors present the Cloud Location and Routing Problem (CLRP), a mathematical problem aiming at solving all those issues in a multi-layer and integrated fashion through a convex integer programming formulation.
Journal ArticleDOI
Using minimal cuts to optimize network reliability for a stochastic computer network subject to assignment budget
Yi-Kuei Lin,Cheng-Ta Yeh +1 more
TL;DR: An optimization algorithm that integrates the genetic algorithm, minimal cuts and Recursive Sum of Disjoint Products is proposed to find the optimal transmission line assignment to the computer network such that network reliability is maximized subject to the budget constraint.
Journal ArticleDOI
A genetic algorithm based approach to route selection and capacity flow assignment
TL;DR: This paper proposes a genetic algorithm based approach to providing optimized integrated solutions to the route selection and capacity flow assignment problems and generates much better solutions than two well known efficient methods in the authors' simulation studies.
References
More filters
Journal ArticleDOI
Validation of subgradient optimization
TL;DR: It is concluded that the “relaxation” procedure for approximately solving a large linear programming problem related to the traveling-salesman problem shows promise for large-scale linear programming.
Journal ArticleDOI
The flow deviation method: An approach to store-and-forward communication network design
TL;DR: In this article, a "FZm Deviation" (FD) method for non-linear, unconstrained m.c. 1 fZm problems is proposed, which is quite similar to the gradient method for functions of continuous variables.
Journal ArticleDOI
A dual ascent approach for steiner tree problems on a directed graph
TL;DR: It is shown that the ascent procedure can be viewed as a generalization of both the Chu-Liu-Edmonds directed spanning tree algorithm and the Bilde-Krarup-Erlenkotter ascent algorithm for the plant location problem.
Journal ArticleDOI
A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design
TL;DR: This work develops a family of dual-ascent algorithms that generalizes known ascent procedures for solving shortest path, plant location, Steiner network and directed spanning tree problems and generates solutions that are guaranteed to be within 1 to 4% of optimality.