Abstract
We consider the capacity assignment problem in telecommunications where the demand is uncertain. In our model, given an amount of traffic \(\bar\mu\), we seek for an optimal link capacity assignment that, given an uncertainty set containing possible demand realizations, limits the loss of traffic to \(\bar\mu\) in any realization of the demand. To obtain tractable approximations to this problem, we use the so-called Affinely Adjustable Robust Counterpart (AARC) concept proposed by Ben-Tal et al. where the adjustable variables are restricted to depend affinely on the uncertain data. Borrowing ingredients from earlier works and the AARC approach, we propose some tractable approximations to this problem.
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
Babonneau, F., Vial, J.-P., Apparigliato, R.: Robust Optimization for environmental and energy planning. In: Handbook on Uncertainty and Environmental Decision Making. International Series in Operations Research and Management Science. Springer, Heidelberg (2009)
Babonneau, F., Klopfenstein, O., Ouorou, A., Vial, J.-P.: Robust capacity expansion solutions for telecommunications networks with uncertain demands. Technical paper, Orange Labs R&D (2009)
Ben-Ameur, W., Kerivin, H.: New economical virtual private networks. Communication of the ACM 46(6), 69–73 (2003)
Ben-Ameur, W., Kerivin, H.: Routing of uncertain traffic demands. Optimization and Engineering 6(3), 283–313 (2005)
Ben-Tal, A., Goryashko, A., Guslitzer, E., Nemirovski, A.: Adjustable robust solutions of uncertain linear programs. Mathematical Programming 99(2), 351–376 (2004)
Ben-Tal, A., Golany, B., Nemirovski, A., Vial, J.-P.: Retailer-Supplier Flexible Commitments Contracts: A Robust Optimization Approach. Manufacturing & Service Operations Management 7(3), 248–271 (2005)
Ben-Tal, A., El Ghaoui, L., Nemirovski, A.: Robust Optimization. Princeton University Press, Princeton (2009)
Bertsimas, D., Sim, M.: The price of robustness. Operations Research 52(1), 35–53 (2004)
Hijazi, H.: Mixed-integer nonlinear optimization approaches for network design in telecommunications. Ph.D Thesis, Université de Marseille (2010)
Klopfenstein, O.: Optimisation robuste des réseaux de télécommunications. Ph.D Thesis, UTC (2008)
Lemaréchal, C., Ouorou, A., Petrou, G.: Robust network design in telecommunications under polytope demand uncertainty. European Journal on Operational Research 206, 634–641 (2010)
Minoux, M.: On 2-stage robust LP with RHS uncertainty: Complexity results and applications (2009)
Minoux, M.: Robust network optimization under polyhedral demand uncertainty is NP-hard. Discrete Applied Mathematics 158(5), 597–603 (2010)
Ouorou, A., Vial, J.-P.: A model for robust capacity planning for telecommunications under demand uncertainty. In: Proceedings of Design of Reliable Communications Networks, IEEE Xplore (2007), doi: 10.1109/DRCN.2007.4762287
Ouorou, A.: Tractable approximations to a robust capacity assignment model in telecommunications under demand uncertainty (2010) (submitted)
Pascali, F.: Chance Constrained Network Design. PhD thesis, Doctorate School in Mathematics for Economic Decisions (2009), http://etd.adm.unipi.it/theses/available/etd-11262009-005543
Petrou, G., Lemaréchal, C., Ouorou, A.: An approach to robust network design in telecommunications. RAIRO-Operations Research 41(4), 411–426 (2007)
Poss, M., Raack, C.: Affine recourse for the robust network design problem: between static and dynamic routing. ZIB-Report 11-03 (February 2011), available on OptimizationOnline
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ouorou, A. (2011). Affine Decision Rules for Tractable Approximations to Robust Capacity Planning in Telecommunications. In: Pahl, J., Reiners, T., Voß, S. (eds) Network Optimization. INOC 2011. Lecture Notes in Computer Science, vol 6701. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21527-8_32
Download citation
DOI: https://doi.org/10.1007/978-3-642-21527-8_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21526-1
Online ISBN: 978-3-642-21527-8
eBook Packages: Computer ScienceComputer Science (R0)