Robust routing and optimal partitioning of a traffic demand polytope

In this paper we consider the problem of optimal partitioning of a traffic demand polytope using a hyperplane. In our model all possible demand matrices belong to a polytope. The polytope can be divided into parts, and different routing schemes can be applied while dealing with traffic matrices from different parts of the polytope. We consider three basic models: Robust-Routing, No-Sharing and Dynamic-Routing. We apply two different partitioning strategies depending on whether the reservation vectors on opposite sides of the hyperplane are required to be identical, or allowed to differ. We provide efficient algorithms that solve these problems. Moreover, we prove polynomiality of some of the considered cases. Finally, we present numerical results proving the applicability of the introduced algorithms and showing differences between the routing strategies.

[1]  Michal Pióro,et al.  SNDlib 1.0—Survivable Network Design Library , 2010, Networks.

[2]  Gerald R. Ash,et al.  Dynamic Routing in Telecommunications Networks , 1997 .

[3]  J. Gondzio,et al.  Capacity Planning under Uncertain Demand in Telecommunication Networks , 1999 .

[4]  Edoardo Amaldi,et al.  Provisioning virtual private networks under traffic uncertainty , 2007, Networks.

[5]  Chandra Chekuri.  Routing and network design with robustness to changing or uncertain traffic demands , 2007, SIGA.

[6]  Anja Feldmann,et al.  Dynamics of IP traffic: a study of the role of variability and the impact of control , 1999, SIGCOMM '99.

[7]  Walid Ben-Ameur,et al.  Routing of Uncertain Traffic Demands , 2005 .

[8]  Albert G. Greenberg,et al.  A flexible model for resource management in virtual private networks , 1999, SIGCOMM '99.

[9]  Adam Ouorou,et al.  Robust Capacity Assignment in Telecommunications , 2006, Comput. Manag. Sci..

[10]  Iraj Saniee,et al.  Studies of random demands on network costs , 1998, Telecommun. Syst..

[11]  FeldmannAnja,et al.  Deriving traffic demands for operational IP networks , 2000 .

[12]  Subhash Suri,et al.  Designing Least-Cost Nonblocking Broadband Networks , 1997, J. Algorithms.

[13]  Ariel Orda,et al.  QoS routing in networks with uncertain parameters , 1998, IEEE/ACM Trans. Netw..

[14]  W. Ben-Ameur.  Between fully dynamic routing and robust stable routing , 2007, 2007 6th International Workshop on Design and Reliable Communication Networks.

[15]  R. Wilder,et al.  Wide-area Internet traffic patterns and characteristics , 1997, IEEE Netw..

[16]  Walid Ben-Ameur,et al.  Networks new economical virtual private , 2003, CACM.

[17]  Robert D. Doverspike,et al.  Network planning with random demand , 1994, Telecommun. Syst..

[18]  A Gerodimos,et al.  Robust Discrete Optimization and its Applications , 1996, J. Oper. Res. Soc..

[19]  Gianpaolo Oriolo,et al.  Hardness of robust network design , 2007 .

[20]  Masayuki Murata,et al.  Analysis and Modeling of World Wide Web Traffic for Capacity Dimensioning of Internet Access Lines , 1998, Perform. Evaluation.

[21]  Georgios Petrou,et al.  An approach to robust network design in telecommunications , 2007, RAIRO Oper. Res..

[22]  Walid Ben-Ameur,et al.  NEW ECONOMICAL VIRTUAL PRIVATE NETWORKS , 2003 .

[23]  Navin Goyal,et al.  Dynamic vs. Oblivious Routing in Network Design , 2010, Algorithmica.

[24]  Anja Feldmann,et al.  Deriving traffic demands for operational IP networks: methodology and experience , 2001, TNET.

[25]  Melvyn Sim,et al.  Robust discrete optimization and network flows , 2003, Math. Program..

[26]  Arkadi Nemirovski,et al.  Robust solutions of uncertain linear programs , 1999, Oper. Res. Lett..

[27]  Edoardo Amaldi,et al.  Provisioning virtual private networks under traffic uncertainty , 2007 .