Satellite internet dynamic topology planning method and system based on service driving and electronic equipment

Abstract

The invention discloses a satellite internet dynamic topology planning method and system based on service driving and electronic equipment, and mainly solves the problem of slow network topology planning solution under the limited constraint of a transceiver in the prior art. The scheme comprises the following steps: generating a service set with front service deadline; representing nodes in the satellite internet by using a topology constraint network element model; according to all possible connection relations among the nodes, adding connection edges among the topology constraint network element models to construct time-period-sharing sub-graphs; a storage edge and a topology switching edge are added between the time-sharing sub-graphs, and a network topology planning graph is constructed; and calculating an end-to-end cross-time-period path for each service in sequence by using a shortest path algorithm of transmitting and receiving limited constraints, and generating a transceiver limited constraint network topology. According to the method, communication resources and storage resources in each time period can be fully utilized, the network topology meeting the limited constraint of the transceiver is quickly formulated for the service, and the method can be used for the satellite internet, the self-organizing network and the time delay tolerant network with limited transceivers.

Description

Technical Field

[0001] The present invention belongs to the field of communication technologies, and particularly relates to a method for dynamic topology planning of satellite Internet, which can be used for dynamic planning of network topologies such as satellite Internet, ad hoc network, and delay-tolerant network with limited transceivers. Background Art

[0002] As a key pillar for the development of 6G, satellite Internet provides reliable communication support for future application scenarios such as Internet of Things, telemedicine, smart city, autonomous driving, and emergency communication with its advantages of global coverage, low latency, and high bandwidth. Small satellites, with their advantages of low cost, short cycle, and flexible deployment, have become an important infrastructure for large-scale satellite Internet construction.

[0003] Due to limited satellite payloads, some satellite networks carry limited communication payloads. By dynamically adjusting the beam pointing, communication between adjacent satellites in the same orbital plane and adjacent satellites in different orbital planes can be achieved. In this scenario, it is necessary to adjust the satellite beam pointing on demand for tasks, that is, to construct a dynamic network topology to ensure network connectivity, end-to-end delay, and end-to-end bandwidth. When the network scale is large, the topology planning load is heavy and it is difficult to plan online. Therefore, a pre-planning mechanism is currently mostly used to construct the network topology, making it difficult to fully utilize communication resources. When there is a large file transfer or continuous end-to-end transfer demand, topology planning needs to be carried out according to the service. On the one hand, it is necessary to ensure the QoS of the service, and on the other hand, it is necessary to improve the service resource utilization rate. Based on this, there is an urgent need for an online topology planning method that faces service requirements, fully utilizes network resources, constructs a network topology, and ensures the QoS requirements of the service and network connectivity.

[0004] The patent document with the patent application number 201810270423.3 discloses a topology reconstruction method for rapid networking of inter-satellite laser communication. According to the forwarding hop count and connectivity constraints, it uses the minimum set rule to quickly find the minimum inter-satellite laser link set that meets the service requirements and realizes the rapid and flexible networking of inter-satellite laser link communication. Although this method considers the dynamic nature of network topology planning, it still has the following deficiencies:

[0005] 1) Regarding the network as a static graph, it does not characterize and utilize link resources and node storage resources at different time periods, restricting the search for cross-time connectivity paths between nodes and affecting the correctness of network dynamic topology planning;

[0006] 2) It does not consider the transceiver limitation constraint. The connectivity constraint it only considers is not completely equivalent to the transceiver limitation constraint, that is, the number of paths between nodes is often greater than the total number of neighbor nodes of this node, and it cannot be applied to the solution of network topology dynamic planning with transceiver limitations.

[0007] The patent document with the application number 202010738534.X discloses a service transmission method, device, electronic device and storage medium for a satellite network. According to the source and destination nodes of the target service and its time requirements, it determines the links in the virtual resource pool whose time slot information meets the time requirements to form a target path. Although this method considers the link resources in different time periods, it still does not consider the transceiver constraint, and cannot be directly applied to solve the problem of network topology dynamic programming with transceiver constraints. Summary of the Invention

[0008] The purpose of the present invention is to overcome the above-mentioned deficiencies of the prior art, and propose a service-driven dynamic topology planning method, system and electronic device for a satellite Internet, so as to consider the transceiver constraint and quickly solve the network topology under the transceiver constraint to meet the online service transmission requirements.

[0009] The technical idea for achieving the purpose of the present invention is: based on the transceiver constraint, construct a network topology planning graph model, and generate a network topology with transceiver constraint for service transmission by calculating the end-to-end cross-time period paths in the model.

[0010] According to the above idea, the implementation scheme of the present invention includes:

[0011] 1. A service-driven dynamic topology planning method for a satellite Internet, characterized by including:

[0012] Sort multiple services to generate a service set F with earlier service deadlines;

[0013] Each node in the satellite Internet is represented by a topology constraint network element model characterize, represent the node set of the topology constraint network element corresponding to the i-th node u in the q-th time period i,q corresponding, represent the edge set of the topology constraint network element corresponding to the i-th node u in the q-th time period i,q corresponding;

[0014] According to all possible connection relationships between nodes in the satellite Internet, add connection edges between the topology constraint network element models corresponding to network nodes Construct a sub-graph model G' of the satellite Internet topology planning graph for each time period q =(V′ q , E' q ), where represents the node set of the sub-graph for the q-th time period, represents the edge set of the sub-graph for the q-th time period;

[0015] Add storage edges between adjacent sub-graph models for each time period With the topological switching edge Construct a network topology planning graph model G' T =(V′ T ,E' T ,W′ T ), where V′ T ={V′ q} represents the node set of the network topology planning graph model, E' T ={E' q}∪E o ∪E · represents the edge set of the network topology planning graph model, W′ T ={w(u,v)} represents the time delay set of the edges in the network topology planning graph model, Represents The virtual receiving node in Represents The virtual receiving node in Represents The virtual sending node in, u and v represent any nodes in the network topology planning graph model;

[0016] In the network topology planning graph model G' T , use the shortest path algorithm with transceiver constraints to calculate the end-to-end cross-time path for each service in the service set in turn, and generate a network topology with transceiver constraints.

[0017] 2. A service-driven satellite Internet dynamic topology planning system, characterized in that it includes:

[0018] A service sorting module, configured to sort all services in the service set F according to the service deadline before and after, and obtain a sorted service set F';

[0019] A topology constraint network element construction module, configured to represent each node in the satellite Internet as a topology constraint network element model;

[0020] A sub-graph construction module for each time period, configured to add connection edges between the topology constraint network element models corresponding to the network nodes according to all possible connection relationships between the nodes in the satellite Internet, and generate a sub-graph for each time period of the network topology planning graph model;

[0021] A network topology planning model construction module, configured to add topological switching edges between adjacent sub-graphs for each time period, and generate a network topology planning graph;

[0022] A shortest path calculation module with transceiver constraints, configured to calculate the end-to-end cross-time path for all services in the service set F' in the network topology planning graph in turn, and generate a network topology with transceiver constraints.

[0023] Furthermore, the shortest path calculation module with transceiver constraints of the transceiver includes:

[0024] An initialization sub-module for setting the initial values of node attributes, end-to-end paths, candidate node sets, and permanent node sets used in the shortest path calculation process;

[0025] A node loop processing sub-module for taking out the node closest to the source node from the candidate node set each time and performing transceiver constraint judgment and node parameter update on its neighbor nodes;

[0026] A transceiver constraint judgment sub-module for excluding neighbor nodes that do not meet the transceiver constraints during the node loop processing;

[0027] A node parameter update sub-module for comparing the distance to the neighbor node through the current node with the current distance of the neighbor node and updating the delay parameter and parent node parameter of the neighbor node;

[0028] A loop termination sub-module for judging whether the target node enters the permanent node set or whether the candidate node set is empty, and terminating the node loop processing or continuing the node loop processing according to the judgment result;

[0029] A path backtracking sub-module for backtracking the end-to-end path according to the parent node information of each node;

[0030] A graph resource update sub-module for deleting all edges other than the topology switching edges in the network topology planning graph according to the end-to-end path completed by backtracking.

[0031] 3. An electronic device, including a memory, a processor, and a computer program stored on the memory and executable on the processor, wherein the program executed by the processor implements the service-driven satellite Internet dynamic topology planning method as described above.

[0032] 4. A non-volatile computer-readable storage medium, characterized in that the readable storage medium stores computer instructions for causing the computer to execute the service-driven satellite Internet dynamic topology planning method.

[0033] Through the above technical solutions, the present invention has the following advantages compared with the prior art:

[0034] First, the service sorting rule and the joint consideration of multi-service deadline indicators proposed by the present invention improve the number of successfully arranged services;

[0035] Second, by constructing a network topology planning graph model based on topology constraint network elements, the present invention jointly represents time resources, communication resources, and storage resources, accurately depicts the transceiver limited constraints, and can convert the network topology planning problem into a deterministic routing calculation problem of a graph, compressing the redundant solution space of the transceiver limited network topology planning problem;

[0036] Third, the shortest path algorithm for transceiver limited constraints proposed by the present invention solves the cross-period end-to-end path of services in the network topology planning graph. Compared with the method based on the planning solver, it has a low computational complexity, shortens the solution time of the transceiver limited network topology planning problem, and improves the transceiver limited network topology planning speed. BRIEF DESCRIPTION OF THE DRAWINGS

[0037] Figure 1 is the overall flowchart of the method for realizing the service-driven satellite Internet dynamic topology planning according to the embodiment of the present invention;

[0038] Figure 2 is the satellite network snapshot diagram used in the embodiment of the present method;

[0039] Figure 3 is the sub-flowchart for calculating the end-to-end cross-period path of each service in the service set in the embodiment of the present method;

[0040] Figure 4 is the topology constraint network element model diagram constructed in the embodiment of the method of the present invention;

[0041] Figure 5 is the sub-diagram by time period in the embodiment of the method of the present invention;

[0042] Figure 6 is the network topology planning graph constructed in the embodiment of the method of the present invention;

[0043] Figure 7 is the principle block diagram of the service-driven satellite Internet dynamic topology planning system according to the embodiment of the present invention;

[0044] Figure 8 is the block diagram of the electronic device according to the embodiment of the present invention. DETAILED DESCRIPTION OF THE EMBODIMENTS

[0045] The following further describes the embodiments of the present invention in detail with reference to the accompanying drawings

[0046] As Figure 2 shown, the implementation scenario of the present invention is a satellite Internet network including three satellite nodes, where the three satellite nodes are u 1 、u 2 、u 3 , the lengths of the three connection periods are the transceiver switching time, and all possible connection situations of the three connection periods are node u1 Connected to node u 2 Connected, node u 2 Connected to node u 1 , node u 3 Connected, node u 3 Connected to u 2 Connected.

[0047] Example 1, a business-driven dynamic topology planning method for satellite Internet.

[0048] Refer to Figure 1 , the implementation steps of this example include the following:

[0049] Step 1, sort multiple services to generate a service set F' with earlier service deadline.

[0050] Let the service set F = {f 1 , f 2} contain 2 services, namely f 1 = (u 1 , u 2 , 1, 3), f 2 = (u 1 , u 3 , 1, 2), where

[0051] The deadline of the first service f 1 is 3 connected time period lengths, and the deadline of the second service f 2 is 2 connected time period lengths. The data volumes of both services can be transmitted within any time period of the network;

[0052] Sort the services according to the service deadline size. According to the setting that the deadline of the first service f 1 is greater than the deadline of the second service f 2 , the sorted service set is obtained: F' = {f 2 , f 1}.

[0053] It should be noted that the "first" and "second" mentioned herein are used to distinguish similar objects, rather than limiting a specific order or sequence.

[0054] Step 2, represent each node in the satellite Internet network with a topology constraint network element model characterize.

[0055] 2.1) Map each node in the satellite Internet network to a topology constraint network element model containing 2 + 2M nodes. This model consists of M virtual receiving direction nodes, M virtual sending direction nodes, 1 virtual receiving node, and 1 virtual sending node. For example Figure 4as shown

[0056] In this embodiment, it is assumed that the total number of node transceiver directions is M = 2, where it is specified that the first transceiver direction is to the left and the second transceiver direction is to the right.

[0057] 2.2) Characterize the node u of the satellite Internet 1,1 as a topological constraint network element model

[0058] 2.2.1) Construct a set of topological constraint network element nodes

[0059] Let the first node u in the first time period 1,1 have a virtual transmission direction node in the second transceiver direction as

[0060] Let the first node u in the first time period 1,1 have a virtual receiving node in the second transceiver direction as

[0061] Let the first node u in the first time period 1,1 have a virtual receiving node as

[0062] Let the first node u in the first time period 1,1 have a virtual transmission node as

[0063] Use these set nodes to obtain a set of topological constraint network element nodes

[0064]

[0065] 2.2.2) Construct a set of topological constraint network element edges

[0066] Let the first node u in the first time period 1,1 have a virtual receiving edge in the second transceiver direction as

[0067] Let the first node u in the first time period 1,1 have a virtual transmission edge in the second transceiver direction as

[0068] Let the first node u in the first time period 1,1 have a virtual forwarding edge as

[0069] Use the set edges to construct a set of topological constraint network element edges

[0070]

[0071] 2.2.3) According to the node set and the edge set characterize node u 1,1 as a topological constraint network element

[0072]

[0073] 2.3) Characterize node u of the satellite interconnection network 2,1 as a topological constraint network element model

[0074] 2.3.1) Construct the node set of the topological constraint network element Let the second node u in the first time period 2,1 The virtual transmission direction node pointed to by the first transceiver is Let the second node u in the first time period 2,1 The virtual receiving node pointed to by the first transceiver is Let the second node u in the first time period 2,1 The virtual transmission direction node pointed to by the second transceiver is Let the second node u in the first time period 2,1 The virtual receiving node pointed to by the second transceiver is Let the second node u in the first time period 2,1 The virtual receiving node of is Let the second node u in the first time period 2,1 The virtual transmission node of is Use these set nodes to obtain the node set of the topological constraint network element

[0075]

[0076] 2.3.2) Construct the edge set of the topological constraint network element

[0077] Let the second node u in the first time period 2,1 The virtual receiving edge pointed to by the first transceiver is

[0078] Let the second node u in the first time period 2,1 The virtual transmission edge pointed to by the first transceiver is

[0079] Let the second node u in the first time period 2,1 The virtual receiving edge pointed to by the second transceiver is

[0080] Let the second node u in the first time period 2,1 The virtual transmission edge pointed to by the second transceiver is

[0081] Let the second node u in the first time period 2,1 The virtual forwarding edge of is Construct the topological constraint network element edge set using the set edges

[0082]

[0083] 2.3.3) According to the node set And the edge set Characterize the node u 2,1 As a topological constraint network element

[0084]

[0085] 2.4) Characterize the node u of the satellite interconnection network 3,1 As a topological constraint network element model

[0086] 2.4.1) Construct the topological constraint network element node set Let the third node u in the first time period 3,1 The virtual transmission direction node pointed to by the first transceiver is Let the third node u in the first time period 3,1 The virtual receiving node pointed to by the first transceiver is Let the third node u in the first time period 3,1 The virtual receiving node of is Let the third node u in the first time period 3,1 The virtual transmission node of is Obtain the topological constraint network element node set using the set nodes

[0087]

[0088] 2.4.2) Construct the topological constraint network element edge set

[0089] Let the third node u in the first time period 3,1 The virtual receiving edge pointed to by the first transceiver is

[0090] Let the third node u in the first time period 3,1 The virtual transmission edge pointed to by the first transceiver is

[0091] Let the third node u in the first time period 3,1 have a virtual forwarding edge of Construct a topological constraint network element edge set using the set edges

[0092]

[0093] 2.4.3) According to the node set and the edge set Characterize the node u 3,1 as a topological constraint network element

[0094]

[0095] 2.5) Characterize the node u of the satellite interconnection network 1,2 as a topological constraint network element model

[0096] 2.5.1) Construct a topological constraint network element node set Let the first node u in the second time period 1,2 have a virtual transmission direction node pointed by the second transceiver as Let the first node u in the second time period 1,2 have a virtual receiving node pointed by the second transceiver as Let the first node u in the second time period 1,2 have a virtual receiving node of Let the first node u in the second time period 1,2 have a virtual transmission node of Obtain a topological constraint network element node set using these set nodes

[0097]

[0098] 2.5.2) Construct a topological constraint network element edge set

[0099] Let the first node u in the second time period 1,2 have a virtual receiving edge pointed by the second transceiver as

[0100] Let the first node u in the second time period 1,2 have a virtual transmission edge pointed by the second transceiver as

[0101] Let the first node u in the second time period 1,2 have a virtual forwarding edge of Construct the set of edges of the topological constraint network element using the set edges

[0102]

[0103] 2.5.3) According to the set of nodes and the set of edges characterize the node u 1,2 as a topological constraint network element

[0104]

[0105] 2.6) Characterize the node u of the satellite interconnection network 2,2 as a topological constraint network element model

[0106] 2.6.1) Construct the set of nodes of the topological constraint network element Let the second node u in the second time period 2,2 The virtual transmission direction node pointed to by the first transceiver is Let the second node u in the second time period 2,2 The virtual receiving node pointed to by the first transceiver is Let the second node u in the second time period 2,2 The virtual transmission direction node pointed to by the second transceiver is Let the second node u in the second time period 2,2 The virtual receiving node pointed to by the second transceiver is Let the second node u in the second time period 2,2 The virtual receiving node of is Let the second node u in the second time period 2,2 The virtual transmission node of is Use these set nodes to obtain the set of nodes of the topological constraint network element

[0107]

[0108] 2.6.2) Construct the set of edges of the topological constraint network element

[0109] Let the second node u in the second time period 2,2 The virtual receiving edge pointed to by the first transceiver is

[0110] Let the second node u in the second time period 2,2 The virtual transmission edge pointed to by the first transceiver is

[0111] Let the second node u in the second time period 2,2 The virtual receiving edge pointed to by the second transceiver is

[0112] Let the second node u in the second time period 2,2 The virtual sending edge pointed to by the second transceiver is

[0113] Let the second node u in the second time period 2,2 Its virtual forwarding edge is Construct the topological constraint network element edge set using the set edges

[0114]

[0115] 2.6.3) According to the node set And the edge set Characterize the node u 2,2 As a topological constraint network element

[0116]

[0117] 2.7) Characterize the node u of the satellite interconnection network 3,2 As a topological constraint network element model

[0118] 2.7.1) Construct the topological constraint network element node set Let the third node u in the second time period 3,2 The virtual sending direction node pointed to by the first transceiver is Let the third node u in the second time period 3,2 The virtual receiving node pointed to by the first transceiver is Let the third node u in the second time period 3,2 Its virtual receiving node is Let the third node u in the second time period 3,2 Its virtual sending node is Obtain the topological constraint network element node set V using the set nodes u3,2 :

[0119]

[0120] 2.7.2) Construct the topological constraint network element edge set

[0121] Let the third node u in the second time period 3,2 The virtual receiving edge pointed to by the first transceiver is

[0122] Let the third node u in the second time period 3,2 The virtual transmission edge pointed to by the first transceiver is

[0123] Let the third node u in the second time period 3,2 The virtual forwarding edge of is Construct the topological constraint network element edge set using the set edges

[0124]

[0125] 2.7.3) According to the node set And the edge set Characterize the node u 3,2 As a topological constraint network element

[0126]

[0127] 2.8) Characterize the node u of the satellite interconnection network 1,3 As a topological constraint network element model

[0128] 2.8.1) Construct the topological constraint network element node set Let the first node u in the third time period 1,3 The virtual transmission direction node pointed to by the second transceiver is Let the first node u in the third time period 1,3 The virtual receiving node pointed to by the second transceiver is Let the first node u in the third time period 1,3 The virtual receiving node of is Let the first node u in the third time period 1,3 The virtual transmission node of is Obtain the topological constraint network element node set using the set nodes

[0129]

[0130] 2.8.2) Construct the topological constraint network element edge set

[0131] Let the first node u in the third time period 1,3 The virtual receiving edge pointed to by the second transceiver is

[0132] Let the first node u in the third time period 1,3 The virtual transmission edge pointed to by the second transceiver is

[0133] Let the first node u in the third time period 1,3 have a virtual forwarding edge of Use the set edges to construct the edge set of the topological constraint network element

[0134]

[0135] 2.8.3) According to the node set and the edge set Characterize the node u 1,3 as a topological constraint network element

[0136]

[0137] 2.9) Characterize the node u of the satellite interconnection network 2,3 as a topological constraint network element model

[0138] 2.9.1) Construct the node set of the topological constraint network element Let the second node u in the third time period 2,3 have a virtual transmission direction node pointed to by the first transceiver as Let the second node u in the third time period 2,3 have a virtual receiving node pointed to by the first transceiver as Let the second node u in the third time period 2,3 have a virtual transmission direction node pointed to by the second transceiver as Let the second node u in the third time period 2,3 have a virtual receiving node pointed to by the second transceiver as Let the second node u in the third time period 2,3 have a virtual receiving node of Let the second node u in the third time period 2,3 have a virtual transmission node of Use the set nodes to obtain the node set of the topological constraint network element

[0139]

[0140] 2.9.2) Construct the edge set of the topological constraint network element

[0141] Let the second node u in the third time period 2,3 have a virtual receiving edge pointed to by the first transceiver as

[0142] Let the second node u in the third time period 2,3The virtual transmission edge pointed to by the first transceiver is

[0143] Let the second node u in the third time period 2,3 The virtual receiving edge pointed to by the second transceiver is

[0144] Let the second node u in the third time period 2,3 The virtual transmission edge pointed to by the second transceiver is

[0145] Let the second node u in the third time period 2,3 The virtual forwarding edge of is Construct the topological constraint network element edge set using the set edges

[0146]

[0147] 2.9.3) According to the node set And the edge set Characterize the node u 2,3 As a topological constraint network element

[0148]

[0149] 2.10) Characterize the node u of the satellite interconnection network 3,3 As a topological constraint network element model

[0150] 2.10.1) Construct the topological constraint network element node set Let the third node u in the third time period 3,3 The virtual transmission direction node pointed to by the first transceiver is Let the third node u in the third time period 3,3 The virtual receiving node pointed to by the first transceiver is Let the third node u in the third time period 3,3 The virtual receiving node of is Let the third node u in the third time period 3,3 The virtual sending node of is

[0151] Obtain the topological constraint network element node set using the set nodes

[0152]

[0153] 2.10.2) Construct the topological constraint network element edge set

[0154] Let the third node u in the third time period 3,3 The virtual receiving edge pointed to by the first transceiver is

[0155] Let the third node u in the third time period 3,3 The virtual sending edge pointed to by the first transceiver is

[0156] Let the third node u in the third time period 3,3 The virtual forwarding edge of is

[0157] Construct the topological constraint network element edge set using the set edges

[0158]

[0159] 2.10.3) According to the node set And the edge set Characterize the node u 3,3 As a topological constraint network element

[0160]

[0161] Step 3, based on all possible connection relationships between nodes in the satellite interconnection network, add connection edges between the topological constraint network element models corresponding to network nodes Construct the sub-graph model G′ of the satellite interconnection network topology planning graph for each time period q =(V′ q , E' q ).

[0162] In this embodiment, based on Figure 2 All possible connection relationships between nodes in the satellite interconnection network, 4 connection edges need to be added between the topological constraint network elements corresponding to the nodes in the satellite interconnection network under each time period to form the sub-graph model for the corresponding time period, as shown in Figure 5 Shown

[0163] 3.1) Taking three time periods as an example, the 4 connection edges added in the first time period The 4 connection edges added in the second time period The 4 connection edges added in the third time period are Are respectively represented as follows:

[0164]

[0165] 3.2) Construct the sub-graph node set V′ for each time period q :

[0166] Let the \(i\)-th node \(u\) in the first time period i,1 The corresponding topological constraint network element node set is

[0167] Let the \(i\)-th node \(u\) in the second time period i,2 The corresponding topological constraint network element node set is

[0168] Let the \(i\)-th node \(u\) in the third time period i,3 The corresponding topological constraint network element node set is

[0169] Use the set nodes to obtain the node set of the first sub-time period sub-graph The node set of the second sub-time period sub-graph The node set of the third sub-time period sub-graph

[0170] 3.3) Construct the edge set \(E'\) of the sub-time period sub-graph for each time period q :

[0171] Let the \(i\)-th node \(u\) in the first time period i,1 The corresponding topological constraint network element edge set is

[0172] Let the \(i\)-th node \(u\) in the second time period i,2 The corresponding topological constraint network element edge set is

[0173] Let the \(i\)-th node \(u\) in the third time period i,3 The corresponding topological constraint network element edge set is

[0174] Use the set nodes and the connecting edges added in each time period to obtain the edge set of the first sub-time period sub-graph The edge set of the second sub-time period sub-graph The edge set of the third sub-time period sub-graph

[0175] 3.4) According to the node set \(V'\) q And the edge set \(E'\) q , obtain the sub-time period sub-graph \(G'\) q :

[0176] According to the node set \(V\) 1 ' of the sub-time period sub-graph in the first time period and the edge set \(E'\) 1 , obtain the sub-time period sub-graph \(G'\) 1 =(V 1 ', E' 1 );

[0177] According to the node set V' of the sub-graph by time period in the second time period 2 and the edge set E' 2 , the sub-graph by time period G' 2 =(V' 2 , E' 2 );

[0178] According to the node set V' of the sub-graph by time period in the third time period 3 and the edge set E 3 ', the sub-graph by time period G' 3 =(V' 3 , E' 3 ).

[0179] Step 4, add the storage edge E o and the topology switching edge E · between adjacent sub-graph models by time period to construct the network topology planning graph model G' T ;

[0180] 4.1) The storage edge E o and the topology switching edge E · added in this embodiment are represented as follows:

[0181]

[0182] 4.2) According to the node sets of the sub-graphs by time period in the above three time periods, obtain the node set V' of the network topology planning graph model T :

[0183] V' T ={V' 1 , V' 2 , V' 3};

[0184] 4.3) According to the edge sets of the sub-graphs by time period in the above three time periods, construct the edge set E' of the network topology planning graph model T :

[0185] E' T ={E′ 1 , E' 2 , E′ 3}∪E · ∪E o ;

[0186] 4.4) Construct the time delay set W' of the network topology planning graph model T :

[0187] Let w(u, v) represent the time delay parameter of any edge (u, v) in the edge set;

[0188] For edge (u, v) ∈ {E' q}, set the time delay of the edge as the transceiver switching time, i.e., w(u, v) = 40 ms;

[0189] For storage edge or topology switching edge (u, v) ∈ E · ∪E o , set the time delay of the edge as w(u, v) = 2 ms;

[0190] According to the set time delay parameters, obtain the time delay set W′ T :

[0191] W′ T = {w(u, v)};

[0192] 4.5) According to the node set V′ T , edge set E' T , and time delay set W′ T , obtain the network topology planning graph model G' T , as Figure 6 shown:

[0193] G' T = (V′ T , E' T , W′ T ).

[0194] Step Five, in the network topology planning graph model G' T , use the shortest path algorithm with transceiver constraints to calculate the end-to-end cross-time path for each service in the service set in turn, and generate the network topology with transceiver constraints.

[0195] Common shortest path algorithms include Dijkstra's algorithm, Bellman-Ford algorithm, and Floyd's algorithm, etc. In this embodiment, Dijkstra's algorithm with the optimal time complexity is selected but not limited to calculate the shortest end-to-end path with transceiver constraints.

[0196] Refer to Figure 3 , the implementation of this step includes the following:

[0197] 5.1) Take out the service f with the highest ranking from the service set F' i for path calculation, and delete the service f i from the service set F';

[0198] In this embodiment, the service f with the highest ranking i is f 2 ;

[0199] Take the service f iDelete from the service set F'. At this time, the service set F' is F' = {f 1};

[0200] 5.2) Initialize node attributes, end-to-end paths, super destination nodes, candidate node sets, and permanent node sets;

[0201] 5.2.1) Initialize the end-to-end path P fi as an empty set. In this embodiment, according to the service with the earliest order being f 2 , initialize

[0202] 5.2.2) Initialize the candidate node set to include all nodes in G' T , and the permanent node set S is an empty set;

[0203] In this embodiment, initialize the candidate node set permanent node set

[0204] 5.2.3) Define the parent node parameter as pre(·), which is used to record the previous hop node of this node in the end-to-end cross-time period path . For each node in the network topology planning graph model G' T , initialize the parent node of each node u as pre(u) = -1. In this embodiment, for the node u ∈ V′ T , initialize the parent node pre(u) = -1;

[0205] 5.2.4) Define the delay parameter dis(·), which is used to record the end-to-end cross-time period path delay from this node to the virtual receiving node corresponding to the service source node s i . For each node in the network topology planning graph model G' , initialize the path delay from each node u excluding the virtual receiving node to the virtual receiving node T as dis(u) = ∞, and the path delay from the virtual receiving node to itself is

[0206] In this embodiment, the source node sof the service f 2 is u i , and its corresponding virtual receiving node is 1 .

[0207] For the virtual receiving node initialize its delay parameter as For the node initialize the parent node dis(u) = +∞;

[0208] 5.2.5) Define the super destination node D for recording the last-hop node of the end-to-end path and initialize the super destination node D as empty. In this embodiment, initialize the super destination node D = 0;

[0209] 5.3) Select a node u with the shortest path delay to the virtual receiving node from the candidate node set , and at the same time delete this node from * and add it to the permanent node set S; In this embodiment, the node closest to the virtual receiving node

[0210] is deleted from and added to the permanent node set S. At this time, S = {u *}; *}

[0211] 5.4) Determine whether the delay parameter dis(u*) of node u* is greater than the deadline m of this service i ;

[0212] If dis(u * ) > m i , then execute step 5.8);

[0213] Otherwise, execute step 5.5);

[0214] In this embodiment, the deadline m 2 of service f 2 is 2 time period lengths, so m 2 = 80ms;

[0215] At this time, the node and

[0216] 5.5) Determine whether the node u * is the virtual sending node in the topological constraint network element corresponding to the service destination node d i ;

[0217] If the node u * is the virtual sending node then update the super destination node to and execute step 5.10);

[0218] Otherwise, execute step 5.6);

[0219] In this embodiment, the current node and

[0220] 5.6) Judging each neighbor v of node u in sequence * one by one * to see if it meets the transceiver constraint;

[0221] If node u * is the node and neighbor v * is and all three of these conditions hold simultaneously, then skip the current neighbor v * , until all neighbors have been traversed;

[0222] Otherwise, execute step 5.7);

[0223] In this embodiment, the neighbor nodes of the current node u * are and Because for the node the above three conditions do not hold simultaneously, so for the two neighbor nodes and both execute step 5.7);

[0224] 5.7) According to the delay parameter dis(u * ) of node u * and the propagation delay w(u * , v * ) of the edge (u * , v * ), judge whether the delay parameter dis(v * ) and the parent node pre(v * ) of neighbor v * ) can be updated;

[0225] If dis(u * ) + w(u * , v * ) < dis(v * ), then update the delay parameter of neighbor v * to: dis(v * ) = dis(u * ) + w(u * , v * ), and update the parent node parameter of neighbor v * to pre(v * ) = u * ;

[0226] Otherwise, do not update the delay parameter dis(v * ) and the parent node pre(v * ) of neighbor v * ;

[0227] In this embodiment, through node u * the delay parameter and the propagation delay of the edge the propagation delay of the edge the edge the propagation delay of the edge update the delay parameters of the neighbor nodes and ;

[0228] For neighbor node Because so update neighbor the delay parameter is and the parent node parameter of is updated to

[0229] For neighbor node Because so update neighbor the delay parameter is and the parent node parameter of is updated to

[0230] 5.8) Compare the number of nodes in the current candidate node set with 0;

[0231] If then execute step 5.9);

[0232] Otherwise, return to step 5.3);

[0233] In this embodiment, the current candidate node set is and so return to step 5.2), until

[0234] 5.9) Determine whether the super destination node D is empty;

[0235] If D is not empty, execute step 5.10);

[0236] Otherwise, the end-to-end path does not exist, execute step 5.14);

[0237] In this embodiment, when the super destination node is is not empty, so execute step 5.10);

[0238] 5.10) Define the symbol J to record the nodes that appear during the backtracking path. Initially, J = D;

[0239] In this embodiment, the super destination node is Initialization symbol

[0240] 5.11) Add node J to the end - to - end path and update node J as its parent node;

[0241] In this embodiment, add J to the end - to - end path to obtain Because the parent node of node is so update the symbol

[0242] 5.12) Compare node J with the set initial value - 1 to determine whether the end - to - end path has completed backtracking;

[0243] If J = - 1, then the end - to - end path has completed backtracking, and execute step 5.13);

[0244] Otherwise, return to step 5.11);

[0245] In this embodiment, the current node Because J ≠ - 1, so return to step 5.10) until the path search is completed;

[0246] 5.13) Delete all edges except the topology - switching edges included in the end - to - end path T in the network topology planning graph model G' The edges included in the end - to - end path

[0247] In this embodiment, for service f 2 the shortest - delay end - to - end path is

[0248]

[0249] Except for the topology - switching edge it is necessary to delete the edge set E formed by adjacent nodes in the path ～ as follows:

[0250]

[0251] After deletion, the edge set E' T of the network topology planning graph model is updated to:

[0252] E' T = E' T - E ～ .

[0253] 5.14) Compare the number of services in the service set F' with the value 0 to determine whether the paths of all services have been calculated:

[0254] If |F'|=0, the paths of all services are calculated and the network topology with restricted transceiver constraints is output;

[0255] Otherwise, return to step 5.1);

[0256] In this embodiment, the current number of services is |F'|=1≠0, then return to step 5.1) until service f 1 The path calculation is completed, and the service f 1 The shortest delay end-to-end path for:

[0257]

[0258] According to business 1 The end-to-end path With business 2 The end-to-end path The network topology with restricted transceiver constraints can be obtained as the connection edges between topology-constrained network elements in all paths:

[0259] Example 2: Satellite Internet Dynamic Topology Planning System Based on Business Driven

[0260] Reference Figure 7 This example includes: a service sorting module 1, a topology constraint network element construction module 2, a time period sub-graph construction module 3, a network topology planning model construction module 4, and a transceiver restricted constraint shortest path calculation module 5, wherein the transceiver restricted constraint shortest path calculation module 5 includes: a service loop processing sub-module 51, an initialization sub-module 52, a node loop processing sub-module 53, a transceiver restricted constraint judgment sub-module 54, a node parameter update sub-module 55, a loop termination sub-module 56, a path backtracking sub-module 57, a graph resource update sub-module 58, and a service calculation termination sub-module 59.

[0261] The whole system works as follows:

[0262] The service sorting module 1 sorts all services in the service set F in the order of the service deadline before and after, and obtains the sorted service set F'; the topology constraint network element construction module 2 represents each node in the satellite Internet as a topology constraint network element model and outputs it to the sub-graph construction module 3 by time period; the sub-graph construction module 3 by time period adds connection edges between the topology constraint network element models according to all possible connection relationships between nodes in the satellite Internet to obtain a sub-graph by time period and outputs it to the network topology planning model construction module 4; the network topology planning model construction module 4 adds topology switching edges between the sub-graphs by time period to obtain a network topology planning graph and outputs it to the shortest path calculation module 5 with transceiver constraints; the shortest path calculation module 5 with transceiver constraints is used to calculate the end-to-end cross-time period paths for all services in the network topology planning graph generated by the network topology planning model construction module according to the service set F' output by the service sorting module, and outputs the network topology with transceiver constraints. The specific implementation is as follows:

[0263] The service loop processing sub-module 51 takes out the service with the earliest deadline in the service set for path calculation in each loop and outputs it to the initialization sub-module 52;

[0264] The initialization sub-module 52 initializes the node attributes, end-to-end paths, super destination nodes, candidate node sets, and permanent node sets used in the shortest path calculation process and outputs them to the node loop processing sub-module 53;

[0265] The node loop processing sub-module 53 takes out the node closest to the source node from the candidate node set in each loop and outputs its neighbor nodes to the transceiver constraint judgment sub-module 54;

[0266] The transceiver constraint judgment sub-module 54 judges whether the neighbor nodes meet the transceiver constraints, retains the neighbor nodes that meet the transceiver constraints according to the judgment results, and outputs the neighbor nodes to the node parameter update sub-module 55;

[0267] The node parameter update sub-module 55 compares the distance from the current node to the neighbor node with the current distance of the neighbor node, updates the delay parameter and parent node parameter of the neighbor node, and outputs them to the loop termination sub-module 56;

[0268] The loop termination sub-module 56 judges whether the target node enters the permanent node set or the candidate node set is empty, terminates the node loop processing process according to the judgment results, and outputs the super destination node to the path backtracking sub-module 57, or feedbacks it to the node loop processing sub-module 53 to continue the node loop processing;

[0269] The path backtracking sub-module 57 backtracks the end-to-end path according to the parent node information of each node, and outputs the path to the graph resource update sub-module 58;

[0270] The graph resource update sub-module 58 deletes all edges other than the topology switching edges in the network topology planning graph according to the end-to-end path obtained by backtracking;

[0271] The service calculation termination sub-module 59 determines whether the service set is empty, terminates the service loop processing process according to the judgment result, outputs the transceiver-constrained network topology, or feeds back to the service loop processing sub-module 51 to continue the service loop processing.

[0272] It should be particularly noted that in Figure 7 Each functional module in the embodiment can be implemented in whole or in part by software, hardware, firmware, or any combination thereof. When implemented using software, it can appear in whole or in part in the form of a program instruction product. The program instruction product includes one or a set of program instructions. When the program instructions are loaded and executed on a computer, the processes or functions according to the present disclosure are generated in whole or in part. The computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable devices. The program instructions can be stored in a computer-readable storage medium, or transmitted from one computer-readable storage medium to another computer-readable storage medium.

[0273] Embodiment 3: An electronic device

[0274] Referring to Figure 8 , this example includes: a processor, a memory, an input / output interface, a communication interface, and a bus. Among them, the processor, the memory, the input / output interface, and the communication interface are communicatively connected to each other inside the device through the bus.

[0275] The processor can be implemented in the form of a general-purpose central processing unit CPU, a microprocessor, an application-specific integrated circuit ASIC, or one or more integrated circuits, etc., and is used to execute relevant programs to implement the technical solutions provided in the embodiments of this specification.

[0276] The memory can be a read-only memory ROM, a flash memory, a hard disk drive HDD, or a solid-state disk SSD, and is used to store an operating system and other application programs. When implementing the technical solutions provided in the embodiments of this specification through application programs or firmware, the relevant program codes are stored in the memory and called and executed by the processor.

[0277] The input / output interface is used to connect to an input / output module to achieve information input and output. The input / output module can be configured as a component in a device or externally connected to other devices to provide corresponding functions. The input devices may include a keyboard, a mouse, a touch screen, a microphone, various sensors, etc., and the output devices may include a display, a speaker, a vibrator, an indicator light, etc.

[0278] The communication interface is used to connect to a communication module to achieve communication and interaction between this device and other devices. The communication module can achieve communication through wired means such as USB and network cable, or through wireless means such as mobile network, WIFI, and Bluetooth.

[0279] The bus includes a path that is used for information transmission between components such as the processor, the memory, the input / output interface, and the communication interface of the device.

[0280] The electronic device can execute, by running computer program instructions, methods such as Figure 1 Those in. Exemplarily, the electronic device can be a distributed computing node system, a server group / server, a desktop computer, a laptop computer, etc., so as to be used to run a topology planning method such as Figure 1 Those in to complete the topology planning of a transceiver-constrained network.

[0281] It should be noted that although the above device only shows a processor, a memory, an input / output interface, a communication interface, and a bus, in the specific implementation process, the device may also include other components necessary for normal operation. In addition, those skilled in the art can understand that the above device may also only include the components necessary to implement the solution of the embodiments of this specification, and does not necessarily include all the components shown in the figure.

[0282] Embodiment 4: A non-volatile computer-readable storage medium

[0283] The non-volatile computer-readable storage medium provided by the embodiments of the present invention stores multiple instructions that can be loaded by a processor to execute the steps in any one of the service-driven satellite Internet dynamic topology planning methods provided by the embodiments of the present invention.

[0284] The non-volatile computer-readable storage medium of this embodiment includes removable media such as USB flash drives, optical discs, solid-state drives (SSDs), and non-removable media such as hard disk drives (HDDs), read-only memories (ROMs), and compact disc read-only memories (CD-ROMs). Information storage can be achieved by any method or technology. The information includes computer-readable instructions, data structures, program modules, or other data. The non-volatile computer-readable storage medium includes, but is not limited to, read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), compact disc read-only memory (CD-ROM), digital versatile disc (DVD), or other optical storage, magnetic cassette tapes, magnetic disk storage, or other magnetic storage devices, and any other non-transmission medium that can be used to store information accessible by a computing device.

[0285] The above description is only a few specific examples of the present invention and does not constitute any limitation to the present invention. Obviously, for professionals in the field, after understanding the content and principle of the present invention, various modifications and changes in form and details may be made without departing from the principle and structure of the present invention. However, these corrections and changes based on the idea of the present invention are still within the scope of protection of the claims of the present invention.

[0286] It should be noted that the step numbers in the specification and claims of the present invention are only for a clear description of the implementation embodiments of the present invention for easy understanding, and their sequence order is not limited.

Claims

1. A satellite Internet dynamic topology planning method based on business drive, characterized in that: include: Sort multiple services to generate a service set F' with earlier service deadlines; Each node in the satellite internet network is modeled as a topology-constrained network element. Characterization, represents the i-th node u in the q-th period i,q The node set of the corresponding topology constraint network element, represents the i-th node u in the q-th period i,q The edge set of the corresponding topology constraint network element; According to all possible connection relationships between nodes in the satellite Internet network, connection edges are added between the topological constraint network element models corresponding to the network nodes. Constructing the time-division subgraph model G' of satellite internet topology planning diagram q =(V′ q ,E' q ),in represents the node set of the qth time period subgraph, represents the edge set of the time-divided subgraph in the qth time period; Add storage edges between adjacent time-segment subgraph models Switch edges with topology Constructing the network topology planning graph model G' T =(V′ T ,E' T ,W′ T ), where V′ T = {V′ q } represents the node set of the network topology planning graph model, E' T ={E' q }∪E o ∪E · Represents the edge set of the network topology planning graph model, W′ T ={w(u,v)} represents the delay set of the edges in the network topology planning graph model, express The virtual receiving node in express The virtual receiving node in express The virtual sending node in, u, v represents any node in the network topology planning graph model; In the network topology planning model G' T In the present invention, the shortest path algorithm with transceiver-constrained constraints is used to calculate the end-to-end cross-time path for each service in the service set in turn, and the transceiver-constrained network topology is generated.

2. The method according to claim 1, characterized in that The generated service set F' with an earlier service deadline includes: 2a) Group all services into service sets: F={f1,…,f i ,…f U } where f i =(s i ,d i ,r i ,m i ) represents the source node s of the i-th service i , destination node d i , data size r i and deadline m i , and the data volume of each service is equal, the value range of i is 1 to U, and U is the number of services included in the service set F; 2b) All services in the service set F are sorted according to their deadlines to obtain a sorted service set F'.

3. The method according to claim 1, characterized in that The node set of the topology constraint network element It is expressed as follows: in represents a virtual receiving node, represents a virtual sending node, represents the kth virtual receiving direction node, Represents the kth virtual sending direction node, the value range of k is 1 to M, and M is the total number of node transceivers pointing to.

4. The method according to claim 1, characterized in that: The edge set of the topology constraint network element It is expressed as follows: in, Indicates a virtual receiving node To virtual sending node A directed edge between , namely the virtual forwarding edge, Represents node u i,q A virtual receiving edge pointing to the kth receiving direction and receiving data, Represents node u i,q A virtual sending edge that points to the kth sending direction and sends data.

5. The method according to claim 1, characterized in that The adding of connection edges between topology constraint network element models corresponding to network nodes It is expressed as follows: in, Represents node u j,q The kth virtual sending node to node u i,q A directed edge of the lth virtual receiving direction node, Represents node u i,q The lth virtual receiving direction node, Represents node u j,q The kth virtual sending direction node; Represents node u i,q The lth virtual sending direction node to node u j,q A directed edge from the kth virtual receiving direction node, Represents node u j,q The kth virtual receiving direction node, Represents node u i,q The lth virtual sending direction node.

6. The method according to claim 1, characterized in that The shortest path algorithm using transceiver constraints sequentially calculates an end-to-end cross-time period path for each service in the service set, including: 5a) Take the top ranked service f from service set F' i Perform path calculation and convert the service f i Delete from the business set F'; 5b) Initialize node attributes, super destination node, end-to-end path, candidate node set and permanent node set Initialize end-to-end path is an empty set; Initialize the candidate node set To include G' T For all nodes in, the permanent node set S is an empty set; Define the parent node parameter as pre(·), which is used to record the node’s end-to-end cross-time path. The previous hop node in the network topology planning graph model G' T For each node in, initialize the parent node of each node u to pre(u)=-1; Define the delay parameter dis(·) to record the time from the node to the service source node s i Corresponding virtual receiving node The end-to-end path delay across time periods, for the network topology planning graph model G' T For each node in, initialize each node u excluding the virtual receiving node to the virtual receiving node The path delay is dis(u) = ∞, and the path delay from the virtual receiving node to itself is Define a super destination node D to record the end-to-end path The last hop node of the node, initialize the super destination node D to be empty; 5c) From the candidate node set Take one out to the virtual receiving node The node u with the shortest path delay * , and move the node from Delete it and add it to the permanent node set S; 5d) Determine node u * The delay parameter dis(u * ) is greater than the deadline m of the service i ; If dis(u * )>m i , then execute step 5g); Otherwise, execute step 5e); 5e) Determine node u * Is it a business purpose node? i The virtual sending node in the corresponding topology constraint network element If the node u * Virtual sending node Then update the super destination node to Execute step 5j); Otherwise, execute step 5f); 5f) Determine node u in turn * Each neighbor v of * Whether the transceiver constraints are met; If the node u * For Node Neighbor v * for If all three conditions are met at the same time, the current neighbor v is skipped. * , until all neighbors are traversed; Otherwise, execute step 5g); 5g) According to node u * The delay parameter dis(u * ) and edge (u * ,v * )’s propagation delay w(u * ,v * ), determine whether the neighbor v can be updated * The delay parameter dis(v * ) and the parent node pre(v * ); If dis(u * )+w(u * ,v * ) <dis(v * ), then update the neighbor v * The delay parameter is: dis(v * )=dis(u * )+w(u * ,v * ), Update Neighbor v * The parent node parameter is pre(v * )=u * ; Otherwise, do not update the neighbor v * The delay parameter dis(v * ) and the parent node pre(v * ); 5h) Set the current candidate node set The number of nodes in is compared with the value 0; like Then execute step 5i); Otherwise, return to step 5c); 5i) Determine whether the super destination node D is empty; If D is not empty, execute step 5j); Otherwise, the end-to-end path If it does not exist, return to step 5n); 5j) Define symbol J to record the nodes that appear in the backtracking path, initially J = D; 5k) Add node J to the end-to-end path And update node J as its parent node; 5l) Compare node J with the set initial value -1 to determine the end-to-end path Whether the backtracking is completed; If J = -1, then the end-to-end path Backtracking is complete, go to step 5m); Otherwise, return to step 5k); 5m) In the network topology planning model G' T Deleting an end-to-end path All edges included except the topology switching edges; 5n) Compare the number of services in the service set F' with the value 0 to determine whether the path calculation of all services has been completed. If |F'|=0, the paths of all services are calculated and the network topology with restricted transceiver constraints is output; Otherwise, return to step 5a).

7. A satellite Internet dynamic topology planning system based on business drive, characterized in that: include: A service sorting module (1) is used to sort all services in a service set F according to their deadlines to obtain a sorted service set F'; A topology-constrained network element construction module (2), used for characterizing each node in the satellite interconnection network as a topology-constrained network element model; A time-division subgraph construction module is used to add connection edges between topology constraint network element models corresponding to network nodes according to all possible connection relationships between nodes in the satellite interconnection network, and generate a time-division subgraph of the network topology planning graph model; A network topology planning model building module (3) is used to add topology switching edges between adjacent time-divided sub-graphs to generate a network topology planning graph; The transceiver-constrained shortest path calculation module (4) is used to calculate the end-to-end cross-time path for all services of the service set F' in the network topology planning diagram in turn, and generate the transceiver-constrained network topology.

8. The system according to claim 8, characterized in that The transceiver-constrained shortest path calculation module (4) comprises: A service cycle processing submodule (41) is used to take out the top ranked node from the service set each time and perform path calculation on it; An initialization submodule (42) is used to set initial values ​​of node attributes, end-to-end paths, candidate node sets, and permanent node sets used in the shortest path calculation process; A node loop processing submodule (43) is used to take out the node closest to the source node from the candidate node set each time, and perform transceiver constraint judgment and node parameter update on its neighboring nodes; A transceiver constraint judgment submodule (44), used to exclude neighbor nodes that do not meet the transceiver constraint during the node loop processing; A node parameter updating submodule (45), used to compare the distance from the current node to the neighbor node with the current distance of the neighbor node, and update the delay parameter of the neighbor node and the parent node parameter; A loop termination submodule (46) is used to determine whether the target node enters the permanent node set or whether the candidate node set is empty, and terminate the node loop processing process or continue the node loop processing according to the determination result; A path backtracking submodule (47), used for backtracking the end-to-end path according to the parent node information of each node; The graph resource updating submodule (48) is used to delete all edges except the topology switching edges in the network topology planning graph according to the end-to-end path completed by backtracking. The service calculation termination submodule (49) is used to determine whether the service set is empty, and terminate the service cycle processing process or continue to perform path calculation for the next service according to the determination result.

9. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that: The program executed by the processor implements the service-driven satellite Internet dynamic topology planning method as described in any one of claims 1 to 6.

10. A non-volatile computer-readable storage medium, characterized in that: The readable storage medium stores computer instructions, which are used to enable the computer to execute the service-driven satellite Internet dynamic topology planning method described in any one of claims 1 to 6.

Images