Abstract
We propose a global design procedure for heterogeneous networks , which includes the definition of their topology; routing procedures; link capacity assignment; transfer mode; and traffic policy. We discuss the network model, which minimizes the cost of interconnecting a number of nodes whose locations are known; the traffic model, where we use the concept of Equivalent Bandwidth, and the resolution algorithms, where we compare a Simulated annealing algorithm (SAA) with a commercial solver, with good results. Results show that SAA gets to the optimum solution over 10 times faster than the commercial solver. Experiments also show that, for networks with more than 50 nodes, the SAA still delivers good feasible solutions while the commercial solver is unable to deliver results.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Alevras, D., Grotschel, M., Wessaly, R.: Capacity and Survivability Models for Telecommunication Networks. Preprint SC97-24. Konrad-Zuse-Zentrum fur Informationstechnik, Berlin (1997)
Babic, G., Vandelore, B., Jain, R.: Analysis and Modeling of Traffic in Modern Data Communication Networks. Ohio State University, Department of Computer and Information Science, Technical Report OSU-CISRC-1/98-TR02 (February 1998)
Balakrishnan, A., Magnanti, T., Wong, T.: A Dual-Ascent Procedure for Large- Scale uncapacitated Network Design. INFORMS Operation Research 37, 716–740 (1989)
Beran, J., et al.: Long Range Dependence in Variable Bit Rate Video Traffic. IEEE Transactions on Communications 43, 1566–1579 (1995)
Bienstock, D., et al.: Minimum Cost Capacity Installations for multicommodity network flows. Mathematical Programming 81(2-1), 177–199 (1998)
Bienstock, D., Saniee, I.: ATM Network Design: Traffic Models and Optimation- Based Heuristics. DIMACS Report 98-20, Telecom Systems (June 2001)
Courcoubetis, C., Fouskas, G., Weber, R.: On Performance of an Effective Bandwidths Formula. In: Proc. 14th Int. Teletraffic Cong., June 6-10, pp. 201–212. North-Holland Elsevier Science, Amsterdam (1994)
Ball, M.O., et al. (eds.): Network Models, Handbook in Operations Research and Management Science, vol. 7. Elsevier, Amsterdam (1995)
Ball, M.O., et al. (eds.): Network Routing, Handbook in Operations Research and Management Science, vol. 8. Elsevier, Amsterdam (1995)
Kirkpatrik, S., Gelatt, C.D., Vecchi, M.P.: Optimization by Simulated Annealing. Science 220(4598), 671–680 (1983)
van Laarhoven, P.J.M., Aarts, E.H.L.: Simulated annealing: theory and applications. Kluwer Academic, Dordrecht (1987)
Norros, I.: On the Use of Fractional Brownian Motion in The Theory of Conneccionless Networks. JSACÂ 13-6 (August 1995)
Nurmela, K.J., Ostergard, R.J.: Constructing Covering Designs by Simulated Annealing. Technical report B10, Digital Systems Laboratory, Helsinki University of Technology (1993)
Press, W.H., et al.: Numerical Recipes in C, 2nd edn. Cambridge University Press, Cambridge (1992)
Reinelt, G.: TSPLIB95. Universitat Heidelberg, Institut fur Angewandte Mathematik. Im Neuenheimer Feld 294 (1995)
De Veciana, G., Kesidis, G., Walrand, J.: Resourse Management in Wide-Area ATM Networks Using Effective Bandwidths. JSACÂ 13(6) (August 1995)
Metropolis, N., Rosenbluth, A., Rosenbluth, M., Teller, A., Teller, E.: Simulated Annealing. Journal of Chemical Physics 21, 1087–1092 (1953)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rios, M., Marianov, V., Abaroa, C. (2005). Design of Heterogeneous Traffic Networks Using Simulated Annealing Algorithms. In: Kim, C. (eds) Information Networking. Convergence in Broadband and Mobile Networking. ICOIN 2005. Lecture Notes in Computer Science, vol 3391. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30582-8_54
Download citation
DOI: https://doi.org/10.1007/978-3-540-30582-8_54
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24467-7
Online ISBN: 978-3-540-30582-8
eBook Packages: Computer ScienceComputer Science (R0)