Security-Aware Service Function Chaining and Embedding With Asymmetric Dedicated Protection
| dc.contributor.author | Wang, Ben | |
| dc.contributor.author | Li, Jun | |
| dc.contributor.author | Cao, Shaohua | |
| dc.contributor.author | Guler, Evrim | |
| dc.contributor.author | Zheng, Danyang | |
| dc.contributor.author | Güler, Evrim | |
| dc.date.accessioned | 2025-10-18T09:58:21Z | |
| dc.date.created | 2024 | |
| dc.date.issued | 2024 | |
| dc.department | Fakülteler, Mühendislik Mimarlık ve Tasarım Fakültesi, Bilgisayar Mühendisliği Bölümü | |
| dc.description.abstract | In the 5G and beyond 5G networks, achieving security-aware data transmission needs to convert clients ' requests into a service function chain (SFC), each service function (SF) providing a certain security guarantee. With diverse configuration techniques, an SF may own multiple versions, each version providing various security guarantees with diverse costs. It should be notice that, as the recent software failures have caused severe financial loss, great attentions from both academia and industry have been put onto the SFC reliability. In the literature, existing works have solely investigated the following two fields: 1) how to deploy a security-aware SFC, and 2) how to protect a traditional SFC. Simply applying these techniques to dealing with the problem of security-aware SFC protection might not be efficient as the backup and primary SFCs may not be identical for security-aware SFCs. Therefore, how to jointly take these fields into account is challenging and remains open. To tackle the above problem, this paper studies how to construct and embed a security-aware SFC with asymmetric dedicated protection. We mathematically define this problem and name it security-aware service function chaining, embedding, and protection with multi-versioned SFs (SFCEP-MF) with the objective of cost optimization. Next, to optimize the SFCEP-MF problem, we construct an efficient algorithm, called augmenting-path with primary-first disjoint SFP identifier (APPF-DSI). Extensive simulation results show that the APPF-DSI algorithm outperforms the benchmark approaches that are directly extended from the state-of-the-art. | |
| dc.description.sponsorship | National Natural Science Founding of China | |
| dc.description.sponsorship | No Statement Available | |
| dc.identifier.doi | 10.1109/ACCESS.2024.3387083 | |
| dc.identifier.endpage | 53957 | |
| dc.identifier.issn | 2169-3536 | |
| dc.identifier.orcid | Guler, Evrim/0000-0002-7226-4748 | |
| dc.identifier.orcid | Cao, Shaohua/0000-0001-8287-2942 | |
| dc.identifier.orcid | Zheng, Danyang/0000-0002-3031-7856; | |
| dc.identifier.scopus | 2-s2.0-85190166744 | |
| dc.identifier.scopusquality | Q1 | |
| dc.identifier.startpage | 53944 | |
| dc.identifier.uri | https://doi.org/10.1109/ACCESS.2024.3387083 | |
| dc.identifier.uri | https://hdl.handle.net/11772/19618 | |
| dc.identifier.volume | 12 | |
| dc.identifier.wos | WOS:001208019800001 | |
| dc.identifier.wosquality | Q2 | |
| dc.indekslendigikaynak | Web of Science | |
| dc.indekslendigikaynak | Scopus | |
| dc.language.iso | en | |
| dc.publisher | IEEE-Inst Electrical Electronics Engineers Inc | |
| dc.relation.ispartof | Ieee Access | |
| dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | |
| dc.rights | info:eu-repo/semantics/openAccess | |
| dc.snmz | WoS_20251016 | |
| dc.subject | Network Function Virtualization | |
| dc.subject | Service Computing | |
| dc.subject | Reliability Engineering | |
| dc.subject | Service Function With Multi-Versions | |
| dc.subject | Service Function Chaining And Embedding | |
| dc.subject | Security | |
| dc.subject | Reliability | |
| dc.title | Security-Aware Service Function Chaining and Embedding With Asymmetric Dedicated Protection | |
| dc.type | Article | |
| dspace.entity.type | Publication | |
| relation.isAuthorOfPublication | 181e6864-0de7-41e9-90eb-19bcf3d116b0 | |
| relation.isAuthorOfPublication.latestForDiscovery | 181e6864-0de7-41e9-90eb-19bcf3d116b0 |










