Robust DWDM Routing and Provisioning under Polyhedral Demand Uncertainty.

O.E. Karasan, M.C. Pinar and H. Yaman, 2005, revised in July 2006.

Abstract: We present mixed integer linear programming models that are robust in the face of uncertain traffic demands known to lie in a certain polyhedron for the problem of dense wavelength division multiplexing network routing and provisioning at minimal cost. We investigate the solution of the problem in a set of numerical experiments for two models of polyhedral uncertainty: (a) the hose model, (b) a restricted interval uncertainty model. We report the results of these numerical experiments in comparison with an alternative model of robustness due to Kennington {\em et al.}

PS FILE is available.