Enabling low‐latency service function chains by merging duplicate match operations. Issue 5 (5th August 2022)

• Record Type: Journal Article
• Authors: Zhang, Dong; Guo, Kaiwei; Chen, Xiang; Liu, Xuan
• Is Part Of: IET networks. Volume 11:Issue 5(2022)
• Page Start: 147
• Page End: 155
• Publication Date: 2022-08-05
• Subjects: Computer network architectures -- Periodicals; Computer network protocols -- Periodicals; Information networks -- Periodicals; Telecommunication systems -- Periodicals; 004.605
• DOI: 10.1049/ntw2.12049
• Languages: English
• ISSNs: 2047-4954

Abstract

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.