Method for automatically configuring synchronous network clock tracking path
A technology for synchronizing networks and tracking paths, applied in the field of network operation and maintenance management of communication systems, it can solve problems such as low efficiency and consume a lot of manpower and energy, and achieve the effects of improving efficiency, reducing labor costs and energy, and avoiding abnormal timing loops.
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
specific Embodiment 1
[0064] Such as figure 1 Shown, the main steps that concrete embodiment 1 technical solution realizes comprises:
[0065] Step S1: According to the network element equipment injected into the node in the synchronous network and the topology relationship of the synchronous network, automatically select the connecting fiber paths between the neighbors of each network element device, and use the minimum heap algorithm to draw all the connecting fiber paths as directed adjacency list of .
[0066] Step S2: Using the directed adjacency table obtained in step S1, and based on the principle of the shortest path hops from the injection node, calculate and obtain the active tracking paths of all network element devices in the synchronization network.
[0067] Step S3: According to each main tracking path obtained in step S2, calculate the backup tracking path of the synchronous network, and track the reachable network element equipment in the synchronous network to the network element ...
specific Embodiment 2
[0079] Such as figure 2 As shown, the method for implementing step S2 in this specific embodiment 2 includes the following steps:
[0080] S21. Traverse the injection nodes;
[0081] S22. Establish a unidirectional connection fiber path PATH according to the clock injection direction of the injection node, and inject it into the directed adjacency table;
[0082] S23. Using the Dijkest minimum heap algorithm, find the path tree with the shortest hops from each network element device to the injection node:
[0083] S24. Record the fiber path PATH connected to the last node of each path tree, and use it as the shortest hop number of the tracking path of the network element device under the current injection node;
[0084] S25. Find the tracking path of the network element device in the temporary cache of the main tracking path of the network element device;
[0085] S26. Compare the number of hops of each tracking path among the injection nodes, and use the tracking path wit...
specific Embodiment 3
[0094] Such as image 3 As shown, the method for implementing step S3 in embodiment 3 includes the following steps:
[0095] S31. Traverse the injection nodes;
[0096] S32. Starting from the injection node, establish a unidirectional connection fiber path PATH according to the clock injection direction of the injection node, and inject it into the directed adjacency table;
[0097] S33. Traversing the network element devices with the active tracking path;
[0098] S34. Delete the last hop of the active tracking path of the network element device in the directed adjacency table;
[0099] S35. Calculate and obtain the shortest path from the network element device to the injection node by using the Dijkest algorithm;
[0100] S36. Step S33 is repeatedly executed until the shortest paths of all network element devices with active paths under the current injection node are obtained;
[0101] S37. Respectively output the shortest hop paths of all network element devices in the ...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More