公开(公告)号：US20230010057A1

公开(公告)日：2023-01-12

申请号：US17784622

申请日：2020-11-20

Applicant: ZTE CORPORATION

Inventor： Haibin LI ,  Xinping ZHANG ,  Huifeng GUO ,  Xin PENG

IPC: H04L41/02 ,  H04L41/14 ,  H04L41/50 ,  G06F16/901

Abstract: Provided are a method for service status analysis, a server, and a storage medium. The method includes: for each vertex of multiple vertices in a graph database: reading out attribute data of the vertex, where the graph database is generated in advance according to a service description table, the vertex represents a service, and the attribute data of the vertex includes at least one service attribute of the service represented by the vertex; and according to the attribute data of the vertex and attribute data of each of multiple related vertices, determining a service status level of the service represented by the vertex, where each of the multiple related vertices has a propagation relationship with the vertex; and according to the service status level of each of the services represented by the vertices, analyzing a service propagation network.

公开(公告)号：US20220278920A1

公开(公告)日：2022-09-01

申请号：US17638055

申请日：2020-07-29

Applicant: ZTE Corporation

Inventor： Jun YANG ,  Xin PENG

IPC: H04L45/12

Abstract: A method for calculating a shortest path, a routing acquisition device, a server and a non-transitory computer-readable storage medium are disclosed. The method may include: acquiring resource information for a network according to a received routing request, where the routing request includes a start node, an end node, a service constraint, and an obligatory constraint; calculating service constraint weights for topological elements in the network according to the service constraint, and calculating obligatory constraint weights for the topological elements according to the obligatory constraint and the resource information for the network; and calculating, according to the service constraint weights and the obligatory constraint weights for the topological elements, a shortest path from the start node to the end node that satisfies the obligatory constraint.