Sökning: onr:"swepub:oai:lup.lub.lu.se:f60bab0f-f495-416a-925c-f899a602f928" >
On total traffic do...
On total traffic domination in non-complete graphs
-
Pavon-Marino, P. (författare)
-
- Pioro, Michal (författare)
- Lund University,Lunds universitet,Institutionen för elektro- och informationsteknik,Institutioner vid LTH,Lunds Tekniska Högskola,Department of Electrical and Information Technology,Departments at LTH,Faculty of Engineering, LTH
-
(creator_code:org_t)
- Elsevier BV, 2011
- 2011
- Engelska.
-
Ingår i: Operations Research Letters. - : Elsevier BV. - 0167-6377. ; 39, s. 40-43
- Relaterad länk:
-
http://dx.doi.org/10...
-
visa fler...
-
http://girtel.upct.e...
-
https://lup.lub.lu.s...
-
https://doi.org/10.1...
-
visa färre...
Abstract
Ämnesord
Stäng
- 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.
Ämnesord
- TEKNIK OCH TEKNOLOGIER -- Elektroteknik och elektronik (hsv//swe)
- ENGINEERING AND TECHNOLOGY -- Electrical Engineering, Electronic Engineering, Information Engineering (hsv//eng)
Nyckelord
- Network optimization
- Traffic matrices domination
- Multi-hour optimization
Publikations- och innehållstyp
- art (ämneskategori)
- ref (ämneskategori)
Hitta via bibliotek
Till lärosätets databas