The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Design and evaluation of algorithms for mapping and scheduling of virtual network functions
Open accessAbstract
Network function virtualization has received attention from both academia and industry as an important shift in the deployment of telecommunication networks and services. It is being proposed as a path towards cost efficiency, reduced time-to-markets, and enhanced innovativeness in telecommunication service provisioning. However, efficiently running virtualized services is not trivial as, among other initialization steps, it requires first mapping virtual networks onto physical networks, and thereafter mapping and scheduling virtual functions onto the virtual networks. This paper formulates the online virtual function mapping and scheduling problem and proposes a set of algorithms for solving it. Our main objective is to propose simple algorithms that may be used as a basis for future work in this area. To this end, we propose three greedy algorithms and a tabu search-based heuristic. We carry out evaluations of these algorithms considering parameters such as successful service mappings, total service processing times, revenue, cost etc, under varying network conditions. Simulations show that the tabu search-based algorithm performs only slightly better than the best greedy algorithm.
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
Glover, F., & Laguna, M. (1997) · Cited by 5,679
Future paths for integer programming and links to artificial intelligence
Glover, F. (1986) · Computers & Operations Research · doi:10.1016/0305-0548(86)90048-1 · Cited by 4,181
Glover, F., & Laguna, M. (1997) · doi:10.1007/978-1-4615-6089-0 · Cited by 3,001
Virtual Network Embedding: A Survey
Fischer, A., Botero, J. F., Beck, M. T., de Meer, H., & Hesselbach, X. (2013) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2013.013013.00155 · 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
Specifying and placing chains of virtual network functions
Mehraghdam, S., Keller, M., & Karl, H. (2014) · 2014 IEEE 3rd International Conference on Cloud Networking (CloudNet) · doi:10.1109/cloudnet.2014.6968961 · Cited by 508
VNF-P: A model for efficient placement of virtualized network functions
Moens, H., & Turck, F. D. (2014) · 10th International Conference on Network and Service Management (CNSM) and Workshop · doi:10.1109/cnsm.2014.7014205 · Cited by 457
Scheduling processes with release times, deadlines, precedence and exclusion relations
Xu, J., & Parnas, D. L. (1990) · IEEE Transactions on Software Engineering · doi:10.1109/32.48943 · Cited by 347
The dynamic placement of virtual network functions
Clayman, S., Maini, E., Galis, A., Manzalini, A., & Mazzocca, N. (2014) · 2014 IEEE Network Operations and Management Symposium (NOMS) · doi:10.1109/noms.2014.6838412 · Cited by 194
Allocation and scheduling of precedence-related periodic tasks
Ramamritham, K. (1995) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/71.372795 · Cited by 194
Cited by
Network Function Virtualization: State-of-the-Art and Research Challenges
Mijumbi, R., Serrat, J., Gorricho, J.-L., Bouten, N., De Turck, F., & Boutaba, R. (2016) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2015.2477041 · Cited by 1,933
Self-citationResource 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
Virtual network functions placement and routing optimization
Addis, B., Belabed, D., Bouet, M., & Secci, S. (2015) · 2015 IEEE 4th International Conference on Cloud Networking (CloudNet) · doi:10.1109/cloudnet.2015.7335301 · Cited by 355
Li, J., Shi, W., Wu, H., Zhang, S., & Shen, X. (2022) · IEEE Internet of Things Journal · doi:10.1109/jiot.2021.3058250 · Cited by 157
Metadata
- Authors
- Mijumbi, R., Serrat, J., Gorricho, J.-L., Bouten, N., De Turck, F., & Davy, S.
- Venue
- Proceedings of the 2015 1st IEEE Conference on Network Softwarization (NetSoft)
- Publisher
- IEEE
- Published
- 2015-04
- Pages
- 1-9
- OpenAlex
- W1823841943
- Cited by
- 310
- References
- 17
- FWCI
- 29.71
- Type
- conference paper
- Language
- en
- Open access
- green
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: Design and evaluation of algorithms for mapping and scheduling of virtual network functions. https://app.cochat.ai/papers/10.1109/netsoft.2015.7116120
- The paper
- Mijumbi, R., Serrat, J., Gorricho, J.-L., Bouten, N., De Turck, F., & Davy, S. (2015). Design and evaluation of algorithms for mapping and scheduling of virtual network functions. Proceedings of the 2015 1st IEEE Conference on Network Softwarization (NetSoft). https://doi.org/10.1109/netsoft.2015.7116120
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.