A network slicing orchestration method for programmable data plane networks
By optimizing the mapping and routing path selection of VNFs in programmable data plane networks, combined with depth-first search and chain super-generation algorithms, the problems of limited resource allocation flexibility and efficiency in existing technologies are solved, and more efficient network slice resource management is achieved.
Patent Information
- Application Number
- CN202510405408.5
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2025-04-02
- Publication Date
- 2025-09-19
- Estimated Expiration
- 2045-04-02
AI Technical Summary
Existing network slicing orchestration methods based on programmable data planes find it difficult to fully utilize resources in a multi-tenant shared network slicing environment, resulting in limited flexibility and efficiency in resource allocation.
By rationally deploying service function chains (SFCs) in the programmable data plane network, the configured network cost function is used to optimize the mapping and routing path selection of VNFs. Combined with the depth-first search algorithm and the chain super generation algorithm (CHG algorithm), the path combination is dynamically adjusted to achieve optimal resource allocation.
It significantly improves the flexibility and efficiency of network slicing deployment and resource allocation, and achieves coordinated optimization of resource allocation, path selection and service quality.