Theoretical Approaches to Node Assignment

By D. Andersen. 2002

308 citations recorded by the source corpus.

View Paper: https://www.semanticscholar.org/paper/7f19a844e2dcdbdb03f5dcb6fa842e19118ca80f

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Citations in the corpus

Virtual Network Embedding: A Survey (2013, background): “Solving the VNE problem is NP-hard, as it is related to the multi-way separator problem [16].”
ViNEYard: Virtual Network Embedding Algorithms With Coordinated Node and Link Mapping (2012, unknown): “With constraints on virtual nodes and links, the offline VN embedding problem can be reduced to the -hard multiway separator problem [8].”
Rethinking virtual network embedding: substrate support for path splitting and migration (2008, background): “(For example, assigning virtual nodes to the substrate network without violating bandwidth constraints can be reduced to themultiway separator problem, which is NP-hard [6].”
Virtual network embedding through topology-aware node ranking (2011, background): “Mapping VN requests of the SPs onto the substrate network of the InPs, also known as VN embedding, is NP-hard[28, 5].”
A survey of network virtualization (2010, background): “But the embedding problem, with constraints on nodes and links, can be reduced to the NP -hard multi-way separator problem [101] even when all the requests are known in advance.”
Virtual Network Embedding with Coordinated Node and Link Mapping (2009, background): “However, the VN embedding problem, with constraints on virtual nodes and virtual links, can be reduced to the NPhard multi-way separator problem [5], even if all the VN requests are known in advance.”
Wireless Network Virtualization: A Survey, Some Research Issues and Challenges (2015, background): “It is pointed out in [118] that embedding virtual networks, with constraints on resources or requirements, can be reduced to an NP-hard optimization problem.”