Edge SFC Partitioning With DLT Smart-Contract Orchestration
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In network function virtualization (NFV) environments, particularly in edge computing, ensuring the proper execution of Service Function Chains (SFCs) while meeting quality of service (QoS) requirements and optimizing resource utilization is challenging, especially when a single service provider cannot fulfill all SFC requirements.
Innovation Solution
A distributed and decentralized approach using graph-based distributed ledger technology (DLT) augmented with layer-2 smart contracts to partition SFCs into sub-workloads and allocate them to multiple service providers through an auction mechanism, ensuring trust and efficient resource allocation.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Device complexity
If a single service provider is used to execute SFC, then device complexity is reduced, but the ability to fulfill QoS requirements and optimize resource utilization deteriorates
Solution Approach 1:
The patent segments the SFC execution into multiple independent parts distributed across different service providers. Each provider executes a specific portion of the SFC, allowing the system to leverage multiple providers' resources while maintaining manageable complexity through modular architecture and standardized interfaces.
Solution Approach 2:
The patent introduces an intermediary orchestration layer that manages the distribution, coordination, and monitoring of SFC execution across multiple service providers. This mediator handles the complexity of multi-provider coordination, enabling reliable SFC execution without requiring each provider to manage the entire system.
2Productivity
If multiple service providers are used to execute SFC, then resource utilization and QoS fulfillment are improved, but device complexity increases
Solution Approach 1:
The patent creates a universal orchestration framework that can manage multiple service providers with different capabilities through standardized interfaces. This multi-functional system handles provisioning, monitoring, and coordination across diverse providers, enabling high resource utilization without proportionally increasing complexity.
Solution Approach 2:
The patent implements dynamic resource allocation and provider selection mechanisms that adapt to changing conditions. The system dynamically adjusts SFC distribution across providers based on resource availability, performance metrics, and QoS requirements, optimizing productivity while managing complexity through adaptive rather than static configurations.
3Productivity
If SFC is partitioned across multiple providers, then resource optimization is improved, but trust management among autonomous entities becomes more difficult
Solution Approach 1:
The patent implements comprehensive feedback mechanisms where each service provider reports execution status, resource consumption, and performance metrics to the orchestration system. This feedback loop enables automated trust verification, performance monitoring, and dynamic adjustment of SFC distribution, optimizing resource utilization while managing trust through transparent, data-driven coordination.
Data Source
AI summary
A service partitions a service function chain (SFC) into multiple virtualized network functions (VNFs). The services deploys the VNFs to a smart contract operating in a distributed ledger. The smart contract initiates a bid to service the SFC. Multiple infrastructure providers (InPs) are identified and included in a graph structure. The graph is organized to reflect the order by which the VNFs are to be serviced by the different InPs. The graph also lists the costs the InPs require to service the various different VNFs. The InPs included in a specific graph traversal having the smallest cost are selected, but the cost that is used is the cost for the graph traversal having the penultimate smallest cost. The service outputs the selected InPs as well as the penultimate smallest cost.