Meny

Javascript verkar inte påslaget? - Vissa delar av Lunds universitets webbplats fungerar inte optimalt utan javascript, kontrollera din webbläsares inställningar.
Du är här

On total traffic domination in non-complete graphs

Författare:
Publiceringsår: 2011
Språk: Engelska
Sidor: 40-43
Publikation/Tidskrift/Serie: Operations Research Letters
Volym: 39
Dokumenttyp: Artikel i tidskrift
Förlag: Elsevier

Sammanfattning

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.

Nyckelord

  • Electrical Engineering, Electronic Engineering, Information Engineering
  • Network optimization
  • Traffic matrices domination
  • Multi-hour optimization

Övriga

Published
  • Networking-lup-obsolete
  • ISSN: 0167-6377

Box 117, 221 00 LUND
Telefon 046-222 00 00 (växel)
Telefax 046-222 47 20
lu [at] lu.se

Fakturaadress: Box 188, 221 00 LUND
Organisationsnummer: 202100-3211
Om webbplatsen