On total traffic domination in non-complete graphs

✍ Scribed by Pablo Pavón Mariño; Michał Pióro

• Book ID: 103877986
• Publisher: Elsevier Science
• Year: 2011
• Tongue: English
• Weight: 235 KB
• Volume: 39
• Category: Article
• ISSN: 0167-6377
• DOI: 10.1016/j.orl.2010.11.007

✦ Synopsis

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 = { ĥ}, say) and G is a complete graph, H totally dominates h if, and only if, ĥ ≥ h component-wise. In this paper we give a generalized condition for |H| ≥ 1 and any undirected graph.