A computer-implemented routing path analysis method for determining a routing path from a first node to a target node, comprising: determining a set of key nodes (PE3, PE4, PE7) based on a label stack of segment routing of a data packet, wherein the label stack comprises a predetermined label stack of a working path and a predetermined label stack of a protection path, and the set of key nodes comprises a diversion node at which the protection path and the working path diverge, a next-hop working path node of the diversion node, and a next-hop protection path node of the diversion node; for each key node: determining neighboring nodes of the key node; querying for traffic information of the key node and traffic information of the neighboring nodes of the key node; selecting, from the set of key nodes and the neighboring nodes of the set of key nodes, based on the traffic information, nodes through which the data packet passes; and determining the routing path based on the selected nodes through which the data packet passes, wherein the method further comprises: for each key node, obtaining a node label of the key node and node labels of the neighboring nodes of the key node; and wherein the querying for traffic information of the key node and traffic information of the neighboring nodes of the key node comprises: querying for the traffic information of the key node and the traffic information of the neighboring nodes of the key node by using the node labels, wherein the querying for the traffic information of the key node and the traffic information of the neighboring nodes is based on information about upstream nodes or downstream nodes of the key node and information about priorities of the upstream nodes or the downstream nodes that are included in the node labels. determining a set of key nodes (PE3, PE4, PE7) based on a label stack of segment routing of a data packet, wherein the label stack comprises a predetermined label stack of a working path and a predetermined label stack of a protection path, and the set of key nodes comprises a diversion node at which the protection path and the working path diverge, a next-hop working path node of the diversion node, and a next-hop protection path node of the diversion node; for each key node: determining neighboring nodes of the key node; querying for traffic information of the key node and traffic information of the neighboring nodes of the key node; determining neighboring nodes of the key node; querying for traffic information of the key node and traffic information of the neighboring nodes of the key node; selecting, from the set of key nodes and the neighboring nodes of the set of key nodes, based on the traffic information, nodes through which the data packet passes; and determining the routing path based on the selected nodes through which the data packet passes, wherein the method further comprises: for each key node, obtaining a node label of the key node and node labels of the neighboring nodes of the key node; and wherein the querying for traffic information of the key node and traffic information of the neighboring nodes of the key node comprises: querying for the traffic information of the key node and the traffic information of the neighboring nodes of the key node by using the node labels, wherein the querying for the traffic information of the key node and the traffic information of the neighboring nodes is based on information about upstream nodes or downstream nodes of the key node and information about priorities of the upstream nodes or the downstream nodes that are included in the node labels. for each key node, obtaining a node label of the key node and node labels of the neighboring nodes of the key node; and wherein the querying for traffic information of the key node and traffic information of the neighboring nodes of the key node comprises: querying for the traffic information of the key node and the traffic information of the neighboring nodes of the key node by using the node labels, wherein the querying for the traffic information of the key node and the traffic information of the neighboring nodes is based on information about upstream nodes or downstream nodes of the key node and information about priorities of the upstream nodes or the downstream nodes that are included in the node labels. querying for the traffic information of the key node and the traffic information of the neighboring nodes of the key node by using the node labels, wherein the querying for the traffic information of the key node and the traffic information of the neighboring nodes is based on information about upstream nodes or downstream nodes of the key node and information about priorities of the upstream nodes or the downstream nodes that are included in the node labels.