A low earth orbit constellation satellite network traffic offloading method based on auction theory

Abstract

The application provides a low-orbit constellation satellite network traffic offloading method based on an auction theory, and steps are as follows: judging whether a subsidence satellite is a light-load subsidence satellite, a heavy-load subsidence satellite or a common subsidence satellite; all light-load subsidence satellites and heavy-load subsidence satellites send request packets containing detection information to each other, and transmission time delays between the subsidence satellites are obtained; the heavy-load subsidence satellite informs a ground station of the satellite state through a feeder link with a demand bandwidth, and the light-load subsidence satellite informs the ground station of the satellite state through the feeder link with a competitive bandwidth; the ground station puts the subsidence satellites into a buyer queue or a seller queue according to the collected satellite states, and obtains a matching result between the light-load subsidence satellites and the heavy-load subsidence satellites through a bidirectional auction; and the ground station informs all the subsidence satellites of the matching result through the feeder link, and the traffic offloading is transferred. The application maximizes the bandwidth of the satellite-ground link, and improves the overall throughput of the air-ground network.

Description

Technical Field

[0001] This invention relates to the technical field of satellite network communication traffic offloading, and more particularly to a traffic offloading method for low-Earth orbit constellation satellite networks based on auction theory. When congestion occurs in the link between the satellite and the ground station, this invention is used to offload traffic and improve the bandwidth utilization of the satellite-to-ground link. Background Technology

[0002] With the widespread use of the internet and the rapid development of space-related technologies, low Earth orbit (LEO) satellite networks have become an important component of mobile communication networks. Many LEO constellations are under construction, such as Starlink, OneWeb, Hongyun, and Hongyan. Most of these LEO constellations utilize laser or radio frequency (RF) terminals to establish inter-satellite links (ISLs). The application of satellite laser communication terminals provides higher bandwidth, enriching the bandwidth resources of satellite networks. However, after user data is relayed by the satellite, it needs to be transmitted to the ground core network via ground stations. Satellites can only establish feeder links with ground stations when the satellites are within the station's visibility range.

[0003] The two-way auction model has a "many-to-many" structure, with multiple buyers and sellers simultaneously submitting bids and asking prices to the auctioneer. In a two-way auction market, buyers and sellers provide their respective offers and information about the goods being traded. Based on market bidding rules, the auctioneer determines whether the transaction price is reasonable. If reasonable, it is accepted by the market; otherwise, they are notified to resubmit their bids. The auctioneer then determines whether the transaction should be terminated based on the trading rules and initiates a new transaction. If the termination conditions are met, the two-way auction market is closed, and the process ends.

[0004] Auction models such as Figure 3 As shown, it mainly consists of four parts: seller, buyer, auction venue, and auctioned item. In a satellite network, bandwidth is the auctioned item, the seller is a lightly loaded satellite, the buyer is a heavily loaded satellite, and the auction venue is the ground station. The ground station collects the load status of the satellites and the transfer time between them through the feed link. Based on the constraints of transfer time and bandwidth utilization, it matches buyers and sellers, assists the heavily loaded satellites in transferring excess traffic to the lightly loaded satellites, thereby improving bandwidth utilization and increasing the throughput of the air-to-ground network.

[0005] Downlink satellites are those that establish feeder links with ground stations. Due to limitations in the number of antennas, feeder links cannot be increased indefinitely. Because the distribution of global user traffic in satellite networks is extremely unbalanced and user activity fluctuates over time, and because the distribution of ground stations within the satellite network is also uneven, space segment congestion is highly likely to occur during the process of onboard data flowing upwards to and then downlinking through the nearest ground station. This type of congestion is a new funnel-shaped congestion pattern, where the shape of the congestion area dynamically changes with the traffic distribution, resulting in some downlink satellites being overloaded while others are underloaded.

[0006] Patent application number 202211398128.9 discloses a method for resource allocation in a MEC-assisted satellite network based on online intelligent auction. The method includes: constructing a multi-access MEC-assisted satellite network consisting of multiple satellites and multiple users; introducing a service satisfaction index to represent the service relationship between satellites and users based on the constructed price satellite network for multi-access MEC-assisted trading resources; and using an online multi-round auction resource allocation algorithm that maximizes overall service satisfaction and the Vickrey-Clerke-Groves payment mechanism to determine the service matching relationship between satellites and users and the final payment price of the trading resources, thereby maximizing overall service satisfaction. While this invention can maximize overall service satisfaction and solve the resource allocation problem between satellites and users, it cannot address existing imbalances. Summary of the Invention

[0007] To address the technical problem of unbalanced traffic load in existing integrated air-to-ground networks, this invention proposes a traffic offloading method for low-Earth orbit satellite constellations based on auction theory. This method utilizes auction theory to offload traffic, transferring overloaded traffic to underloaded traffic, thereby improving the bandwidth utilization of the satellite-to-ground link.

[0008] To achieve the above objectives, the technical solution of this invention is as follows: a low-Earth orbit constellation satellite network traffic offloading method based on auction theory, comprising the following steps:

[0009] Step 1: The sinking satellite obtains the link bandwidth B and round-trip time (RTT) with the ground, calculates the delay-bandwidth product (BDP), determines the maximum throughput that the link can transmit, and judges whether the sinking satellite is a lightly loaded sinking satellite, a heavily loaded sinking satellite, or a normal sinking satellite based on the relationship between the delay-bandwidth product (BDP) and the maximum throughput.

[0010] Step 2: All lightly loaded and heavily loaded sinking satellites send request packets containing detection information to each other to obtain the transmission delay between sinking satellites;

[0011] Step 3: Heavy-load satellites transmit satellite status to the ground station via the feeder link using the required bandwidth, while light-load satellites transmit satellite status to the ground station via the feeder link using the sold bandwidth (competitive bandwidth).

[0012] Step 4: Based on the collected satellite status, the ground station places the sinking satellite into the buyer's queue or the seller's queue, and then obtains the matching results between the transfer nodes of lightly loaded and heavily loaded sinking satellites through a two-way auction.

[0013] Step 5: The ground station informs each sinking satellite of the matching results through the power supply link to transfer the traffic offloading.

[0014] Preferably, the delay-bandwidth product (BDP) is equal to half the product of the link bandwidth B and the round-trip time (RTT); when the link bandwidth B reaches its maximum, the delay-bandwidth product BDP no longer increases, thereby determining the maximum traffic that the link can transmit.

[0015] Preferably, sinking satellites with a maximum throughput of less than 90% of the delay-bandwidth product (BDP) within half the round-trip time (RTT) are classified as lightly loaded sinking satellites, sinking satellites with a maximum throughput exceeding 115% of the delay-bandwidth product (BDP) are classified as heavily loaded sinking satellites, and the remaining satellites are considered as ordinary sinking satellites.

[0016] Preferably, the request packet includes the start time of sending the probe information and the name of the satellite to be sent; the transmission delay is the transmission time between the sinking satellite and other sinking satellites, and the transmission delay is sent to the ground station along with the required bandwidth / competitive bandwidth of the auction.

[0017] Preferably, the satellite status transmitted by the heavy-load sinking satellite is {role,sat_name,need_band}, and the satellite status transmitted by the light-load sinking satellite is {role,sat_name,band}. Here, the role value of the heavy-load sinking satellite is the buyer's value, and the role value of the light-load sinking satellite is the seller's value. `sat_name` is the satellite name, `need_band` is the required bandwidth, and `band` is the competitor's bandwidth. The required bandwidth `need_band` is the bandwidth that the heavy-load satellite needs to transfer, and the competitor's bandwidth `band` is the bandwidth that the light-load satellite can still handle.

[0018] Preferably, the ground station determines the buyer or seller based on the role value in the satellite status, thus obtaining a buyer queue {b1, b2, ..., b}. n} and seller queue {s1,s2,……s m}, where b i For the satellite name in the buyer's queue, s i The satellite name is the buyer queue, and n and m represent the lengths of the buyer and seller queues, respectively.

[0019] Preferably, the matching method between the lightly loaded and heavily loaded sinking satellites includes the following steps:

[0020] Step 4.1: Initialize the cost between the buyer and seller;

[0021] Step 4.2: Balance the auction results to ensure that the quantities for buyers and sellers are equal;

[0022] Step 4.3: Select a buyer from the buyer queue in order and check if the initial matching seller has been matched. If the initial matching seller has been matched, find the buyer that is in conflict with the buyer based on the matching object of the seller. The conflicting party searches for a feasible replacement. If the conflicting party can find a feasible replacement seller within the range of no more than the compensation cost above the cost of the original matching seller, the search for feasible replacement is successful and step 4.5 is executed; otherwise, it fails and step 4.4 is executed.

[0023] Step 4.4: Since the conflicting parties have not found a feasible alternative seller and are unwilling to relinquish the matched seller, the original buyer searches for other buyers in order of increasing cost. If a conflict occurs, proceed to step 4.3.

[0024] Step 4.5: Update the matching status between the buyer and the seller: If no conflict occurs during the above execution process, update the seller's matching object to the buyer; if a conflict occurs and a feasible replacement is found, update the original seller's matching buyer with the conflicting party, and at the same time, change the seller's matching object to the corresponding value.

[0025] Step 4.6: Check if all buyers have been matched. If all are matched, obtain all buyer-buyer transfer pairs, with the transfer bandwidth being the smaller value between the matching parties. If there are still unmatched buyers, return to Step 4.3; if either the buyer or seller is a virtual party, remove this match from the matching results.

[0026] Preferably, the cost between the buyer and seller in step 4.1 is:

[0027]

[0028] Where α and β are discount factors, t ij For the two satellites, i.e., buyer b i With the seller j Transmission time, cost ij For buyer b i With sellers j The cost between them, need_band i For buyer b i Bandwidth requirements j For the seller s jThe bandwidth of competing products; n and m represent the lengths of the buyer queue and the seller queue, respectively.

[0029] Preferably, if the buyer queue length is less than the seller queue length, then nm virtual buyers need to be added, and the cost of each virtual buyer and each seller is set to twice the maximum value of the transfer cost; if the buyer queue length is greater than the buyer queue length, then mn virtual sellers need to be added, and the cost of each virtual seller and each buyer is initialized to twice the maximum value of the transfer cost; the virtual sellers and virtual buyers do not participate in the actual bandwidth transfer; initialization of matching objects: for buyers, select the seller with the lowest transfer cost; for sellers, record their matching objects as 0, i.e., no match.

[0030] Preferably, the feasible replacement involves the conflicting parties searching for other sellers according to the seller queue; the original buyer's lower cost compared to the conflicting party is the compensation cost; if a conflict occurs with the other buyers being searched, the conflicting parties of the conflicting parties search for feasible replacements in the same way; in step 5, the ground station preprocesses the bandwidth of the buyer and seller, deducting the transfer bandwidth of the buyer and seller; in the buyer queue, buyers with a required bandwidth of 0 are deleted; in the seller queue, sellers with a transferable bandwidth of 0 are deleted; if the length of both the seller queue and the seller queue is not 0, then step 4 is continued to obtain a new matching queue; otherwise, the matching ends.

[0031] Compared with existing technologies, the beneficial effects of this invention are as follows: This invention applies the economic theory model of auction to the traffic offloading of satellite networks. It treats the satellite-to-ground link bandwidth as the auction item, considers lightly loaded satellites as sellers and heavily loaded satellites as buyers, and the ground station as the auction venue. Satellites determine their maximum transmittable traffic based on bandwidth and round-trip time, and then determine their state based on the bandwidth-delay product (BDP). The ground station collects the transmission time between satellites, using bandwidth and transfer time as reference factors for bidding. It uses the theory of two-way auctions to match buyers and sellers. For satellites that have not purchased bandwidth, they are required to reduce their bandwidth requirements, and the auction is repeated, thus achieving traffic offloading between lightly and heavily loaded satellites. This invention maximizes the utilization of satellite-to-ground link bandwidth and improves the overall throughput of the air-to-ground network. Attached Figure Description

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

[0033] Figure 1 This is a schematic diagram of the process in this invention.

[0034] Figure 2 This is a schematic diagram of the auction process in this invention.

[0035] Figure 3 This is a schematic diagram of the auction model in this invention.

[0036] Figure 4 This is a schematic diagram of a virtual node in the present invention, wherein (a) is a schematic diagram of adding a virtual seller, and (b) is a schematic diagram of adding a virtual buyer.

[0037] Figure 5 This is a schematic diagram of the matching process in this invention. Detailed Implementation

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

[0039] Example 1

[0040] like Figure 1 As shown, a traffic offloading method for low-Earth orbit constellation satellite networks based on auction theory is implemented through the following steps:

[0041] Step 1: The satellite is lowered to obtain the link bandwidth B and round-trip time (RTT) with the ground. The delay-bandwidth product (BDP) is obtained from the link bandwidth B and the RTT. The delay-bandwidth product (BDP) is equal to half of the link bandwidth B and the RTT product. When the bandwidth B reaches its maximum, BDP will no longer increase, thus determining the maximum traffic that the link can transmit.

[0042] Satellites with traffic less than 90% of the Delay-Bandwidth Product (BDP) within half the Round-Trip Time (RTT) are defined as lightly loaded sinking satellites, and satellites with traffic exceeding 115% of the BDP are defined as heavily loaded sinking satellites. All other satellites are considered ordinary sinking satellites. During the auction process, lightly loaded sinking satellites will be considered sellers, and heavily loaded sinking satellites will be considered buyers.

[0043] Step 2: The sinking satellites send request packets to each other. The request packet includes the start time for sending probe information and the name of the sending satellite. The sinking satellite collects the transmission time t between itself and other sinking satellites. ij After the sinking satellite collects the transmission delay between each sinking satellite, it sends the subsequent auction demand bandwidth / competitive bandwidth to the ground station as the basis for auction matching.

[0044] The required bandwidth (need_band) is the bandwidth that a heavily loaded satellite needs to transfer, while the competing bandwidth (band) is the bandwidth that a lightly loaded satellite can still handle.

[0045] Step 3: The heavy-load sinking satellite informs the ground station of its bandwidth requirement {role,sat_name,need_band} via the feeder link, where the role value is buyer; the light-load sinking satellite informs the ground station of its bandwidth requirement {role,sat_name,band} via the feeder link, where the role value is seller.

[0046] Step 4: The ground station determines whether the satellite is a buyer or a seller based on the role value collected from the satellite status data, and places the sunken satellite into the buyer's queue or the seller's queue, resulting in the buyer's queue {b1, b2, ..., b}. n} and seller queue {s1,s2,……s m},like Figure 3 As shown; where b i For the satellite name in the buyer's queue, s i Let n be the satellite name in the seller queue, and m be the length of the buyer's queue and m be the seller's queue, respectively. Then, a two-way auction is used to obtain the matching results between the transfer nodes of lightly loaded and heavily loaded sinking satellites.

[0047] Step 5: The ground station preprocesses the bandwidth of both the buyer and seller, deducting the transfer bandwidth for both parties. In the buyer queue, buyers with a bandwidth requirement of 0 are removed. In the seller queue, sellers with a transferable bandwidth of 0 are removed. If neither the seller queue nor the seller queue length is 0, proceed to Step 4 to obtain a new matching queue. Otherwise, the process ends. The ground station informs each sinking satellite of the matching results via the power supply link to facilitate the transfer of traffic offloading.

[0048] Example 2

[0049] like Figure 1 As shown, a traffic offloading method for low-Earth orbit constellation satellite networks based on auction theory is implemented in step 4, where the matching results between lightly loaded and heavily loaded satellite transfer nodes are obtained through a two-way auction. Figure 2 As shown.

[0050] The matching of lightly loaded and heavily loaded satellites includes the following steps:

[0051] Step 4.1: Initialize the cost between the buyer and seller using the following calculation formula:

[0052] cost ij =α(band) j -need_band i ) / bandj +βt ij (i∈(1,n),j∈(1,m))………………(1)

[0053] Where α and β are discount factors, and since the main consideration is the matching value between bandwidths, α = 0.8 and β = 0.2 are generally chosen. ij For the two satellites, i.e., buyer b i With the seller j Transmission time, cost ij For buyer b i With the seller j The cost between them, need_band i For buyer b i Bandwidth requirements j For the seller s j The bandwidth of competing products.

[0054] The less bandwidth is wasted between two satellites and the shorter the transmission time, the lower the cost of transferring between them is considered to be.

[0055] Step 4.2: Balance the auction results so that the quantities for the buyers and sellers are equal.

[0056] This ensures that both buyers and sellers have matching counterparties, preventing situations where buyers frequently snatch up sellers during the auction. In other words, the number of buyers exceeds the number of sellers.

[0057] like Figure 4 As shown in (a), if the buyer queue length is less than the seller queue length, then virtual buyers need to be added, with a quantity of nm, and their value is set to a larger value than the cost of each seller. This value can be twice the maximum value used in calculating the transfer cost. Figure 4 In (a), the buyer 3 on the left is the virtual node shown.

[0058] like Figure 4 As shown in (b), if the length of the buyer queue is greater than the length of the buyer queue, then virtual sellers need to be added, with a quantity of mn, and their value is initialized with a larger value, which can be twice the maximum value in the calculation of the transfer cost. Figure 4 In (b), the seller 3 on the right is the virtual node shown.

[0059] Virtual sellers and virtual buyers do not participate in the actual bandwidth transfer; they are only used for matching. Afterward, matching objects are initialized. For buyers, the seller with the lowest transfer cost is selected; for sellers, their matching objects are recorded as 0, meaning no match. The advantage of this approach is that it reduces the number of auctions and shortens the overall bidding time in subsequent auction processes.

[0060] Step 4.3: As Figure 5 As shown, from the buyer queue {b1,b2,……b n In the process, a buyer is selected sequentially, and it is checked whether the seller matched in the initialization has been matched. If the seller matched in the initialization has been matched, the buyer that conflicts with the matching of the seller (hereinafter referred to as the conflicting party) is found based on the matching object of the seller, and a feasible replacement is found for the conflicting party.

[0061] Feasible replacement means that the conflicting parties search for other sellers according to the seller queue. The price that the original buyer offers lower than the conflicting party's is called the compensation price. If the conflicting party can find a feasible replacement seller within the range of the compensation price, above the price of the original matching seller, the feasible replacement search is successful, and step 4.5 is executed. Otherwise, it fails, and step 4.4 is executed. Conflicts may also occur among the other buyers being searched. If a conflict occurs, the conflicting party's conflicting parties search for feasible replacements in the same way.

[0062] Step 4.4: Since the conflicting parties have not found a viable alternative seller and are unwilling to relinquish their matched sellers, the original buyers search for other buyers in ascending order of cost. If a conflict occurs, proceed to step 4.3. Because the number of buyers is equal to the number of sellers, a buyer will always find a matching seller.

[0063] Step 4.5: Update the matching status between the buyer and seller. If no conflict occurs during the above process, update the seller's matching object to the buyer. If a conflict occurs and a feasible replacement is found, update the original seller's matching buyer with the conflicting party, and simultaneously update the seller's matching object to the corresponding value.

[0064] Step 4.6: Check if all buyers have been matched. If all are matched, obtain all buyer-buyer transfer pairs, with the transfer bandwidth being the smaller value between the matching parties. If there are still unmatched buyers, return to Step 4.3. If either the buyer or seller is a virtual party, remove this match from the matching results.

[0065] The implementation methods for the other steps are the same as in Example 1.

[0066] The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention. Any modifications, equivalent substitutions, improvements, etc., made within the spirit and principles of the present invention should be included within the protection scope of the present invention.

Claims

1. A traffic offloading method for low-Earth orbit constellation satellite networks based on auction theory, characterized in that, The steps are as follows: Step 1: The sinking satellite obtains the link bandwidth B and round-trip time (RTT) with the ground, calculates the delay-bandwidth product (BDP), determines the maximum throughput that the link can transmit, and judges whether the sinking satellite is a lightly loaded sinking satellite, a heavily loaded sinking satellite, or a normal sinking satellite based on the relationship between the delay-bandwidth product (BDP) and the maximum throughput. Step 2: All lightly loaded and heavily loaded sinking satellites send request packets containing detection information to each other to obtain the transmission delay between sinking satellites; Step 3: Heavy-load satellites transmit satellite status to the ground station via the feeder link using the required bandwidth, while light-load satellites transmit satellite status to the ground station via the feeder link using the sold bandwidth (competitive bandwidth). Step 4: Based on the collected satellite status, the ground station places the sinking satellite into the buyer's queue or the seller's queue, and then obtains the matching results between the transfer nodes of lightly loaded and heavily loaded sinking satellites through a two-way auction. Step 5: The ground station informs each sinking satellite of the matching results through the power supply link to transfer the traffic offloading.

2. The low-Earth orbit constellation satellite network traffic offloading method based on auction theory according to claim 1, characterized in that, The delay-bandwidth product (BDP) is equal to half the product of the link bandwidth (B) and the round-trip time (RTT). Once the link bandwidth (B) reaches its maximum, the delay-bandwidth product (BDP) no longer increases, thus determining the maximum traffic that the link can transmit.

3. The low-Earth orbit constellation satellite network traffic offloading method based on auction theory according to claim 1 or 2, characterized in that, Sinking satellites with a maximum throughput of less than 90% of the delay-bandwidth product (BDP) within half the round-trip time (RTT) are classified as lightly loaded sinking satellites, while sinking satellites with a maximum throughput exceeding 115% of the BDP are classified as heavily loaded sinking satellites. All other satellites are considered as ordinary sinking satellites.

4. The low-Earth orbit constellation satellite network traffic offloading method based on auction theory according to claim 3, characterized in that, The request packet includes the start time for sending probe information and the name of the satellite to be sent; The transmission delay is the transmission time between the sinking satellite and other sinking satellites. The transmission delay is sent to the ground station along with the required bandwidth / competitive bandwidth of the auction.

5. The low-Earth orbit constellation satellite network traffic offloading method based on auction theory according to claim 4, characterized in that, The satellite status transmitted by the heavy-load sinking satellite is {role, sat_name, need_band}, and the satellite status transmitted by the light-load sinking satellite is {role, sat_name, band}. Here, the role value of the heavy-load sinking satellite is the buyer, and the role value of the light-load sinking satellite is the seller. sat_name is the satellite name, need_band is the required bandwidth, and band is the competitor's bandwidth. The required bandwidth need_band is the bandwidth that the heavy-load satellite needs to transfer, and the competitor's bandwidth band is the bandwidth that the light-load satellite can still bear.

6. The low-Earth orbit constellation satellite network traffic offloading method based on auction theory according to claim 5, characterized in that, The ground station determines whether a user is a buyer or a seller based on the role value in the satellite status, thus obtaining a buyer queue {b1, b2, ..., b}. n } and seller queue {s1,s2,……s m }, where b i For the satellite name in the buyer's queue, s i is the satellite name for the seller queue, and n and m represent the lengths of the buyer and seller queues, respectively.

7. The low-Earth orbit constellation satellite network traffic offloading method based on auction theory according to any one of claims 4-6, characterized in that, The matching method between lightly loaded and heavily loaded sinking satellites includes the following steps: Step 4.1: Initialize the cost between the buyer and seller; Step 4.2: Balance the auction results to ensure that the quantities for buyers and sellers are equal; Step 4.3: Select a buyer from the buyer queue in order and check whether the initial matching seller has been matched. If the initial matching seller has been matched, find the buyer that is in conflict with the buyer based on the matching object of the seller. The conflicting party searches for a feasible replacement. If the conflicting party can find a feasible replacement seller within the range of no more than the compensation cost above the cost of the original matching seller, the search for feasible replacement is successful, and step 4.5 is executed. Otherwise, it will fail, and proceed to step 4.4; Step 4.4: Since the conflicting parties have not found a feasible alternative seller and are unwilling to relinquish the matched seller, the original buyer searches for other buyers in order of increasing cost. If a conflict occurs, proceed to step 4.

3. Step 4.5: Update the matching status between the buyer and the seller: If no conflict occurs during the above execution process, update the seller's matching object to the buyer; if a conflict occurs and a feasible replacement is found, update the original seller's matching buyer with the conflicting party, and at the same time, change the seller's matching object to the corresponding value. Step 4.6: Check if all buyers have been matched. If all have been matched, obtain all buyer-buyer transfer pairs. The transfer bandwidth is the smaller value between the matching parties. If there are still unmatched buyers, return to step 4.

3. If either the buyer or the seller is a virtual party, delete this match from the matching results.

8. The low-Earth orbit constellation satellite network traffic offloading method based on auction theory according to claim 7, characterized in that, The cost between the buyer and the seller in step 4.1 is as follows: ； in, , As a discount factor, For the two satellites, i.e., buyer b i With sellers j Transmission time, For buyer b i With sellers j The cost between them For buyer b i The required bandwidth For the seller s j The bandwidth of competing products; n and m represent the lengths of the buyer queue and the seller queue, respectively.

9. The low-Earth orbit constellation satellite network traffic offloading method based on auction theory according to claim 8, characterized in that, If the buyer queue length is less than the seller queue length, mn virtual buyers need to be added, and the cost of each virtual buyer and each seller is set to twice the maximum value of the transfer cost. If the buyer queue length is greater than the seller queue length, nm virtual sellers need to be added, and the cost of each virtual seller and each buyer is initialized to twice the maximum value of the transfer cost. The virtual sellers and virtual buyers do not participate in the actual bandwidth transfer. Initialize the matching object: for the buyer, select the seller with the lowest transfer cost; for the seller, record its matching object as 0, i.e., no match.

10. The low-Earth orbit constellation satellite network traffic offloading method based on auction theory according to claim 8 or 9, characterized in that, The feasible replacement involves the conflicting parties searching for other sellers according to the seller queue; the original buyer's lower cost compared to the conflicting party is the compensation cost; if a conflict occurs with the other buyers being searched, the conflicting parties of the conflicting parties search for feasible replacements in the same way; in step 5, the ground station preprocesses the bandwidth of the buyer and seller, deducting the transfer bandwidth of the buyer and seller; in the buyer queue, buyers with a required bandwidth of 0 are deleted; in the seller queue, sellers with a transferable bandwidth of 0 are deleted; if the length of both the seller queue and the seller queue is not 0, then step 4 is continued to obtain a new matching queue; otherwise, the matching ends.

Images