Resource Allocation Method, Apparatus, and Storage Medium

Abstract

The present application provides a resource allocation method, apparatus, and storage medium, relating to the field of communication technologies. It is applicable to the space-ground integrated optical network. Obtain service request information, where the service request information includes the service bandwidth requirement, service arrival time, and service duration of the service request; determine the service end time according to the service arrival time and the service duration; within the time period between the service arrival time and the service end time, determine whether the network topology of the space-ground integrated optical network remains fixed; if so, allocate resources for the service according to the service bandwidth requirement under the network topology at the service arrival time; if not, allocate resources for the service according to the intersection of multiple network topologies between the service arrival time and the service end time and the service bandwidth requirement. The present application can effectively solve the problems of easy link interruption or signal delay caused by network topology changes, and improve the stability and reliability of network transmission.

Description

Technical Field

[0001] This application relates to the field of communication technologies, and in particular, to a resource allocation method, apparatus, and storage medium. Background Art

[0002] With the development of communication technologies, the number of user accesses and network throughput have shown explosive growth. Due to the limited coverage and network capacity of terrestrial networks, relying solely on terrestrial networks can no longer meet the demand for high-speed and reliable network access at any time and anywhere on the earth. Dependent on the development of technologies such as inter-satellite links and on-board processing, the space-ground integrated optical network has become an inevitable trend in the development of the next-generation network architecture due to its advantages such as wide coverage and high speed. The space-ground integrated optical network mainly consists of a satellite optical network and a terrestrial optical network. Since the space-ground integrated optical network is a heterogeneous network, including three network segments: inter-satellite, space-ground, and terrestrial, the total number of link wavelengths and wavelength bandwidth configurations in each network segment are different. Therefore, the space-ground service path will span different network segments, and thus the number of wavelengths to be allocated on the links in different network segments is different.

[0003] In the space-ground integrated optical network, due to the periodic movement of satellites, the inter-satellite links and space-ground links in the network will dynamically switch, and accordingly, the entire network topology will change dynamically. The paths obtained by using the routing calculation method in traditional terrestrial fiber optic networks may be interrupted. Therefore, in the space-ground integrated optical network, dynamic routing calculation and wavelength allocation need to be performed according to the dynamic changes of the network topology. During the service transmission process, path switching will result in poor routing stability, increased unreliability, and increased transmission delay. Therefore, compared with the routing and wavelength allocation in traditional terrestrial optical networks using wavelength division multiplexing (WDM) technology, the routing and wavelength allocation in the space-ground integrated optical network are more complex. When performing routing calculation and wavelength allocation, it is necessary to consider network heterogeneity, the changes of network topology and link resources over time, and effectively solve the problems of path interruption and signal delay. Summary of the Invention

[0004] This application provides a resource allocation method, apparatus, and storage medium to solve the problems of link interruption or signal delay.

[0005] In a first aspect, the present application provides a resource allocation method applicable to a space-ground integrated optical network. The space-ground integrated optical network includes an inter-satellite network segment, a space-ground network segment, and a ground network segment. The resource allocation method includes: obtaining service request information, where the service request information includes the service bandwidth requirement, service arrival time, and service duration of the service request; determining the service end time according to the service arrival time and service duration; determining whether the network topology of the space-ground integrated optical network remains fixed during the period from the service arrival time to the service end time; if so, allocating resources for the service according to the service bandwidth requirement under the network topology at the service arrival time; if not, allocating resources for the service according to the intersection of multiple network topologies between the service arrival time and the service end time and the service bandwidth requirement.

[0006] Optionally, the service request information includes the source node and destination node of the service request. Allocating resources for the service according to the service bandwidth requirement under the network topology at the service arrival time includes: under the network topology at the service arrival time, determining whether there is a first available path between the source node and the destination node according to the wavelength occupancy of the link and the service bandwidth requirement; if the first available path is a single path, allocating corresponding numbers of wavelengths for the service in different network segments according to the first available path; if the first available path is at least two paths, obtaining the path with the shortest distance among the first available paths based on the shortest path algorithm; allocating corresponding numbers of wavelengths for the service in different network segments according to the path with the shortest distance among the first available paths.

[0007] Optionally, the service request information includes the source node and destination node of the service request. Allocating resources for the service according to the intersection of multiple network topologies between the service arrival time and the service end time and the service bandwidth requirement includes: obtaining multiple network topologies and the change time points of the network topologies during the period from the service arrival time to the service end time; determining multiple time slices according to the service arrival time, service end time, and change time points; performing combined processing on the multiple time slices based on the principle of minimizing the number of path switches to obtain multiple time periods, and adjacent time periods satisfy time continuity; for each time period among the multiple time periods, determining whether there is a second available path between the source node and the destination node during the time period based on the routing algorithm of the intersection topology according to the wavelength occupancy of the link and the service bandwidth requirement; if there is a second available path in each time period among the multiple time periods, allocating corresponding numbers of wavelengths for the service in different network segments according to the second available path corresponding to the time period during the corresponding time period.

[0008] Optionally, for the routing algorithm based on the intersection topology, determine whether there is a second available path between the source node and the destination node according to the wavelength occupancy of the link and the service bandwidth requirement, including: performing an intersection process on the network topologies corresponding to each time slice within the time period to obtain the intersection topology corresponding to the time period; determining whether there is an available path between the source node and the destination node according to the wavelength occupancy of the link and the service bandwidth requirement under the intersection topology corresponding to the time period.

[0009] Optionally, allocate corresponding numbers of wavelengths for the service in different network segments according to the second available path corresponding to the time period, including: if the second available path is a single path, allocate corresponding numbers of wavelengths for the service according to the links in different network segments of the second available path; if the second available path is at least two paths, obtain the path with the shortest distance among the second available paths based on the shortest path algorithm; allocate corresponding numbers of wavelengths for the service according to the path with the shortest distance among the second available paths in different network segments.

[0010] Optionally, determine whether there is an available path between the source node and the destination node according to the wavelength occupancy of the link and the service bandwidth requirement, including: determining at least one path between the source node and the destination node; performing the following processing on each link in the at least one path to determine whether there is an available path between the source node and the destination node: determining the number of idle wavelengths on the link under each time slice according to the wavelength occupancy of the link during the service duration; determining the number of wavelengths to be allocated corresponding to the link according to the service bandwidth requirement and the bandwidth of the wavelengths in the network segment corresponding to the link; if the number of idle wavelengths is greater than or equal to the number of wavelengths to be allocated, determine that the link is an available link.

[0011] Optionally, the resource allocation method further includes: if there is no second available path in any of the multiple time periods, re - execute the combination process of multiple time slices to obtain multiple time periods; if there are still time periods without a second available path after traversing the combination methods, increase the link switching times and re - execute the combination process of multiple time slices to obtain multiple time periods; if the link switching times reach n - 1 and there are still time periods without a second available path after traversing the combination methods, determine that the service is blocked; where the link switching times is an integer less than n, and n is the number of time slices within the service duration.

[0012] Second aspect, the present application further provides a resource allocation device, which is applicable to the space-ground integrated optical network. The space-ground integrated optical network includes an inter-satellite network segment, a space-ground network segment, and a ground network segment. The resource allocation device includes: an acquisition module, configured to acquire service request information, where the service request information includes the service bandwidth requirement of the service request, the service arrival time, and the service duration; a first determination module, configured to determine the service end time according to the service arrival time and the service duration; a second determination module, configured to determine whether the network topology of the space-ground integrated optical network remains unchanged during the time period from the service arrival time to the service end time; a resource allocation module, configured to, when determining that the network topology remains unchanged, allocate resources for the service according to the service bandwidth requirement under the network topology at the service arrival time; the resource allocation module is further configured to, when determining that the network topology does not remain unchanged, allocate resources for the service according to the intersection of multiple network topologies between the service arrival time and the service end time and the service bandwidth requirement.

[0013] Third aspect, the present application further provides an electronic device, including: a memory, a processor; the memory is configured to store program instructions; the processor is configured to call the program instructions to execute the resource allocation method provided in any one of the above first aspects.

[0014] Fourth aspect, the present application further provides a computer-readable storage medium, in which computer-executable instructions are stored, and when the computer-executable instructions are executed by a processor, they are used to implement the resource allocation method provided in any one of the above first aspects.

[0015] Fifth aspect, the present application further provides a computer program product, including a computer program; when the computer program is executed, it implements the resource allocation method provided in the above first aspect.

[0016] The resource allocation method, device, and storage medium provided by this application are applicable to the space-ground integrated optical network. The space-ground integrated optical network includes an inter-satellite network segment, a space-ground network segment, and a ground network segment. The resource allocation method includes: obtaining service request information, where the service request information includes the service bandwidth requirement, service arrival time, and service duration of the service request; determining the service end time according to the service arrival time and service duration; determining whether the network topology of the space-ground integrated optical network remains fixed during the period from the service arrival time to the service end time; if so, allocating resources for the service according to the service bandwidth requirement under the network topology at the service arrival time; if not, allocating resources for the service according to the intersection of multiple network topologies between the service arrival time and the service end time and the service bandwidth requirement. This application dynamically allocates resources for the space-ground integrated optical network according to the network topology change situation during service transmission. When the network topology does not change, resources are allocated according to the network topology at the service arrival time. When the network topology changes, the service transmission path is calculated on the intersection topology of the network topologies under multiple time slices, so that the service still has an available path when the network topology changes and is not affected by the network topology change, effectively solving the problem of easy link interruption or signal delay caused by network topology change and improving the stability and reliability of network transmission. Description of the Drawings

[0017] The drawings here are incorporated into the specification and form a part of this specification, showing embodiments consistent with this application, and are used together with the specification to explain the principles of this application.

[0018] Figure 1 Schematic diagram of the space-ground integrated optical network architecture provided by an embodiment of this application;

[0019] Figure 2 Flow chart of the resource allocation method provided by an embodiment of this application Figure 1 ;

[0020] Figure 3 Flow chart of the resource allocation method provided by an embodiment of this application Figure 2 ;

[0021] Figure 4 Schematic diagram of the time period combination provided by an embodiment of this application;

[0022] Figure 5 Schematic diagram of the time slices of an orbital period provided by an embodiment of this application;

[0023] Figure 6 Schematic diagram of service transmission in the same time slice provided by an embodiment of this application;

[0024] Figure 7 Schematic diagram of service transmission in different time slices provided by an embodiment of this application;

[0025] Figure 8 A schematic diagram of the space-ground integrated optical network topology under a time slice provided by an embodiment of the present application;

[0026] Figure 9 A schematic diagram of the routing under a time slice provided by an embodiment of the present application;

[0027] Figure 10 A schematic diagram of the space-ground integrated optical network topology under two adjacent time slices provided by an embodiment of the present application;

[0028] Figure 11 A schematic diagram of the intersection topology under two adjacent time slices provided by an embodiment of the present application;

[0029] Figure 12 A schematic diagram of the routing under two adjacent time slices provided by an embodiment of the present application;

[0030] Figure 13 A schematic diagram of the structure of the resource allocation device provided by an embodiment of the present application;

[0031] Figure 14 A schematic diagram of the structure of the electronic device provided by an embodiment of the present application.

[0032] Through the above-mentioned drawings, specific embodiments of the present application have been shown, and there will be more detailed descriptions hereinafter. These drawings and written descriptions are not intended to limit the scope of the concept of the present application in any way, but to illustrate the concept of the present application to those skilled in the art by referring to specific embodiments. Detailed Description of the Embodiment

[0033] Here, the exemplary embodiments will be described in detail, and the examples are shown in the drawings. When the following description refers to the drawings, unless otherwise indicated, the same numbers in different drawings represent the same or similar elements. The embodiments described in the following exemplary embodiments do not represent all embodiments consistent with the present application. On the contrary, they are merely examples of devices and methods consistent with some aspects of the present application as detailed in the appended claims.

[0034] Figure 1 A schematic diagram of the space-ground integrated optical network architecture provided by an embodiment of the present application. As Figure 1 shown, the space-ground integrated optical network mainly includes two layers of optical networks, namely the ground optical network and the satellite optical network. Among them, the ground optical network includes multiple ground nodes, and the ground nodes can be composed of ground stations and switches. From the perspective of the application scenarios / regions of the optical network, as Figure 1As shown in the figure, the terrestrial optical network may include a mobile communication network (i.e., the mobile communication shown in the figure), a business circle network (i.e., the business circle shown in the figure), and a residential network (i.e., the residence shown in the figure). The terrestrial nodes are used to establish data connection links between these application areas and the data center, and provide network services for these application areas.

[0035] The satellite optical network includes multiple satellite nodes, and the satellite nodes can be composed of satellites. The satellites in the satellite optical network are generally distributed in multiple orbits. Taking the Iridium constellation as an example, the Iridium constellation includes 6 orbits, and there are 11 satellites on each orbit. Generally, each satellite can be connected to four to eight adjacent satellites. The link between two satellites in the same orbit is called an in-orbit inter-satellite link (Inter-Satellite Link, abbreviated as ISL), and the link connecting satellites in different orbits is called an inter-orbit ISL. Each inter-satellite link between satellite optical nodes can accommodate 16 wavelengths.

[0036] Multiple satellite nodes can establish connections with a terrestrial node, and a satellite node can also establish connections with multiple terrestrial nodes. That is to say, multiple satellites can be connected to the same ground station, and a single satellite can also be connected to multiple ground stations. The link between satellite nodes is an inter-satellite link, and the network composed of inter-satellite links is called an inter-satellite network segment; the link between terrestrial nodes is a terrestrial link, and the network composed of terrestrial links is called a terrestrial network segment; the link between satellite nodes and terrestrial nodes is a satellite-terrestrial link, and the network composed of satellite-terrestrial links is called a satellite-terrestrial network segment. The scenarios applicable to the embodiments of this application include a space-ground integrated optical network composed of an inter-satellite network segment, a satellite-terrestrial network segment, and a terrestrial network segment.

[0037] Exemplarily, the space-ground integrated optical network architecture (or model) is described as an undirected graph G=(V, E(t)), the optical node set V={V S ,V G}, where V S represents the set of satellite optical nodes, and V G represents the set of terrestrial optical nodes. The terrestrial optical nodes can include ground station nodes and ordinary switching nodes. Among them, the ground station node refers to a node where a ground station and an optical switch are deployed, and the ordinary switching node refers to a node where only an optical switch is deployed. The optical switch can be directly connected to a data center, mobile communication users, Internet users, etc. The network topology information and network status information of the space-ground integrated optical network can be obtained by the network control center summarizing the node and link status information collected from each node.

[0038] A satellite node that can be directly connected to a ground station node is called a satellite edge node. The mobility of satellites causes frequent switching of inter-satellite links and satellite-ground links. Therefore, the link set in the space-ground integrated optical network is dynamically changing. Correspondingly, the network topology of the space-ground integrated optical network is also dynamically changing. Specifically, both ends of an inter-satellite link are satellite nodes, the nodes at both ends of a satellite-ground link are a ground station node and a satellite edge node respectively, and both ends of a ground link are ground nodes. The in-orbit satellite links are usually fixed, while the inter-orbit satellite links and satellite-ground links change with the movement of satellites. The satellite-ground link switching means that as the satellite moves, the ground station changes from the coverage area of one satellite to that of another satellite. At this time, the ground station disconnects the satellite-ground link with the original satellite and establishes a new satellite-ground link with the new satellite.

[0039] When transmitting service data in the space-ground integrated optical network, if the network topology changes during the duration of some services, the paths obtained by using the routing calculation methods in traditional terrestrial optical networks (such as wavelength division multiplexing technology, abbreviated as WDM) may be interrupted. Therefore, compared with the allocation of resources such as routing and wavelength in traditional terrestrial optical networks, the allocation of resources such as routing and wavelength in the space-ground integrated optical network is more complex. When performing routing calculation, it is necessary to consider the changes of network topology and link resources over time and the heterogeneity of the network.

[0040] In summary, to solve the problem that the routing paths in the space-ground integrated optical network are prone to link interruption, this application proposes a resource allocation method, device, and storage medium, which determine whether the network topology changes during the transmission of service data and propose different resource allocation schemes for different situations. The technical solutions of this application will be explained below in combination with specific embodiments.

[0041] Figure 2 Flow schematic of the resource allocation method provided in the embodiments of this application Figure 1 This resource allocation method is applicable to the space-ground integrated optical network, which includes an inter-satellite network segment, a satellite-ground network segment, and a ground network segment. As Figure 2 shown, this resource allocation method includes:

[0042] S201: Obtain service request information, where the service request information includes the service bandwidth requirement of the service request, the service arrival time, and the service duration.

[0043] In the embodiments of this application, first, the service requests (such as satellite-to-ground service requests) in the space-ground integrated optical network are modeled. Exemplarily, it is represented by a five-dimensional expression, that is: where s r represents the source node of the service request r, usually a satellite node; d rDenotes the destination node of service request r, usually a terrestrial optical node; b r Is the bandwidth resource required for service request r (i.e., bandwidth demand), which is the required service data transmission rate; Is the service arrival time of service request r, T r h Is the duration required for the completion of service data transmission of service request r, i.e., the service duration.

[0044] In this step, the network control center can obtain the bandwidth demand b of the service request r , service arrival time and service duration T r h .

[0045] S202: Determine the service end time according to the service arrival time and service duration.

[0046] Is the service end time of service request r, which can be determined by the network control center by adding the service arrival time and the duration T required for the completion of service data transmission r h for calculation.

[0047] S203: Determine whether the network topology of the space-ground integrated optical network remains fixed during the period from the service arrival time to the service end time.

[0048] According to the satellite orbit parameters and the configuration of parameters such as the ground station tilt angle, the space-ground integrated network topology changes periodically with the movement of the satellite. There can be multiple time slices within an orbital period. Within each time slice, the space-ground integrated network topology is fixed. The inter-satellite network segments and the links of the satellite-ground network segments between adjacent time slices will switch.

[0049] In this embodiment, the network topology can be obtained from the snapshots at the service arrival time and the service end time respectively, and the network topologies at these two times can be compared to determine whether they remain fixed. In other embodiments, multiple snapshots between the service arrival time and the service end time can also be obtained, and the network topologies at different times can be obtained from the multiple snapshots to determine whether the network topology has changed. The snapshots can be obtained by the network control center.

[0050] Determining whether the network topology remains fixed means determining that the nodes in the topology (including ground nodes and satellite nodes) and the links between nodes remain unchanged.

[0051] If so, that is, if it is determined that the network topology of the space-ground integrated optical network remains unchanged during the time period from the service arrival time to the service end time, then step S204 is executed; if not, that is, if it is determined that the network topology of the space-ground integrated optical network is not fixed during the time period from the service arrival time to the service end time, then step S205 is executed.

[0052] S204: Under the network topology at the service arrival time, allocate resources for the service according to the service bandwidth requirement.

[0053] If it is determined that the network topology of the space-ground integrated optical network remains unchanged during the time period from the service arrival time to the service end time, then only resource allocation needs to be performed according to this network topology, that is, resource allocation is performed according to the network topology at the service arrival time.

[0054] The resources in the embodiments of the present application may include wavelength resources. First, calculate the route for the service, and then allocate wavelength resources on the links passed by the route. Among them, calculating the route means calculating the available path. The wavelength bandwidth configurations of the three network segments of inter-satellite, satellite-ground, and ground in the space-ground integrated optical network are different, so the number of wavelengths to be allocated for each network segment is also different. Specifically, the wavelengths can be allocated for the service according to the service bandwidth requirement, and the calculation can be performed according to the following formula:

[0055]

[0056] Where represents the number of wavelengths required by the service request r on the link e(i,j), b r represents the service bandwidth requirement of the service request r, represents the wavelength bandwidth on the link e(i,j). The wavelength bandwidths of the links in the same network segment are the same. According to formula 1, the number of wavelengths to be allocated for the three network segments of inter-satellite, satellite-ground, and ground can be determined respectively

[0057] Exemplarily, if the arrival time and the end time of the service request are within the same time slice (the network topology within the same time slice remains unchanged, which will be specifically described below), then there is no need to consider whether the links in the path are interrupted, and only resource allocation needs to be performed according to the network topology at the arrival time of the service request.

[0058] S205: Allocate resources for the service according to the intersection of multiple network topologies between the service arrival time and the service end time and the service bandwidth requirement.

[0059] If it is determined that the network topology of the space-ground integrated optical network has changed during the time period from the service arrival time to the service end time, resource allocation shall be performed according to the intersection of multiple network topologies. Similarly, first calculate the route for the service, and then allocate wavelength resources on the links passed by the route.

[0060] In the embodiment of the present application, by obtaining service request information, the service request information includes the service bandwidth requirement of the service request, the service arrival time, and the service duration; determine the service end time according to the service arrival time and the service duration; determine whether the network topology of the space-ground integrated optical network remains fixed during the time period from the service arrival time to the service end time; if so, allocate resources for the service according to the service bandwidth requirement under the network topology at the service arrival time; if not, allocate resources for the service according to the intersection of multiple network topologies and the service bandwidth requirement between the service arrival time and the service end time. The present application dynamically allocates resources for the space-ground integrated optical network according to the network topology change situation during service transmission, allocates resources according to the network topology at the service arrival time when the network topology does not change, calculates the service transmission path on the intersection topology of the network topologies under multiple time slices when the network topology changes, so that the service still has an available path when the network topology changes, is not affected by the network topology change, effectively solves the problem of easy link interruption or signal delay caused by network topology change, and improves the stability and reliability of network transmission.

[0061] Based on the above embodiment, optionally, the service request information includes the source node and the destination node of the service request. Based on this, allocating resources for the service according to the service bandwidth requirement under the network topology at the service arrival time includes: under the network topology at the service arrival time, determine whether there is a first available path between the source node and the destination node according to the wavelength occupancy situation of the link and the service bandwidth requirement; if the first available path is a single path, allocate corresponding numbers of wavelengths for the service in different network segments according to the first available path; if the first available path is at least two paths, obtain the path with the shortest distance in the first available paths based on the shortest path algorithm, and allocate corresponding numbers of wavelengths for the service in different network segments according to the path with the shortest distance in the first available paths.

[0062] The resource usage of the inter-satellite link, the space-ground link, and the ground link can also be obtained from the network control center. The resource usage includes the wavelength occupancy of the link. Here, the link refers to the connection from any one node to another node. By comparing the number of idle wavelengths and the number of wavelengths to be allocated on the link between the source node and the destination node in each network segment of the space-ground integrated optical network topology, it can be determined whether there are sufficient wavelengths available on the link. If there are enough wavelengths on the link, it means that the link can be used by this service. Specifically, let the total number of wavelengths on the link e(i, j) between node i and node j be The number of idle wavelengths is The bandwidth of each wavelength on the link e(i, j) is The number of wavelengths to be allocated to the service r passing through this link is It can be calculated by formula 1. If it is determined that Then the link e(i, j) is unavailable for this service; if Then the link e(i, j) is available for this service. Optionally, add the determined available links to the available link set L a , otherwise add this link to the unavailable link set L ua .

[0063] That is, if the arrival time and the end time of the service request are within the same network topology structure, then only the wavelength usage of each link in the network topology at the arrival time of the service request needs to be considered, and and are calculated according to the above method, where is the set of available links in the network topology at the arrival time of the service, is the set of unavailable links in the network topology at the arrival time of the service.

[0064] If the first available path is a single one, then according to the links of this first available path on different network segments, allocate the corresponding number of wavelengths for the service. Specifically, the number of wavelengths required on different network segments can be calculated according to formula 1, and then allocate the corresponding number of wavelengths for the service on the inter-satellite network segment, the space-ground network segment, and the ground network segment respectively.

[0065] If the first available path is at least two, then first use the shortest path algorithm to determine the path with the shortest distance in the first available paths, and allocate the corresponding number of wavelengths for the service on different network segments of this path. Exemplarily, the shortest path algorithm can include Dijkstra algorithm, Bellman-Ford algorithm, etc.

[0066] Figure 3Flow schematic of the resource allocation method provided by the embodiments of the present application Figure 2 , based on the above embodiments, this method specifically explains the method of allocating resources for services according to the intersection of multiple network topologies and the service demand bandwidth between the service arrival time and the service end time. This embodiment is also based on the service request information including the source node and the destination node of the service request. In Figure 2 Based on the process shown in Figure 3 As shown, step S205 may further include:

[0067] S301: Obtain multiple network topologies and the change time points of the network topologies within the time period from the service arrival time to the service end time.

[0068] The network topology includes nodes and links between nodes. The change time point of the network topology refers to the moment when the nodes or node links in the network topology are switched / changed.

[0069] S302: Determine multiple time slices according to the service arrival time, the service end time, and the change time points.

[0070] Among them, for the method of determining multiple time slices, one way is to divide the time period from the service arrival time to the service end time into multiple time slices at the service arrival time, the service end time, and the change time points of the network topology, and the network topology within each time slice remains fixed.

[0071] Another way is to divide the change cycle of the space-ground integrated optical network topology by time slices, and the network topology of the space-ground integrated optical network within each time slice remains fixed, and only the multiple time slices between the service arrival time and the service end time need to be determined in step 302.

[0072] S303: Based on the principle of minimizing the number of link switches, perform combination processing on multiple time slices to obtain multiple time periods, and adjacent time periods satisfy time continuity.

[0073] Since some link switches during the service transmission will result in poor routing stability, increased unreliability, and increased transmission delay, a routing scheme with fewer switches should be preferred.

[0074] Figure 4 Schematic diagram of time period combination provided by the embodiments of the present application. Assume that the service arrival time to the end time Spanning 4 time slices, the combination method of combining time slices into time periods can include the 4 cases shown in the figure and is combined in sequence. First: the number of switches is 0, and 4 time slices are combined into one time period; Second: the number of switches is 1, and 4 time slices are combined into 2 time periods; Third: the number of switches is 2, and 4 time slices are combined into 3 time periods; Fourth: the number of switches is 3, and 4 time slices are combined into 4 time periods.

[0075] S304: For each time period among multiple time periods, based on the routing algorithm of the intersection topology, according to the wavelength occupancy of the link and the service bandwidth requirement, determine whether there is a second available path between the source node and the destination node in the time period.

[0076] The intersection topology of a time period refers to that only the nodes and links contained in each time slice topology within this time period are retained in this intersection topology. Exemplarily, still taking Figure 4 as a reference, in the routing algorithm based on the intersection topology, similarly before calculating the path using Dijkstra's algorithm, it is necessary to first delete all unavailable links with insufficient wavelengths in the intersection topology of a time period where is the set of unavailable links in the topology of the first time slice within this time period, is the set of available links in the topology of the last time slice within this time period.

[0077] Since switching paths will result in poor routing stability, increased unreliability, and increased transmission delay, a routing scheme with fewer switches should be preferred. Therefore, for a service that lasts for a total of n time slices, traverse from 0 to n - 1 according to the number of switches, and use the routing algorithm based on the intersection topology until it is determined whether there is a second available path between the source node and the destination node in the topologies of the corresponding time periods.

[0078] S305: If there is a second available path in each time period among multiple time periods, then within the corresponding time period, according to the second available path corresponding to the time period, allocate the corresponding number of wavelengths for the service in different network segments.

[0079] That is, in S204 of the above embodiment, if the arrival time and the end time of the service request are within the same time slice (that is, the topological links of the arrival time and the end time of the service request remain fixed), then there is no need to consider whether the links in the path are interrupted. Just delete the links in the set of unavailable links from the link set of the topology according to the network topology at the arrival time of the service request, and then calculate a shortest path P r ={s r ,v1,…,vp , d r} where v1, …, v p are the intermediate nodes passed by path P r .

[0080] If the arrival time and the end time of a service request are in different time slices, a routing algorithm based on the intersection topology is adopted. Due to the topological changes in each time slice, there may be a situation where a link in the path is interrupted and the path needs to be switched. Suppose the service duration experiences a total of n time slices. In the routing algorithm based on the intersection topology, if the number of switches is k, then the n time slices are combined into k + 1 time periods. Each time period needs to satisfy time continuity, and a path can be calculated in each topology of the k + 1 time periods. Denote the finally obtained service path as is the path calculated in the i-th time period where v i1 , …, v ip are the intermediate nodes passed by path . The network control center calculates the paths in each time period after receiving the service request. During the transmission process, path automatic switching is realized at the start time of each time period, from switched to and switched in turn until

[0081] Optionally, if there is no second available path in any of the multiple time periods, the combination process of multiple time slices is re-executed to obtain multiple time periods; if there is still a time period without a second available path after traversing the combination methods, the number of link switches is increased, and the combination process of multiple time slices is re-executed to obtain multiple time periods; if the number of link switches reaches n - 1 and there is still a time period without a second available path after traversing the combination methods, it is determined that the service is blocked. Among them, the number of link switches is an integer less than n, and n is the number of time slices within the service duration.

[0082] First, set the number of switches to 0, that is, the arrival time of the service to the end time The combined time slices across each are a time period, and the intersection topology of this time period is the intersection of the topologies of n time slices within the service duration (which can be called the n-intersection topology). The path calculated under this n-intersection topology is the path that does not require switching. If a shortest path can be calculated under this n-intersection topology, then the routing calculation ends. If no service path can be obtained in this n-intersection topology, then only paths that require switching can be established. To minimize the number of switches, traverse from 1 to n - 1 according to the number of switches until a path is calculated and the routing calculation ends. When the number of switches is 1, the first time period can be the first n - 1 time slices, and the second time period is the last 1 time slice, that is, divided as {n - 1, 1}; if a path cannot be calculated in both the intersection topology of the first n - 1 time slices and the topology of the last 1 time slice, then increase the number of time slices in the second time period by 1, that is, the last 2 time slices form the second time period, and the first time period is the first n - 2 time slices, that is, combined as {n - 2, 2}; and so on, until combined as {1, n - 1}. If still no path can be calculated in the intersection topologies of the two time periods, then the number of switches is 2, and the n time slices are divided into 3 time periods. First, let the third time period be the last 1 time slice, and then divide the first two time periods according to the combination method when the number of switches is 1 for the n - 1 time slices, that is, combined as {n - 2, 1, 1}, {n - 3, 2, 1}, …, {1, n - 2, 1}, and then sequentially add the number of time slices in the last time period until combined as {1, 1, n - 2}. And so on, when the number of switches is n, that is, a single time slice is a time period. If still no path can be calculated in the topologies of each time period, then the service is blocked.

[0083] The following further explains this solution with specific embodiments. Figure 5 It is a schematic diagram of time slices for one orbital period provided in an embodiment of the present application, which shows the time slice division of the Iridium orbital system, as Figure 5 shown. The snapshot period duration is 60s, and each time slot is 200ms, that is, there are 300 time slots in one snapshot period. Divide the topological change period of the space-ground integrated optical network according to time slices. The topology of the space-ground integrated optical network remains fixed within each time slice. Among them, the duration of each time slice can be the same or different. According to the satellite orbital period, a period T o of the topological change of the space-ground integrated optical network can be divided into n time slices T S , and one time slice can be further divided into multiple time slots T t . As Figure 5 shown, the first time slot after the first time slice T S1 is the start time slot of the second time slice T S2 , and the last time slot of the second time slice T S2 is its end time slot.

[0084] Figure 6 This is a schematic diagram of service transmission provided by an embodiment of the present application in the same time slice. The service duration is within the same time slice, that is, The service arrival time and the service end time are within the same time slice T Sm as shown in the figure. Figure 7 This is a schematic diagram of service transmission provided by an embodiment of the present application in different time slices. The service duration spans different time slices, that is, The service arrival time and the service end time are respectively in different time slices T Sm and T S(m+1) as shown in the figure.

[0085] If the number of changes in the integrated space-ground optical network topology during the service duration is n - 1, then the service duration experiences n time slices. Denote the time point of the i-th topology change as t i , then the n time slices are

[0086] The integrated space-ground optical network model can be described as an undirected graph G(V, E(t)), where the node set V = {V s , V g}, V s represents the satellite node set, and V g represents the ground node set. E(t) is the link set at time t, and the link e ij (t) ∈ E(t). If there is a directly connected link between nodes i and j, then the link e ij (t) = 1; if not, then e ij (t) = 0, and e ij (t) ∈ E(t). In the integrated space-air-ground optical network topology, the connection of ground optical fiber links is fixed. However, due to the mobility of satellites, inter-satellite links and satellite-ground links will switch frequently. Therefore, the link set in the integrated space-ground optical network is dynamically changing. Correspondingly, the integrated space-ground optical network topology is also dynamically changing.

[0087] Since the operation of satellites is periodic, the topology information of the satellite optical network at different snapshots can also be obtained by calculating the ephemeris of the satellite constellation. The overall topology change of the integrated space-ground optical network over time can be obtained at the network control center by collecting the satellite optical network topology information, satellite-ground link information, and ground optical network information. Therefore, the overall topology of the integrated space-ground optical network for each time slice during the service duration can be directly obtained from the network control center.

[0088] In one implementation, according to the wavelength occupancy of the link and the service bandwidth requirement, it is determined whether there is a second available path between the source node and the destination node in a time period, including: performing an intersection process on the network topologies corresponding to each time slice in the time period to obtain the intersection topology corresponding to the time period; under the intersection topology corresponding to the time period, according to the wavelength occupancy of the link and the service bandwidth requirement, it is determined whether there is an available path between the source node and the destination node.

[0089] Specifically, if it is determined that the arrival time and the end time of the service request are in different time slices, then the wavelength usage of the links in the network topologies of each time slice needs to be considered. The wavelength usage of each link in the first time slice topology is still calculated according to the wavelength usage of the link at the arrival time of the service request. The wavelength usage of each link in the remaining time slice topologies is calculated according to the wavelength usage of the link at the start time of the time slice.

[0090] Since wavelength resources are reserved for the finally calculated service path during the service duration, according to the service survival situation in the current network, the network control center can know the wavelength usage of these services on the links in each future time slice. Thus, the available link set and the unavailable link set can be calculated, where is the available link set in the topology of the i-th time slice during the service duration, is the unavailable link set in the topology of the i-th time slice during the service duration.

[0091] Furthermore, according to the second available path corresponding to the time period, the corresponding number of wavelengths is allocated to the service in different network segments, including: if the second available path is a single path, the corresponding number of wavelengths is allocated to the service in different network segments according to the second available path; if the second available path is at least two paths, based on the shortest path algorithm, the path with the shortest distance in the second available paths is obtained; the corresponding number of wavelengths is allocated to the service in different network segments according to the path with the shortest distance in the second available paths. The specific method for allocating wavelengths according to the second available path in this embodiment is similar to the method for allocating wavelengths according to the first available path, and will not be elaborated here.

[0092] When allocating wavelengths, the links in the same network segment on one path need to satisfy the wavelength consistency constraint, and different wavelengths can be allocated to the links in different network segments, and the same wavelength is selected for the links in the same network segment. According to the first hit strategy, the required number of wavelengths is allocated to the links on the paths calculated for the service in each time period according to the network segments to which they belong and After wavelength allocation, the wavelength occupancy information of the overall network links is updated.

[0093] In some embodiments, determining whether there is an available path between a source node and a destination node according to the wavelength occupancy of a link and the service bandwidth requirement may include: determining at least one path between the source node and the destination node; performing the following processing on each link in the at least one path to determine whether there is an available path between the source node and the destination node: determining the number of idle wavelengths on the link in each time slice according to the wavelength occupancy of the link during the service duration; determining the number of wavelengths to be allocated corresponding to the link according to the service bandwidth requirement and the bandwidth of the wavelengths in the network segment corresponding to the link; if the number of idle wavelengths is greater than or equal to the number of wavelengths to be allocated, determining the link as an available link.

[0094] After the service completes data transmission in each time slice, release the wavelength resources and update the wavelength occupancy information of the overall network link.

[0095] Still referring to Figure 4 , first combine 4 time slices into a time period to obtain the intersection topology of the topology in the 4 time slices, that is, only retain the nodes and links that are included in all 4 time slice topologies in this intersection topology. The path calculated under this intersection topology is the path without link switching. If a shortest path can be calculated under this intersection topology using Dijkstra's algorithm, then the routing calculation ends.

[0096] If a service path cannot be obtained in this intersection topology, then only a path that needs to be switched can be established. If the number of switchings is k, then combine n time slices into k + 1 time periods. It is sufficient to calculate a path in each topology of the k + 1 time periods (the first time period only contains wavelength available links). When combining n time slices into k + 1 time periods, each time period needs to satisfy time continuity.

[0097] To minimize the number of handovers, traverse from 1 to n according to the number of handovers until a path is calculated and the routing calculation ends. Combine the 4 time slices. When the number of handovers is 1, following the principle of preferentially selecting a long duration, the first time period can be the first 3 time slices, and the second time period is the last 1 time slice, that is, divided as {3,1}; if a path cannot be calculated in both the intersection topology of the first 3 time slices and the topology of the last 1 time slice, then reduce the number of time slices in the first time period by 1, that is, the first time period is the first 2 time slices, and the last 2 time slices form the second time period, that is, combined as {2,2}; if a path still cannot be calculated in the intersection topology of the two time periods, then combine as {1,3}, and if still a path cannot be calculated in the intersection topology of the two time periods, then the number of handovers is 2, and the 4 time slices are divided into 3 time periods. First, let the third time period be the last 1 time slice, and then the first two time periods are divided according to the division method when the number of handovers is 1 for the first 3 time slices, that is, combined as {2,1,1}, {1,2,1} in sequence, and then add the number of time slices in the last time period, combined as {1,1,2}. If still a path cannot be calculated in the intersection topology of the two time periods, then the number of handovers is 3, that is, a single time slice is a time period {1,1,1,1}. If a path still cannot be calculated in the topology of each time period, then the service is blocked.

[0098] Figure 8 This is a schematic diagram of the space-ground integrated optical network topology under a time slice provided by an embodiment of the present application. Among them, v S1 ~v S9 represent satellite nodes, and v G1 ~v G5 represent ground nodes. Figure 8 It also shows the wavelength occupancy situation of the links. Solid squares indicate wavelength occupancy, and hollow squares indicate wavelength availability. Suppose there is a service whose duration does not exceed one time slice (assuming one time slice T s has 100 time slots T t ). Suppose the total number of wavelengths of the inter-satellite links is 8, the total number of wavelengths of the satellite-ground links is 6, and the total number of wavelengths of the ground links is 10. Taking the service request r2 as an example, the connectivity of its source node and destination node is both 3. It is calculated that the required wavelengths of the inter-satellite links, satellite-ground links, and ground links for the service are all 1. Figure 9 This is a routing schematic diagram under a time slice provided by an embodiment of the present application. The path of the service under the network topology at the service arrival time is shown by the dotted line.

[0099] Figure 10This is a schematic diagram of the space-ground integrated optical network topology under two adjacent time slices provided by the embodiments of the present application, including the topology schematic diagram (a) of the space-ground integrated optical network under the previous time slice and the topology schematic diagram (b) of the space-ground integrated optical network under the adjacent next time slice. Suppose there is a service request spanning these two time slices. Figure 11 This is a schematic diagram of the intersection topology under two adjacent time slices provided by the embodiments of the present application, which is Figure 10 the network topology intersection shown for two adjacent time slices. In this intersection topology, since there is no way to establish a connected path between node v S4 and node v G4 , only a handover path can be established.

[0100] Figure 12 This is a routing schematic diagram under two adjacent time slices provided by the embodiments of the present application, including the routing schematic diagram (a) under the previous time slice and the routing schematic diagram (b) under the adjacent next time slice. As Figure 11 shown, a path can be established respectively in the network topologies of these two time slices (as shown by the dotted line in the figure). Before service transmission, the wavelength resources of these two paths are pre-allocated. When the first time slice ends, that is, after the topology change occurs, the service data can be directly switched from the path in the topology of the first time slice to the path established in the topology of the second time slice for transmission.

[0101] The following are the device embodiments of the present application, which can be used to execute the method embodiments of the present application. For the details not disclosed in the device embodiments of the present application, please refer to the method embodiments of the present application.

[0102] Figure 13 This is a schematic structural diagram of a resource allocation device provided by the embodiments of the present application. The resource allocation device 1300 is applicable to the space-ground integrated optical network. The space-ground integrated optical network includes an inter-satellite network segment, a space-ground network segment, and a ground network segment. As Figure 13 shown, the resource allocation device 1300 includes:

[0103] An acquisition module 1301, configured to acquire service request information, where the service request information includes the service bandwidth requirement of the service request, the service arrival time, and the service duration;

[0104] A first determination module 1302, configured to determine the service end time according to the service arrival time and the service duration;

[0105] A second determination module 1303, configured to determine whether the network topology of the space-ground integrated optical network remains fixed and unchanged during the time period from the service arrival time to the service end time;

[0106] A resource allocation module 1304, configured to allocate resources for a service according to the service bandwidth requirement under the network topology at the service arrival time when it is determined that the network topology is fixed;

[0107] The resource allocation module 1304 is further configured to allocate resources for the service according to the intersection of multiple network topologies between the service arrival time and the service end time and the service bandwidth requirement when it is determined that the network topology is not fixed.

[0108] Optionally, the service request information includes the source node and the destination node of the service request. Correspondingly, the resource allocation module 1304 may specifically be configured to: under the network topology at the service arrival time, determine whether there is a first available path between the source node and the destination node according to the wavelength occupancy of the link and the service bandwidth requirement; if the first available path is a single path, allocate corresponding numbers of wavelengths for the service in different network segments according to the first available link; if the first available path is at least two paths, obtain the path with the shortest distance in the first available paths based on the shortest path algorithm; allocate corresponding numbers of wavelengths for the service in different network segments according to the path with the shortest distance in the first available paths.

[0109] Optionally, based on that the service request information includes the source node and the destination node of the service request, correspondingly, the resource allocation module 1304 may specifically further be configured to: obtain multiple network topologies and the change time points of the network topologies within the time period from the service arrival time to the service end time; determine multiple time slices according to the service arrival time, the service end time, and the change time points; perform a combination process on the multiple time slices based on the principle of minimizing the number of link switches to obtain multiple time periods, and adjacent time periods satisfy time continuity; for each time period in the multiple time periods, determine whether there is a second available path between the source node and the destination node according to the wavelength occupancy of the link and the service bandwidth requirement based on the routing algorithm of the intersection topology; if there is a second available path in each time period of the multiple time periods, allocate corresponding numbers of wavelengths for the service in different network segments according to the second available path corresponding to the time period within the corresponding time period.

[0110] Optionally, the resource allocation module 1304 may specifically further be configured to: perform an intersection process on the network topologies corresponding to each time slice within the time period to obtain the intersection topology corresponding to the time period; under the intersection topology corresponding to the time period, determine whether there is an available path between the source node and the destination node according to the wavelength occupancy of the link and the service bandwidth requirement.

[0111] Optionally, the resource allocation module 1304 may specifically be further configured to: if the second available path is a single path, allocate corresponding numbers of wavelengths for services according to the links of the second available path in different network segments; if the second available path is at least two paths, obtain the path with the shortest distance among the second available paths based on the shortest path algorithm; and allocate corresponding numbers of wavelengths for services in different network segments according to the path with the shortest distance among the second available paths.

[0112] Optionally, the resource allocation device 1300 further includes a third determination module, configured to: determine at least one path between a source node and a destination node; perform the following processing on each link in the at least one path to determine whether there is an available path between the source node and the destination node: determine the number of idle wavelengths on the link in each time slice according to the wavelength occupancy of the link during the service duration; determine the number of wavelengths to be allocated corresponding to the link according to the service bandwidth requirement and the bandwidth of the wavelengths in the network segment corresponding to the link; and if the number of idle wavelengths is greater than or equal to the number of wavelengths to be allocated, determine that the link is an available link.

[0113] Optionally, the resource allocation device 1300 further includes a fourth determination module, configured to: if there is no second available path in any of multiple time periods, re - execute the combination processing of multiple time slices to obtain multiple time periods; if there are still time periods without a second available path after traversing the combination methods, increase the link switching times and re - execute the combination processing of multiple time slices to obtain multiple time periods; and if the link switching times reach n - 1 and there are still time periods without a second available link after traversing the combination methods, determine that the service is blocked; where the link switching times is an integer less than n, and n is the number of time slices during the service duration.

[0114] The device provided in the embodiments of the present application can be used to execute the resource allocation method in the above - mentioned embodiments, and its implementation principle and technical effects are similar, which will not be elaborated here.

[0115] Figure 14 This is a schematic structural diagram of an electronic device provided in the embodiments of the present application. As Figure 14 shown, the electronic device 1400 includes:

[0116] a processor 1401, a memory 1402, a communication interface 1403, and a system bus 1404.

[0117] Among them, the memory 1402 and the communication interface 1403 are connected to the processor 1401 through the system bus 1404 and complete mutual communication. The memory 1402 is used to store computer - executable instructions, the communication interface 1403 is used to communicate with other devices, and the processor 1401 is used to execute the computer - executable instructions to execute the resource allocation method solution in the above - mentioned method embodiments.

[0118] Specifically, the processor 1401 may include one or more processing units. For example, the processor 1401 may be a CPU, or may be a digital signal processing (DSP), an application specific integrated circuit (ASIC), etc. The general-purpose processor may be a microprocessor or any conventional processor, etc. The steps of the method disclosed in combination with the application can be directly implemented by a hardware processor, or implemented by a combination of hardware and software modules in the processor.

[0119] The memory 1402 may be used to store program instructions. The memory 1402 may include a program storage area and a data storage area. Among them, the program storage area may store an operating system, application programs required for at least one function (such as a sound playback function, etc.). The data storage area may store data created during the use of the electronic device 1400 (such as audio data, etc.). In addition, the memory 1402 may include a high-speed random access memory, and may also include a non-volatile memory, such as at least one magnetic disk storage device, a flash memory device, a universal flash storage (UFS), etc. The processor 1401 executes various functional applications and data processing of the electronic device 1400 by running the program instructions stored in the memory 1402.

[0120] The communication interface 1403 may provide solutions for wireless communications including 2G / 3G / 4G / 5G, etc. applied to the electronic device 1400. The communication interface 1403 may receive electromagnetic waves by an antenna, filter, amplify, etc. the received electromagnetic waves, and transmit them to a modulation and demodulation processor for demodulation. The communication interface 1403 may also amplify the signal modulated by the modulation and demodulation processor and convert it into electromagnetic waves through the antenna for radiation. In some embodiments, at least some functional modules of the communication interface 1403 may be disposed in the processor 1401. In some embodiments, at least some functional modules of the communication interface 1403 and at least some modules of the processor 1401 may be disposed in the same device.

[0121] It should be noted that in the original text, "114G" is likely incorrect. I have translated it as "5G" according to common sense in the context of wireless communication development. If this is not what you intended, please correct the original text.The system bus 1404 can be a Peripheral Component Interconnect (PCI) bus, an Extended Industry Standard Architecture (EISA) bus, or the like. The system bus 1404 can be divided into an address bus, a data bus, a control bus, etc. For the sake of simplicity, only a thick line is used to represent it in the figure, but it does not mean that there is only one bus or one type of bus.

[0122] It should be noted that the number of the memories 1402 and the processors 1401 is not limited in the embodiments of the present application, and each of them can be one or more. Figure 14 Taking one as an example for illustration; between the memories 1402 and the processors 1401, they can be connected in a wired or wireless manner through various means, such as through a bus connection. In practical applications, the electronic device 1400 can be various forms of computers or mobile terminals. Among them, the computer is, for example, a laptop computer, a desktop computer, a workbench, a server, a blade server, a mainframe computer, etc.; the mobile terminal is, for example, a personal digital assistant, a cellular phone, a smart phone, a wearable device, and other similar computing devices.

[0123] The electronic device in this embodiment can be used to execute the technical solutions in the above method embodiments. The implementation principles and technical effects are similar, and will not be elaborated here.

[0124] The embodiments of the present application further provide a computer-readable storage medium, in which computer-executable instructions are stored. When the computer-executable instructions are executed by a processor, they are used to implement the resource allocation method in the above method embodiments.

[0125] The embodiments of the present application further provide a computer program product, including a computer program; when the computer program is executed, it implements the resource allocation method in the above method embodiments.

[0126] Those skilled in the art will readily think of other implementation manners of the present application after considering the specification and practicing the invention disclosed herein. The present application is intended to cover any variations, uses, or adaptations of the present application. These variations, uses, or adaptations follow the general principles of the present application and include the common general knowledge or conventional technical means in the technical field not disclosed in the present application. The specification and the embodiments are only regarded as exemplary, and the true scope and spirit of the present application are pointed out by the following claims.

[0127] It should be understood that the present application is not limited to the exact structures described above and shown in the drawings, and various modifications and changes can be made without departing from its scope. The scope of the present application is only limited by the appended claims.

Claims

1. A resource allocation method, characterized in that, Applicable to the space-ground integrated optical network, the space-ground integrated optical network includes an inter-satellite network segment, a space-ground network segment, and a ground network segment, and the resource allocation method includes: Obtain service request information, where the service request information includes the service bandwidth requirement, service arrival time, and service duration of the service request; Determine the service end time according to the service arrival time and the service duration; During the time period from the service arrival time to the service end time, determine whether the network topology of the space-ground integrated optical network remains fixed; If so, allocate resources for the service according to the service bandwidth requirement under the network topology at the service arrival time; If not, allocate resources for the service according to the intersection of multiple network topologies between the service arrival time and the service end time and the service bandwidth requirement; The service request information includes the source node and the destination node of the service request. Allocating resources for the service according to the intersection of multiple network topologies between the service arrival time and the service end time and the service bandwidth requirement includes: Obtain multiple network topologies and the change time points of the network topologies during the time period from the service arrival time to the service end time; Determine multiple time slices according to the service arrival time, the service end time, and the change time points; Based on the principle of minimizing the number of link switches, perform combination processing on the multiple time slices to obtain multiple time periods, and adjacent time periods satisfy time continuity; For each time period in the multiple time periods, based on the routing algorithm of the intersection topology, determine whether there is a second available path between the source node and the destination node according to the wavelength occupancy of the link and the service bandwidth requirement; If there is a second available path in each time period of the multiple time periods, then within the corresponding time period, allocate the corresponding number of wavelengths for the service in different network segments according to the second available path corresponding to the time period.

2. The resource allocation method according to claim 1, wherein The service request information includes the source node and the destination node of the service request. Allocating resources for the service according to the service bandwidth requirement under the network topology at the service arrival time includes: Under the network topology at the corresponding service arrival time, determine whether there is a first available path between the source node and the destination node according to the wavelength occupancy of the link and the service bandwidth requirement; If the first available path is a single path, allocate the corresponding number of wavelengths for the service in different network segments according to the first available path; If the first available path is at least two paths, based on the shortest path algorithm, obtain the path with the shortest distance among the first available paths; Allocate the corresponding number of wavelengths for the service in different network segments according to the path with the shortest distance among the first available paths.

3. The resource allocation method according to claim 1, wherein The routing algorithm based on the intersection topology determines whether there is a second available path between the source node and the destination node under the time period according to the wavelength occupancy of the link and the service bandwidth requirement, including: Perform an intersection operation on the network topologies corresponding to each time slice within the time period to obtain the intersection topology corresponding to the time period; Under the intersection topology corresponding to the time period, determine whether there is an available path between the source node and the destination node according to the wavelength occupancy of the link and the service bandwidth requirement.

4. The resource allocation method according to claim 1, wherein Allocating corresponding numbers of wavelengths for the service in different network segments according to the second available path corresponding to the time period includes: If the second available path is a single path, allocate corresponding numbers of wavelengths for the service according to the links of the second available path in different network segments; If the second available path is at least two paths, obtain the path with the shortest distance among the second available paths based on the shortest path algorithm; Allocate corresponding numbers of wavelengths for the service according to the path with the shortest distance among the second available paths in different network segments.

5. The resource allocation method according to any one of claims 2 to 4, characterized in that, Determining whether there is an available path between the source node and the destination node according to the wavelength occupancy of the link and the service bandwidth requirement includes: Determine at least one path between the source node and the destination node; Perform the following processing for each link in the at least one path to determine whether there is an available path between the source node and the destination node: According to the wavelength occupancy of the link during the service duration, determine the number of idle wavelengths on the link in each time slice; According to the service bandwidth requirement and the bandwidth of the wavelengths in the network segment corresponding to the link, determine the number of wavelengths to be allocated corresponding to the link; If the number of idle wavelengths is greater than or equal to the number of wavelengths to be allocated, determine that the link is an available link.

6. The resource allocation method according to any one of claims 3 to 4, characterized in that It also includes: If there is no second available path in any of the multiple time periods, re - execute the combination processing of the multiple time slices to obtain multiple time periods; If there are still time periods without a second available path after traversing the combination methods, increase the link switching times and re - execute the combination processing of the multiple time slices to obtain multiple time periods; If the link switching times reach n - 1 and there are still time periods without a second available path after traversing the combination methods, determine that the service is blocked; Wherein, the link switching times is an integer less than n, and n is the number of time slices during the service duration.

7. A resource allocation device, characterized in that, Applicable to the space - ground integrated optical network, the space - ground integrated optical network includes an inter - satellite network segment, a space - ground network segment, and a ground network segment, and the resource allocation device includes: An acquisition module, configured to acquire service request information, where the service request information includes the service bandwidth requirement of the service request, the service arrival time, and the service duration; A first determination module, configured to determine the service end time according to the service arrival time and the service duration; A second determination module, configured to determine whether the network topology of the space - ground integrated optical network remains fixed during the time period from the service arrival time to the service end time; A resource allocation module, configured to, when determining that the network topology is fixed, allocate resources for the service according to the service bandwidth requirement under the network topology at the service arrival time. The resource allocation module is further configured to allocate resources for the service according to the intersection of multiple network topologies between the service arrival time and the service end time and the service bandwidth requirement when it is determined that the network topology is not fixed; If the service request information includes the source node and the destination node of the service request, the resource allocation module is specifically configured to obtain multiple network topologies and the change time points of the network topologies within the time period from the service arrival time to the service end time; determine multiple time slices according to the service arrival time, the service end time and the change time points; perform combination processing on the multiple time slices based on the principle of minimizing the number of link switches to obtain multiple time periods, and adjacent time periods satisfy time continuity; for each time period in the multiple time periods, based on the routing algorithm of the intersection topology, determine whether there is a second available path between the source node and the destination node according to the wavelength occupancy of the link and the service bandwidth requirement; if there is a second available path in each time period of the multiple time periods, then within the corresponding time period, allocate the corresponding number of wavelengths for the service in different network segments according to the second available path corresponding to the time period.

8. An electronic device, characterized in that, Including: A memory, a processor; The memory is used to store program instructions; The processor is used to call the program instructions to execute the resource allocation method according to any one of claims 1 to 6.

9. A computer-readable storage medium, characterized in that, Computer-executable instructions are stored in the computer-readable storage medium, and when the computer-executable instructions are executed by the processor, they are used to implement the resource allocation method according to any one of claims 1 to 6.

Images