The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
Traffic-Aware and Energy-Efficient vNF Placement for Service Chaining: Joint Sampling and Matching Approach
Abstract
Although network function virtualization (NFV) is a promising approach for providing elastic network functions, it faces several challenges in terms of adaptation to diverse network appliances and reduction of the capital and operational expenses of the service providers. In particular, to deploy service chains, providers must consider different objectives, such as minimizing the network latency or the operational cost, which are coupled objectives that have traditionally been addressed separately. In this paper, the problem of virtual network function (vNF) placement for service chains is studied for the purpose of energy and traffic-aware cost minimization. This problem is formulated as an optimization problem named the joint operational and network traffic cost (OPNET) problem. First, a sampling-based Markov approximation (MA) approach is proposed to solve the combinatorial NP-hard problem, OPNET. Even though the MA approach can yield a near-optimal solution, it requires a long convergence time that can hinder its practical deployment. To overcome this issue, a novel approach that combines the MA with matching theory, named as SAMA, is proposed to find an efficient solution for the original problem OPNET. Simulation results show that the proposed framework can reduce the total incurred cost by up to 19 percent compared to the existing non-coordinated approach.
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
College Admissions and the Stability of Marriage
Gale, D., & Shapley, L. S. (1962) · The American Mathematical Monthly · doi:10.1080/00029890.1962.11989827 · Cited by 5,985
VL2: a scalable and flexible data center network
Greenberg, A., Hamilton, J. R., Jain, N., Kandula, S., Kim, C., Lahiri, P., Maltz, D. A., Patel, P., & Sengupta, S. (2009) · Proceedings of the ACM SIGCOMM 2009 conference on Data communication · doi:10.1145/1592568.1592576 · Cited by 2,111
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
Dominant resource fairness: fair allocation of multiple resource types
Ghodsi, A., Zaharia, M., Hindman, B., Konwinski, A., Shenker, S. J., & Stoica, I. G. (2011) · doi:10.5555/1972457.1972490 · Cited by 1,049
Improving the Scalability of Data Center Networks with Traffic-aware Virtual Machine Placement
Meng, X., Pappas, V., & Zhang, L. (2010) · 2010 Proceedings IEEE INFOCOM · doi:10.1109/infcom.2010.5461930 · Cited by 935
PowerNap: eliminating server idle power
Meisner, D., Gold, B. T., & Wenisch, T. F. (2009) · Proceedings of the 14th international conference on Architectural support for programming languages and operating systems · doi:10.1145/1508244.1508269 · Cited by 901
VL2: a scalable and flexible data center network
Greenberg, A., Hamilton, J. R., Jain, N., Kandula, S., Kim, C., Lahiri, P., Maltz, D. A., Patel, P., & Sengupta, S. (2009) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1594977.1592576 · Cited by 711
SIMPLE-fying middlebox policy enforcement using SDN
Qazi, Z. A., Tu, C.-C., Chiang, L., Miao, R., Sekar, V., & Yu, M. (2013) · Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM · doi:10.1145/2486001.2486022 · Cited by 642
Matching theory for future wireless networks: fundamentals and applications
Gu, Y., Saad, W., Bennis, M., Debbah, M., & Han, Z. (2015) · IEEE Communications Magazine · doi:10.1109/mcom.2015.7105641 · Cited by 561
Self-citationSpecifying 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
Cited by
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
A Manifesto for Future Generation Cloud Computing: Research Directions for the Next Decade
Buyya, R., Srirama, S. N., Casale, G., Calheiros, R., Simmhan, Y., Varghese, B., Gelenbe, E., Javadi, B., Vaquero, L. M., Netto, M. A. S., et al. (2019) · ACM Computing Surveys · doi:10.1145/3241737 · Cited by 362
Metadata
- Authors
- Pham, C., Tran, N. H., Ren, S., Saad, W., & Hong, C. S.
- Venue
- IEEE Transactions on Services Computing
- Published
- 2020-01-01
- Volume
- 13
- Issue
- 1
- Pages
- 172-185
- ISSN
- 1939-1374 (ISSN-L)
- 2372-0204
- OpenAlex
- W2591441959
- Cited by
- 260
- References
- 31
- FWCI
- 19.81
- Type
- journal article
- 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: Traffic-Aware and Energy-Efficient vNF Placement for Service Chaining: Joint Sampling and Matching Approach. https://app.cochat.ai/papers/10.1109/tsc.2017.2671867
- The paper
- Pham, C., Tran, N. H., Ren, S., Saad, W., & Hong, C. S. (2020). Traffic-Aware and Energy-Efficient vNF Placement for Service Chaining: Joint Sampling and Matching Approach. IEEE Transactions on Services Computing. https://doi.org/10.1109/tsc.2017.2671867
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.