Trust-Aware Service Function Chain Embedding: A Path-Based Approach
Nariman Torkzaban, John S. Baras

TL;DR
This paper enhances trust-aware service function chain embedding by incorporating link and path trustworthiness, formulating it as a MILP, and proposing an approximate model to improve scalability, validated through simulations.
Contribution
It generalizes trust considerations in SFC embedding by including link and path trustworthiness and introduces an approximate model to reduce computational complexity.
Findings
The trust-aware model improves embedding reliability.
The approximate model reduces computational complexity.
Simulation results validate the effectiveness of the approach.
Abstract
With the emergence of network function virtualization (NFV), and software-defined networking (SDN), the realization and implementation of service function chains (SFCs) have become much easier. An SFC is an ordered set of interconnected virtual network functions (VNFs). NFV allows for decoupling the network functions from proprietary hardware realizing a software-based implementation of VNFs on commodity hardware and SDN decouples the network control from its forwarding logic allowing for a more flexible and programmable traffic routing among the VNFs. The SFC embedding problem (i.e. placement of SFCs on a shared substrate and establishing the corresponding traffic routes between the VNFs), has been extensively studied in the literature. In this paper, we extend a previous work on trust-aware service chain embedding with generalizing the role of trust by incorporating the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
