On the computational complexity of the virtual network embedding problem

Given a graph representing a substrate (or physical) network with node and edge capacities and a set of virtual networks with node capacity demands and node-to-node traffic demands, the Virtual Network Embedding problem (VNE) calls for an embedding of (a subset of) the virtual networks onto the subs...

Celý popis

Podrobná bibliografia

Vydané v:	Electronic notes in discrete mathematics Ročník 52; s. 213 - 220
Hlavní autori:	Amaldi, Edoardo, Coniglio, Stefano, Koster, Arie M.C.A., Tieves, Martin
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 01.06.2016
Predmet:	combinatorial optimization computational complexity inapproximability Virtual network embedding combinatorial optimization inapproximability Virtual network embedding computational complexity
ISSN:	1571-0653, 1571-0653
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!