A robust resource allocation approach with the number of uncertain traffic demands constraint

In traditional routing and network design problems, we assume that traffic demands are known in advance, which based on a set of historical requirement. Due to the new technologies development and the diversity of communication applications, the demand matrix presents considerable uncertainty. So, in the past years, research on the issue of uncertainty in demand matrix is a hot topic, and a number of mature approaches have been proposed. In this paper, we investigate the robust resource allocation problem with the number of simultaneously varying traffic demands constraint, and propose a new robust model, namely Γ-robust model. At the same time, we also propose a normal model, namely low-bound model, which obtain the optimal solution (or low bound), by enumerating all robust states. We compare the efficiency of our Γ-robust model using simulation under various performance metrics.