Enabling low‐latency service function chains by merging duplicate match operations
Abstract Service function chains (SFCs) built by network functions (NFs) are usually required to be low‐latency, especially in some tight latency scenarios such as Distributed Denial of Service (DDoS) defense. However, different NFs in SFCs are likely to perform identical operations of matching spec...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2022-09-01
|
| Series: | IET Networks |
| Online Access: | https://doi.org/10.1049/ntw2.12049 |
| _version_ | 1811257289489776640 |
|---|---|
| author | Dong Zhang Kaiwei Guo Xiang Chen Xuan Liu |
| author_facet | Dong Zhang Kaiwei Guo Xiang Chen Xuan Liu |
| author_sort | Dong Zhang |
| collection | DOAJ |
| description | Abstract Service function chains (SFCs) built by network functions (NFs) are usually required to be low‐latency, especially in some tight latency scenarios such as Distributed Denial of Service (DDoS) defense. However, different NFs in SFCs are likely to perform identical operations of matching specific packet header fields (e.g., source IP address). Such a processing redundancy inevitably increases the overall end‐to‐end processing latency of SFCs, which in turn affects network management applications in their decision‐making process of handling short‐lived network events (e.g., microbursts). To address this problem, in this paper, we propose a novel NFV framework, DMO, that aims to eliminate those identical and redundant match operations among different NFs in input SFCs while maintaining the original SFC semantics of packet processing. To achieve this goal, our design proposes a semantic‐preserving mechanism that merges duplicate match operations between different NFs and also preserves original SFC semantics. Also, to avoid potential conflicts among NF rules at runtime, DMO further offers another mechanism that resolves unnecessary conflicts among different NF rules by assigning reasonable priorities to these rules. We have implemented a prototype of DMO. Our experiments indicate that DMO achieves 26.7%–67.3% latency reduction for real‐world SFCs. |
| first_indexed | 2024-04-12T17:55:06Z |
| format | Article |
| id | doaj.art-d9af81ceb0814efab79f8e07e39acd46 |
| institution | Directory Open Access Journal |
| issn | 2047-4954 2047-4962 |
| language | English |
| last_indexed | 2024-04-12T17:55:06Z |
| publishDate | 2022-09-01 |
| publisher | Wiley |
| record_format | Article |
| series | IET Networks |
| spelling | doaj.art-d9af81ceb0814efab79f8e07e39acd462022-12-22T03:22:24ZengWileyIET Networks2047-49542047-49622022-09-0111514715510.1049/ntw2.12049Enabling low‐latency service function chains by merging duplicate match operationsDong Zhang0Kaiwei Guo1Xiang Chen2Xuan Liu3College of Mathematics and Computer Science Fuzhou University Fuzhou ChinaCollege of Mathematics and Computer Science Fuzhou University Fuzhou ChinaCollege of Mathematics and Computer Science Fuzhou University Fuzhou ChinaCollege of Information Engineering (College of Artificial Intelligence) Yangzhou University Yangzhou ChinaAbstract Service function chains (SFCs) built by network functions (NFs) are usually required to be low‐latency, especially in some tight latency scenarios such as Distributed Denial of Service (DDoS) defense. However, different NFs in SFCs are likely to perform identical operations of matching specific packet header fields (e.g., source IP address). Such a processing redundancy inevitably increases the overall end‐to‐end processing latency of SFCs, which in turn affects network management applications in their decision‐making process of handling short‐lived network events (e.g., microbursts). To address this problem, in this paper, we propose a novel NFV framework, DMO, that aims to eliminate those identical and redundant match operations among different NFs in input SFCs while maintaining the original SFC semantics of packet processing. To achieve this goal, our design proposes a semantic‐preserving mechanism that merges duplicate match operations between different NFs and also preserves original SFC semantics. Also, to avoid potential conflicts among NF rules at runtime, DMO further offers another mechanism that resolves unnecessary conflicts among different NF rules by assigning reasonable priorities to these rules. We have implemented a prototype of DMO. Our experiments indicate that DMO achieves 26.7%–67.3% latency reduction for real‐world SFCs.https://doi.org/10.1049/ntw2.12049 |
| spellingShingle | Dong Zhang Kaiwei Guo Xiang Chen Xuan Liu Enabling low‐latency service function chains by merging duplicate match operations IET Networks |
| title | Enabling low‐latency service function chains by merging duplicate match operations |
| title_full | Enabling low‐latency service function chains by merging duplicate match operations |
| title_fullStr | Enabling low‐latency service function chains by merging duplicate match operations |
| title_full_unstemmed | Enabling low‐latency service function chains by merging duplicate match operations |
| title_short | Enabling low‐latency service function chains by merging duplicate match operations |
| title_sort | enabling low latency service function chains by merging duplicate match operations |
| url | https://doi.org/10.1049/ntw2.12049 |
| work_keys_str_mv | AT dongzhang enablinglowlatencyservicefunctionchainsbymergingduplicatematchoperations AT kaiweiguo enablinglowlatencyservicefunctionchainsbymergingduplicatematchoperations AT xiangchen enablinglowlatencyservicefunctionchainsbymergingduplicatematchoperations AT xuanliu enablinglowlatencyservicefunctionchainsbymergingduplicatematchoperations |