Network Slice Path Calculation Using Algorithm-Constrained Topologies
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing network slicing technologies struggle to effectively implement logically isolated network partitions to address traffic congestion and resource sharing among different services.
Innovation Solution
A path calculation method and apparatus that utilizes a flexible algorithm with algorithm constraints to divide network devices into multiple topologies, enabling each topology to support specific service requirements by configuring sub-interfaces with distinct algorithm constraints for different network slices.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If network devices are divided into multiple topologies based on algorithm constraints to support different network slices, then service adaptability and resource utilization are improved, but device complexity and configuration overhead increase
Solution Approach 1:
The patent segments network devices into multiple topologies based on different algorithm constraints (e.g., strict shortest path, flexible shortest path, equal cost multi-path). Each topology is assigned to specific network slices with matching service requirements. This segmentation allows the network to support diverse services (voice, video, data) with different QoS demands while maintaining clear organizational boundaries that manage complexity.
Solution Approach 2:
A single network device can belong to multiple topologies simultaneously, enabling it to serve multiple network slices with different service requirements. For example, a router can participate in both a strict shortest path topology for voice services and a flexible shortest path topology for video services, making the device multi-functional without requiring separate physical hardware for each service type.
2Manufacturing precision
If sub-interfaces are configured with distinct algorithm constraints for different network slices, then traffic management precision and QoS performance are improved, but configuration complexity and operational difficulty increase
Solution Approach 1:
Different sub-interfaces of the same network device are configured with different algorithm constraints tailored to specific network slice requirements. For instance, sub-interface GE1/0/1.1 uses strict shortest path for voice traffic requiring consistent routing, while sub-interface GE1/0/1.2 uses flexible shortest path for video traffic allowing dynamic path selection. This local differentiation achieves precise traffic management without requiring all interfaces to be configured identically.
Solution Approach 2:
The patent changes the algorithm constraint parameter (strict shortest path vs. flexible shortest path vs. equal cost multi-path) at the sub-interface level to match different service requirements. This parameter variation enables precise control over path selection behavior for each network slice while using a unified configuration framework that reduces operational complexity compared to entirely separate configuration systems.
3Reliability
If network topology division is performed based on algorithm constraints, then resource isolation and service independence are improved, but computational overhead and path calculation time increase
Solution Approach 1:
The network controller pre-calculates and establishes multiple topologies based on different algorithm constraints before actual traffic flows arrive. These topologies are prepared in advance and stored for quick retrieval when path calculation requests occur. This preliminary action eliminates the need to perform complex topology division and path calculation in real-time, significantly reducing path calculation time while maintaining service independence through pre-defined logical isolation.
Data Source
Figure 1
Figure 2
Figure 3~4
AI summary
Embodiments of this application disclose a path calculation method, apparatus, and device, to implement network slicing. The path calculation method includes: obtaining an algorithm constraint supported by each of a plurality of network devices, where the algorithm constraint is a constraint of a forwarding path algorithm, and the forwarding path algorithm is used to calculate, for the network device, a forwarding path that meets the algorithm constraint; performing network topology division on the plurality of network devices, where network devices in a same network topology support a same algorithm constraint; and calculating a forwarding path between network devices in each network topology based on the algorithm constraint, of the forwarding path algorithm, corresponding to the network topology.