Method for forming physical topology based on broadband carrier network topology
A technology of network topology and broadband carrier, applied in data exchange network, AC network circuit, digital transmission system, etc., can solve the problems of physical topology identification error, warranty, maintenance obstacle, and inability to determine the physical relationship topology of electricity meters in the station area. , to achieve the effect of physical topology
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
example 1
[0028] Such as figure 1 As shown, the method for forming a physical topology based on the broadband carrier network topology includes the following steps:
[0029] 1) CTU is installed in each branch box and user meter box, and the CTU is equipped with a carrier module for carrier signal and routing calculation and analysis;
[0030] 2) After receiving the command from the master station, the distribution terminal starts the topology identification command through the carrier broadcast;
[0031] 3) After receiving the command, the carrier module at the end or in the middle of the line forms a random time of less than 2 minutes according to its own address and Clock, and actively sends a topology identification response with its own address after this random delay;
[0032] 4) After 2 hours, the terminal of the distribution transformer collects the address library of the carrier module, which should contain the carrier module of its own station area or the adjacent station area...
example 2
[0043] Different from the above examples, the topology exploration is carried out in a depth-first search traversal method, and the depth-first search traversal method includes the following steps:
[0044] B1) with a given vertex As the starting point, visit the vertex;
[0045] B2) Pick a vertex with Adjacent and unvisited vertices ,use As a new starting point, repeat the above process;
[0046] B3) When reaching a vertex whose adjacent vertices have been visited , it returns to the recently visited , continue to visit For adjacent points that have not been visited, repeat the above search process;
[0047] B4) The traversal is complete until starting from any visited vertex and no unvisited vertex can be found.
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More