SDN Controller Path Calculation for Virtualized Service Functions
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current network virtualization architectures in mobile communication networks lack an efficient method to find an optimal path for service functions, especially when multiple virtualized network nodes are involved, leading to complexity in traffic processing and quality of service (QoS) provision.
Innovation Solution
A method is proposed that uses a software-defined networking (SDN) controller to generate a sequenced service function chain (SFC) based on user policy and state information, calculate an optimal service function path (SFP), and update it as necessary, incorporating monitoring and optimization units to manage virtualized entities like firewalls, optimizers, and load balancers.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If network nodes are virtualized to provide flexible service functions, then adaptability and service versatility are improved, but device complexity and path calculation difficulty increase
Solution Approach 1:
The patent introduces a dedicated path calculation unit as an intermediary component within the network node. This specialized unit receives service function requirements, determines optimal paths through virtualized network nodes, and returns routing information. By isolating the complex path calculation logic in a dedicated intermediary unit, the system achieves flexible service function adaptation without overwhelming complexity in the overall network architecture.
2Adaptability or versatility
If multiple virtualized network nodes are involved in service processing, then service functionality is enhanced, but traffic processing complexity and QoS management difficulty increase
Solution Approach 1:
The patent segments the network architecture into distinct functional units: service function units that provide specific services, a dedicated path calculation unit that handles routing decisions, and network nodes that execute the paths. This segmentation allows multiple virtualized network nodes to be involved in service processing while distributing complexity across specialized components, thereby managing traffic processing complexity effectively.
Solution Approach 2:
The path calculation unit serves as an intermediary between service function units and network nodes. It receives service requirements, calculates optimal paths through multiple virtualized nodes, and returns routing information. This intermediary layer simplifies QoS management by centralizing path optimization logic, allowing multiple virtualized nodes to work together without direct complex interactions.
3Reliability
If dynamic path updates are performed based on changing policies and network states, then QoS and service quality are improved, but processing overhead and system complexity increase
Solution Approach 1:
The patent implements a feedback mechanism where the path calculation unit continuously receives updated network state information and service policy changes. Based on this feedback, it dynamically recalculates optimal paths and updates routing information. This feedback-driven approach ensures reliable QoS provision by adapting to changing conditions while maintaining manageable system complexity through structured information flow.
Solution Approach 2:
The system employs dynamic path calculation where the path calculation unit can adjust service function paths in real-time based on current network state and policy changes. This dynamic capability improves QoS by responding to changing conditions, while the modular architecture keeps system complexity manageable by confining dynamic behavior to the specialized path calculation unit rather than the entire system.
Data Source
Figure 1
Figure 2
Figure 3
AI summary
Disclosed in the present specification is a method by which network nodes calculate an optimum path for virtualized service functions (SFs). The method can comprise the steps of: generating a service function chain (SFC), in which SFs are put in order, on the basis of subscriber information-based user policy information, session policy information, and SF state information; searching for an optimum SF set on the basis of the SFC so as to calculate an optimum service function path (SFP); and updating the SFP when any one of the subscriber information-based user policy information, session policy information, and SF state information is changed.