Near-optimal tree-based access network design

Authors:
Hong-Hsu Yen;Frank Yeong-Sung Lin
Affiliations:
Department of Information Management, Shih Hsin University, no. 1, Lane 17, Mu-Cha Road, Sec. 1, Taipei 116, Taiwan, ROC;Department of Information Management, National Taiwan University, no. 1, Sec. 4, Roosevelt Road, Taipei 106, Taiwan, ROC
Venue:
Computer Communications
Year:
2005

Citing 3
Cited 1

Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Genetic Algorithm and Neural Network Approaches to Local Access Network Design

MASCOTS '94 Proceedings of the Second International Workshop on Modeling, Analysis, and Simulation On Computer and Telecommunication Systems
The Access Network Design Problem

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science

Survivable and delay-guaranteed backbone wireless mesh network design

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.24

Visualization

Abstract

Among various access network topologies, the tree topology is the most popular due to its simplicity and relatively low cost. A salient example is the CATV network. In this paper, we consider the tree-based access network design problem where the operational cost and the fixed installation cost are jointly minimized. The problem is formulated as a combinatorial optimization problem, where the difficulty of solving a Steiner tree problem typically encountered in a tree-based topological design problem is particularly circumvented. The basic approach to the algorithm development is Lagrangean relaxation and the subgradient method. In the computational experiments, the proposed algorithm calculates near-optimal solutions within 3.2% of an optimal solution in 1min of CPU time for test networks of up to 26 nodes.