The multicommodity network flow problem: state of the art classification, applications, and solution methods
Over the past decades, the Multicommodity Network Flow (MCNF) problem has grown
popular in the academic literature and a growing number of researchers are interested in …
popular in the academic literature and a growing number of researchers are interested in …
Vineyard: Virtual network embedding algorithms with coordinated node and link map**
Network virtualization allows multiple heterogeneous virtual networks (VNs) to coexist on a
shared infrastructure. Efficient map** of virtual nodes and virtual links of a VN request onto …
shared infrastructure. Efficient map** of virtual nodes and virtual links of a VN request onto …
A survey of network virtualization
Due to the existence of multiple stakeholders with conflicting goals and policies, alterations
to the existing Internet architecture are now limited to simple incremental updates; …
to the existing Internet architecture are now limited to simple incremental updates; …
Virtual network embedding through topology-aware node ranking
Virtualizing and sharing networked resources have become a growing trend that reshapes
the computing and networking architectures. Embedding multiple virtual networks (VNs) on …
the computing and networking architectures. Embedding multiple virtual networks (VNs) on …
Rethinking virtual network embedding: Substrate support for path splitting and migration
Network virtualization is a powerful way to run multiple architectures or experiments
simultaneously on a shared infrastructure. However, making efficient use of the underlying …
simultaneously on a shared infrastructure. However, making efficient use of the underlying …
Virtual network embedding with coordinated node and link map**
Recently network virtualization has been proposed as a promising way to overcome the
current ossification of the Internet by allowing multiple heterogeneous virtual networks (VNs) …
current ossification of the Internet by allowing multiple heterogeneous virtual networks (VNs) …
[PDF][PDF] Algorithms for assigning substrate network resources to virtual network components.
Recent proposals for network virtualization provide a promising way to overcome the
Internet ossification. The key idea of network virtualization is to build a diversified Internet to …
Internet ossification. The key idea of network virtualization is to build a diversified Internet to …
Derandomizing polynomial identity tests means proving circuit lower bounds
We show that derandomizing Polynomial Identity Testing is, essentially, equivalent to
proving circuit lower bounds for NEXP. More precisely, we prove that if one can test in …
proving circuit lower bounds for NEXP. More precisely, we prove that if one can test in …
An improved LP-based approximation for Steiner tree
The Steiner tree problem is one of the most fundamental NP-hard problems: given a
weighted undirected graph and a subset of terminal nodes, find a minimum-cost tree …
weighted undirected graph and a subset of terminal nodes, find a minimum-cost tree …
Steiner tree approximation via iterative randomized rounding
The Steiner tree problem is one of the most fundamental NP-hard problems: given a
weighted undirected graph and a subset of terminal nodes, find a minimum-cost tree …
weighted undirected graph and a subset of terminal nodes, find a minimum-cost tree …