Joint Network Slicing and Traffic Engineering Optimization
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Next-generation communication networks face challenges in routing data traffic efficiently due to the need to solve the network slicing and traffic engineering problems in a more complex and flexible manner, as prior art methods often result in sub-optimal solutions by simplifying these issues or assuming arbitrary service function instantiation across multiple nodes, leading to increased communication overhead.
Innovation Solution
A method and system that determine a network traffic routing path by solving a joint network slicing and traffic engineering problem, minimizing resource objectives with constraints, and transmitting instructions to create a service function chain across identified function nodes, using a Mixed Integer Linear Program and penalty terms to relax binary variables and achieve optimal resource allocation.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Device complexity
If prior art methods simplify network slicing and traffic engineering problems or assume arbitrary service function instantiation across multiple nodes, then device complexity is reduced, but resource allocation efficiency deteriorates
Solution Approach 1:
The patent merges the network slicing problem and traffic engineering problem into a single joint optimization framework. Instead of solving them separately as prior art does, the invention formulates a unified Mixed Integer Linear Program (MILP) that simultaneously determines service function chain instantiation and traffic routing paths, achieving optimal resource allocation while maintaining manageable complexity through integrated problem formulation.
Solution Approach 2:
The patent develops a universal routing solution that works for both simple and complex network scenarios. The joint optimization framework serves multiple functions: it performs network slicing, determines service function chain instantiation, and computes traffic routing paths all within a single methodology, making it applicable to diverse network configurations without requiring separate specialized approaches.
2Adaptability or versatility
If service function chains are instantiated across multiple nodes arbitrarily, then adaptability is improved, but communication overhead increases
Solution Approach 1:
The patent applies local quality by optimizing the distribution of service functions across nodes based on local network conditions and traffic patterns. The joint optimization framework determines precisely which nodes should host which service functions and what traffic paths should be used, creating a tailored configuration that adapts to specific network requirements while minimizing unnecessary communication overhead through localized, purposeful service function placement.
Data Source
AI summary
A computing system and a method are provided for determining a network traffic routing path through a service function chain (SFC). A joint network slicing and traffic engineering problem is provided that may be solved to identify network slicing configuration and traffic engineering parameters to provide a set of function nodes, the SFC, and the network traffic routing path from the source node to the destination node. The joint network slicing and traffic engineering problem P may be solved by minimizing a resource objective associated with the joint network slicing and traffic engineering problem, in accordance with a set of one or more constraints. Instructions may be transmitted to a network orchestrator to create the service function chain in a network slice on the set of network nodes in accordance with the identified network slicing configuration and traffic engineering parameters, to provide the network traffic routing path.