Reliable Placement of Service Function Chains and Virtual Monitoring Functions With Minimal Cost in Softwarized 5G Networks

Thiruvasagam, Prabhu Kaliyammal; Chakraborty, Abhishek; Mathew, Abin; Murthy, C. Siva Ram

doi:10.1109/tnsm.2021.3056917

Cited by 41 publications

(15 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To guarantee service delivery, Refs. [18], [22], [23] proposed heuristic and approximate approaches to handle single and mixed-type failure. Ref.…”

Section: Related Workmentioning

confidence: 99%

“…Ref. [22] proposed a method for embedding an SFC via two linkdisjoint SFPs to protect the service delivery from single mixedtype failure. Taking SF instance distribution into account, Ref.…”

Section: Related Workmentioning

confidence: 99%

“…Moreover, we extend and implement the exhaustive search algorithm, primary and backup service function chaining and embedding (PB-SFCE) [22], and protection centrality-based pairwise node protections (PC-PNP) [23] for comparisons. To verify the approximate performance of KC-NS, we implement the exhaustive search algorithm to obtain the optimal solution.…”

Section: Survivabilitymentioning

confidence: 99%

“…Most existing research concentrated on fault tolerance of a network [11]- [19], but few works have focused on fault-tolerant mechanisms of the SFC delivery [20]- [23]. In [22], two disjoint SFPs (primary and backup) are established to tolerate a single node, link, or SF instance failure. In [23], an SFP fault-tolerant mechanism is proposed to handle multiple SF instance failures.…”

Section: Introductionmentioning

confidence: 99%

“…When investigating the impact of k values in KC-FS, we find that (1) k = 3 can achieve the best cost-protection ratio (i.e., wavelength resource consumption divided by k), and (2) k = 3 has the best average cost-survivability ratio (i.e., wavelength resource consumption divided by the survivability of the deployed services, where the survivability is the ratio between the number of survived services after failures and the total number of deployed services). Moreover, compared to the schemes directly extended from the existing works [22] [23], the proposed MCF-SE algorithm has a better survivability and a higher average cost-survivability ratio.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Service Function Chaining with Deterministic Fault Tolerance in Optical Edge Networks

Zheng¹,

Shen²,

Li³

et al. 2021

Preprint

View full text Add to dashboard Cite

In the upcoming 5G-and-beyond era, ultra-reliable low-latency communication (URLLC) services will be ubiquitous in edge networks. To improve network performance and quality of service (QoS), URLLC services could be delivered via a sequence of software-based network functions, also known as service function chains (SFCs). Towards reliable SFC delivery, it is imperative to incorporate deterministic fault tolerance during SFC deployment. However, deploying an SFC with deterministic fault tolerance is challenging because the protection mechanism needs to consider protection against physical/virtual network failures and hardware/software failures jointly. Against multiple and diverse failures, this work investigates how to effectively deliver an SFC in optical edge networks with deterministic fault tolerance while minimizing wavelength resource consumption. We introduce a protection augmented graph, called k-connected service function slices layered graph (KC-SLG), protecting against k-1 fiber link failures and k-1 server failures. We formulate a novel problem called deterministic-fault-tolerant SFC embedding and propose an effective algorithm, called most candidate first SF slices layered graph embedding (MCF-SE). MCF-SE employs two proposed techniques: k-connected network slicing (KC-NS) and k-connected function slicing (KC-FS). Through thorough mathematical proof, we show that KC-NS is 2-approximate. For KC-FS, we demonstrate that k = 3 provides the best cost-efficiency. Our experimental results also show that the proposed MCF-SE achieves deterministic-fault-tolerant service delivery and performs better than the schemes directly extended from existing work regarding survivability and average cost-efficiency.

show abstract

“…To guarantee service delivery, Refs. [18], [22], [23] proposed heuristic and approximate approaches to handle single and mixed-type failure. Ref.…”

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Survivabilitymentioning

confidence: 99%