Joint Energy Efficient and QoS-Aware Path Allocation and VNF Placement for Service Function Chaining
The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
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.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
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
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
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
Service Function Chaining (SFC) Architecture
(2015) · doi:10.17487/rfc7665 · Cited by 659
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
Regulation by Prices, Quantities, or Both: A Review of Instrument Choice
Hepburn, C. (2006) · Oxford Review of Economic Policy · doi:10.1093/oxrep/grj014 · Cited by 416
Joint VM placement and routing for data center traffic engineering
Jiang, J. W., Lan, T., Ha, S., Chen, M., & Chiang, M. (2012) · 2012 Proceedings IEEE INFOCOM · doi:10.1109/infcom.2012.6195719 · Cited by 362
Eramo, V., Miucci, E., Ammar, M., & Lavacca, F. G. (2017) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2017.2668470 · Cited by 357
Energy-Efficient Adaptive Resource Management for Real-Time Vehicular Cloud Services
Shojafar, M., Cordeschi, N., & Baccarelli, E. (2019) · IEEE Transactions on Cloud Computing · doi:10.1109/tcc.2016.2551747 · Cited by 339
Self-citationOn 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
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
Optimal virtual network function placement in multi-cloud service function chaining architecture
Bhamare, D., Samaka, M., Erbad, A., Jain, R., Gupta, L., & Chan, H. A. (2017) · Computer Communications · doi:10.1016/j.comcom.2017.02.011 · Cited by 219
Comparing VM-Placement Algorithms for On-Demand Clouds
Mills, K. L., Filliben, J. J., & Dabrowski, C. (2011) · IEEE International Conference on Cloud Computing Technology and Science · doi:10.1109/cloudcom.2011.22 · Cited by 200
Tang, M., & Pan, S. (2015) · Neural Processing Letters · doi:10.1007/s11063-014-9339-8 · Cited by 181
Wang, L., Lu, Z., Wen, X., Knopp, R., & Gupta, R. K. (2016) · IEEE Access · doi:10.1109/access.2016.2629278 · Cited by 167
Khosravi, A., Andrew, L. L. H., & Buyya, R. (2017) · IEEE Transactions on Sustainable Computing · doi:10.1109/tsusc.2017.2709980 · Cited by 141
Distributed Service Function Chaining
Ghaznavi, M., Shahriar, N., Kamali, S., Ahmed, R., & Boutaba, R. (2017) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2017.2760178 · Cited by 128
VM Placement Strategies for Cloud Scenarios
Calcavecchia, N. M., Biran, O., Hadad, E., & Moatti, Y. (2012) · IEEE ... International Conference on Cloud Computing · doi:10.1109/cloud.2012.113 · Cited by 121
Toward a telco cloud environment for service functions
Soares, J., Gonçalves, C., Parreira, B., Tavares, P., Carapinha, J., Barraca, J. P., Aguiar, R. L., & Sargento, S. (2015) · IEEE Communications Magazine · doi:10.1109/mcom.2015.7045397 · Cited by 91
Abdelsalam, A., Clad, F., Filsfils, C., Salsano, S., Siracusano, G., & Veltri, L. (2017) · IEEE International Conference on Network Softwarization (NetSoft) · doi:10.1109/netsoft.2017.8004208 · Cited by 88
Self-citationMarotta, A., D’Andreagiovanni, F., Kassler, A., & Zola, E. (2017) · Computer Networks · doi:10.1016/j.comnet.2017.04.045 · Cited by 73
Energy-efficient path allocation heuristic for service function chaining
Tajiki, M. M., Salsano, S., Shojafar, M., Chiaraviglio, L., & Akbari, B. (2018) · Conference on Innovation in Clouds, Internet and Networks and Workshops (ICIN) · doi:10.1109/icin.2018.8401618 · Cited by 31
Self-citationOptimal Qos-aware network reconfiguration in software defined cloud data centers
Tajiki, M. M., Akbari, B., & Mokari, N. (2017) · Computer Networks · doi:10.1016/j.comnet.2017.04.003 · Cited by 30
Self-citationGu, L., Zeng, D., Guo, S., & Ye, B. (2015) · 2012 International Conference on Computing, Networking and Communications (ICNC) · doi:10.1109/iccnc.2015.7069434 · Cited by 15
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
- 24
- 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
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.