Abstract
The problems of telecommunication networks designing could be presented into three aspects: 1) choice of the capacity for each telecommunication link with total minimum network cost; 2) QoS-routing of multicommodity flows in the synthesized network for all forecasting demands and 3) providing a necessary level of survivability. We consider QoS-routing, taking into account various performance requirements: delay, variation of the delay (jitter), bandwidth, packet loss probability. In this article we consider QoS-routing adding to consideration new constraints which provide the delay requirements as the important part of QoS.
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.
References
Resende, M., Pardalos, P.: Handbook of Optimization in Telecommunications. Springer Science, Business Media (2006)
Van Mieghem, P., Kuipers, F.A., Korkmaz, T., Krunz, M., Curado, M., Monteiro, E., Masip-Bruin, X., Solé-Pareta, J., Sánchez-López, S.: Quality of Service Routing. In: Smirnov, M. (ed.) COST 263 Final Report. LNCS, vol. 2856, pp. 80–117. Springer, Heidelberg (2003)
Girlich, E., Kovalev, M.M., Listopad, N.I.: Optimization of the Topology and the Capacities of Telecommunications Networks, http://www.math.uni-magdeburg.de/~girlish/preprints/final_eng.pdf
Chifflet, J., Hadjiat, M., Maurras, J.-F., Vaxes, Y.: A Primal Partitioning Approach for Single and Non-Simultaneous Multicommodity Flow Problems. Discrete Mathematics 1 (1998)
Grötschel, M., Monma, C.L., Stoer, M.: Computational results with a cutting plan algorithm for designing communication networks with low-connectivity constraints. Operations Research 2(3), 474–504 (1992)
Gröstchel, M., Monma, C.I., Stoer, M.: Polyhedral anad Computational Investigations for designing Communication networks with High Survivability Requirements. Konrad-Zuse-Zentrum für Informationstechnik Berlin. Preprint SC 92-94, (1992)
Hu, T.: Integer programming and flows in networks. Addison-Wesley, CityLondon (1970)
Maurras, J.F., Vaxes, Y.: Multicommodity network flow with jump constraints. Discrete Mathematics 165–166 (1997)
Minoux, M.: Optimum synthes of a network with non-simultaneous multicommodity flow requirements in Stadies on Graphs and Diskrete Programming, pp. 269–277. North Holland (1981)
Grötschel, M., Monma, C.L., Stoer, M.: Design of survivable networks. In: Handbook in Operations Research and Management Science. Network Models, pp. 617–672. North-Holland (1995)
Listopad, N.: Modelling and optimization of global networks. Byelorussian State University, Minsk (2000)
Kuipers, F.A.: Quality of Service Routing in the Internet. Theory, Complexity and Algorithms. Delft University Press (2004)
Holnberg, K., Yuan, D.: A lagrangian hueristic based branch-and-bound approch for the capacitated network design problem. Operation Research 48(3), 461–481 (2000)
Kovalev, M., Pisaruk, M.: Modern linear programming. Byelarussian State University, Minsk (1988)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Girlich, E., Kovalev, M.M., Listopad, N.I. (2013). Optimal Choice of the Capacities of Telecommunication Networks to Provide QoS-Routing. In: Dudin, A., Klimenok, V., Tsarenkov, G., Dudin, S. (eds) Modern Probabilistic Methods for Analysis of Telecommunication Networks. BWWQT 2013. Communications in Computer and Information Science, vol 356. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35980-4_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-35980-4_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-35979-8
Online ISBN: 978-3-642-35980-4
eBook Packages: Computer ScienceComputer Science (R0)