A time synchronization compensation method and device for a digital converter station distributed fusion terminal

Abstract

The application relates to the technical field of electric power communication, and discloses a digital converter station distributed fusion terminal time synchronization compensation method and device, which comprises the following steps: S1: according to the type of a service, priority of the service of a digital converter station is divided; S2: a preset routing and spectrum allocation algorithm is used to initialize a path and a time delay of the service after the priority is divided; S3: through adaptive setting of a to-be-forwarded waiting real-time delay in a pending node, differential compensation is carried out, time synchronization of a receiving end is realized, and a path and spectrum are reconstructed according to a minimized compensation routing spectrum; S4: whether there is a licensed spectrum slot is judged, if yes, step S5 is executed, and if not, step S2 is executed through re-routing; and S5: transmission delay of the service is recorded, and a blocking probability under a traffic load to which the service belongs is calculated. The method provided by the application guarantees time synchronization of a receiving end of a digital converter station, and has better performance in terms of transmission delay and blocking probability.

Description

Technical Field

[0001] This invention relates to the field of communication technology, specifically to a method and apparatus for time synchronization compensation of distributed converged terminals in digital converter stations. Background Technology

[0002] With the exponential growth of electricity users and the diversification of power grid functions, converter station equipment management requires digital transformation and intelligent upgrades. Along with the increase in the number of users, digital converter stations are gradually generating diverse service demands, requiring precise time synchronization and greater bandwidth. Passive Optical Network (PON), a purely dielectric optical network, can provide greater bandwidth and avoid electromagnetic interference from external devices and lightning strikes. It is suitable for services in power communication networks that provide high bandwidth and low latency.

[0003] Currently, PON-based digital converter station testing systems do not support synchronous acquisition and measurement functions at the service receiver. In traditional WDM-PON (point-to-point passive optical network) technology, the OLT (Optical Line Terminal) and ONU (Optical Network Unit) calculate the round-trip time (RTT) of signal propagation by transmitting GATE and REPORT frames, thereby achieving unique clock synchronization between the ONU and OLT. However, this clock synchronization is only the synchronization of the OLT's master clock. While applicable to this scenario, it cannot guarantee time synchronization at the receiver after service transmission. Summary of the Invention

[0004] In view of this, the present invention provides a method, apparatus, device and storage medium for time synchronization compensation of distributed fusion terminals in digital converter stations, so as to solve the problem of time asynchrony at the receiving end of the detection system of digital converter stations in the prior art.

[0005] In a first aspect, the present invention provides a method for time synchronization compensation of distributed converged terminals in a digital converter station, comprising:

[0006] S1: Prioritize the services of the digital converter station according to the type of service;

[0007] S2: Initialize the path and latency for services after priority division using preset routing and spectrum allocation algorithms;

[0008] S3: Differential compensation is performed by adaptively setting the waiting real-time delay for forwarding at the pending node to synchronize the receiver time and reconstruct the path and spectrum according to the route spectrum with minimal compensation;

[0009] S4: Determine if there is a licensed spectrum slot. If there is, proceed to step S5. If not, reroute and proceed to step S2.

[0010] S5: Record the transmission delay of the service and calculate the blocking probability under the traffic load of the service.

[0011] In one optional implementation, service types are categorized by establishing a model that distinguishes between time synchronization services and other services. The model for time synchronization services and other services is represented as follows:

[0012] TSS i (s i ,d i ,t i ,st i ,w i ,v i J i )

[0013] Among them, s i It is the source node of the business, d i It is the destination node, t i It is the transmission duration, st i It's the start time, w i This is the required number for the spectrum slot, v i It is the transmission rate of the service, if J i True indicates TSS i If it indicates a time synchronization service, otherwise it indicates other services that are not time synchronization services.

[0014] In one alternative implementation, the priority of time synchronization services is set to be higher than that of other services.

[0015] In one optional implementation, step S2 includes:

[0016] S21: Initialize network state and algorithm model parameters;

[0017] S22: When a new traffic load is input into the network topology, the preset shortest route algorithm is used to output the path and delay, and spectrum slots are allocated to the services in the traffic load.

[0018] S23: Repeat the iteration until all services in the traffic load are allocated spectrum slots;

[0019] S24: Calculate the round-trip transmission delay determined under this traffic load.

[0020] In one optional implementation, step S3 includes:

[0021] S31: Initialize the random iteration parameters;

[0022] S32: Perform differential compensation on the determined round-trip transmission delay and determine whether the compensation cost is minimized;

[0023] S33: If not, then update the iteration parameters and execute step S32; if yes, then execute S34.

[0024] S34: The iteration ends and the optimal delay spectrum round-trip path is obtained.

[0025] In one alternative implementation, the determined transmission delay Calculated using the following formula:

[0026]

[0027] Where, Path s,d This is the optical link path from node to node, where d and k represent the nodes along this path. s,d v is the length of the path. i θ is the transmission rate of the service, and θ is the node forwarding delay;

[0028] Update the total transmission delay using the differential delay compensation algorithm:

[0029]

[0030] Where j is the index of different receivers, i is the service index, and σ * To protect against latency, For the differential latency that needs compensation, the compensation mode is consistent with the maximum round-trip latency of the same distributed task group, with a small amount of additional protection latency. ζ represents the priority. syn indicates time synchronization services, else indicates other services;

[0031] The optimization objective of the differential delay compensation algorithm is to minimize all compensation times:

[0032]

[0033] Where Z represents all compensation times.

[0034] In one optional implementation, the routing and spectrum allocation calculation process must simultaneously satisfy spectrum allocation constraints and latency tolerance conditions, wherein the spectrum allocation constraints include:

[0035] Spectral consistency constraint means that each link on the path needs to be allocated the same spectrum resources;

[0036] Spectral continuity constraints ensure that neutron carriers must be connected to each other along a single path;

[0037] Spectrum conflict constraint is defined as the requirement that the spectrum allocations of different paths on the same optical fiber cannot overlap.

[0038] The latency constraint tolerance conditions include: the total transmission latency shall not exceed the queuing latency tolerance of each service.

[0039] This embodiment can predict power at multiple time points. Further fitting processing can yield a power prediction curve, which can more intuitively display the ultra-short-term power prediction data for a future period.

[0040] Secondly, the present invention provides a time synchronization compensation device for a distributed converged terminal of a digital converter station, the device comprising:

[0041] The input service allocation module is used to prioritize the services of the digital converter station according to the type of service.

[0042] The routing module is used to initialize paths and latency for services after priority allocation using preset routing and spectrum allocation algorithms;

[0043] The differential compensation module is used to perform differential compensation by adaptively setting the waiting real-time delay for forwarding at the pending node, so as to synchronize the receiving end time and reconstruct the path and spectrum according to the route spectrum with minimal compensation.

[0044] The spectrum slot determination module is used to determine whether there are licensed spectrum slots. If there are, it enters the performance indicator calculation module; otherwise, it reroutes to the routing module.

[0045] The performance metric calculation module is used to record the transmission delay of the service and calculate the blocking probability under the traffic load of the service.

[0046] In some alternative implementations, the routing module includes:

[0047] The first initialization unit is used to initialize the network topology state, record matrix, and network traffic load.

[0048] The spectrum slot allocation unit is used to allocate spectrum slots to services in a new traffic load by using a preset shortest route algorithm to output the path and latency when a new traffic load is input into the network topology.

[0049] An iterative unit is used to repeatedly iterate until all services in the traffic load are allocated spectrum slots;

[0050] The transmission delay calculation unit is used to calculate the round-trip transmission delay under the given traffic load.

[0051] In some optional implementations, the differential compensation module includes:

[0052] The second initialization unit is used to initialize the random iteration parameters;

[0053] The differential compensation unit is used to perform differential compensation on a given round-trip transmission delay and determine whether the compensation cost is minimized.

[0054] The iterative parameter update unit is used to update the iterative parameters and re-enter the differential compensation unit when the compensation cost is not minimized. If the compensation cost is minimized, the result is output.

[0055] The result output unit is used to obtain the optimal delay spectrum round-trip path at the end of the iteration.

[0056] Thirdly, the present invention provides a computer device, comprising: a memory and a processor, wherein the memory and the processor are communicatively connected to each other, the memory stores computer instructions, and the processor executes the computer instructions to perform a digital converter station distributed converged terminal time synchronization compensation method according to the first aspect or any corresponding embodiment described above.

[0057] Fourthly, the present invention provides a computer-readable storage medium storing computer instructions for causing a computer to execute a time synchronization compensation method for a distributed converged terminal of a digital converter station according to the first aspect or any corresponding embodiment described above.

[0058] The advantages of the technical solution provided by the embodiments of the present invention are as follows:

[0059] The distributed converged terminal time synchronization compensation method for digital converter stations provided in this invention first prioritizes the service types input to the digital converter station. Then, it initializes the paths and delays for the prioritized services using a preset routing and spectrum allocation algorithm. Differential compensation is then performed by adaptively setting the waiting real-time delay for forwarding at the pending nodes to synchronize the receiving end's time. The path and spectrum are reconstructed according to the route spectrum with minimal compensation. Further, it is determined whether there are licensed spectrum slots. If so, the transmission delay of the service is recorded, and the blocking probability under the traffic load of the service is calculated. If not, rerouting is performed until the above process is repeated. The method provided by this invention ensures time synchronization at the receiving end of the digital converter station and has better performance in terms of transmission delay and blocking probability. Attached Figure Description

[0060] To more clearly illustrate the specific embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the specific embodiments or the prior art will be briefly introduced below. Obviously, the drawings described below are some embodiments of the present invention. For those skilled in the art, other drawings can be obtained from these drawings without creative effort.

[0061] Figure 1 This is a schematic diagram of an application scenario according to an embodiment of the present invention;

[0062] Figure 2This is a flowchart illustrating the time synchronization compensation method for distributed converged terminals in digital converter stations according to an embodiment of the present invention.

[0063] Figure 3 This is a flowchart illustrating the routing and spectrum allocation algorithm according to an embodiment of the present invention;

[0064] Figure 4 This is a flowchart illustrating the differential compensation algorithm according to an embodiment of the present invention;

[0065] Figure 5 This is a structural block diagram of a time synchronization compensation device for a distributed fusion terminal in a digital converter station according to an embodiment of the present invention.

[0066] Figure 6 This is a schematic diagram of the hardware structure of a computer device according to an embodiment of the present invention. Detailed Implementation

[0067] To make the objectives, technical solutions, and advantages of the embodiments of the present invention clearer, the technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of the present invention, not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of the present invention.

[0068] The optical network of a digital converter station consists of EON and WDM-PON. Numerous services between multiple ONU converged terminals require accurate time synchronization. For example, distributed fault location services demand consistent data time synchronization; in power communication networks, PON digital converter stations need to simultaneously retrieve information from multiple terminal devices for verification.

[0069] Based on this, this embodiment provides a time synchronization compensation method for distributed fusion terminals in digital converter stations, and an application scenario example is shown in the figure. Figure 1 As shown, Figure 2 This is a flowchart of a time synchronization compensation method for distributed converged terminals in a digital converter station according to an embodiment of the present invention, as follows: Figure 2 As shown, the process includes the following steps:

[0070] S1: Prioritize the services of the digital converter station according to the type of service.

[0071] In this embodiment of the invention, service types are categorized by establishing a model for time synchronization services and other services. The model for time synchronization services and other services is represented as follows:

[0072] TSS i (s i ,d i ,ti ,st i ,w i ,v i J i )

[0073] Among them, s i It is the source node of the business, d i It is the destination node, t i It is the transmission duration, st i It's the start time, w i This is the required number for the spectrum slot, v i It is the transmission rate of the service, if J i True indicates TSS i If it indicates a time synchronization service, otherwise it indicates other services that are not time synchronization services.

[0074] Set a higher priority for the time synchronization service to ensure deterministic latency, as follows:

[0075]

[0076] Where ζ represents priority, syn represents time synchronization service, and else represents other services.

[0077] On the one hand, time synchronization services have a higher priority than ordinary services. When two services arrive at the same time, the transmission delay accuracy of the time synchronization service is guaranteed first. On the other hand, the priority setting can serve as a marker for subsequent time compensation.

[0078] S2: Initialize paths and latency for services after priority allocation using preset routing and spectrum allocation algorithms. For example... Figure 3 As shown, the specific process includes:

[0079] S21: Initialize network state and algorithm model parameters;

[0080] S22: When a new traffic load is input into the network topology, the path and latency are output using a preset shortest route algorithm (e.g., Dijkstra's algorithm), and spectrum slots are allocated to the services in the traffic load (e.g., the spectrum allocation algorithm first-fit).

[0081] S23: Repeat the iteration until all services in the traffic load are allocated spectrum slots;

[0082] S24: Calculate the round-trip transmission delay determined under this traffic load.

[0083] The above steps yield a set of possible delay matrices, which record the inherent transmission delay of all possible routes selected by each service under each traffic load.

[0084] Determined delay Calculated using the following formula:

[0085]

[0086] Where, Path s,d This is the optical link path from node to node, where d and k represent the nodes along this path. s,d v is the length of the path. i θ represents the transmission rate of the service, and θ represents the node forwarding delay.

[0087] A large, continuous supply of available spectrum slots is reserved for time synchronization services to ensure a defined transmission delay. Three types of constraints must be followed throughout the routing and spectrum allocation calculation process:

[0088] (1) Spectrum consistency constraint:

[0089] Λ q f pq =True, q∈Path si,di

[0090] This formula indicates that the same spectrum resources need to be allocated on each link along the path, where f pq This represents the spectrum occupancy matrix for the service, where q represents the edges the route needs to traverse, and Λ q Representation and operation.

[0091] (2) Spectral continuity constraint:

[0092] Λ p f pq =True, p∈Link k,startp,endp

[0093] This formula ensures that neutron carriers must be connected to each other along a single path.

[0094] (3) Spectrum conflict constraint:

[0095]

[0096] The formula defines that the spectrum allocation of different paths on the same optical fiber cannot overlap.

[0097] While satisfying the spectrum allocation constraints, the time delay tolerance constraints must also be met:

[0098]

[0099] Total transmission delay Calculated using the following formula:

[0100]

[0101] Where j is the index of a different receiver, i is the service index, and σ * To protect against latency, This is the differential latency that needs to be compensated. The compensation mode is consistent with the maximum round-trip latency of the same distributed task group, with a small amount of additional protection latency.

[0102] Queuing latency tolerance Hd for each service i Calculated using the following formula:

[0103]

[0104] in, To minimize the switching cost, log2(B+2) is the bandwidth cost, where B is the bandwidth and U is the bandwidth. v B represents the node state in degrees, and B is the bandwidth.

[0105] S3: Differential compensation is performed by adaptively setting the waiting real-time delay for forwarding at the pending nodes to synchronize the receiver time, and path and spectrum reconstruction is performed according to the route spectrum with minimal compensation. This embodiment of the invention achieves time synchronization of the distributed fusion terminal receiver through a differential compensation algorithm. For example... Figure 4 As shown, the specific steps include:

[0106] S31: Initialize the random iteration parameters;

[0107] S32: Perform differential compensation on the determined round-trip transmission delay and determine whether the compensation cost is minimized;

[0108] S33: If not, then update the iteration parameters and execute step S32; if yes, then execute S34.

[0109] S34: The iteration ends and the optimal delay spectrum round-trip path is obtained.

[0110] Due to network complexity, the randomness of service generation, and the constraints in spectrum space and allocation, it is necessary to control the differential compensation time to reduce congestion. The optimization objective is to minimize all compensation times.

[0111]

[0112] S4: Determine if there are any licensed spectrum slots. If so, proceed to step S5; otherwise, reroute and proceed to step S2. In EON systems, multi-service crosstalk is the main factor causing spectrum congestion and latency issues. End-to-end resilience is achieved using bandwidth-variable cross-connects (BV-WXC), flexibly allocating spectrum slots according to client services. Bandwidth-variable transponders (BVT) select appropriate modulation formats based on the transmission distance of each service. BV-WXC and BVT enable EON to flexibly match spectrum slots for time synchronization services.

[0113] S5: Record the transmission delay of the service and calculate the blocking probability under the traffic load of the service.

[0114] Therefore, the digital converter station distributed converged terminal time synchronization compensation method provided in this embodiment of the invention aims to minimize the compensation time, using the above-mentioned constraints and priorities as constraints to achieve the purpose of receiver time synchronization, that is:

[0115]

[0116]

[0117] Through comparative experiments, the performance of the synchronization timing method provided in this embodiment compared to the traditional K-shortest path spectrum allocation shows an average performance reduction of 65.4%. This is because the synchronization timing method provided in this embodiment avoids blocking of low-latency services. Time synchronization services achieve receiver time synchronization through differential delay compensation at the transmitting end. Due to priority settings, the transmission latency of time synchronization services is also shorter than other services under different network traffic loads. Therefore, the time synchronization compensation method for distributed converged terminals in digital converter stations provided in this embodiment ensures time synchronization at the receiver end of the digital converter station and has better performance in terms of transmission latency and blocking probability.

[0118] This embodiment also provides a time synchronization compensation device for a distributed converged terminal in a digital converter station. This device is used to implement the above embodiments and preferred embodiments, and details already described will not be repeated. As used below, the term "module" can refer to a combination of software and / or hardware that performs a predetermined function. Although the devices described in the following embodiments are preferably implemented in software, hardware implementations, or a combination of software and hardware, are also possible and contemplated.

[0119] This embodiment provides a time synchronization compensation device for a distributed fusion terminal in a digital converter station, such as... Figure 5 As shown, it includes:

[0120] Input service division module 501, used to prioritize services of digital converter stations according to the type of service.

[0121] The routing module 502 is used to initialize the path and latency for services after priority division using preset routing and spectrum allocation algorithms.

[0122] The differential compensation module 503 is used to perform differential compensation by adaptively setting the waiting real-time delay for forwarding at the pending node, so as to synchronize the receiving end time and reconstruct the path and spectrum according to the route spectrum with minimal compensation.

[0123] The spectrum slot determination module 504 is used to determine whether there is a licensed spectrum slot. If there is, it enters the performance indicator calculation module; otherwise, it reroutes to the routing module.

[0124] The performance indicator calculation module 505 is used to record the transmission delay of the service and calculate the blocking probability under the traffic load of the service.

[0125] In some alternative implementations, routing module 502 includes:

[0126] The first initialization unit is used to initialize the network topology state, record matrix, and network traffic load.

[0127] The spectrum slot allocation unit is used to allocate spectrum slots to services in a new traffic load by using a preset shortest route algorithm to output the path and latency when a new traffic load is input into the network topology.

[0128] An iterative unit is used to repeatedly iterate until all services in the traffic load are allocated spectrum slots.

[0129] The transmission delay calculation unit is used to calculate the round-trip transmission delay under the given traffic load.

[0130] In some alternative implementations, the differential compensation module 503 includes:

[0131] The second initialization unit is used to initialize the random iteration parameters;

[0132] The differential compensation unit is used to perform differential compensation on a given round-trip transmission delay and determine whether the compensation cost is minimized.

[0133] The iterative parameter update unit is used to update the iterative parameters and re-enter the differential compensation unit when the compensation cost is not minimized. If the compensation cost is minimized, the result is output.

[0134] The result output unit is used to obtain the optimal delay spectrum round-trip path at the end of the iteration.

[0135] In this embodiment, a time synchronization compensation device for a distributed converged terminal of a digital converter station is presented in the form of a functional unit. Here, a unit refers to an ASIC circuit, a processor and memory that execute one or more software or fixed programs, and / or other devices that can provide the above-mentioned functions.

[0136] Further functional descriptions of the above modules and units are the same as those in the corresponding embodiments described above, and will not be repeated here.

[0137] This invention also provides a computer device having the above-described features. Figure 6 The diagram shows a time synchronization compensation device for a distributed fusion terminal in a digital converter station.

[0138] Please see Figure 6 , Figure 6 This is a schematic diagram of the structure of a computer device provided in an optional embodiment of the present invention, such as... Figure 6 As shown, the computer device includes one or more processors 10, memory 20, and interfaces for connecting the components, including high-speed interfaces and low-speed interfaces. The components communicate with each other via different buses and can be mounted on a common motherboard or otherwise installed as needed. The processors can process instructions executed within the computer device, including instructions stored in or on memory to display graphical information of a GUI on external input / output devices (such as display devices coupled to the interfaces). In some alternative implementations, multiple processors and / or multiple buses can be used with multiple memories and multiple memory modules, if desired. Similarly, multiple computer devices can be connected, each providing some of the necessary operations (e.g., as a server array, a set of blade servers, or a multiprocessor system). Figure 6 Take a processor 10 as an example.

[0139] Processor 10 may be a central processing unit, a network processor, or a combination thereof. Processor 10 may further include a hardware chip. The hardware chip may be an application-specific integrated circuit (ASIC), a programmable logic device (PLD), or a combination thereof. The programmable logic device may be a complex programmable logic device (CAMP), a field-programmable gate array (FPGA), a general-purpose array logic (GDA), or any combination thereof.

[0140] The memory 20 stores instructions executable by at least one processor 10 to cause the at least one processor 10 to perform the method shown in the above embodiments.

[0141] The memory 20 may include a program storage area and a data storage area. The program storage area may store the operating system and applications required for at least one function; the data storage area may store data created based on the use of the computer device as shown by a landing page for an app. Furthermore, the memory 20 may include high-speed random access memory and may also include non-transitory memory, such as at least one disk storage device, flash memory device, or other non-transitory solid-state storage device. In some alternative embodiments, the memory 20 may optionally include memory remotely located relative to the processor 10, which can be connected to the computer device via a network. Examples of such networks include, but are not limited to, the Internet, intranets, local area networks, mobile communication networks, and combinations thereof.

[0142] The memory 20 may include volatile memory, such as random access memory; the memory may also include non-volatile memory, such as flash memory, hard disk or solid-state drive; the memory 20 may also include a combination of the above types of memory.

[0143] The computer device also includes a communication interface 30 for communicating with other devices or communication networks.

[0144] This invention also provides a computer-readable storage medium. The methods described above according to embodiments of the invention can be implemented in hardware or firmware, or implemented as computer code that can be recorded on a storage medium, or implemented as computer code downloaded via a network and originally stored on a remote storage medium or a non-transitory machine-readable storage medium and then stored on a local storage medium. Thus, the methods described herein can be processed by software stored on a storage medium using a general-purpose computer, a dedicated processor, or programmable or dedicated hardware. The storage medium can be a magnetic disk, optical disk, read-only memory, random access memory, flash memory, hard disk, or solid-state drive, etc.; further, the storage medium can also include combinations of the above types of memory. It is understood that computers, processors, microprocessor controllers, or programmable hardware include storage components capable of storing or receiving software or computer code, which, when accessed and executed by the computer, processor, or hardware, implements the methods shown in the above embodiments.

[0145] Although embodiments of the invention have been described in conjunction with the accompanying drawings, those skilled in the art can make various modifications and variations without departing from the spirit and scope of the invention, and such modifications and variations all fall within the scope defined by the appended claims.

Claims

1. A method for time synchronization compensation of distributed converged terminals in a digital converter station, characterized in that, The method includes: S1: Prioritize the services of the digital converter station according to the type of service; S2: Initialize the path and latency for services after priority division using preset routing and spectrum allocation algorithms; S3: Differential compensation is performed by adaptively setting the waiting delay for forwarding at the pending node to synchronize the receiver time and reconstruct the path and spectrum according to the route spectrum with minimal compensation; S4: Determine if there is a licensed spectrum slot. If there is, proceed to step S5. If not, reroute and proceed to step S2. S5: Record the transmission delay of the service and calculate the blocking probability under the traffic load of the service; Step S3 includes: S31: Initialize the random iteration parameters; S32: Perform differential compensation on the determined round-trip transmission delay and determine whether the compensation cost is minimized; S33: If not, then update the iteration parameters and execute step S32; if yes, then execute S34. S34: The iteration ends and the optimal delay spectrum round-trip path is obtained; Determined transmission delay Calculated using the following formula: in, This is the optical link path from node to node, where d and k represent the nodes along this path. The length of the path. It is the transmission rate of the service. θ For node forwarding latency; Update the total transmission delay using the differential delay compensation algorithm: Where j represents the index of a different receiving end, and i represents the service index. To protect against latency, For the differential latency that needs compensation, the compensation mode is consistent with the maximum round-trip latency of the same distributed task group, with a small amount of additional protection latency. Indicates priority. , This indicates a time synchronization service. Indicates other business activities; The optimization objective of the differential delay compensation algorithm is to minimize all compensation times: Where Z represents all compensation times.

2. The method according to claim 1, characterized in that, The business types are categorized by establishing models for time synchronization services and other services. The model for time synchronization services and other services is represented as follows: in, It is the source node of the business. It is the destination node. It is the transmission duration. It's the start time. This is the required number for the spectrum slot. It is the transmission rate of the service. True indicates TSS i If it indicates a time synchronization service, otherwise it indicates other services that are not time synchronization services.

3. The method according to claim 2, characterized in that, Set the priority of time synchronization services to be higher than that of other services.

4. The method according to claim 1 or 2, characterized in that, Step S2 includes: S21: Initialize network state and algorithm model parameters; S22: When a new traffic load is input into the network topology, the preset shortest route algorithm is used to output the path and delay, and spectrum slots are allocated to the services in the traffic load. S23: Repeat the iteration until all services in the traffic load are allocated spectrum slots; S24: Calculate the round-trip transmission delay determined under this traffic load.

5. The method according to claim 1, characterized in that, During the routing and spectrum allocation calculation process, both spectrum allocation constraints and latency tolerance conditions must be met simultaneously. The spectrum allocation constraints include: Spectral consistency constraint means that each link on the path needs to be allocated the same spectrum resources; Spectral continuity constraints ensure that neutron carriers must be connected to each other along a single path; Spectrum conflict constraint is defined as the requirement that the spectrum allocations of different paths on the same optical fiber cannot overlap. The latency constraint tolerance conditions include: the total transmission latency shall not exceed the queuing latency tolerance of each service.

6. A time synchronization compensation device for a distributed fusion terminal in a digital converter station, characterized in that, The device includes: The input service allocation module is used to prioritize the services of the digital converter station according to the type of service. The routing module is used to initialize paths and latency for services after priority allocation using preset routing and spectrum allocation algorithms; The differential compensation module is used to perform differential compensation by adaptively setting the waiting delay for forwarding at the pending node, so as to synchronize the receiving end time and reconstruct the path and spectrum according to the route spectrum with minimal compensation. The spectrum slot determination module is used to determine whether there are licensed spectrum slots. If there are, it enters the performance indicator calculation module; otherwise, it reroutes to the routing module. The performance metric calculation module is used to record the transmission delay of the service and calculate the blocking probability under the traffic load of the service. The differential compensation module includes: The second initialization unit is used to initialize the random iteration parameters; The differential compensation unit is used to perform differential compensation on a given round-trip transmission delay and determine whether the compensation cost is minimized. The iterative parameter update unit is used to update the iterative parameters and re-enter the differential compensation unit when the compensation cost is not minimized. If the compensation cost is minimized, the result is output. The result output unit is used to obtain the optimal round-trip path of the delay spectrum at the end of the iteration; Determined transmission delay Calculated using the following formula: in, This is the optical link path from node to node, where d and k represent the nodes along this path. The length of the path. It is the transmission rate of the service. θ For node forwarding latency; Update the total transmission delay using the differential delay compensation algorithm: Where j represents the index of a different receiving end, and i represents the service index. To protect against latency, For the differential latency that needs compensation, the compensation mode is consistent with the maximum round-trip latency of the same distributed task group, with a small amount of additional protection latency. Indicates priority. , This indicates a time synchronization service. Indicates other business activities; The optimization objective of the differential delay compensation algorithm is to minimize all compensation times: Where Z represents all compensation times.

7. The apparatus according to claim 6, characterized in that, The routing module includes: The first initialization unit is used to initialize the network topology state, record matrix, and network traffic load. The spectrum slot allocation unit is used to allocate spectrum slots to services in a new traffic load by using a preset shortest route algorithm to output the path and latency when a new traffic load is input into the network topology. An iterative unit is used to repeatedly iterate until all services in the traffic load are allocated spectrum slots; The transmission delay calculation unit is used to calculate the round-trip transmission delay under the given traffic load.

8. A computer device, characterized in that, include: A memory and a processor, the memory and the processor being communicatively connected to each other, the memory storing computer instructions, the processor executing the computer instructions to perform the method of any one of claims 1 to 5.

9. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores computer instructions for causing a computer to perform the method of any one of claims 1 to 5.

Images