The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Piecing together the NFV provisioning puzzle: Efficient placement and chaining of virtual network functions
Abstract
Network Function Virtualization (NFV) is a promising network architecture concept, in which virtualization technologies are employed to manage networking functions via software as opposed to having to rely on hardware to handle these functions. By shifting dedicated, hardware-based network function processing to software running on commoditized hardware, NFV has the potential to make the provisioning of network functions more flexible and cost-effective, to mention just a few anticipated benefits. Despite consistent initial efforts to make NFV a reality, little has been done towards efficiently placing virtual network functions and deploying service function chains (SFC). With respect to this particular research problem, it is important to make sure resource allocation is carefully performed and orchestrated, preventing over- or under-provisioning of resources and keeping end-to-end delays comparable to those observed in traditional middlebox-based networks. In this paper, we formalize the network function placement and chaining problem and propose an Integer Linear Programming (ILP) model to solve it. Additionally, in order to cope with large infrastructures, we propose a heuristic procedure for efficiently guiding the ILP solver towards feasible, near-optimal solutions. Results show that the proposed model leads to a reduction of up to 25% in end-to-end delays (in comparison to chainings observed in traditional infrastructures) and an acceptable resource over-provisioning limited to 4%. Further, we demonstrate that our heuristic approach is able to find solutions that are very close to optimality while delivering results in a timely manner.
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
Cites
Topology of Evolving Networks: Local Events and Universality
Albert, R., & Barabási, A.-L. (2000) · Physical Review Letters · doi:10.1103/physrevlett.85.5234 · Cited by 1,308
Rethinking virtual network embedding: substrate support for path splitting and migration
Yu, M., Yi, Y., Rexford, J., & Chiang, M. (2008) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1355734.1355737 · Cited by 1,244
ViNEYard: Virtual Network Embedding Algorithms With Coordinated Node and Link Mapping
Chowdhury, M., Rahman, M. R., & Boutaba, R. (2012) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2011.2159308 · Cited by 818
ClickOS and the Art of Network Function Virtualization
Martins, J. F., Ahmed, M. F., Europe, N., et al. (2014) · Cited by 668
Design and implementation of a consolidated middlebox architecture
Sekar, V., Egi, N., Ratnasamy, S., Reiter, M. K., & Shi, G. (2012) · UC Berkeley · Cited by 402
NetVM: High Performance and Flexible Networking Using Virtualization on Commodity Platforms
Hwang, J., Ramakrishnan, K. K., & Wood, T. (2015) · IEEE Transactions on Network and Service Management · doi:10.1109/tnsm.2015.2401568 · Cited by 357
Applying NFV and SDN to LTE mobile core gateways, the functions placement problem
Basta, A., Kellerer, W., Hoffmann, M., Morper, H. J., & Hoffmann, K. (2014) · Proceedings of the 4th workshop on All things cellular: operations, applications, & challenges · doi:10.1145/2627585.2627592 · Cited by 238
A policy-aware switching layer for data centers
Joseph, D. A., Tavakoli, A., & Stoica, I. (2008) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1402946.1402966 · Cited by 205
A policy-aware switching layer for data centers
Joseph, D. A., Tavakoli, A., & Stoica, I. G. (2008) · ACM SIGCOMM Conference (SIGCOMM) · doi:10.1145/1402958.1402966 · Cited by 118
On Tackling Virtual Data Center Embedding Problem
Rabbani, M. G., Esteves, R. P., Podlesny, M., et al. (2013) · INRIA a CCSD electronic archive server · Cited by 78
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
A comprehensive survey of Network Function Virtualization
Yi, B., Wang, X., Li, K., Das, S. K., & Huang, M. (2018) · Computer Networks · doi:10.1016/j.comnet.2018.01.021 · Cited by 534
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
On orchestrating virtual network functions
Bari, M. F., Chowdhury, S. R., Ahmed, R., & Boutaba, R. (2015) · 2015 11th International Conference on Network and Service Management (CNSM) · doi:10.1109/cnsm.2015.7367338 · Cited by 300
Metadata
- Authors
- Luizelli, M. C., Bays, L. R., Buriol, L. S., Barcellos, M. P., & Gaspary, L. P.
- Venue
- 2015 IFIP/IEEE International Symposium on Integrated Network Management (IM)
- Publisher
- IEEE
- Published
- 2015-05
- Pages
- 98-106
- OpenAlex
- W2105685892
- Cited by
- 400
- References
- 11
- FWCI
- 40.19
- 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: Piecing together the NFV provisioning puzzle: Efficient placement and chaining of virtual network functions. https://app.cochat.ai/papers/10.1109/inm.2015.7140281
- The paper
- Luizelli, M. C., Bays, L. R., Buriol, L. S., Barcellos, M. P., & Gaspary, L. P. (2015). Piecing together the NFV provisioning puzzle: Efficient placement and chaining of virtual network functions. 2015 IFIP/IEEE International Symposium on Integrated Network Management (IM). https://doi.org/10.1109/inm.2015.7140281
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.