On total traffic domination in non-complete graphs

Authors:
Pablo PavóN MariñO;Michał PióRo
Affiliations:
Technical University of Cartagena, Plaza Cronista Isidoro Valverde s/n 30202 Cartagena, Spain;Inst. of Telecom, Warsaw University of Technology, Nowowiejska 15/19, 00-665 Warszawa, Poland and Department of Electrical and Information Technology, Lund University, Box 118, S-221 00 Lund, Swed ...
Venue:
Operations Research Letters
Year:
2011

Citing 3
Cited 0

Making intra-domain routing robust to changing and uncertain traffic demands: understanding fundamental tradeoffs

Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Hardness of robust network design

Networks
Domination Between Traffic Matrices

Mathematics of Operations Research

Quantified Score

Hi-index	0.00

Visualization

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.