Data communication method and system, and electronic device

Abstract

The present invention relates to the field of communications, and provides a data communication method, system, and electronic device. The method includes: receiving, by means of a pre-constructed satellite data warehouse, data name information uploaded by a producer, where the satellite data warehouse includes at least three geostationary orbit satellites and a number of low-earth orbit satellites, and the data name information represents the position of the producer after movement; and updating the data in the satellite data warehouse based on the data name information. This is used to solve the defect that in an NDN network architecture, when the producer moves, it is difficult for the consumer to locate the new position of the producer, resulting in the interest packets sent reaching the old position of the producer, thereby causing packet loss and greatly affecting the accuracy and efficiency of data transmission. In the solution of this application, the data packets of the mobile producer can be cached in the pre-constructed satellite data warehouse, so that the impact of the producer's movement on network performance can be effectively shielded.

Description

Technical Field

[0001] The present invention relates to the field of communication technologies, and in particular, to a data communication method, a system, and an electronic device. Background Art

[0002] With the rapid development of data communication technologies and their hardware technologies, the connectivity provided by the Internet and the low storage cost enable a large amount of new content to be accessed, and the amount of data in the network is increasing at an alarming rate, which puts higher requirements on various aspects such as the bandwidth and delay of content transmission in the network architecture. Named Data Networking (NDN) is one of the future network architectures that meet such higher requirements.

[0003] In the NDN network architecture, a producer refers to a node or device that can provide data or content to meet the needs of consumers. It should be noted that in actual applications, producers are often mobile. When a producer moves, it is difficult for consumers to locate the new position of the producer, resulting in the interest packets sent reaching the old position of the producer, thus causing packet loss, which will greatly affect the accuracy and efficiency of data transmission. Summary of the Invention

[0004] The present invention provides a data communication method, a system, and an electronic device to solve the defect that when a producer moves in the NDN network architecture, it is difficult for consumers to locate the new position of the producer, resulting in the interest packets sent reaching the old position of the producer, thus causing packet loss and greatly affecting the accuracy and efficiency of data transmission. In the solution of the present application, the data generated by the producer can be cached based on a pre-constructed satellite data warehouse, so that the impact of producer movement on network performance can be effectively shielded.

[0005] The present invention provides a data communication method, including:

[0006] Receiving, by a pre-constructed satellite data warehouse, data name information uploaded by a producer, where the satellite data warehouse includes at least three geostationary orbit satellites and a plurality of low-earth orbit satellites, and the data name information represents the data generated by the producer;

[0007] Updating the data in the satellite data warehouse based on the data name information.

[0008] According to the data communication method provided by the present invention, it further includes:

[0009] When the satellite data warehouse receives a request packet from a consumer, forwarding the request packet to the producer;

[0010] The satellite data warehouse receives a data packet uploaded by the producer based on the request packet and forwards the data packet to the consumer.

[0011] According to the data communication method provided by the present invention, when the satellite data warehouse receives a request packet from a consumer, it forwards the request packet to the producer, including:

[0012] Receiving a request packet from a consumer via a low-earth orbit satellite;

[0013] Marking the request packet based on data name information;

[0014] Routing the request packet to the producer based on the mark.

[0015] According to the data communication method provided by the present invention, the satellite data warehouse receives data name information uploaded by the producer via a target satellite, and the target satellite is one of several low-earth orbit satellites;

[0016] Routing the request packet to the producer based on the mark, including:

[0017] Routing the request packet to the target satellite based on a preset routing rule, and the address of the target satellite corresponds to the mark;

[0018] The target satellite forwards the request packet to the producer based on the data name information of the producer.

[0019] According to the data communication method provided by the present invention, it further includes:

[0020] When the satellite data warehouse receives a request packet from a consumer, if it is determined that the satellite data warehouse has cached the data packet corresponding to the request packet, the cached data packet is forwarded to the consumer.

[0021] According to the data communication method provided by the present invention, the satellite data warehouse caches the data packet by the following method:

[0022] Determining the number of times the data packet is requested;

[0023] Determining the corresponding hop count of each low-earth orbit satellite passed by each time the data packet is requested;

[0024] Calculating the caching probability of the data packet for each low-earth orbit satellite based on the number of times the data packet is requested and the hop count;

[0025] Each low-earth orbit satellite caches the data packet based on the caching probability.

[0026] According to the data communication method provided by the present invention, a routing table is set in the satellite data warehouse, and the routing table includes a satellite-ground communication routing table and an inter-satellite communication routing table. The low-earth orbit satellites are distributed in several orbits. The construction method of the inter-satellite communication routing table includes:

[0027] For each low-earth orbit (LEO) satellite, send a first message to the LEO satellites in the same orbit, where the first message characterizes the position of the LEO satellite.

[0028] When a LEO satellite in the same orbit receives the first message, if the inter-satellite communication routing table corresponding to the LEO satellite is not stored in the LEO satellites in the same orbit, create an inter-satellite communication routing table and store it in the LEO satellites in the same orbit; if it is already stored, update the inter-satellite communication routing table based on the first message.

[0029] For each LEO satellite, send a second message to the LEO satellites in different orbits at regular intervals, where the second message characterizes the position of the LEO satellite.

[0030] When a LEO satellite in a different orbit receives the second message, if the inter-satellite communication routing table corresponding to the LEO satellite is not stored in the LEO satellites in different orbits, create an inter-satellite communication routing table and store it in the LEO satellites in different orbits; if it is already stored, update the inter-satellite communication routing table based on the second message.

[0031] According to the data communication method provided by the present invention, update the data in the satellite data warehouse based on the data name information, including:

[0032] Update the data of the target satellite based on the data name information.

[0033] Update the data of all LEO satellites and geostationary orbit satellites in the satellite data warehouse.

[0034] The present invention also provides a data communication system, including:

[0035] An information receiving module, configured to receive the data name information uploaded by a producer through a pre-constructed satellite data warehouse, where the satellite data warehouse includes at least three geostationary orbit satellites and several LEO satellites, and the data name information characterizes the data generated by the producer.

[0036] An information updating module, configured to update the data in the satellite data warehouse based on the data name information.

[0037] The present invention also provides an electronic device, including a memory, a processor, and a computer program stored on the memory and executable on the processor, where the processor implements any of the above data communication methods when executing the program.

[0038] The present invention also provides a non-transitory computer-readable storage medium, on which a computer program is stored, and the computer program implements any of the above data communication methods when executed by a processor.

[0039] The present invention also provides a computer program product, including a computer program which, when executed by a processor, implements any of the above data communication methods.

[0040] In the data communication method provided by the present invention, a satellite data warehouse can be pre-constructed. The satellite data warehouse can receive the data name information uploaded by producers. Since the data name information can represent the data generated by producers, even when producers are in motion, the satellite data warehouse can obtain the data produced by producers. In this way, efficient communication between producers and consumers is achieved, and the accuracy and efficiency of data transmission are improved. BRIEF DESCRIPTION OF THE DRAWINGS

[0041] To more clearly illustrate the technical solutions in the present invention or the prior art, the following briefly introduces the drawings required for the description of the embodiments or the prior art. Obviously, the following drawings are some embodiments of the present invention. For those of ordinary skill in the art, other drawings can be obtained based on these drawings without creative efforts.

[0042] Figure 1 is one of the flow diagrams of the data communication method provided by the embodiments of the present invention;

[0043] Figure 2 is one of the structural diagrams of the satellite data warehouse provided by the embodiments of the present invention;

[0044] Figure 3 is the second structural diagram of the satellite data warehouse provided by the embodiments of the present invention;

[0045] Figure 4 is the structural diagram of the routing table provided by the embodiments of the present invention;

[0046] Figure 5 is the second flow diagram of the data communication method provided by the embodiments of the present invention;

[0047] Figure 6 is the third flow diagram of the data communication method provided by the embodiments of the present invention;

[0048] Figure 7 is the fourth flow diagram of the data communication method provided by the embodiments of the present invention;

[0049] Figure 8 is the consumer delay graph under different numbers of managers provided by the embodiments of the present invention;

[0050] Figure 9 is the signaling overhead graph under different numbers of managers provided by the embodiments of the present invention;

[0051] Figure 10Delivery rate graph under different numbers of managers provided by the embodiments of the present invention;

[0052] Figure 11 Graph of the influence of different intranet caching policies on the performance of MsDD provided by the embodiments of the present invention;

[0053] Figure 12 Consumer latency graph under different producer movement rates provided by the embodiments of the present invention;

[0054] Figure 13 Delivery rate graph under different producer movement rates provided by the embodiments of the present invention;

[0055] Figure 14 Signaling overhead graph under different producer movement rates provided by the embodiments of the present invention;

[0056] Figure 15 Structural schematic diagram of a data communication system provided by the embodiments of the present invention;

[0057] Figure 16 Entity structural schematic diagram of an electronic device provided by the embodiments of the present invention. Detailed implementation manners

[0058] To make the objectives, technical solutions and advantages of the present invention clearer, the technical solutions in the present invention will be clearly and completely described below with reference to the accompanying drawings in the present invention. Apparently, the described embodiments are some, but not all, of the embodiments of the present invention. All other embodiments obtained by those of ordinary skill in the art based on the embodiments in the present invention without creative efforts shall fall within the protection scope of the present invention.

[0059] Figure 1 It is one of the flow schematic diagrams of the data communication method provided by the embodiments of the present invention.

[0060] As Figure 1 shown, this embodiment provides a data communication method, including:

[0061] Step 101, receiving data name information uploaded by a producer through a pre-constructed satellite data warehouse, where the satellite data warehouse includes at least three geostationary orbit satellites and several low-earth orbit satellites, and the data name information represents the data generated by the producer;

[0062] Step 102, updating the data in the satellite data warehouse based on the data name information.

[0063] Figure 2 It is one of the structural schematic diagrams of the satellite data warehouse provided by the embodiments of the present invention.

[0064] As Figure 2As shown in the figure, the satellite data warehouse provided in this embodiment is composed of a Low Earth Orbit (LEO) satellite constellation and a Geosynchronous Earth Orbit (GEO) satellite constellation. The GEO satellite constellation is formed by at least three GEO satellites evenly distributed over the equator, and the orbital plane coincides with the equatorial plane. The LEO satellite constellation is a Walker constellation composed of m ordered polar orbital planes, with n ordered LEO satellites evenly distributed on each orbit. Therefore, the data warehouse is composed of m×n + 3 LEO satellites. Producers and consumers on the ground in the NDN architecture can directly communicate with the satellites in the LEO layer through hardware devices.

[0065] In practical applications, LEO satellites can be distributed in different orbits and can be defined by the prefix / sat / OP h / SP i where / sat indicates that the node is a satellite node, / OP h is the orbit it is in, and / SP i is its number in the current orbit. That is, h represents the orbit where the LEO satellite is located, and i is the number of the LEO satellite in the current orbit. Therefore, the set of LEO satellite nodes satisfies S = {S h,i , h = 1, 2, …, m, i = 1, 2, … n}.

[0066] Figure 3 This is the second schematic diagram of the structure of the satellite data warehouse provided by the embodiment of the present invention.

[0067] In implementation, as Figure 3 shown, LEO satellites include managers and non - managers. For example, the number of managers in each orbital plane is M, and they are placed at intervals of nodes within the orbit. In addition, when a certain manager on orbit OP h is S h,i , then the manager on the adjacent orbit OP h+1 is S h+1,i+1 , and so on for other orbits. Such an arrangement method can keep the number of managers in each dimension basically the same. Figure 3 This figure exemplifies the arrangement of LEO satellites when n = 11, m = 6, and M = 4.

[0068] In implementation, a data list table DL can be set up in the satellite data warehouse, and data name information can be stored in the data list table. Moreover, the number of entries in the data list table can be multiple. Preferably, each manager can jointly maintain a DL table with the same content with three GEO satellites. When the information in the DL table of a certain manager changes, an update message can be sent to the GEO satellite covering it, and then the GEO satellite sends this update message to other managers to achieve the purpose of global update. A DL table entry includes the packet storage location (node prefix) and the packet name prefix.

[0069] In implementation, the data name information can also represent the position after the producer moves.

[0070] In the data communication method provided in this embodiment, a satellite data warehouse can be pre-constructed. The satellite data warehouse can receive the data name information uploaded by the producer. Since the data name information can represent the address of the producer, even when the producer is in the process of moving, the satellite data warehouse can obtain the data produced by the producer. In this way, efficient communication between the producer and the consumer is realized, and the accuracy and efficiency of data transmission are improved.

[0071] In an exemplary embodiment, the data communication method further includes:

[0072] When the satellite data warehouse receives a request packet from the consumer, it forwards the request packet to the producer;

[0073] The satellite data warehouse receives the data packet uploaded by the producer based on the request packet and forwards the data packet to the consumer.

[0074] In practical applications, the satellite data warehouse receives the data name information uploaded by the producer and the request packet from the consumer through low-earth orbit satellites. However, the low-earth orbit satellite receiving the data name information uploaded by the producer and the one receiving the request packet from the consumer may not be the same low-earth orbit satellite. In this case, it is necessary to forward the received request packet from the consumer to the low-earth orbit satellite corresponding to the producer. In this process, the request packet can be forwarded through the DL table managed by the manager. When the request packet is forwarded to the low-earth orbit satellite corresponding to the producer, the low-earth orbit satellite then forwards the request packet to the producer based on the stored data name information. After that, it receives the data packet uploaded by the producer based on the request packet and gradually forwards the data packet to the consumer that issued the request packet.

[0075] In this embodiment, as the role of requesting the data packet from the producer, the consumer can accurately and real-time obtain the required data packet on the premise that the satellite data warehouse can accurately locate the position of the producer through the data name information, improving the efficiency of data communication.

[0076] In an exemplary embodiment, when the satellite data warehouse receives a request packet from a consumer, it forwards the request packet to the producer, including:

[0077] Receiving a request packet from a consumer via a low-earth orbit (LEO) satellite;

[0078] Marking the request packet based on data name information;

[0079] Routing the request packet to the producer based on the mark.

[0080] In practical applications, during the process of forwarding the request packet to the producer, since non-managers do not carry a DataLocator (DL), the prefix name of the LEO satellite corresponding to the producer needs to be obtained through the DL carried by the manager. Therefore, the LEO satellite of the non-manager first forwards the Interest packet to the nearest manager on the same orbit through the Forwarding Information Base (FIB) entry. The data packet is sent by the consumer and carries the request packet. Then, the manager adds a forwarding hint to the Interest packet, that is, marks the request packet. The forwarding hint is a locator carried in the Interest packet, indicating "where" to forward the Interest packet. Through the forwarding hint, the core network of Named Data Networking (NDN) can only announce the location in the form of a prefix, which is more scalable than announcing the data name prefix. Since each satellite in the LEO layer has been set with its unique prefix name during the construction of the LEO layer, in practice, the prefix name of the target node can be used as the forwarding hint to route the Interest packet.

[0081] In this embodiment, by attaching a mark to the request packet, the request packet can be accurately forwarded to the producer.

[0082] In an exemplary embodiment, the satellite data warehouse receives data name information uploaded by the producer via a target satellite, where the target satellite is one of several LEO satellites;

[0083] Routing the request packet to the producer based on the mark, including:

[0084] Routing the request packet to the target satellite based on a preset routing rule, where the address of the target satellite corresponds to the mark;

[0085] The target satellite forwards the request packet to the producer based on the data name information of the producer.

[0086] In practical applications, the preset routing rule is as follows:

[0087]

[0088]

[0089]

[0090] In an exemplary embodiment, the data communication method further includes:

[0091] When the satellite data warehouse receives a request packet from a consumer, if it determines that the data packet corresponding to the request packet has been cached in the satellite data warehouse, it forwards the cached data packet to the consumer.

[0092] In practical applications, it is possible for a consumer to repeatedly request data packets from the same producer, and it is also possible for different consumers to request the same data packet from the same producer. In these cases, the satellite data warehouse can cache the data packets uploaded by the producer. In this way, when it is confirmed that the same data packet is requested by the request packet, the pre-cached data packet can be directly forwarded from inside the satellite data warehouse to the consumer that sent the request packet, without the need to forward the request packet to the producer again. This can improve the efficiency of data communication.

[0093] In an exemplary embodiment, the satellite data warehouse caches the data packet by the following method:

[0094] Determine the number of times the data packet is requested;

[0095] Determine the corresponding number of hops of each low-earth orbit satellite when the data packet is requested each time;

[0096] Based on the number of times the data packet is requested and the number of hops, calculate the caching probability of each low-earth orbit satellite for the data packet;

[0097] Each low-earth orbit satellite caches the data packet based on the caching probability.

[0098] In practical applications, the number of hops of the producer's data packet can be represented by the number of hops that the request packet sent by the consumer is forwarded to the producer. In implementation, when the satellite data warehouse receives a request packet from a consumer, a TLV element named ISLhop can be added to the interest packet. This element is responsible for recording the number of hops that the interest packet is forwarded after passing through a management node when it is forwarded between different orbits. When the interest packet is forwarded within the same orbit, ISLhop = 0. When the request packet is forwarded to a new node each time, that is, when it is forwarded to a new low-earth orbit satellite, the new low-earth orbit satellite records and updates the ISLhop of the interest packet incoming from the interface communicating with satellites in two different orbits.

[0099] When the data packet sent by a certain producer based on the request packet is forwarded between low-earth orbit satellites, since the forwarding path of the producer is the same as that of the consumer, there is a TLV element named ISLhop recorded in each low-earth orbit satellite that the producer passes through. Therefore, when the data packet sent by the producer is forwarded to each low-earth orbit satellite, the caching probability of the low-earth orbit satellite for the data packet can be calculated based on the number of hops recorded by ISLhop and the number of times the data packet is requested. Specifically, the probability can be calculated by the following formula:

[0100]

[0101] Where P (h,i),D is the caching probability of each LEO satellite, is the probability that the LEO satellite caches the data packet when the data packet is forwarded through different orbits, is the probability that the LEO satellite caches the data packet when the data packet is forwarded through the same orbit, P D is the caching probability calculated based on the CCS (Cache in the Core Strategy) scheme, ε is the descending weight, ε ∈ (0, 1), and when ε is larger, P h,i has a greater descending trend. ISLhop h,i is the value of ISLhop of the corresponding LEO satellite, hop max is the maximum number of hops from a non-manager LEO satellite to a manager LEO satellite within the same orbit, hop h,i is the number of hops between a LEO satellite and the nearest manager within the same orbit.

[0102] In practical applications, hop max 、hop h,i and ISLhop h,i can be calculated by the following formula:

[0103]

[0104] Where, is the ISLhop value recorded by the current LEO satellite incoming from interface f a , is the ISLhop value recorded by the LEO satellite incoming from interface f b , where f a is the interface for the LEO satellite to communicate with satellites in different orbits, f b is the interface for the LEO satellite to communicate with satellites in the same orbit, h represents the orbit where the LEO satellite is located, i is the number of the LEO satellite in the current orbit, m represents the number of orbits where the LEO satellites are distributed, M represents the number of managers in each orbit, and j represents the number of the manager satellite in the current orbit.

[0105] In an exemplary embodiment, when the target satellite in the satellite data warehouse receives a data packet uploaded by the producer, the data packet can be cached in the target satellite, and the target satellite is the LEO satellite that receives the data name information of the producer.

[0106] In practical applications, when the satellite data warehouse does not cache data packets, the request packets of consumers need to be forwarded to the producer by the target satellite. In this embodiment, when a consumer requests a data packet from the producer for the first time, the target satellite can cache the data packet. Thus, when other consumers or the same consumer requests the data packet from the producer again later, the request packet can directly obtain the data packet after being forwarded to the target satellite, without the need to be forwarded to the producer again. In this way, the data communication efficiency can also be improved.

[0107] In an exemplary embodiment, a routing table is set in the satellite data warehouse. The routing table includes a space-ground communication routing table and an inter-satellite communication routing table. The low-earth orbit satellites are distributed in several orbits. The method for constructing the inter-satellite communication routing table includes:

[0108] For each low-earth orbit satellite, send a first message to the low-earth orbit satellites in the same orbit. The first message represents the position of the low-earth orbit satellite.

[0109] When the low-earth orbit satellites in the same orbit receive the first message, if the inter-satellite communication routing table corresponding to the low-earth orbit satellite is not stored in the low-earth orbit satellites in the same orbit, create an inter-satellite communication routing table and store it in the low-earth orbit satellites in the same orbit; if it is already stored, update the inter-satellite communication routing table based on the first message.

[0110] For each low-earth orbit satellite, send a second message to the low-earth orbit satellites in different orbits at regular intervals. The second message represents the position of the low-earth orbit satellite.

[0111] When the low-earth orbit satellites in different orbits receive the second message, if the inter-satellite communication routing table corresponding to the low-earth orbit satellite is not stored in the low-earth orbit satellites in different orbits, create an inter-satellite communication routing table and store it in the low-earth orbit satellites in different orbits; if it is already stored, update the inter-satellite communication routing table based on the second message.

[0112] In practical applications, the FIB (Forwarding Information Base) table is a key data structure in the NDN network used to determine how interest packets are forwarded through the network. The FIB itself is filled by the routing protocol of the name prefix, and each prefix can have multiple interfaces, which is crucial for data communication. The solution in this embodiment involves communication between satellites and communication between satellites and ground producers or consumers. Therefore, the routing table can include a satellite-ground communication routing table and an inter-satellite communication routing table. Among them, the satellite-ground communication routing table can be represented by the FIB. The FIB table entries on low-earth orbit satellites only include different interfaces divided by frequency bands in the downlink. The inter-satellite communication routing table can be represented by the SFIB (Satellite FIB). An SFIB table entry includes the prefix, interface, and manager identifier of the low-earth orbit satellite. The manager identifier is used to indicate whether the low-earth orbit satellite is a manager. On the other hand, in the solution of this embodiment, since the satellite data warehouse involves low-earth orbit satellites in different orbits, different routing rules need to be applied when data packets communicate between different orbits and within the same orbit. Therefore, two different routing tables are constructed in this embodiment. The inter-satellite communication routing table in the same orbit is established as follows:

[0113] Step 1: For each low-earth orbit satellite S h,i , send a Pub-A message from each of its 2 relay interfaces for communicating with satellites in the same orbit. The Pub-A message includes the prefix information, forwarding hop count, and manager identifier of the low-earth orbit satellite itself.

[0114] Step 2: After the adjacent low-earth orbit satellite node 's interface f a receives the Pub-A message sent by S h,i , the following processing is performed:

[0115] · If there is an SFIB table entry in the node with a prefix equal to / sat / OP h / SP i and the forwarding hop count of Pub-A is less, then update the table entry.

[0116] · If there is an SFIB table entry in the node with a prefix equal to / sat / OP h / SP i but the forwarding hop count is more, then no adjustment is made.

[0117] · If there is no SFIB table entry in the node with a prefix equal to / sat / OP h / SP i , the satellite node creates the SFIB table entry with the prefix equal to / sat / OP h / SP i , and the interface is equal to fa and record its administrator identification.

[0118] Since the order of satellites in the same orbit does not change, after the SFIB entries of satellites in the same orbit are constructed, the node does not need to send Pub-A messages again to establish entries.

[0119] The inter-satellite communication routing table for different orbits is established as follows:

[0120] Step 1: S h,i Every time interval τ elapses, a Pub-B message is sent from each of its 2 relay interfaces communicating with satellites in different orbits. τ is determined by the characteristics of different satellite constellations. The Pub-B message contains the h,i location (prefix) of S.

[0121] Step 2: The satellite node interface f b receives the Pub-B message sent by S h,i and performs the following processing:

[0122] · If there is an SFIB entry in the node with a prefix equal to / sat / OP h and the interfaces are the same, no adjustment is made.

[0123] · If there is an SFIB entry in the node with a prefix equal to / sat / OP h but the interfaces are different, update the entry.

[0124] · If there is no SFIB entry in the node with a prefix equal to / sat / OP h , the satellite node creates the SFIB entry with a prefix equal to / sat / OP h and the interface equal to f b .

[0125] Figure 4 is the schematic diagram of the structure of the routing table provided by the embodiment of the present invention.

[0126] Through the above steps, an SFIB can be created for each LEO satellite node in MsDD, and each satellite node can communicate with other satellites in the LEO layer through the SFIB entries of the node itself. Figure 4 shows the situation after the SFIB of satellite S 1,1 is constructed.

[0127] Due to the characteristics of the polar-orbiting satellite constellation, when a satellite passes through the north and south poles, its adjacent orbits will be swapped left and right. Therefore, it is necessary to dynamically adjust the SFIB entries of different orbits. Based on this, in this embodiment, when constructing the inter-satellite communication routing table for different orbits, the routing table needs to be updated every once in a while.

[0128] In an exemplary embodiment, updating the data in the satellite data warehouse based on the data name information includes:

[0129] Updating the data of the target satellite based on the data name information;

[0130] Updating the data of all low-earth orbit satellites and geostationary orbit satellites in the satellite data warehouse.

[0131] In practical applications, after the target satellite receives the data name information of the producer, it can update the space-ground communication routing table inside the target satellite based on this data name information. Then, the target satellite can send the update information to the geostationary orbit satellite, and the geostationary orbit satellite can issue a global update instruction. Based on this instruction, the satellites in the satellite data warehouse update their respective DL forms.

[0132] Figure 5 It is the second schematic diagram of the process of the data communication method provided by the embodiment of the present invention.

[0133] As Figure 5 shown, in an exemplary embodiment, to prevent the situation where data packets are lost due to link switching at the Walker constellation's Cross-seam in the reverse path of data packets, this embodiment solves this problem through the following method: when a certain satellite node wants to send an Interest packet through the inter-satellite link at the reverse seam, this satellite node will send an A-Interest packet (Auxiliary Interest) to its neighboring satellite node in the same orbit. The difference between the A-Interest packet and an ordinary Interest packet is that the hop limit of the A-Interest packet is 2. The sending process of the A-Interest packet is as follows. The purpose of sending the A-Interest packet is to reconstruct a reverse path for data packets.

[0134]

[0135]

[0136] Appendix Figure 5 shows this process. It can be seen that when a link switch occurs, a connection is re-established between S m,2 and S 1,3 , and a reverse path of S m,2 →S 1,3 →S 1,2 is constructed.

[0137] Figure 6 It is the third flowchart of the data communication method provided by the embodiments of the present invention.

[0138] Figure 7 It is the fourth flowchart of the data communication method provided by the embodiments of the present invention.

[0139] The overall process of the data communication method in the solution of the present application is introduced as follows:

[0140] As Figure 6 and Figure 7 shown, when a consumer from the ground forwards the interest packet D of the request packet D int to the satellite in the LEO layer , the data packet acquisition process starts.

[0141] Step 1: Forward D int to the nearest manager through the SFIB entry

[0142] Step 2: Query the DL entry carried by itself and perform the following operations:

[0143] · If there is an entry named D in DL and the storage location is S h,i , then enter Step 3;

[0144] · If there is no entry named D in DL, D int will wait at and repeat Step 2.

[0145] Step 3: D int Will use the prefix name of S h,i as the forwarding hint, and then forward D according to the preset routing algorithm int .

[0146] Step 4: D int Will try to hit D in the cache. If the cache cannot be hit at S h,i , S h,i will send an SReq request for the data packet D to P according to the FIB entry.

[0147] Figure 8 It is the consumer delay graph under different numbers of managers provided by the embodiments of the present invention. Attached Figure 8The results show that when the number of managers increases, the consumer latency of MsDD shows an obvious downward trend. This is because the more managers there are on an orbital plane, the fewer additional hops the interest packets and data packets need to be transmitted to their nearest managers on that orbital plane. When the number of managers on each orbit is 11, the additional hops at this time are 0, so the consumer latency is also the lowest.

[0148] Figure 9 This is the signaling overhead diagram under different numbers of managers provided by the embodiments of the present invention. Attached Figure 9 The results show that when the number of managers increases, the signaling overhead for each update of DL in the data collection phase will also become larger. This is because in the data collection phase, the managers need to send update information to the GEO satellite, and when the number of managers increases, the more managers the GEO satellite needs to send update information to.

[0149] Figure 9 This is the signaling overhead diagram under different numbers of managers provided by the embodiments of the present invention. The schemes with the number of managers being 2, 3, and 4 can be named MsDD-2, MsDD-3, and MsDD-4 respectively, and their average delivery rates under the condition of increasing data rate can be compared. Attached Figure 9 It shows that when the Interestrate increases, the packet delivery rates of the three schemes will show a downward trend due to the increase in the amount of data in the network, and the decreases of MsDD-2 and MsDD-3 are relatively obvious. This is because in MsDD, the manager nodes will carry a large amount of network traffic, and the fewer managers there are, the greater the load on the inter-satellite links between each manager and different orbits. Therefore, we believe that when the number of managers on each orbit is 2 and 3, the performance of MsDD cannot reach the optimal, so in the subsequent experimental process, we excluded the schemes MsDD-2 and MsDD-3 and selected MsDD-4 for subsequent experiments.

[0150] Figure 11 This is the result diagram of the influence of different intranet cache strategies on the performance of MsDD provided by the embodiments of the present invention. From the attached Figure 11 it can be seen that when the request rate increases, the cache hit rate and consumer latency of MsDD-4 are significantly better than other schemes. This is because the intranet cache scheme of MsDD-4 preferentially caches more popular content in the network by probability, reducing cache redundancy and also reducing the probability that the requested content is replaced. At the same time, MsDD-4 increases the probability that data packets are cached at nodes close to the managers, enabling interest packets to hit the cache with fewer hops.

[0151] Figure 12 This is the consumer latency diagram under different producer moving rates provided by the embodiments of the present invention. Attached Figure 12The results show that as the producer's moving speed increases, except for Pure NDN, several other schemes perform well in terms of consumer latency and stabilize within a reasonable value range. Among them, MsDD-4 shows the most stable performance and improves the consumer latency by about 5% compared to other schemes.

[0152] Figure 13 This is the delivery rate graph under different producer moving rates provided by the embodiments of the present invention. Attached Figure 13 The results show that the delivery rate of MsDD-4 is significantly better than other schemes, and this advantage becomes more obvious as the producer's moving speed increases. This is because although other schemes can reduce the packet loss problem during handover to a certain extent, when the number of handover events increases, the delivery rate will inevitably decrease. For example, in Kite, when the producer's moving speed increases, the frequency of the producer switching between APs also increases, which will lead to the stale path problem and cause packet loss.

[0153] Figure 14 This is the signaling overhead graph under different producer moving rates provided by the embodiments of the present invention. Attached Figure 14 It shows the change of signaling overhead when the producer's moving speed increases. Here, we calculate the signaling overhead when MsDD undergoes satellite handover. It can be seen that the signaling overhead of MsDD remains stable with the change of the producer's moving speed and is better than that of Kite and T-Move. This is because when the producer moves, Kite needs to frequently send TI / TD packets to the producer to update the tracking path, and T-Move needs to send messages to update the FIB before and after handover. While the signaling overhead of MsDD is only related to the number of managers, because the GEO controller only sends update information to the managers.

[0154] Next, the data communication system provided by the present invention will be described. The data communication system described below can be correspondingly referred to the data communication method described above.

[0155] Figure 15 This is the structural schematic diagram of the data communication system provided by the embodiments of the present invention.

[0156] As Figure 15 shown, the data communication system provided in this embodiment includes:

[0157] An information receiving module 1501, configured to receive the data name information uploaded by the producer through a pre-constructed satellite data warehouse. The satellite data warehouse includes at least three geostationary orbit satellites and several low-earth orbit satellites, and the data name information represents the data generated by the producer;

[0158] An information updating module 1502, configured to update the data in the satellite data warehouse based on the data name information.

[0159] In an exemplary embodiment, the data communication system further includes a data forwarding module, and the data forwarding module is specifically configured to:

[0160] After the satellite data warehouse receives a request packet from a consumer, forward the request packet to the producer;

[0161] The satellite data warehouse receives a data packet uploaded by the producer based on the request packet, and forwards the data packet to the consumer.

[0162] In an exemplary embodiment, the data forwarding module is further configured to:

[0163] Receive a request packet from a consumer through a low-earth orbit satellite;

[0164] Mark the request packet based on the data name information;

[0165] Based on the mark, route the request packet to the producer.

[0166] In an exemplary embodiment, the data forwarding module is further configured to:

[0167] Route the request packet to a target satellite based on a preset routing rule, where the address of the target satellite corresponds to the mark;

[0168] The target satellite forwards the request packet to the producer based on the data name information of the producer.

[0169] In an exemplary embodiment, the data communication system further includes a cache forwarding module, and the cache forwarding module is specifically configured to:

[0170] After the satellite data warehouse receives a request packet from a consumer, if it is determined that the satellite data warehouse has cached the data packet corresponding to the request packet, forward the cached data packet to the consumer.

[0171] In an exemplary embodiment, the data communication system further includes a cache module, and the cache module is specifically configured to:

[0172] Determine the number of times a data packet is requested;

[0173] Determine the corresponding hop count of each low-earth orbit satellite passed by when the data packet is requested each time;

[0174] Calculate the cache probability of each low-earth orbit satellite for the data packet based on the number of times the data packet is requested and the hop count;

[0175] Each low-earth orbit satellite caches the data packet based on the cache probability.

[0176] In an exemplary embodiment, the data communication system further includes a routing table construction module, and the routing table construction module is specifically configured to:

[0177] For each low-earth orbit (LEO) satellite, send a first message to the LEO satellites in the same orbit, where the first message represents the position of the LEO satellite.

[0178] When a LEO satellite in the same orbit receives the first message, if the inter-satellite communication routing table corresponding to the LEO satellite is not stored in the LEO satellites in the same orbit, create an inter-satellite communication routing table and store it in the LEO satellites in the same orbit; if it is already stored, update the inter-satellite communication routing table based on the first message.

[0179] For each LEO satellite, send a second message to the LEO satellites in different orbits at regular intervals, where the second message represents the position of the LEO satellite.

[0180] When a LEO satellite in a different orbit receives the second message, if the inter-satellite communication routing table corresponding to the LEO satellite is not stored in the LEO satellites in different orbits, create an inter-satellite communication routing table and store it in the LEO satellites in different orbits; if it is already stored, update the inter-satellite communication routing table based on the second message.

[0181] In an exemplary embodiment, the data communication system is further configured to:

[0182] Update the data of the target satellite based on the data name information.

[0183] Update the data of all LEO satellites and geostationary orbit satellites in the satellite data warehouse.

[0184] The specific implementation method of the data communication system provided in this embodiment can be implemented with reference to the above embodiments, and details are not described herein again.

[0185] Figure 16 An exemplary schematic diagram of the physical structure of an electronic device is shown as Figure 16 As shown, the electronic device may include: a processor 910, a communication interface 920, a memory 930, and a communication bus 940. Among them, the processor 910, the communication interface 920, and the memory 930 communicate with each other through the communication bus 940. The processor 910 can call the logical instructions in the memory 930 to execute a data communication method, which includes:

[0186] Receive the data name information uploaded by the producer through a pre-constructed satellite data warehouse, where the satellite data warehouse includes at least three geostationary orbit satellites and several LEO satellites, and the data name information represents the data generated by the producer.

[0187] Update the data in the satellite data warehouse based on the data name information.

[0188] In addition, when the logical instructions in the above-mentioned memory 930 are implemented in the form of software functional units and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on such an understanding, the technical solution of the present invention, in essence, or the part that contributes to the prior art, or a part of this technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to execute all or part of the steps of the methods of various embodiments of the present invention. The aforementioned storage medium includes: various media such as USB flash drives, mobile hard disks, read-only memories (ROMs), random access memories (RAMs), magnetic disks, or optical discs that can store program codes.

[0189] On the other hand, the present invention also provides a computer program product. The computer program product includes a computer program that can be stored on a non-transitory computer-readable storage medium. When the computer program is executed by a processor, the computer can execute the data communication methods provided by the above-mentioned various methods. On another aspect, the present invention also provides a non-transitory computer-readable storage medium, on which a computer program is stored. When the computer program is executed by a processor, it is implemented to execute the data communication methods provided by the above-mentioned various methods.

[0190] The device embodiments described above are merely illustrative. The units described as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed to multiple network units. Some or all of the modules can be selected according to actual needs to achieve the purpose of the solution of this embodiment. A person of ordinary skill in the art can understand and implement it without creative labor.

[0191] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention and are not intended to limit them. Although the present invention has been described in detail with reference to the foregoing embodiments, those of ordinary skill in the art should understand that they can still modify the technical solutions described in the foregoing embodiments or perform equivalent replacements for some of the technical features. However, these modifications or replacements do not cause the essence of the corresponding technical solutions to deviate from the spirit and scope of the technical solutions of the various embodiments of the present invention.

Claims

1. A data communication method, characterized in that, including: Receiving the data name information uploaded by producers through a pre-constructed satellite data warehouse, which is composed of a low-earth orbit (LEO) satellite constellation and a geostationary orbit (GEO) satellite constellation. The GEO satellite constellation is formed by at least 3 GEO satellites evenly distributed over the equator, with the orbital plane coinciding with the equatorial plane. The LEO satellite constellation is composed of m ordered polar orbital planes, and each orbit is evenly distributed with n ordered LEO satellites. The set of LEO satellite nodes satisfies S = {S h,i , h = 1, 2, …, m, i = 1, 2, … n}, where the LEO satellites include managers and non-managers. The number of managers in each orbital plane is M, and they are placed at intervals of nodes within the orbit. When a certain manager on orbit OP h is S h,i , then the manager of the adjacent orbit OP h+1 is S h+1,i+1 . The data name information characterizes the data generated by the producers; updating the data in the satellite data warehouse based on the data name information; when the satellite data warehouse receives a request packet from a consumer, forwarding the request packet to the producer; the satellite data warehouse receiving a data packet uploaded by the producer based on the request packet and forwarding the data packet to the consumer; when the satellite data warehouse receives a request packet from a consumer, if it is determined that the satellite data warehouse has cached the data packet corresponding to the request packet, forwarding the cached data packet to the consumer; the satellite data warehouse caches the data packet by the following method: determining the number of times the data packet is requested; determining the corresponding hop count of each low-earth orbit satellite passed by when the data packet is requested each time; calculating the caching probability of each low-earth orbit satellite for the data packet based on the number of times the data packet is requested and the hop count; each low-earth orbit satellite caches the data packet based on the caching probability; the caching probability is calculated by the following formula: Among which P (h,i),D is the caching probability of each LEO satellite, is the probability that the LEO satellite caches the data packet when the data packet is forwarded through different orbits, is the probability that the LEO satellite caches the data packet when the data packet is forwarded through the same orbit, P D is the caching probability calculated based on the scheme of the core built-in caching strategy, ε is the descending weight, ε ∈ (0, 1), and when ε is larger, P h,i has a greater descending trend; ISLhop h,i It is the value of ISLhop for the corresponding LEO satellite. ISLhop records the number of hops that an interest packet is forwarded after passing through a manager node when being forwarded between different orbits, hop max It is the maximum number of hops from a non-manager LEO satellite to a manager LEO satellite within the same orbit, hop h,i It is the number of hops between a LEO satellite and the nearest manager within the same orbit; hop max 、hop h,i and ISLhop h,i can be calculated by the following formula: Among them, is the ISLhop value passed in from interface f a recorded by the current LEO satellite, is the ISLhop value passed in from interface f b recorded by the LEO satellite, where f a is the interface for the LEO satellite to communicate with satellites in different orbits, f b is the interface for the LEO satellite to communicate with satellites in the same orbit. h represents the orbit where the LEO satellite is located, i is the number of the LEO satellite in the current orbit, m represents the number of orbits in which the LEO satellites are distributed, M represents the number of managers in each orbit, and j represents the number of the manager satellite in the current orbit.

2. The data communication method according to claim 1, characterized in that when the satellite data warehouse receives a request packet from a consumer and forwards the request packet to the producer, it includes: receiving the request packet from the consumer through the low-earth orbit satellite; marking the request packet based on the data name information; routing the request packet to the producer based on the mark.

3. The data communication method according to claim 2, characterized in that, the satellite data warehouse receives data name information uploaded by the producer through a target satellite, and the target satellite is one of the several low-earth orbit satellites; routing the request packet to the producer based on the mark includes: routing the request packet to the target satellite based on a preset routing rule, and the address of the target satellite corresponds to the mark; the target satellite forwards the request packet to the producer based on the data name information uploaded by the producer.

4. The data communication method according to claim 1, wherein a routing table is set in the satellite data warehouse, and the routing table includes a satellite-ground communication routing table and an inter-satellite communication routing table. The low-earth orbit satellites are distributed in several orbits. The method for constructing the inter-satellite communication routing table includes: for each low-earth orbit satellite, sending a first message to the low-earth orbit satellites in the same orbit, and the first message represents the position of the low-earth orbit satellite; when the low-earth orbit satellites in the same orbit receive the first message, if the inter-satellite communication routing table corresponding to the low-earth orbit satellite is not stored in the low-earth orbit satellites in the same orbit, creating the inter-satellite communication routing table and storing it in the low-earth orbit satellites in the same orbit; if it is already stored, updating the inter-satellite communication routing table based on the first message; for each low-earth orbit satellite, sending a second message to the low-earth orbit satellites in different orbits at regular intervals, and the second message represents the position of the low-earth orbit satellite; when the low-earth orbit satellites in different orbits receive the second message, if the inter-satellite communication routing table corresponding to the low-earth orbit satellite is not stored in the low-earth orbit satellites in different orbits, creating the inter-satellite communication routing table and storing it in the low-earth orbit satellites in different orbits; if it is already stored, updating the inter-satellite communication routing table based on the second message.

5. The data communication method according to claim 3, characterized in that, Updating the data in the satellite data warehouse based on the data name information includes: Updating the data of the target satellite based on the data name information; Updating the data of all the low-earth orbit satellites and the geostationary orbit satellites in the satellite data warehouse.

6. A data communication system, characterized in that, Applying the data communication method according to any one of claims 1-5 includes: An information receiving module, configured to receive, through a pre-constructed satellite data warehouse, data name information uploaded by a producer, where the satellite data warehouse includes at least three geostationary orbit satellites and a plurality of low-earth orbit satellites, and the data name information represents the data generated by the producer; An information updating module, configured to update the data in the satellite data warehouse based on the data name information.

7. An electronic device, comprising a memory, a processor, and a computer program stored on the memory and executable on the processor, characterized in that, When the processor executes the program, it implements the data communication method according to any one of claims 1-5.

Images