CN102123057B - Synchronous network route detection, optimization and network routing method and synchronous network system - Google Patents

Abstract

Disclosed are a synchronous network routing detection, optimization, network routing method and a synchronous network system. The optimization method includes: obtaining the node to be optimized, and adding the node to be optimized into the first queue; detecting the neighbor nodes of the node to be optimized and judging whether a protection link can be introduced, and when the protection link can be introduced, the neighbor The node joins the second queue; traverses the neighbor nodes in the second queue, introduces the standby link to the node to be optimized for tentative detection, until the master and backup routing requirements are met, and deletes the node to be optimized from the first queue ; and repeat processing until the first queue is empty.

Description

Synchronous network routing detection, optimization and network routing method and synchronous network system

technical field

The invention relates to a synchronous network, in particular to a detection and optimization method for primary and backup routes in the synchronous network.

Background technique

A synchronization net is a network in which all clocks have the same long-term accuracy under normal operating conditions. A synchronization network is a network for providing timing reference signals. Generally speaking, a synchronization network is composed of synchronization network nodes connected by synchronization links. Specifically, the synchronization methods mainly include a master-slave synchronization method and a mutual synchronization method. The present invention mainly uses the master-slave synchronization method, that is, all clocks track a certain reference clock, and the synchronization is obtained by passing the timing reference from one clock to the next clock.

The synchronous network in the present invention is composed of service nodes, clock nodes, working (primary) links between nodes, and protection (standby) links between nodes. The clock nodes are further divided into first-level clock nodes, second-level clock nodes, and third-level clock nodes. The first-level clock node is set at the intersection of the inter-provincial and intra-provincial transport layers, the second-level clock node is set at the intersection of the provincial and local transport layers, and the third-level clock node is set at the end office of the local network.

For other basic technical content of the synchronization network, those skilled in the art can also refer to "The Planning Method and Organizational Principles of the Digital Synchronization Network", issued by the Ministry of Information Industry of the People's Republic of China on July 13, 1999, "Telecommunication Network Operation Supervision and Management Measures ", Ministry of Industry and Information Technology of the People's Republic of China, released on April 24, 2009, and "Code for Design of Power System Digital Synchronization Network Engineering", National Development and Reform Commission of the People's Republic of China, released on July 20, 2007. The entire contents of the aforementioned publications are hereby incorporated by reference.

A synchronous network requires strict synchronization in principle, and the clock frequency of each node in the network is limited within a predetermined tolerance range to avoid transmission performance degradation and bit errors caused by inaccuracy. However, in the actual synchronous network, the timing performance of the network may change at any time due to reasons such as optical cable failure, equipment failure, and network changes, so its routing may also change at any time.

In the synchronous network planning of the present invention, the active link constitutes the active route, and the standby link and part of the active links form the standby route. The present invention only selects the corresponding standby link for the part where the failure occurs, but the original active link is still used for other parts that do not fail. Generally speaking, a primary route and one or more backup routes are set during network planning to ensure that the network can still run smoothly when a network failure occurs, thereby improving the security and stability of the entire network. However, unreasonable synchronization network planning in the prior art cannot guarantee the smooth operation of the synchronization network all the time.

Specifically, the irrationality of network planning is mainly reflected in three aspects: the main route does not exist in network planning, the backup route does not exist in network planning, and the main and backup routes do not physically isolate nodes in network planning. Here, the main and standby routes are not physically isolated from nodes, which means that the main and standby routes are not completely isolated, and ultimately point to the same clock node. That is to say, the main and standby routes point to the same clock source in the end. There are many kinds of clock sources in the synchronization network, such as PRC (reference clock of the whole network) clock, LPR (regional reference clock), DNU (cannot be used for synchronization) clock and so on. Once the master and backup routes finally point to the PRC clock, it is considered to be a node that is not physically isolated from the master and backup routes.

When any of the above three unreasonable situations of network planning occurs, it is necessary to optimize the main and backup routes to ensure the smooth operation of the network.

At present, the main steps of the synchronization network master and backup route optimization method include:

1. Establish the entire synchronization network, including service nodes, clock nodes, and the main link and backup link connecting each node. The main link constitutes the main route, and the backup link constitutes the backup route.

2. Do not detect the established synchronization network, that is, do not determine whether there are active links or backup links between any two nodes in the synchronization network, and do not determine whether the main and backup routes do not physically isolate the nodes.

3. If the main route fails, the backup route will be activated as the current main route, and a new backup route will be established.

4. If the current active route fails again, the new standby route is activated as the current active route, and another new standby route is established.

5. By analogy, the optimization of the main and backup routes of the entire synchronization network is completed.

Correspondingly, the security of the network construction scheme of the above-mentioned prior art is relatively low. The active and standby routes do not physically isolate the nodes. This means that the important prerequisite for the smooth implementation of the network solution is to establish a network in strict accordance with the mode of one master and one backup, and neither is dispensable. Obviously, the backup route is composed of protection links. If there is only an active link between two nodes in a synchronous network without a backup link, then when the active link between the two nodes fails At that time, it will be impossible to find an available backup route for replacement, which can only lead to the paralysis of the entire network in the end.

Secondly, the function of the above-mentioned network construction scheme is not perfect. For the case where the main route and the backup route of the same destination node are all connected to the same clock node, that is, when the third kind of unreasonable network planning mentioned above occurs , the existing technology cannot identify such an unreasonable situation. In this case, the synchronous network still cannot operate, and the purpose of optimization has not been achieved.

In addition, the resource utilization rate of the above-mentioned network construction scheme is low. In the above network construction scheme, when the main route fails, a backup route is selected as a substitute, and this backup route is composed of all protection links. When a network failure occurs, the entire active route will be discarded and a new backup route will be selected. This directly causes a waste of resources and cannot effectively utilize existing network resources.

Therefore, there is an urgent need to provide a master-standby route detection and optimization method, so that when any of the above-mentioned three kinds of network planning irrationality occurs, the master-standby route can be automatically and effectively implemented for the synchronous network optimization.

Contents of the invention

The technical problem to be solved by the present invention is to provide a detection and optimization method for the main and backup routes in the synchronous network, so as to effectively detect and optimize the absence of the main route and the non-existence of the backup route in the synchronous network, and Three unreasonable network plans, such as the main and backup routes not physically separating nodes.

According to the first aspect of the present invention, there is provided a detection method for a primary and backup route implemented in a synchronous network, the synchronous network includes a service node, a clock node, a primary link, and a backup link, characterized in that, The detection method comprises the following steps: step A. searching for all nodes; step B. selecting one of the nodes in turn; step C. detecting whether the selected node satisfies the requirement that the main route does not exist, the backup route does not exist, and the main backup route does not exist. Any of the isolation, when any of the above conditions are not met, return to step B; and step D. When any of the above conditions are met, then determine that the node is faulty, and record the faulty node, and then return to Step B and repeat the processing of steps C and D until the last node found.

Step C of the detection method further includes: step C-1. detecting whether the selected clock node satisfies the fact that the main route does not exist, and when the condition is not met, proceed to step C-2; step C-2. detecting the selected Whether the selected clock node satisfies that the standby route does not exist, when the condition is not met, proceed to step C-3; and step C-3. detect whether the selected clock node meets the main standby route without isolation, when the condition is not met , then determine that the clock node is not faulty, and return to step B.

In step C-1 of the detection method, a recursive method is used to search for the primary route of the node.

In step C-2 of the detection method, the backup route of the node is searched through an improved depth traversal method.

In step C-3 of the detection method, if the main and backup routes finally point to the reference clock of the whole network, it is determined that the main and backup routes are not physically isolated.

According to the second aspect of the present invention, there is provided a method for optimizing primary and backup routes implemented in a synchronous network, the synchronous network includes service nodes, clock nodes, active links, and backup links, characterized in that, The optimization method includes the following steps: Step E. Acquire the node to be optimized, and add the clock node to be optimized into the first queue; Step F. Detect the neighbor nodes of the node to be optimized and determine whether protection can be introduced link, when the protection link can be introduced, then add the neighbor node to the second queue; step G. traverse the neighbor nodes in the second queue, and test the clock node to be optimized by introducing the protection link in turn performance check until the master/standby routing requirements are met, and delete the clock node to be optimized from the first queue; and Step H. return to step G for processing until the first queue is empty.

Further include between step F and step G of the optimization method: Step I. sort each node in the first queue according to the number of adjacent nodes in the second queue of each node in the first queue ; and step J. prioritizing the first-ordered nodes in the first queue.

The nodes to be optimized include nodes that have any one of the main route does not exist, the backup route does not exist, and the main and backup routes are not isolated.

The judging whether the protection link can be introduced in the step F of the optimization method further includes: judging whether the neighboring nodes meet the requirements of the active and standby routes.

When it is judged that the neighbor node does not meet the master and backup routing requirements, further perform: step F-1. judge whether the master clocks of the neighbor node and the node to be optimized are the same, wherein, when the judgment result in step F-1 is true , the neighbor node is ignored and the next neighbor node in the second queue is detected; when the judgment result in step F-1 is false, the neighbor node is added to the second queue.

The tentative detection in the step G of the optimization method includes judging whether the introduction of the protection link from the neighbor node to the node to be optimized will result in no physical isolation between the new active route and the backup route.

According to a third aspect of the present invention, there is provided a network routing method implemented in a synchronous network, the synchronous network includes service nodes, clock nodes, active links, and backup links, characterized in that the network The routing method includes: firstly executing each step of the above detection method, and then executing each step of the above optimization method.

According to the fourth aspect of the present invention, a synchronous network system is provided, the synchronous network includes a service node, a clock node, a main link, and a backup link, and the route of the synchronous network system is optimized by using the above-mentioned network routing method operate. Wherein, the synchronization network may be a power system digital synchronization network or a telecommunication system synchronization network.

Compared with the prior art in this field, the present invention has the following advantages:

First, complete and comprehensive. Compared with the prior art, the present invention more comprehensively solves various main and standby route planning errors that may occur in the synchronous network. The optimization of nodes that do not exist in the main route, the backup route does not exist, and the main and backup routes are not physically isolated can be completed. The flexible optimization scheme can optimize (correct) most of the routing planning errors, making full use of network resources.

Second, stability and security. Because the present invention additionally completes the optimization of the absence of the main route, the absence of the backup route, and the physical separation of the nodes of the main and backup routes on the basis of the prior art, the stability and security of the synchronous network are greatly improved. At the same time, by using the optimization results, the present invention can also automatically detect again to ensure the correctness of network routing optimization.

Third, resource utilization is high. In the synchronous network planning of the present invention, the active link constitutes the active route, and the standby link and part of the active links form the standby route. The present invention only selects the corresponding standby link for the part where the failure occurs, but the original active link is still used for other parts that do not fail. In this way, the resource utilization rate of the network is improved through the present invention.

Other objects and further features of the present invention can be clearly understood when reading the following detailed description in conjunction with the attached drawings.

Description of drawings

FIG. 1 is a schematic diagram generally showing a network configuration about a synchronous network;

Fig. 2 is a flow chart showing the detection method of the main standby route according to an embodiment of the present invention;

Fig. 3 is a flow chart showing the optimization method of the main standby route according to an embodiment of the present invention; and

4 to 6 are diagrams schematically showing several situations of heuristic optimization, respectively.

Detailed ways

In order to make the object, technical solution and advantages of the present invention clearer, the present invention will be described in detail below with reference to the accompanying drawings and specific embodiments.

Network Configuration for Synchronous Networks

FIG. 1 schematically shows a schematic diagram of a network configuration about a synchronization network 100 as a whole. As those skilled in the art can understand, the synchronization network can be widely used in various occasions requiring clock synchronization, such as wired or wireless network communication, power system, packet network and so on.

As shown in FIG. 1 , the synchronization network 100 includes a primary clock node 10 , a secondary clock node 20 , and a tertiary clock node 30 . The numbers of the primary, secondary and tertiary clock nodes are not limited to those shown in FIG. 1 . In Figure 1, the solid line represents the primary timing reference, while the dashed line represents the backup timing reference.

Here, the synchronization network 100 may be a wired network or a wireless network, and the present invention is not limited thereto.

Usually, the first-level clock node 10 is set at the junction of inter-provincial and intra-provincial transport layers, the second-level clock node 20 is set at the intersection of provincial and local transport layers, and the third-level clock node 30 is set at the local network end office.

Clock nodes at all levels in the synchronization network 100 are linked to each other through various links, and the various links respectively constitute a primary route and a standby route.

Next, the method for detecting and optimizing the primary and backup routes of the synchronous network 100 according to the present invention will be described in detail with reference to the accompanying drawings.

Detection method of primary and backup routes

Fig. 2 is a flow chart showing a method for detecting a primary and backup route according to an embodiment of the present invention.

Referring to FIG. 2 , the specific flow of the detection method is described in detail.

In step S201, the service nodes of the synchronization network 100 and all clock nodes in the synchronization network 100 are searched, so as to determine whether these nodes meet the requirements of the main and backup routes, that is, whether they need to be optimized accordingly in the optimization method described later. Here, if a node satisfies the requirements of the master and backup routes, it means that the node has the master route and the backup route, and the master and backup routes are physically isolated nodes, that is, the master and backup routes point to different clock types.

Here, there are many kinds of clock sources in the synchronous network, such as PRC (network-wide reference clock), LPR (regional reference clock), DNU (not used for synchronization), and so on. For example, as long as the master and backup routes point to the PRC clock in the end, it means that the nodes are not physically isolated on the master and backup routes.

In an optional embodiment, in step S201, all secondary and tertiary clock nodes may be searched, but the present invention is not limited thereto.

Next, in step S202, the primary route of the node is searched first. If the primary route does not exist ("No" in step S203), it is determined that the node does not meet the detection of the primary and backup routes (step S207).

On the other hand, if the master route exists (YES in step S203), the processing flow advances to step S204.

Here, in step S202, preferably, a recursive method is used to find the primary route of the node.

Next, in step S204, the standby route of the node is searched. If the backup route does not exist ("No" in step S205), it is determined that the node does not meet the main backup route detection (step S207).

On the other hand, if a backup route exists (YES in step S205), the processing flow advances to step S206.

Here, in step S204, preferably an improved depth traversal method is used to search for the backup route of the node.

Next, in step S206, that is, when both the primary route and the backup route of the node exist, it is judged whether the primary route and the backup route are completely isolated physically, that is, there is no intersection between the primary route and the backup route.

If there is no complete physical isolation between the active route and the standby route (No in step S206), it is determined that the node does not satisfy the detection of the active and standby routes (step S207).

If the active route and the standby route are completely isolated physically (Yes in step S206), it is determined that the node does not need to perform subsequent optimization of the active and standby routes, and the detection process for the node ends.

Here, it is worth noting that the detection method shown in FIG. 2 is only a preferred embodiment, and the sequence of steps S203 , S205 and S206 can be set accordingly according to needs. For example, in an optional embodiment, the standby route may be searched first, and then the main route may be searched, and finally whether the main and standby routes are physically isolated is determined.

It can be seen that in the present invention, it is proposed that the premise of optimizing a synchronous network is to perform the above-mentioned primary and backup route detection on the synchronous network. Only when a failure (error) in routing of the synchronization network is detected, further network routing optimization processing needs to be performed.

Therefore, through the route detection method as described above, it is possible to effectively detect failure situations that may occur in the synchronous network, such as the absence of the main route, the absence of the backup route, and the fact that the main and backup routes are not completely isolated physically, and provide information for subsequent Make preparations for routing optimization.

Next, with reference to FIG. 3 , the method for optimizing the primary and backup routes in the synchronization network 100 will be described in detail.

Optimization method of main and backup routes

After completing the detection of the primary and backup routes as described above, and finding the unreasonable part of the primary and backup routes in the synchronous network, optimization processing will be performed on these nodes to be optimized to ensure the smooth operation of the synchronous network.

Fig. 3 is a flow chart showing a method for optimizing a primary and backup route according to an embodiment of the present invention.

Referring to FIG. 3 , the specific flow of the optimization method is described in detail.

In step S301, nodes that do not meet the requirements of the primary and backup routes are obtained from the detection results of the detection method described above, and the detected nodes are added to the queue to be optimized.

Here, the queue refers to a first-in-first-out (FIFO) data structure for storing nodes, but the present invention is not limited thereto, and other suitable data structures can also be appropriately selected as required. As long as these data structures can satisfy the temporary storage of nodes to be optimized, they should all be included in the protection scope of the present invention.

Next, in step S302, the neighbor nodes of the first node in the queue to be optimized are first traversed.

Next, in step S303, it is judged whether the neighbor nodes obtained through the traversal meet the requirements of the primary and backup routes. When the requirements of the primary and backup routes are met ("Yes" in step S303), in step S304, the neighbor node is added to the available queue.

Preferably, when the master and backup route requirements are not met ("No" in step S303), it is further judged whether the master clocks of the neighbor node and the node to be optimized are the same (step S303a).

Wherein, when the master clocks of the neighbor node and the node to be optimized are different ("No" in step S303a), proceed to step S304. Otherwise, return to step S302.

Here, preferably, the nodes to be optimized can be sorted according to the number of adjacent nodes that can be introduced into the protection link of each node (step S304a), and the nodes with the most available options are prioritized (step S304b).

Next, in step S305, it is judged whether the queue to be optimized is empty, that is, whether there are still unoptimized nodes.

If the queue to be optimized is empty, proceed to step S309 and end the process. If the queue to be optimized is not empty, proceed to step S306.

Next, in step S306, the neighbor nodes in the available queue are traversed, and standby links are introduced sequentially for tentative detection. The tentative detection will be described in detail later.

Next, in step S307, it is judged (obtained through tentative detection) whether the new main-standby route meets the requirements of the main-standby route.

On the one hand, when the new primary and backup routes meet the requirements ("yes" in step S307), then in step S308, delete the node that has met the requirements of the primary and backup routes from the queue to be optimized, and return to step S305, so that the next A node to be optimized performs processing.

On the other hand, when the new primary and backup routes do not meet the requirements ("No" in step S307), then return to step S306, and continue to perform tentative detection.

Heuristic optimization method

Consider introducing protection links from the adjacent nodes of the node to be optimized to the node for tentative optimization. Here, the heuristic optimization refers to whether the new active route and the standby route will become physically non-isolated nodes if a protection link is introduced from a neighboring node to the node. That is to say, the clock pointed to by the neighbor node may be of the same type as the clock pointed to by the node, so that the node becomes physically non-isolated, and a protection link cannot be introduced from the neighbor node to the node.

4 to 6 are schematic diagrams showing several situations of heuristic optimization, respectively. Wherein, in FIG. 6 , for convenience of display, the active link between nodes is not shown, but only the standby link is shown. In addition, in FIGS. 4 to 6 , the solid line indicates the active link, and the dotted line indicates the standby link.

As shown in FIG. 4 , an error (failure) situation in which the nodes are not physically isolated occurs, because when the first-level clock node PRC fails, the backup route still points to the PRC. Here, although two PRC nodes are used in Figure 4, they both refer to the same clock device.

Furthermore, as shown in FIG. 5 , it is a case where the nodes are physically isolated. If the PRC clock fails, the LPR clock can be imported through the backup route.

The so-called tentative optimization is to tentatively introduce a backup link from the neighbor node to the node to be optimized when optimizing the "node to be optimized". If the neighbor nodes meet the requirements of the primary and backup routes, that is, the primary and backup routes pointing to the neighbor nodes are physically isolated from each other, as shown in Figure 6. That is, when the first-level clock fails, the clock with higher priority (here the second-level clock LPR) can be selected from two different clocks by the neighbor node and delivered to the node to be optimized. If the situation is shown in Figure 5, then this neighbor node meets the requirements of the main and backup routes and will be added to the available queue.

In the tentative optimization, if the neighbor node does not meet the requirements of the primary and backup routes, then it is judged whether the clock of the neighbor node is the same as the clock of the node to be optimized. If they are the same, it is equivalent to the situation shown in Figure 4. The neighbor node is unavailable; if not the same, then it is equivalent to the situation shown in Figure 5, and the neighbor node can be added to the available queue at this time.

network routing method

According to the network routing method of the synchronous network of the present invention, the detection method and the optimization method of the above-mentioned primary and backup routes can be appropriately combined, thereby automatically and effectively performing the routing optimization of the synchronous network, and when there is a routing failure, it can be effectively The new routing optimization can be obtained by updating the main and backup routes.

synchronous network system

In the embodiment of the present invention, the above network routing method can be widely applied to route optimization operations for various synchronous network systems. These synchronization networks usually include service nodes, clock nodes, active links, and standby links.

Here, the synchronization network is, for example, a power system digital synchronization network or a telecommunication system synchronization network. However, the present invention is not limited thereto.

Finally, it should be noted that the above embodiments are only used to illustrate the technical solution of the present invention and not to limit it. Those of ordinary skill in the art should understand that the technical solution of the present invention can be modified or equivalently replaced without departing from the technical solution of the present invention. The spiritual scope of the invention should be included in the scope of the claims of the present invention.

Claims (13)

1. a detection method for the standby usage route of implementing in synchronizing network, described synchronizing network comprises service node, clock node, active link and reserve link, it is characterized in that, described detection method comprises the following steps:

Steps A. search whole service nodes and clock node;

Step B. selects one of them node successively;

Whether the node that step C. detects this selection meets that primary route does not exist, alternate routing does not exist and physically any one in isolation of standby usage route, in the time not meeting in above-mentioned condition any one, returns to step B; And

Step D. in the time meeting in above-mentioned condition any one, determines that this node breaks down, and records the node that this breaks down, then returns to the processing of step B repeating step C and step D until last node finding;

Standby usage route physically isolation refer to that standby usage route finally all points to same clock source.

2. detection method according to claim 1, is characterized in that, described step C further comprises:

Step C-1. detects selected node and whether meets primary route and do not exist, and in the time not meeting this condition, advances to step C-2;

Step C-2. detects selected node and whether meets alternate routing and do not exist, and in the time not meeting this condition, advances to step C-3; And

Step C-3. detects selected node and whether meets the physically not isolation of standby usage route, in the time not meeting this condition, determines that this node does not break down, and returns to step B.

3. detection method according to claim 2, is characterized in that, in described step C-1, searches the primary route of this node by recurrence method.

4. detection method according to claim 2, is characterized in that, in described step C-2, and the alternate routing of searching this node by improved degree of depth traversal.

5. detection method according to claim 2, is characterized in that, in described step C-3, if standby usage route has finally all been pointed to the whole network reference clock, judges the physically not isolation of standby usage route.

6. an optimization method for the standby usage route of implementing in synchronizing network, described synchronizing network comprises service node, clock node, active link and reserve link, it is characterized in that, described optimization method comprises the following steps:

Step e. obtain node to be optimized, and described node to be optimized is added to the first queue;

Step F. can the neighbor node the judgement that detect described node to be optimized introduce reserve link, in the time can introducing reserve link, described neighbor node are added to the second queue;

Step G. travels through the neighbor node in described the second queue, and this node to be optimized is introduced to reserve link successively and carry out exploratory detection, until meet active and standby route request, and delete this node to be optimized from described the first queue; And

Step H. returns to that step G processes until described first team classifies sky as;

Described node to be optimized comprises and has that primary route does not exist, alternate routing does not exist and the physically node of any fault in isolation of standby usage route;

Standby usage route physically isolation refer to that standby usage route finally all points to same clock source;

Meet active and standby route request, refer to and possess primary route, possess alternate routing, and standby usage route is pointed to respectively different clock types.

7. optimization method according to claim 6, is characterized in that, between step F and step G, further comprises:

Step I. sorts to the each clock node in described the first queue according to the adjacent node number of each node in the second queue in described the first queue; With

Sequence node formerly in the first queue described in step J. priority treatment.

8. according to the optimization method described in claim 6 or 7, it is characterized in that, can the judgement in described step F be introduced reserve link and further comprise: judge whether neighbor node meets active and standby route request.

9. optimization method according to claim 8, is characterized in that, in the time judging that neighbor node does not meet active and standby route request, further carries out:

Step F-1. judge that whether the master clock of neighbor node and described node to be optimized is identical,

Wherein, when the judged result in step F-1 is true time, ignore this neighbor node and detect the next neighbor node in the second queue; When the judged result in step F-1 is fictitious time, this neighbor node is added to the second queue.

10. optimization method according to claim 6, it is characterized in that, the exploratory detection in described step G comprises that judgement is when whether can cause physically not isolation between new primary route and alternate routing in the time that node to be optimized is introduced reserve link from neighbor node.

11. 1 kinds of network route methods of implementing in synchronizing network, described synchronizing network comprises service node, clock node, active link and reserve link, it is characterized in that, described network route method comprises:

Carry out each step of detection method according to claim 1; With

Carry out each step of optimization method according to claim 6.

12. 1 kinds of synchronous network systems, described synchronizing network comprises service node, clock node, active link and reserve link, it is characterized in that, network route method according to claim 11 is optimized operation for the route of described synchronous network system.

13. synchronous network systems according to claim 12, is characterized in that, described synchronizing network is electric power digital synchronizing network or telecommunication system synchronizing network.