Abstract
Given an undirected graph G ( V , E ) , a set of traffic matrices H and one additional traffic matrix h , we say that H totally dominates h if, for each capacity reservation u supporting H , u also supports h using the same routing pattern. It has been shown that if | H | = 1 ( H = { h ˆ } , say) and G is a complete graph, H totally dominates h if, and only if, h ˆ ≥ h component-wise. In this paper we give a generalized condition for | H | ≥ 1 and any undirected graph.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
