CN109617836B - Intelligent bandwidth allocation method and system for satellite data transmission - Google Patents
Intelligent bandwidth allocation method and system for satellite data transmission Download PDFInfo
- Publication number
- CN109617836B CN109617836B CN201811637726.0A CN201811637726A CN109617836B CN 109617836 B CN109617836 B CN 109617836B CN 201811637726 A CN201811637726 A CN 201811637726A CN 109617836 B CN109617836 B CN 109617836B
- Authority
- CN
- China
- Prior art keywords
- bandwidth
- real
- time
- task
- priority
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
- H04L47/80—Actions related to the user profile or the type of traffic
- H04L47/805—QOS or priority aware
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B7/00—Radio transmission systems, i.e. using radiation field
- H04B7/14—Relay systems
- H04B7/15—Active relay systems
- H04B7/185—Space-based or airborne stations; Stations for satellite systems
- H04B7/18578—Satellite systems for providing broadband data service to individual earth stations
- H04B7/18595—Arrangements for adapting broadband applications to satellite systems
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
- H04L47/80—Actions related to the user profile or the type of traffic
- H04L47/801—Real time traffic
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Physics & Mathematics (AREA)
- Astronomy & Astrophysics (AREA)
- Aviation & Aerospace Engineering (AREA)
- General Physics & Mathematics (AREA)
- Radio Relay Systems (AREA)
Abstract
The invention provides an intelligent bandwidth allocation method and an intelligent bandwidth allocation system for satellite data transmission, which comprise the following steps: setting the maximum transmission limit speed of a link; obtaining a total bandwidth of a link; judging whether the sum of the real-time downlink code rates of the real-time tasks is greater than the total bandwidth of the link; if the total bandwidth of the link is larger than the total bandwidth of the link, all real-time tasks and non-real-time tasks are equally divided into the total bandwidth of the link; if the bandwidth is not larger than the total bandwidth of the link, distributing respective bandwidth according to the real-time downlink code rate of each real-time task, comparing the residual bandwidth obtained by subtracting the sum of the real-time downlink code rates from the total bandwidth of the link with the maximum transmission limiting speed, and dividing the residual bandwidth by the non-real-time task into the smaller one of the maximum transmission limiting speed and the residual bandwidth. The method and the system are suitable for various complex bandwidth allocation scenes such as multitask, multi-segment, multi-link, multi-source, multi-destination, multi-time-efficiency, dynamic requirements, multi-satellite, multi-task modes and the like.
Description
Technical Field
The invention relates to the technical field of satellite data transmission, in particular to an intelligent bandwidth allocation method and an intelligent bandwidth allocation system for satellite data transmission.
Background
The existing bandwidth allocation technology mainly performs bandwidth allocation under a short-distance link or a long-distance link, and is basically a pure bandwidth allocation algorithm, the link condition is generally simpler, is not systematic, and is not intelligent, the considered factors are fewer, generally only the role level is considered, and the bandwidth allocation technology is only suitable for a simpler application scenario and is not suitable for application in a complex system, for example:
a Static Bandwidth Allocation (SBA) scheme is developed in a passive optical network system, and is a Bandwidth Allocation mode with a fixed time slot length. The optical line terminal divides the upstream channel into a plurality of time slots with fixed length, and allocates the time slots to each optical network unit in advance without considering the difference of the requirements of the optical network units. In this access mode, the optical network unit does not need to send a REPORT frame, and the optical line terminal can directly allocate the bandwidth without complicated calculation, so that the access speed is high, and certain advantages are achieved.
The static bandwidth allocation scheme ignores the actual needs of the optical network unit. The idle bandwidth and the waste of relative quantity of bandwidth are caused, when the optical network unit is heavily loaded, the waste is not too large, and the idle bandwidth is obviously increased along with the gradual reduction of the load of the optical network unit.
In 2002, 2, g.kramer proposed an ipact (interleaved polling with adaptive round time) mechanism, which is a frame structure-based bandwidth allocation method and the earliest form of dynamic bandwidth allocation algorithm. IPACT causes the optical line terminal to poll each optical network unit in sequence through GATE messages in a polling manner, and the optical network unit carries a REPORT message in the transmitted effective data stream to apply for subsequent bandwidth. The optical line terminal divides the whole Cycle into a plurality of time slots with different lengths according to the bandwidth request information with different sizes of each optical network unit, and authorizes each optical network unit respectively according to the allocation scheme of the limited Maximum Transmission Window (MTW), thereby realizing the statistical multiplexing of the bandwidth and improving the utilization rate of the whole uplink channel.
The method is not an intelligent bandwidth allocation system which supports various multilink, multi-source, multi-destination and multi-timeliness and is applicable to various scenes, and is a bandwidth allocation scheme under a general simple application scene.
Disclosure of Invention
In view of the above problems, the present invention provides an intelligent bandwidth allocation method and an intelligent bandwidth allocation system suitable for satellite data transmission in various scenarios.
According to an aspect of the present invention, there is provided an intelligent bandwidth allocation method for satellite data transmission, comprising:
setting the maximum transmission limit speed of a link;
obtaining a total bandwidth of a link;
judging whether the sum of the real-time downlink code rates of the real-time tasks is greater than the total bandwidth of the link;
if the total bandwidth of the link is larger than the total bandwidth of the link, all real-time tasks and non-real-time tasks are equally divided into the total bandwidth of the link;
if the bandwidth is not larger than the total bandwidth of the link, distributing respective bandwidth according to the real-time downlink code rate of each real-time task, comparing the residual bandwidth obtained by subtracting the sum of the real-time downlink code rates from the total bandwidth of the link with the maximum transmission limiting speed, and dividing the residual bandwidth by the non-real-time task into the smaller one of the maximum transmission limiting speed and the residual bandwidth.
Preferably, the method further comprises setting two or more task priorities.
Further, preferably, the method further comprises the following steps:
obtaining the total bandwidth occupied by each task priority according to the following formula (1)
Wherein T is total bandwidth, n is category index of task priority, TnIs the total bandwidth of the nth task priority, m is the total number of categories of task priorities, WnThe set proportion of the nth task priority to the total bandwidth is that the higher the task priority is, the larger the set proportion is, and Y isnThe task number of the nth task priority;
the bandwidth of the real-time task and the bandwidth of the non-real-time task of each task priority are respectively distributed by adopting the intelligent bandwidth distribution method.
Furthermore, it is preferable that: judging whether a task with the highest priority exists;
if the highest priority task does not exist, taking the next highest priority task as the highest priority task;
if the task with the highest priority exists, intelligent bandwidth allocation is carried out on the real-time task and the non-real-time task with the highest priority;
judging whether the non-real-time task with the highest priority is distributed and whether residual bandwidth exists;
if the residual bandwidth exists, judging whether at least two tasks with different priorities exist;
if there is a priority task, the following steps are performed:
judging whether the sum of the real-time downlink code rates of the real-time tasks of the priority is larger than the residual bandwidth or not;
if the bandwidth is larger than the residual bandwidth, the real-time task and the non-real-time task of the priority level equally divide the residual bandwidth;
if the bandwidth is not larger than the residual bandwidth, the bandwidth is distributed according to the real-time downlink code rate of the real-time task, the part with the residual bandwidth minus the sum of the real-time downlink code rate and the maximum transmission limiting speed smaller is screened out, and the non-real-time task with the priority is divided into the smaller part;
when there are at least two tasks of different priorities, performing the following steps:
judging whether the highest priority of the at least two different priorities has a non-real-time task or not;
if the non-real-time tasks exist, respectively distributing the tasks in the at least two different priorities by using a weighted average method;
if the non-real-time task does not exist, judging whether the sum of real-time downlink code rates of the real-time task with the highest priority in the at least two different priorities is larger than the residual bandwidth or not;
if the current bandwidth is larger than the residual bandwidth, dividing the residual bandwidth equally by all the real-time tasks with the highest priority;
if the bandwidth is not larger than the residual bandwidth, distributing respective bandwidth according to the real-time downlink code rate of each real-time task with the highest priority, and if the sum of the residual bandwidth and the real-time downlink code rate still has a second residual bandwidth, returning to the step of judging whether at least two tasks with different priorities exist.
Preferably, the task priorities include a high priority, a medium priority and a low priority.
Furthermore, it is preferable that: after each bandwidth allocation, judging whether the network delay is greater than a set value, and if so, reducing the bandwidth allocation result by a set proportion.
Furthermore, it is preferable that: if the network delay is greater than 400ms, the bandwidth result is reduced 1/3.
Furthermore, it is preferable that: when a real-time task or/and a non-real-time task is completed, the bandwidth occupied by the real-time task or/and the non-real-time task is distributed to other real-time tasks or/and non-real-time tasks which are executing or waiting to be executed.
According to another aspect of the present invention, there is provided an intelligent bandwidth allocation system for satellite data transmission, comprising:
the setting module is used for setting the maximum transmission limiting speed of the link;
an obtaining module, for obtaining total bandwidth of the link;
the judging module is used for judging whether the sum of the real-time downlink code rates of the real-time tasks is greater than the total bandwidth or not, if so, sending a signal to the first bandwidth allocation module, and if not, sending a signal to the second bandwidth allocation module;
the first bandwidth allocation module is used for enabling all real-time tasks and non-real-time tasks to equally divide the set total bandwidth of the link;
the second bandwidth allocation module allocates respective bandwidths according to the real-time downlink code rates of the real-time tasks;
a residual bandwidth obtaining module, which is used for subtracting the sum of the bandwidth distributed by the second bandwidth distributing module from the total bandwidth of the link obtained by the obtaining module as the residual bandwidth;
the comparison module is used for comparing the residual bandwidth obtained by the residual bandwidth obtaining module with the maximum transmission limit speed of the link set by the setting module and sending the smaller party to the third bandwidth allocation module;
and the third bandwidth allocation module is used for dividing the smaller one of the residual bandwidth and the maximum transmission limiting speed by the non-real-time task in an average way.
Preferably, the method further comprises the following steps:
the priority total bandwidth determining module determines the total bandwidth of each task priority according to the total bandwidth of the link, the task priority, the task number and the set proportion of the task number occupying the total bandwidth.
Advantageous effects
The intelligent bandwidth allocation method and the allocation system for satellite data transmission are suitable for various complex, multi-system and multi-link bandwidth allocation and are suitable for the requirements proposed by various complex projects. In a multitask scene, the method is suitable for bandwidth allocation under the condition that a plurality of tasks are transmitted simultaneously. In the multi-segment scenario, it is applicable that there are multiple segments of transmission processes between the transmission source to the destination. In a multilink scenario, the method is applicable to a scenario in which a plurality of links exist between a transmission source and a transmission destination, and can analyze the real-time bandwidth conditions of the plurality of links and select a link with a large residual bandwidth for transmission. In a multi-source scenario, bandwidth allocation for transmitting data from multiple sources to the same transmission destination is supported, in this case, links from different sources to the destination are different, and therefore, total link bandwidth is also different, and if multiple tasks are transmitted simultaneously, it is necessary to perform comprehensive allocation by coordinating and analyzing link states. In a multi-destination scenario, bandwidth allocation from the same transmission source to different transmission destinations is supported, similarly, links to different destinations are different, total bandwidth is also different, when multiple tasks are transmitted simultaneously, current tasks need to be classified according to destinations, and tasks in the same destination are allocated according to the total bandwidth to the destination. In a multi-effectiveness scene, bandwidth allocation of different time-effectiveness tasks is supported, high-priority/medium-priority/low-priority tasks can be configured from the task level, a plurality of tasks need to be treated according to different priorities, the tasks with the same priority are distinguished, such as real-time tasks and non-real-time tasks, the real-time tasks can support configuration of downlink code rates (namely, transmission rate values with the lowest requirements), and the real-time tasks are preferentially transmitted under the condition that the real-time tasks and the non-real-time tasks exist at the same time. In a dynamic requirement scene, the intelligent bandwidth allocation system is not constant, but is adjusted according to the state of the system all the time, if a plurality of tasks are running at present, after one task is finished, the system can automatically judge the current state, allocate the bandwidth occupied by the task to the other running tasks, and increase the transmission bandwidth of the other tasks so as to ensure the maximum utilization rate of the bandwidth. In a multi-satellite scene, the bandwidths required by various satellites of different types are different and even variable, so that higher requirements are provided for bandwidth allocation, an intelligent bandwidth system needs to meet the transmission rate requirements of various satellites according to the time period requirements of the satellites, and meanwhile, the bandwidth is guaranteed not to be wasted as much as possible.
Drawings
Other objects and results of the present invention will be more apparent and readily appreciated by reference to the following detailed description taken in conjunction with the accompanying drawings. In the drawings:
fig. 1 is a flow chart illustrating an intelligent bandwidth allocation method for satellite data transmission according to the present invention;
FIG. 2 is a flow chart illustrating a preferred embodiment of the method for intelligent bandwidth allocation for satellite data transmission according to the present invention;
fig. 3 is a schematic diagram of a block diagram of the intelligent bandwidth distribution system for satellite data transmission according to the present invention.
Detailed Description
In the following description, for purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of one or more embodiments. It may be evident, however, that such embodiment(s) may be practiced without these specific details. In other instances, well-known structures and devices are shown in block diagram form in order to facilitate describing one or more embodiments.
Various embodiments according to the present invention will be described in detail below with reference to the accompanying drawings.
Fig. 1 is a schematic flow diagram of an intelligent bandwidth allocation method for satellite data transmission according to the present invention, and as shown in fig. 1, the intelligent bandwidth allocation method for satellite data transmission includes:
step S1, setting the maximum transmission limit speed of the link;
step S2, obtaining the total bandwidth of the link;
step S3, judging whether the sum of the real-time downlink code rates of the real-time tasks is larger than the total bandwidth of the link;
if the total bandwidth of the link is larger than the total bandwidth of the link, step S4, all real-time tasks and non-real-time tasks equally divide the total bandwidth of the link;
if not, step S5, allocating respective bandwidths according to the real-time downlink code rates of the real-time tasks;
after the real-time task is allocated, in step S6, the remaining bandwidth obtained by subtracting the sum of the real-time downlink code rate from the total bandwidth of the link is compared with the maximum transmission limiting speed;
in step S7, the non-real-time task averages the smaller of the remaining bandwidth and the maximum transmission limit speed.
The method is suitable for various complex bandwidth allocation scenes such as multitask, multi-section, multi-link, multi-source, multi-destination, multi-timeliness, dynamic requirements, multi-satellite, multi-task modes and the like.
In an embodiment of the present invention, the tasks of the satellite data transmission are prioritized into two or more task priorities, the total bandwidth of each task priority is determined according to the total bandwidth of the links, the task priorities, the task number and the set proportion of the total bandwidth, for example, the total bandwidth occupied by each task priority is obtained according to the following formula (1)
Wherein T is total bandwidth, n is category index of task priority, TnIs the total bandwidth of the nth task priority, m is the total number of categories of task priorities, WnThe set proportion of the nth task priority to the total bandwidth is that the higher the task priority is, the higher the set proportion isLarge, YnThe total bandwidth occupied by each task priority is obtained for the task number of the nth task priority according to the following formula (2)
The real-time tasks and the non-real-time tasks of the respective task priorities may be assigned using steps S1-S7, respectively.
In an optional embodiment, the method for intelligently allocating the bandwidth of the real-time task and the non-real-time task of each task priority comprises the following steps:
judging whether a task with the highest priority exists;
if the highest priority task does not exist, taking the next highest priority task as the highest priority task;
if the task with the highest priority exists, executing the steps of the intelligent bandwidth allocation method of the steps S1-S7 on the real-time task and the non-real-time task with the highest priority;
judging whether the non-real-time task with the highest priority is distributed and whether residual bandwidth exists;
if the residual bandwidth exists, judging whether at least two tasks with different priorities exist;
if there is a priority task, the following steps are performed:
judging whether the sum of the real-time downlink code rates of the real-time tasks of the priority is larger than the residual bandwidth or not;
if the current bandwidth is larger than the residual bandwidth, the real-time task and the non-real-time task of the priority level equally divide the residual bandwidth according to network delay;
if the bandwidth is not larger than the residual bandwidth, the bandwidth is distributed according to the real-time downlink code rate of the real-time task, the part with the residual bandwidth minus the sum of the real-time downlink code rate and the maximum transmission limiting speed smaller is screened out, and the non-real-time task with the priority is divided into the smaller part;
when there are at least two tasks of different priorities, performing the following steps:
judging whether the highest priority of the at least two different priorities has a non-real-time task or not;
if there are non-real-time tasks, the tasks in the at least two different priorities are each assigned using a weighted average method, e.g., the total bandwidth of the tasks in the at least two different priorities is determined according to equation (3) below
Wherein, TsAllocating the residual bandwidth for the previous priority; as another example, the total bandwidth of tasks in at least two different priorities is determined according to equation (4) below
If the non-real-time task does not exist, judging whether the sum of real-time downlink code rates of the real-time task with the highest priority in the at least two different priorities is larger than the residual bandwidth or not;
if the current bandwidth is larger than the residual bandwidth, dividing the residual bandwidth equally by all the real-time tasks with the highest priority;
if the bandwidth is not larger than the residual bandwidth, distributing respective bandwidth according to the real-time downlink code rate of each real-time task with the highest priority, and if the sum of the residual bandwidth and the real-time downlink code rate still has a second residual bandwidth, returning to the step of judging whether at least two tasks with different priorities exist.
In each of the above embodiments, preferably, the method further includes: after each bandwidth allocation, judging whether the network delay is greater than a set value, and if so, reducing the bandwidth allocation result by a set proportion.
Further, it is preferable to reduce the bandwidth result to two thirds if the network delay is greater than 400 ms.
In a preferred embodiment of the present invention, as shown in fig. 2, the task is preferred and includes a high priority, a low priority and a medium priority, and when the bandwidth is intelligently allocated, the task includes:
firstly, setting a maximum transmission limit speed fmax and task priority;
then, the total bandwidth of the link, the real-time task number of each priority task level, the real-time downlink code rate thereof, and the non-real-time task number are obtained, for example, the total bandwidth of the link is ftotal, and there are m1 real-time high-priority tasks TG1，TG2…TGm1M2 real-time medium priority tasks TZ1，TZ2…TZm2M3 real-time low-priority tasks TD1，TD2…TDm3The respective corresponding real-time downlink code rates are respectively: TGM1，TGM2…TGMm1；TZM1，TZM2…TZMm2；TDM1，TDM2…TDMm3Then the high priority real-time task downlink code rate sum is
The real-time task downlink code rate of the medium priority is
Low priority real time task downlink code rate sum
n1 non-real-time high-priority tasks FG1，FG2…FGn1(ii) a n2 non-real-time medium priority tasks FZ1，FZ2…FZn2(ii) a n3 non-real-time low-priority tasks FD1，FD2…FDn3。
If m1+ n1>0, that is to say if there is a high priority task, the following steps are carried out:
if the sum of the real-time downlink code rates is greater than the total bandwidth, that is
Then all high priority tasks are equally divided, i.e. the bandwidth of each high priority task is:
wherein, BiFor the bandwidth of the ith task, if the network delay is greater than 400ms, the bandwidth result is reduced to two thirds.
If the sum of the real-time downlink code rates is not greater than the total bandwidth, that is
Bandwidth allocation for real-time tasks according to the downstream bit rate, i.e. Bi＝TMiWherein, TMiIs the downlink code rate of the ith task, wherein if there is network delay, the network delay is set as Y, then
Wherein, Bi' is the bandwidth of the ith task optimized by the network delay, and a is a constant, the same as the network delay unit, preferably 300 ms.
Comparing the remaining bandwidth (total bandwidth-real-time downlink code rate sum) with fmax;
a smaller party is used for equally dividing the non-real-time tasks, so that waste caused by the fact that the residual bandwidth is too large and is completely given to the non-real-time tasks is prevented;
and after the non-real-time tasks are distributed, if the bandwidth is remained, the tasks are distributed to a medium priority and a low priority.
If m2+ n2>0, that is, if there is a medium priority task, the following steps are performed:
if the medium priority has non-real time and low priority, the total bandwidth of the medium priority is obtained by using a weighted average method, and the weighted average method ensures that the ratio of the bandwidth of each medium priority to the bandwidth of each low priority is the same, such as 6:4, for example, the remaining bandwidth of the tasks with high priority is 1000Mb, the ratio of the bandwidth occupation of the medium priority to the bandwidth occupation of the low priority is 3:2, the number of the tasks with medium priority in the current transmission link is 4, and the number of the tasks with low priority is 2, then after the bandwidth is allocated according to the ratio, the total bandwidth occupation value of the medium priority is 1000 × 3/(2+3) × 600Mb, and the total bandwidth occupation value of the low priority is 1000 × 2/(2+3) × 400Mb, in order to avoid the tasks with medium priority from completing the transmission after the tasks with low priority, the bandwidth must be allocated by using the weighted average method shown in formula (3), the total bandwidth occupation value of the medium priority is 750Mb, the bandwidth occupation value of the low priority is 250Mb, and the task with the medium priority can be ensured to be transmitted and completed before the task with the low priority.
If the real-time downlink code rate of the medium priority is greater than the total bandwidth of the medium priority, that is
Wherein, TZTotal bandwidth of medium priority (750 Mb in the above example), which is averaged over all medium priority tasks; for example, the bandwidth occupancy value of each of the medium priorities in the above example is 187.5 Mb.
If the sum of the real-time downlink code rates is not greater than the total bandwidth of the medium priority, that is
Dividing the real-time task according to the down-going code rate, and dividing the residual bandwidth (
Total bandwidth) is compared with fmax, a smaller party is used for equally dividing the non-real-time tasks with the medium priority, and after the non-real-time tasks are distributed, if the bandwidth is remained, the non-real-time tasks are divided into low priorities.
If there is a low priority task, if the real-time downlink code rate of the low priority task and the total bandwidth are larger than the total bandwidth of the low priority task, that is
Wherein, TDIs the total bandwidth of the low priority (250 Mb in the example above), all low priority tasks are equally divided,
for each low-priority task as in the above exampleThe bandwidth occupation value is 125Mb, if there is network delay, the network delay is set as Y, Bi＇＝Bi*Y/300。
If the sum of the real-time downlink code rate and the real-time downlink code rate of the low priority is not greater than the total bandwidth, that is
Allocating the low-priority real-time task according to the downlink code rate and the residual bandwidth
The lower priority non-real time tasks are evenly distributed using the smaller party compared to fmax.
In the above embodiment, an embodiment is given in which transmission of a high-priority task is guaranteed first, and then bandwidth is allocated to a medium-priority task and a low-priority task by using a weighted average method, but the present invention is not limited to this, and the total bandwidth may be divided equally by using the high-priority task, the medium-priority task, and the low-priority task according to the weighted average method, and when there is remaining bandwidth after the high-priority task is allocated, the remaining bandwidth may be added to the total bandwidth of the medium-priority task.
The intelligent bandwidth allocation method in the above embodiments supports a scenario in which multiple transmission tasks are performed simultaneously.
The intelligent bandwidth allocation method in each embodiment described above supports a multi-path scenario, such as a situation where the peony river first reaches the dense cloud and then reaches each node in beijing.
The intelligent bandwidth allocation method in each embodiment supports a multilink scenario, and can analyze the real-time bandwidth conditions of a plurality of links and intelligently select a link with a large residual bandwidth for transmission.
The intelligent bandwidth allocation method in each of the above embodiments supports a multi-source scenario, that is, bandwidth allocation for transmitting data from multiple sources to the same transmission destination is supported, in this case, links from different sources to the destination are different, so that total link bandwidths are also different, and if multiple tasks are transmitted simultaneously, it is necessary to perform comprehensive allocation by coordinating and analyzing link states.
The intelligent bandwidth allocation method in each embodiment described above supports a multi-destination scenario, that is, bandwidth allocation from the same transmission source to different transmission destinations is supported, similarly, links to different destinations are different, total bandwidth is also different, when multiple tasks are transmitted simultaneously, current tasks need to be classified according to destinations, and tasks at the same destination are allocated according to total bandwidth to the destination.
The intelligent bandwidth allocation method in each embodiment supports a multi-timeliness scene, that is, bandwidth allocation of different timeliness tasks is supported, from the task level, high-priority/medium-priority/low-priority tasks can be configured, and meanwhile, when a plurality of tasks exist, the tasks need to be treated according to different priorities. The tasks with the same priority level are also distinguished, such as real-time tasks and non-real-time tasks, wherein the real-time tasks can support the configuration of downlink code rate (namely the lowest required transmission rate value).
The intelligent bandwidth allocation method in the above embodiments supports a dynamic requirement scenario, that is, the intelligent bandwidth allocation system is not a constant one, but is always adjusted according to the state of the system, for example, a plurality of tasks are currently running, and after one task is completed. The system can automatically judge the current state, allocate the bandwidth occupied by the task to other running tasks, and increase the transmission bandwidth of other tasks so as to ensure the maximum utilization rate of the bandwidth.
The intelligent bandwidth allocation method in each embodiment supports a multi-satellite scenario, that is, the bandwidths required by various types of satellites are different and even variable, so that a higher requirement is provided for bandwidth allocation, and an intelligent bandwidth system needs to meet the transmission rate requirements of various satellites according to the time period requirements of the satellites, and meanwhile, the bandwidth is guaranteed not to be wasted as much as possible.
The intelligent bandwidth allocation method in each embodiment described above supports a multi-task mode scenario, that is, supports various different job task modes, such as non-real-time tasks, and other different types of tasks.
Fig. 3 is a schematic diagram of a block diagram of an intelligent bandwidth allocation system for satellite data transmission according to the present invention, and as shown in fig. 3, the intelligent bandwidth allocation system for satellite data transmission includes:
a setting module 10, which sets the maximum transmission limit speed of the link;
an obtaining module 20, obtaining a total bandwidth of a link;
the judging module 30 is used for judging whether the sum of the real-time downlink code rates of the real-time tasks is greater than the total bandwidth, if so, sending a signal to the first bandwidth allocation module, and if not, sending a signal to the second bandwidth allocation module;
a first bandwidth allocation module 40, which enables all real-time tasks and non-real-time tasks to average the set total bandwidth of the link;
the second bandwidth allocation module 50 allocates respective bandwidths according to the real-time downlink code rates of the real-time tasks;
a residual bandwidth obtaining module 60, which is used for obtaining the sum of the total bandwidth of the link obtained by the module minus the bandwidth allocated by the second bandwidth allocation module as the residual bandwidth;
the comparison module 70 compares the residual bandwidth obtained by the residual bandwidth obtaining module with the maximum transmission limit speed of the link set by the setting module, and sends the smaller one to the third bandwidth allocation module;
the third bandwidth allocation module 80, the non-real-time task, averages the smaller of the remaining bandwidth and the maximum transmission limit speed.
Preferably, the method further comprises the following steps:
and a priority total bandwidth determining module 90, which sets two or more task priorities, and determines the total bandwidth of each task priority by a weighted average method according to the total bandwidth of the links, the task priorities, the task number and the set proportion of the total bandwidth.
While the foregoing disclosure shows illustrative embodiments of the invention, it should be noted that various changes and modifications could be made herein without departing from the scope of the invention as defined by the appended claims. The functions, steps and/or actions of the method claims in accordance with the inventive embodiments described herein need not be performed in any particular order. Furthermore, although elements of the invention may be described or claimed in the singular, the plural is contemplated unless limitation to a single element is explicitly stated.
Claims (7)
1. An intelligent bandwidth allocation method for satellite data transmission is characterized by comprising the following steps:
step S1, setting the maximum transmission limit speed of the link;
step S2, obtaining the total bandwidth of the link;
step S3, judging whether the sum of the real-time downlink code rates of the real-time tasks is larger than the total bandwidth of the link;
if the total bandwidth of the link is larger than the total bandwidth of the link, step S4, all real-time tasks and non-real-time tasks equally divide the total bandwidth of the link;
if not, step S5, allocating respective bandwidths according to the real-time downlink code rates of the real-time tasks;
after the real-time task is allocated, in step S6, the remaining bandwidth obtained by subtracting the sum of the real-time downlink code rate from the total bandwidth of the link is compared with the maximum transmission limiting speed;
step S7, the non-real-time task divides the smaller of the residual bandwidth and the maximum transmission limit speed equally;
setting two or more task priorities;
wherein, still include: judging whether a task with the highest priority exists;
if the highest priority task does not exist, taking the next highest priority task as the highest priority task;
if the task with the highest priority exists, executing the steps of the intelligent bandwidth allocation method of the steps S1-S7 on the real-time task and the non-real-time task with the highest priority;
judging whether the non-real-time task with the highest priority is distributed and whether residual bandwidth exists;
if the residual bandwidth exists, judging whether at least two tasks with different priorities exist;
if there is a priority task, the following steps are performed:
judging whether the sum of the real-time downlink code rates of the real-time tasks of the priority is larger than the residual bandwidth or not;
if the bandwidth is larger than the residual bandwidth, the real-time task and the non-real-time task of the priority level equally divide the residual bandwidth;
if the bandwidth is not larger than the residual bandwidth, the bandwidth is distributed according to the real-time downlink code rate of the real-time task, the part with the residual bandwidth minus the sum of the real-time downlink code rate and the maximum transmission limiting speed smaller is screened out, and the non-real-time task with the priority is divided into the smaller part;
when there are at least two tasks of different priorities, performing the following steps:
judging whether the highest priority of the at least two different priorities has a non-real-time task or not;
if the non-real-time tasks exist, respectively distributing the tasks in the at least two different priorities by using a weighted average method;
if the non-real-time task does not exist, judging whether the sum of real-time downlink code rates of the real-time task with the highest priority in the at least two different priorities is larger than the residual bandwidth or not;
if the current bandwidth is larger than the residual bandwidth, dividing the residual bandwidth equally by all the real-time tasks with the highest priority;
if the bandwidth is not larger than the residual bandwidth, distributing respective bandwidth according to the real-time downlink code rate of each real-time task with the highest priority, and if the sum of the residual bandwidth and the real-time downlink code rate still has a second residual bandwidth, returning to the step of judging whether at least two tasks with different priorities exist.
2. The intelligent bandwidth allocation method according to claim 1, further comprising:
obtaining the total bandwidth occupied by each task priority according to the following formula (1)
Wherein T is total bandwidth, n is category index of task priority, TnIs the total bandwidth of the nth task priority, m is the total number of categories of task priorities, WnThe set proportion of the nth task priority to the total bandwidth is that the higher the task priority is, the larger the set proportion is, and Y isnThe task number of the nth task priority;
the bandwidth execution steps S1-S7 of the real-time task and the non-real-time task of each task priority are assigned, respectively.
3. The intelligent bandwidth allocation method according to claim 1, wherein a high priority, a medium priority and a low priority are set.
4. The intelligent bandwidth allocation method according to claim 1, further comprising: after each bandwidth allocation, judging whether the network delay is greater than a set value, and if so, reducing the bandwidth allocation result by a set proportion.
5. The intelligent bandwidth allocation method according to claim 4, wherein if the network delay is greater than 400ms, the bandwidth result is reduced 1/3.
6. The intelligent bandwidth allocation method according to any one of claims 1 to 5, further comprising: when a real-time task or/and a non-real-time task is completed, the bandwidth occupied by the real-time task or/and the non-real-time task is distributed to other real-time tasks or/and non-real-time tasks which are executing or waiting to be executed.
7. An intelligent bandwidth allocation system for satellite data transmission, comprising:
the setting module is used for setting the maximum transmission limiting speed of the link;
an obtaining module, for obtaining total bandwidth of the link;
the judging module is used for judging whether the sum of the real-time downlink code rates of the real-time tasks is greater than the total bandwidth or not, if so, sending a signal to the first bandwidth allocation module, and if not, sending a signal to the second bandwidth allocation module;
the first bandwidth allocation module is used for enabling all real-time tasks and non-real-time tasks to equally divide the total bandwidth of the link;
the second bandwidth allocation module allocates respective bandwidths according to the real-time downlink code rates of the real-time tasks;
a residual bandwidth obtaining module, which is used for subtracting the sum of the bandwidth distributed by the second bandwidth distributing module from the total bandwidth of the link obtained by the obtaining module as the residual bandwidth;
the comparison module is used for comparing the residual bandwidth obtained by the residual bandwidth obtaining module with the maximum transmission limit speed of the link set by the setting module and sending the smaller party to the third bandwidth allocation module;
the third bandwidth allocation module is used for dividing the residual bandwidth and the smaller party of the maximum transmission limiting speed by the non-real-time task;
wherein, still include:
the priority total bandwidth determining module is used for determining the total bandwidth of each task priority according to the total bandwidth of the link, the task priorities, the task quantity and the set proportion of the total bandwidth, and comprises the following steps:
judging whether a task with the highest priority exists;
if the highest priority task does not exist, taking the next highest priority task as the highest priority task;
performing the steps of the intelligent bandwidth allocation method of claims 1 steps S1-S7 on the highest priority real-time task and the non-real-time task, if any;
judging whether the non-real-time task with the highest priority is distributed and whether residual bandwidth exists;
if the residual bandwidth exists, judging whether at least two tasks with different priorities exist;
if there is a priority task, the following steps are performed:
judging whether the sum of the real-time downlink code rates of the real-time tasks of the priority is larger than the residual bandwidth or not;
if the bandwidth is larger than the residual bandwidth, the real-time task and the non-real-time task of the priority level equally divide the residual bandwidth;
if the bandwidth is not larger than the residual bandwidth, the bandwidth is distributed according to the real-time downlink code rate of the real-time task, the part with the residual bandwidth minus the sum of the real-time downlink code rate and the maximum transmission limiting speed smaller is screened out, and the non-real-time task with the priority is divided into the smaller part;
when there are at least two tasks of different priorities, performing the following steps:
judging whether the highest priority of the at least two different priorities has a non-real-time task or not;
if the non-real-time tasks exist, respectively distributing the tasks in the at least two different priorities by using a weighted average method;
if the non-real-time task does not exist, judging whether the sum of real-time downlink code rates of the real-time task with the highest priority in the at least two different priorities is larger than the residual bandwidth or not;
if the current bandwidth is larger than the residual bandwidth, dividing the residual bandwidth equally by all the real-time tasks with the highest priority;
if the bandwidth is not larger than the residual bandwidth, distributing respective bandwidth according to the real-time downlink code rate of each real-time task with the highest priority, and if the sum of the residual bandwidth and the real-time downlink code rate still has a second residual bandwidth, returning to the step of judging whether at least two tasks with different priorities exist.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811637726.0A CN109617836B (en) | 2018-12-29 | 2018-12-29 | Intelligent bandwidth allocation method and system for satellite data transmission |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811637726.0A CN109617836B (en) | 2018-12-29 | 2018-12-29 | Intelligent bandwidth allocation method and system for satellite data transmission |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109617836A CN109617836A (en) | 2019-04-12 |
| CN109617836B true CN109617836B (en) | 2021-08-03 |
Family
ID=66015445
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811637726.0A Active CN109617836B (en) | 2018-12-29 | 2018-12-29 | Intelligent bandwidth allocation method and system for satellite data transmission |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109617836B (en) |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110932769A (en) * | 2019-11-12 | 2020-03-27 | 南京衡尔姮网络科技有限公司 | Multichannel satellite bandwidth dynamic allocation method |
| CN113055308B (en) * | 2019-12-26 | 2024-03-05 | 华为云计算技术有限公司 | Bandwidth scheduling method, traffic transmission method and related products |
| CN111586350B (en) * | 2020-04-19 | 2021-11-09 | 国网辽宁省电力有限公司电力科学研究院 | Method for adjusting code rate based on bandwidth, priority and no-operation time |
| CN114844556B (en) * | 2022-04-26 | 2023-08-25 | 武昌理工学院 | Remote sensing information de-differentiation transmission method based on functional satellite load rate |
| CN117596395B (en) * | 2024-01-18 | 2024-05-07 | 浙江大华技术股份有限公司 | Code rate control method, device and computer readable storage medium |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1953353A (en) * | 2006-06-28 | 2007-04-25 | 北京邮电大学 | A distribution method of dynamic bandwidth based on multiple-grade service in the gigabit passive optical network |
| CN104184514A (en) * | 2014-08-29 | 2014-12-03 | 大连大学 | Bandwidth allocation method used for satellite network |
| CN108768885A (en) * | 2018-05-29 | 2018-11-06 | 西南交通大学 | A kind of network real-time scheduling method based on type of service |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8660006B2 (en) * | 2011-11-29 | 2014-02-25 | Hughes Network Systems, Llc | Method and system for traffic management and resource allocation on a shared access network |
-
2018
- 2018-12-29 CN CN201811637726.0A patent/CN109617836B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1953353A (en) * | 2006-06-28 | 2007-04-25 | 北京邮电大学 | A distribution method of dynamic bandwidth based on multiple-grade service in the gigabit passive optical network |
| CN104184514A (en) * | 2014-08-29 | 2014-12-03 | 大连大学 | Bandwidth allocation method used for satellite network |
| CN108768885A (en) * | 2018-05-29 | 2018-11-06 | 西南交通大学 | A kind of network real-time scheduling method based on type of service |
Non-Patent Citations (2)
| Title |
|---|
| 一种简单灵活的带宽分配机制及其性能仿真;王海涛等;《数据通信》;20020630(第02期);全文 * |
| 基于动态规划的遥感卫星数据分发策略研究;秦丽等;《遥感信息》;20161015(第05期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109617836A (en) | 2019-04-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109617836B (en) | Intelligent bandwidth allocation method and system for satellite data transmission | |
| US5615212A (en) | Method, device and router for providing a contention-based reservation mechanism within a mini-slotted dynamic entry polling slot supporting multiple service classes | |
| CN110248417B (en) | Resource allocation method and system for communication service in power Internet of things | |
| JP4995808B2 (en) | Method and apparatus for enhanced content delivery over a data network | |
| US20040156367A1 (en) | Hierarchically distributed scheduling apparatus and method | |
| CN112996116B (en) | Resource allocation method and system for guaranteeing quality of power time delay sensitive service | |
| CN109618375B (en) | UAV ad hoc network time slot scheduling method based on service priority and channel interruption probability | |
| JP2003229896A (en) | Device and method for scheduling packet transmission | |
| CN111836370B (en) | Resource reservation method and equipment based on competition | |
| US20090304021A1 (en) | Method and System For Dynamic Resource Allocation | |
| CN112637911A (en) | Resource allocation method and system for eMB and urllc in coexistence in 5G system | |
| CN109743751B (en) | Resource allocation method and device for wireless access network | |
| JP2001504316A (en) | System, apparatus and method for performing scheduling in a communication network | |
| JP3508562B2 (en) | Communication bandwidth allocation method | |
| CN112039804B (en) | Method and system for dynamically allocating burst service bandwidth based on weight ratio | |
| US8045577B2 (en) | Method and apparatus for allocating wireless resource and wireless network system | |
| Chang et al. | Adaptive hierarchical polling and cost-based call admission control in IEEE 802.16 WiMAX networks | |
| CN116074260A (en) | Service slice scheduling method in power network | |
| KR100446794B1 (en) | A traffic control technology in home network through adaptive priority control | |
| CN113766653A (en) | Service demand-oriented TDMA time slot allocation method | |
| CN113014465A (en) | Bus transmission interface system based on quality of service characteristics and design method | |
| CN113905448A (en) | Wireless network resource scheduling method, device and equipment | |
| CN111586880A (en) | Dynamic hybrid access method and system suitable for TDMA | |
| Grover et al. | A new queue length based scheduling strategy for nrtPS service class in IEEE 802.16 networks | |
| Delicado et al. | New contention resolution schemes for WiMAX |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |