Abstract
We consider the problems of designing netwrok topologies with minimum cost. In the first problem, basic optimum topology which guarnatees only one path from one to the other node, is considered. This problem is extended in the second part to include one redundant path between two nodes. These two problems are solved in this work in three stages. In the first stage, modified version of random feasible topology generation algorithm is used to generate initial feasible solutions. In the second and third stages, Link Reduction Algorithm and Branch-X-Change algorithms are used sequentially to get a locally optimal solution. These three stages are required to repeat with different orderings of the nodes to get a global optimal solution. We tested the above approach with two problems.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Gerla,M. and Kleinrock,L.(1977) On the Topological Design of Distributed Computer Networks,IEEE Trans. on Communications, Vol. COM-25, No. 1, Jan 1977
Gersht,A. and Weihmayer,R.(1990) Joint Optimization of Data Network Design and Facility Selection,IEEE Jl. on S.A.C., Vol. 8, No. 9, Dec 1990
Magnanti,T.L. and Wong,R.T.(1984) Network Design and Transportation Planning: Models and Algorithms,Transport Science, Vol. 18, No. 1, Feb 1984
Steiglitz,K., Weiner,P. and Klietman,D.J.(1969) The Design of Minimum-cost Survivable Networks,IEEE Trans. on Ciruits Theory, Vol. CT-16, No. 4, Nov 1969
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Srinivasa Rao, T., Bose, S.K., Srivathsan, K.R., Deb, K. (1995). A New Approach for Network Topology Optimization. In: Raghavan, S.V., Jain, B.N. (eds) Computer Networks, Architecture and Applications. IFIP — The International Federation for Information Processing. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-34887-2_20
Download citation
DOI: https://doi.org/10.1007/978-0-387-34887-2_20
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-9804-3
Online ISBN: 978-0-387-34887-2
eBook Packages: Springer Book Archive