File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1016/j.comnet.2023.109869
- Scopus: eid_2-s2.0-85162136977
- WOS: WOS:001025816400001
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Efficient embedding of Service Function Chains in space-division multiplexing elastic optical networks
| Title | Efficient embedding of Service Function Chains in space-division multiplexing elastic optical networks |
|---|---|
| Authors | |
| Keywords | Service Function Chain Space-Division Multiplexing Elastic Optical Networks Virtual Network Functions |
| Issue Date | 1-Sep-2023 |
| Publisher | Elsevier |
| Citation | Computer Networks, 2023, v. 233 How to Cite? |
| Abstract | Virtual Network Functions (VNFs) are implemented as software instances on generic servers in Data Centers (DCs). A network service is implemented by an ordered list of VNFs, called Service Function Chain (SFC). SFC embedding decides which DC to place/instantiate a VNF, and how to route traffic through the instantiated VNFs/DCs. Benefits from its high capacity and flexibility, the Space-Division Multiplexing Elastic Optical Networks (SDM-EONs) have been proposed as a promising solution to provide connection service between DCs. In this paper, the problem of SFC embedding in SDM-EONs is studied. We first formulate an Integer Linear Programming (ILP) to minimize the Maximum Index of the Utilized Frequency Slot (MIUFS) for a given set of SFC requests. To achieve scalability, a greedy algorithm is proposed to embed SFCs separately. For each SFC, the lowest cost embedding solution can be found by enumeration would be selected for service embedding. A novel stretch algorithm is then designed to reduce the computing complexity further. The key idea is to place VNFs close to the least-cost path between the source and destination of a request. Three strategies to measure the path cost are evaluated. Simulation results show that our stretch algorithm gives the best overall performance in terms of running time, bandwidth consumption, MIUFS and request blocking probability. |
| Persistent Identifier | http://hdl.handle.net/10722/339778 |
| ISSN | 2023 Impact Factor: 4.4 2023 SCImago Journal Rankings: 1.520 |
| ISI Accession Number ID |
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Zhang, Shengyu | - |
| dc.contributor.author | Yeung, Kwan L | - |
| dc.date.accessioned | 2024-03-11T10:39:15Z | - |
| dc.date.available | 2024-03-11T10:39:15Z | - |
| dc.date.issued | 2023-09-01 | - |
| dc.identifier.citation | Computer Networks, 2023, v. 233 | - |
| dc.identifier.issn | 1389-1286 | - |
| dc.identifier.uri | http://hdl.handle.net/10722/339778 | - |
| dc.description.abstract | <p>Virtual Network Functions (VNFs) are implemented as software instances on generic servers in <a href="https://www.sciencedirect.com/topics/computer-science/data-center" title="Learn more about Data Centers from ScienceDirect's AI-generated Topic Pages">Data Centers</a> (DCs). A <a href="https://www.sciencedirect.com/topics/computer-science/network-service" title="Learn more about network service from ScienceDirect's AI-generated Topic Pages">network service</a> is implemented by an ordered list of VNFs, called Service Function Chain (SFC). SFC embedding decides which DC to place/instantiate a VNF, and how to route traffic through the instantiated VNFs/DCs. Benefits from its high capacity and flexibility, the Space-Division Multiplexing Elastic <a href="https://www.sciencedirect.com/topics/engineering/fiber-optic-networks" title="Learn more about Optical Networks from ScienceDirect's AI-generated Topic Pages">Optical Networks</a> (SDM-EONs) have been proposed as a promising solution to provide connection service between DCs. In this paper, the problem of SFC embedding in SDM-EONs is studied. We first formulate an <a href="https://www.sciencedirect.com/topics/computer-science/integer-linear-programming" title="Learn more about Integer Linear Programming from ScienceDirect's AI-generated Topic Pages">Integer Linear Programming</a> (ILP) to minimize the Maximum Index of the Utilized Frequency Slot (MIUFS) for a given set of SFC requests. To achieve scalability, a <a href="https://www.sciencedirect.com/topics/computer-science/greedy-algorithm" title="Learn more about greedy algorithm from ScienceDirect's AI-generated Topic Pages">greedy algorithm</a> is proposed to embed SFCs separately. For each SFC, the lowest cost embedding solution can be found by enumeration would be selected for service embedding. A novel stretch algorithm is then designed to reduce the computing complexity further. The key idea is to place VNFs close to the least-cost path between the source and destination of a request. Three strategies to measure the path cost are evaluated. Simulation results show that our stretch algorithm gives the best overall performance in terms of running time, bandwidth consumption, MIUFS and request <a href="https://www.sciencedirect.com/topics/computer-science/blocking-probability" title="Learn more about blocking probability from ScienceDirect's AI-generated Topic Pages">blocking probability</a>.<br></p> | - |
| dc.language | eng | - |
| dc.publisher | Elsevier | - |
| dc.relation.ispartof | Computer Networks | - |
| dc.rights | This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License. | - |
| dc.subject | Service Function Chain | - |
| dc.subject | Space-Division Multiplexing Elastic Optical Networks | - |
| dc.subject | Virtual Network Functions | - |
| dc.title | Efficient embedding of Service Function Chains in space-division multiplexing elastic optical networks | - |
| dc.type | Article | - |
| dc.identifier.doi | 10.1016/j.comnet.2023.109869 | - |
| dc.identifier.scopus | eid_2-s2.0-85162136977 | - |
| dc.identifier.volume | 233 | - |
| dc.identifier.isi | WOS:001025816400001 | - |
| dc.identifier.issnl | 1389-1286 | - |