The DOI matches its Crossref record.
Near optimal placement of virtual network functions
Abstract
Network Function Virtualization (NFV) is a new networking paradigm where network functions are executed on commodity servers located in small cloud nodes distributed across the network, and where software defined mechanisms are used to control the network flows. This paradigm is a major turning point in the evolution of networking, as it introduces high expectations for enhanced economical network services, as well as major technical challenges. In this paper, we address one of the main technical challenges in this domain: the actual placement of the virtual functions within the physical network. This placement has a critical impact on the performance of the network, as well as on its reliability and operation cost. We perform a thorough study of the NFV location problem, show that it introduces a new type of optimization problems, and provide near optimal approximation algorithms guaranteeing a placement with theoretically proven performance. The performance of the solution is evaluated with respect to two measures: the distance cost between the clients and the virtual functions by which they are served, as well as the setup costs of these functions. We provide bi-criteria solutions reaching constant approximation factors with respect to the overall performance, and adhering to the capacity constraints of the networking infrastructure by a constant factor as well. Finally, using extensive simulations, we show that the proposed algorithms perform well in many realistic scenarios.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Resource Allocation in NFV: A Comprehensive Survey
Gil Herrera, J., & Botero, J. F. (2016) · IEEE Transactions on Network and Service Management · doi:10.1109/tnsm.2016.2598420 · Cited by 904
Orchestrating Virtualized Network Functions
Bari, F., Chowdhury, S. R., Ahmed, R., Boutaba, R., & Duarte, O. C. M. B. (2016) · IEEE Transactions on Network and Service Management · doi:10.1109/tnsm.2016.2569020 · Cited by 417
A survey on service function chaining
Bhamare, D., Jain, R., Samaka, M., & Erbad, A. (2016) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2016.09.001 · Cited by 331
Semantic-Aware Security Orchestration in SDN/NFV-Enabled IoT Systems
Molina Zarca, A., Bagaa, M., Bernal Bernabe, J., Taleb, T., & Skarmeta, A. F. (2020) · Sensors · doi:10.3390/s20133622 · Cited by 55
Towards optimal outsourcing of service function chain across multiple clouds
Chen, H., Xu, S., Wang, X., Zhao, Y., Li, K., Wang, Y., Wang, W., & Li, L. M. (2016) · 2016 IEEE International Conference on Communications (ICC) · doi:10.1109/icc.2016.7510996 · Cited by 17
Metadata
- Authors
- Cohen, R., Lewin-Eytan, L., Naor, J. S., & Raz, D.
- Venue
- 2015 IEEE Conference on Computer Communications (INFOCOM)
- Publisher
- IEEE
- Published
- 2015-04
- Pages
- 1346-1354
- OpenAlex
- W1578960134
- Cited by
- 519
- References
- 0
- FWCI
- 44.69
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Near optimal placement of virtual network functions. https://app.cochat.ai/papers/10.1109/infocom.2015.7218511
- The paper
- Cohen, R., Lewin-Eytan, L., Naor, J. S., & Raz, D. (2015). Near optimal placement of virtual network functions. 2015 IEEE Conference on Computer Communications (INFOCOM). https://doi.org/10.1109/infocom.2015.7218511
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.