New discoveries of domination between traffic matrices

Abstract

A trac matrix D1 dominates a trac matrix D2 if any capacity reservation supporting D1 supports D2 as well. We prove that D3 dominates D3 + (D2 D1) for any > 0 if D1 dominates D2 . By the property , it is pointed out that the domains supported by dierent trac matrices are isomorphic on the extended concept of support. Besides, we oer an absolutely dierent way based on domination to help solve the Robust Network Design problem. Furthermore, we give the generalization to integral ows.