Near-optimal tree-based access network design

Computer Communications

Volumn 28, Issue 2, 2005, Pages 236-245

  Yen, Hong Hsu ^a   Yeong Sung Lin, Frank ^b  

^a SHIH HSIN UNIVERSITY   (Taiwan)

^b NATIONAL TAIWAN UNIVERSITY   (Taiwan)

Author keywords

Access network design; Lagrangean relaxation; Network planning; Optimization; Steiner tree problem; Tree based networks

Indexed keywords

COMBINATORIAL MATHEMATICS; INSTALLATION; LAGRANGE MULTIPLIERS; OPTIMAL SYSTEMS; PROBLEM SOLVING; TOPOLOGY; TREES (MATHEMATICS);

ACCESS NETWORK DESIGN; LAGRANGEAN RELAXATION; NETWORK PLANNING; STEINER TREE PROBLEM; TREE-BASED NETWORKS;

COMPUTER NETWORKS;

EID: 12344303495     PISSN: 01403664     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comcom.2004.08.002     Document Type: Article

References (9)

1. R.K. Ahuja, T.L. Magnanti, and J.B. Orlin Network Flows - Theory, Algorithms, and Applications 1993 Prentice-Hall Englewood Cliffs, NJ
2. M. Andrews, and L. Zhang The access network design problem Proceedings of the 39th Annual Symposium on Foundations of Computer Science 1998 pp. 40-49
3. Y.J. Chu, and T.H. Liu On the shortest arborescence of a directed graph Scientific Sinica 14 1965 1396 1400
4. B. Gavish Topological design of computer communication networks - the overall design problem European Journal of Operational Research 58 1992 149 172
5. P.A. Humblet A distributed algorithm for minimum weight directed spanning trees IEEE Transactions on Communication COM-31 6 1983 756 762
6. R.M. Karp Reducibility among combinatorial problems R.E. Miller J.W. Thacher Complexity of Computer Computations 1972 Plenum Press New York 83 103
7. T. Routen Genetic algorithm and neural network approaches to local access network design Proceedings of the Second International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunication Systems 1994 239 243
8. R.E. Tarjan Finding optimum branchings Networks 7 1977 25 35
9. H.-H. Yen, and F.Y.-S. Lin Near-optimal delay constrained routing in virtual circuit networks Proceedings of the IEEE INFOCOM vol. 2 2001 pp. 750-756