Near optimal placement of virtual network functions

By Rami Cohen, Liane Lewin-Eytan, Joseph (Seffi) Naor, Danny Raz. IEEE Conference on Computer Communications, 2015

498 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Electrical and Electronic Engineering

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

How researchers see this paper

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

In Computer Networks and Communications

1. Juan Felipe Botero
2. Juliver Gil-Herrera
3. Md. Faizul Bari
4. Shihabur Rahman Chowdhury
5. Reaz Ahmed
6. Raj Jain
7. Raouf Boutaba
8. Mohammed Samaka

In Electrical and Electronic Engineering

1. Juan Felipe Botero
2. Juliver Gil-Herrera
3. Raj Jain
4. Raouf Boutaba

Citations in the corpus

• A survey on service function chaining (2016, background): “As outlined in Section V, a significant amount of work has been already done in the field of virtual function placement as well as resource allocation [97-99, 120].”
• Resource Allocation in NFV: A Comprehensive Survey (2016, methodology): “The NFV-RA problem is completely solved when its three stages VNFs-CC, VNF-FGE and VNFs-SCH, are solved.”
• Orchestrating Virtualized Network Functions (2015, methodology): “[33] provided a LP-relaxation based approach for finding inter-data center VNF chain placement.”
• Deploying chains of virtual network functions: On the relation between link and server usage (2016, background): “…SPH SGH GVR Ours (b) 0 10 20 30 40 50 60 [1 ,2] [3,4] [5,6] [7,8] Total Served Demand Size [Gbps] The Length of the Service Chain SPH SGH GVR Ours (c) 0 50 100 150 200 250 300 350 [1,2] [3] [4] [5] [6] [7] [8] Total Served Demand Size [Gbps] The Length of the Service Chain SPH SGH GVR Ours (d) Fig.”