期刊文献+

New Discoveries of Domination Between Traffic Matrices

New Discoveries of Domination Between Traffic Matrices
原文传递
导出
摘要 In this paper the definition of domination is generalized to the case that the elements of the traffic matrices may have negative values. It is proved that D3 dominates D3 + λ(D2 - D1) for any λ ≥0 if D1 dominates D2. Let u(D) be the set of all the traffic matrices that are dominated by the traffic matrix D. It is shown that u ( D∞) and u (D ∈) are isomorphic. Besides, similar results are obtained on multi-commodity flow problems. Fhrthermore, the results are the generalized to integral flows. In this paper the definition of domination is generalized to the case that the elements of the traffic matrices may have negative values. It is proved that D3 dominates D3 + λ(D2 - D1) for any λ ≥0 if D1 dominates D2. Let u(D) be the set of all the traffic matrices that are dominated by the traffic matrix D. It is shown that u ( D∞) and u (D ∈) are isomorphic. Besides, similar results are obtained on multi-commodity flow problems. Fhrthermore, the results are the generalized to integral flows.
出处 《Acta Mathematicae Applicatae Sinica》 SCIE CSCD 2017年第3期561-566,共6页 应用数学学报(英文版)
基金 Supported by National Natural Science Foundation of China under Grant No.(1157101511331012) the Open Project of Key Laboratory of Big Data Mining and Knowledge Management Knowledge Innovation Program of the Chinese Academy of Sciences under Grant No.(KGCX2-RW-329)
关键词 robust network design multi-commodity flows DOMINATION robust network design multi-commodity flows domination
  • 相关文献

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部