The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Joint Energy Efficient and QoS-Aware Path Allocation and VNF Placement for Service Function Chaining
Abstract
Service function chaining (SFC) allows the forwarding of traffic flows along a chain of virtual network functions (VNFs). Software defined networking (SDN) solutions can be used to support SFC to reduce both the management complexity and the operational costs. One of the most critical issues for the service and network providers is the reduction of energy consumption, which should be achieved without impacting the Quality of Service. In this paper, we propose a novel resource allocation architecture which enables energy-aware SFC for SDN-based networks, considering also constraints on delay, link utilization, server utilization. To this end, we formulate the problems of VNF placement, allocation of VNFs to flows, and flow routing as integer linear programming (ILP) optimization problems. Since the formulated problems cannot be solved (using ILP solvers) in acceptable timescales for realistic problem dimensions, we design a set of heuristic to find near-optimal solutions in timescales suitable for practical applications. We numerically evaluate the performance of the proposed algorithms over a real-world topology under various network traffic patterns. Our results confirm that the proposed heuristic algorithms provide near-optimal solutions (at most 14% optimality-gap) while their execution time makes them usable for real-life networks.
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
Service Function Chaining in Next Generation Networks: State of the Art and Research Challenges
Medhat, A. M., Taleb, T., Elmangoush, A., Carella, G. A., Covaci, S., & Magedanz, T. (2017) · IEEE Communications Magazine · doi:10.1109/mcom.2016.1600219rp · Cited by 267
Cited by
Service Function Chain Orchestration Across Multiple Domains: A Full Mesh Aggregation Approach
Sun, G., Li, Y., Liao, D., & Chang, V. (2018) · IEEE Transactions on Network and Service Management · doi:10.1109/tnsm.2018.2861717 · Cited by 254
Metadata
- Authors
- Tajiki, M. M., Salsano, S., Chiaraviglio, L., Shojafar, M., & Akbari, B.
- Venue
- IEEE Transactions on Network and Service Management
- Published
- 2019-03
- Volume
- 16
- Issue
- 1
- Pages
- 374-388
- ISSN
- 1932-4537
- 2373-7379
- OpenAlex
- W2962948535
- Cited by
- 187
- References
- 1
- FWCI
- 17.07
- 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: Joint Energy Efficient and QoS-Aware Path Allocation and VNF Placement for Service Function Chaining. https://app.cochat.ai/papers/10.1109/tnsm.2018.2873225
- The paper
- Tajiki, M. M., Salsano, S., Chiaraviglio, L., Shojafar, M., & Akbari, B. (2019). Joint Energy Efficient and QoS-Aware Path Allocation and VNF Placement for Service Function Chaining. IEEE Transactions on Network and Service Management. https://doi.org/10.1109/tnsm.2018.2873225
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.