New Discoveries of Domination between Traffic Matrices

A traffic matrix $D_1$ dominates a traffic matrix $D_2$ if any capacity reservation supporting $D_1$ supports $D_2$ as well. We prove that $D_3$ dominates $D_3+ \lambda(D_2-D_1)$ for any $\lambda\geq 0$ if $D_1$ dominates $D_2$. By the property , it is pointed out that the domains supported by different traffic matrices are isomorphic on the extended concept of support. Besides, we offer an absolutely different way based on domination to help solve the Robust Network Design problem. Furthermore, we give the generalization to integral flows.

Article

Download

View PDF