The multicommodity network flow problem: state of the art classification, applications, and solution methods

K Salimifard, S Bigharaz - Operational Research, 2022 - Springer
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 …

Vineyard: Virtual network embedding algorithms with coordinated node and link map**

M Chowdhury, MR Rahman… - IEEE/ACM Transactions …, 2011 - ieeexplore.ieee.org
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 …

A survey of network virtualization

NMMK Chowdhury, R Boutaba - Computer Networks, 2010 - Elsevier
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; …

Virtual network embedding through topology-aware node ranking

X Cheng, S Su, Z Zhang, H Wang, F Yang… - ACM SIGCOMM …, 2011 - dl.acm.org
Virtualizing and sharing networked resources have become a growing trend that reshapes
the computing and networking architectures. Embedding multiple virtual networks (VNs) on …

Rethinking virtual network embedding: Substrate support for path splitting and migration

M Yu, Y Yi, J Rexford, M Chiang - ACM SIGCOMM Computer …, 2008 - dl.acm.org
Network virtualization is a powerful way to run multiple architectures or experiments
simultaneously on a shared infrastructure. However, making efficient use of the underlying …

Virtual network embedding with coordinated node and link map**

NMMK Chowdhury, MR Rahman… - IEEE INFOCOM …, 2009 - ieeexplore.ieee.org
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) …

[PDF][PDF] Algorithms for assigning substrate network resources to virtual network components.

Y Zhu, MH Ammar - INFOCOM, 2006 - Citeseer
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 …

Derandomizing polynomial identity tests means proving circuit lower bounds

V Kabanets, R Impagliazzo - Proceedings of the thirty-fifth annual ACM …, 2003 - dl.acm.org
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 …

An improved LP-based approximation for Steiner tree

J Byrka, F Grandoni, T Rothvoß, L Sanita - Proceedings of the forty …, 2010 - dl.acm.org
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 …

Steiner tree approximation via iterative randomized rounding

J Byrka, F Grandoni, T Rothvoß, L Sanità - Journal of the ACM (JACM), 2013 - dl.acm.org
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 …