Search: onr:"swepub:oai:lup.lub.lu.se:f60bab0f-f495-416a-925c-f899a602f928" >
On total traffic do...
Abstract
Subject headings
Close
- Abstract in Undetermined 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 vertical bar H vertical bar = 1 = (H = {(h) over cap}, say) and g, is a complete graph, H totally dominates h if, and only if, (h) over cap >= h component-wise. In this paper we give a generalized condition for vertical bar H vertical bar >= 1 and any undirected graph.
Subject headings
- TEKNIK OCH TEKNOLOGIER -- Elektroteknik och elektronik (hsv//swe)
- ENGINEERING AND TECHNOLOGY -- Electrical Engineering, Electronic Engineering, Information Engineering (hsv//eng)
Keyword
- Network optimization
- Traffic matrices domination
- Multi-hour optimization
Publication and Content Type
- art (subject category)
- ref (subject category)
Find in a library
To the university's database