CN112039804A - Method and system for dynamically allocating burst service bandwidth based on weight ratio - Google Patents
Method and system for dynamically allocating burst service bandwidth based on weight ratio Download PDFInfo
- Publication number
- CN112039804A CN112039804A CN202010897459.1A CN202010897459A CN112039804A CN 112039804 A CN112039804 A CN 112039804A CN 202010897459 A CN202010897459 A CN 202010897459A CN 112039804 A CN112039804 A CN 112039804A
- Authority
- CN
- China
- Prior art keywords
- bandwidth
- preset node
- preset
- bandwidth allocation
- service
- 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.)
- Granted
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/76—Admission control; Resource allocation using dynamic resource allocation, e.g. in-call renegotiation requested by the user or requested by the network in response to changing network conditions
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Small-Scale Networks (AREA)
Abstract
The invention discloses a method and a system for dynamically allocating burst service bandwidth based on weight proportion, and relates to the field of aerospace. The method comprises the following steps: polling the state information of each preset node in the time delay insensitive bursty service bandwidth allocation, calculating the bandwidth allocation weight of each preset node according to the obtained information, and calculating the minimum guaranteed bandwidth of the preset node according to the bandwidth allocation weight; the bandwidth allocation is carried out according to the requested bandwidth and the guaranteed bandwidth, the updated data transmission state of the preset node and the updated requested bandwidth are obtained, the bandwidth allocation of each preset node is dynamically adjusted and corrected according to the updated data before the next round of transmission, the bandwidth transmission of strong aging service, delay sensitive service and burst service is effectively guaranteed, the reliability of data transmission is enhanced, the utilization rate of network bandwidth is improved, and the network throughput is improved.
Description
Technical Field
The invention relates to the field of aerospace, in particular to a method and a system for dynamically allocating burst service bandwidth based on weight proportion.
Background
With the continuous expansion of the application task scale in the aerospace field, the types of the effective loads mounted on the large aerospace information network are more and more, the control is more and more complex, the transmitted information amount is more and more, and the transmission rate is higher and more, and the characteristics provide higher requirements for the aspects of instantaneity, data transmission bandwidth, data processing capacity, reliability and the like of the high-reliability application information network.
FC-AE-1553(Fibre-Channel environments-Upper Layer Protocol: FC-AE-1553) network is considered as one of protocols meeting the requirements of future aerospace missions due to the advantages of high real-time performance, high bandwidth, high reliability, low loss, compatibility with MIL-STD-1553 and the like, and becomes a preferred network of future aerospace vehicles. Then, with the continuous increase of data service types and data traffic, how to maximize the bandwidth utilization of the FC-AE-1553 network and realize the effective transmission of services is one of the important problems faced by the current FC-AE-155 network. However, the existing technical solutions can not solve the problem.
Disclosure of Invention
The technical problem to be solved by the present invention is to provide a method and a system for dynamically allocating burst service bandwidth based on weight allocation, aiming at the defects of the prior art.
The technical scheme for solving the technical problems is as follows:
a method for dynamically allocating burst service bandwidth based on weight ratio comprises the following steps:
s1, polling the data transmission state and the request bandwidth of each preset node in the time delay insensitive bursty service bandwidth allocation, calculating the bandwidth allocation weight of each preset node according to the data transmission state and the request bandwidth, and calculating the minimum guaranteed bandwidth of each preset node according to the bandwidth allocation weight;
s2, according to the request bandwidth and the minimum guaranteed bandwidth, performing bandwidth allocation on each preset node;
s3, obtaining the updated data transmission state and the updated request bandwidth of each preset node through polling, and dynamically adjusting and correcting the bandwidth allocation of each preset node according to the updated data transmission state and the updated request bandwidth before the next round of transmission;
before S1, the method further includes performing fixed bandwidth allocation on the periodic service and the strong time-based bursty service according to a first preset weight value and a second preset weight value.
The invention has the beneficial effects that: according to the scheme, the fixed bandwidth allocation is carried out on the periodic service and the strong timeliness burst service, the dynamic bandwidth allocation is carried out on the delay insensitive burst service, the certainty and the real-time performance of key data transmission are guaranteed, meanwhile, the transmission bandwidth of the bus is utilized to the maximum extent, the bandwidth exceeding the request part is collected and then redistributed, the highest bandwidth utilization efficiency is achieved, the bandwidth transmission of the strong timeliness service, the delay sensitive service and the burst service is effectively guaranteed, the reliability of data transmission is enhanced, the network bandwidth utilization rate is improved, and the network throughput is improved.
Further, the minimum guaranteed bandwidth is calculated according to the following formula:
wherein the content of the first and second substances,
for minimum guaranteed bandwidth, PcycleFor a service period, n denotes n data connections, TgTransmission guard time, w, scheduled for a messageNCT_iAssigning a weight to the bandwidth of the preset node, CNCTLink capacity, R, of the corresponding time axis of the preset nodeNCTBandwidth rates reserved for periodic traffic and strong time-sensitive bursty traffic.
The beneficial effect of adopting the further scheme is that: according to the scheme, the minimum guaranteed bandwidth of each preset node is calculated through the bandwidth allocation weight, the rated bandwidth allocation of the burst service is realized, and the basic transmission of tasks of each node is guaranteed.
Further, the S1 further specifically includes: calculating the bandwidth allocation weight of the preset node according to the following formula:
wherein the content of the first and second substances,
requested bandwidth, Δ R, for the preset nodeNCTI represents the ith node, k represents k requests,
indicating the size of the nominal bandwidth allocated to bursty traffic.
The beneficial effect of adopting the further scheme is that: according to the scheme, the bandwidth allocation weight of each preset node is calculated according to the data transmission state and the request bandwidth, and the bandwidth requirements of each node transmission task are allocated according to the calculated weight value, so that the highest bandwidth utilization efficiency is realized.
Further, the S2 specifically includes: allocating the bandwidth of each preset node according to the following formula:
wherein the content of the first and second substances,
indicating a size of a nominal bandwidth allocated to bursty traffic on the preset node,
for the requested bandwidth of the preset node,
and the minimum guaranteed bandwidth of the preset node, i represents the ith node, and k represents k requests.
The beneficial effect of adopting the further scheme is that: according to the scheme, bandwidth allocation is carried out on each preset node according to the requested bandwidth and the minimum guaranteed bandwidth, rated bandwidth allocation is carried out on the burst service, and the basic transmission requirements of the nodes are met.
Further, before the step S1, fixed bandwidth allocation is further performed on the periodic service and the strong time-sensitive bursty service according to a first preset weight value and a second preset weight value.
The beneficial effect of adopting the further scheme is that: according to the scheme, the fixed bandwidth allocation is carried out on the periodic service and the strong timeliness burst service, and the dynamic bandwidth allocation is carried out on the time delay insensitive burst service, so that the certainty and the real-time performance of key data transmission are guaranteed.
Another technical solution of the present invention for solving the above technical problems is as follows:
a system for dynamically allocating burst service bandwidth based on weight ratio comprises: the system comprises a guaranteed bandwidth calculation module, a rated bandwidth allocation module and an extra bandwidth allocation module;
the guaranteed bandwidth calculation module is used for polling the data transmission state and the request bandwidth of each preset node in the time delay insensitive bursty service bandwidth allocation, calculating the bandwidth allocation weight of each preset node according to the data transmission state and the request bandwidth, and calculating the minimum guaranteed bandwidth of each preset node through the bandwidth allocation weight;
the rated bandwidth allocation module is used for allocating bandwidth to each preset node according to the requested bandwidth and the minimum guaranteed bandwidth;
the extra bandwidth allocation module is used for acquiring the updated data transmission state and the updated request bandwidth of each preset node through polling, and dynamically adjusting and correcting the bandwidth allocation of each preset node according to the updated data transmission state and the updated request bandwidth before the next round of transmission.
The invention has the beneficial effects that: according to the scheme, the fixed bandwidth allocation is carried out on the periodic service and the strong timeliness burst service, the dynamic bandwidth allocation is carried out on the delay insensitive burst service, the certainty and the real-time performance of key data transmission are guaranteed, meanwhile, the transmission bandwidth of the bus is utilized to the maximum extent, the bandwidth exceeding the request part is collected and then redistributed, the highest bandwidth utilization efficiency is achieved, the bandwidth transmission of the strong timeliness service, the delay sensitive service and the burst service is effectively guaranteed, the reliability of data transmission is enhanced, the network bandwidth utilization rate is improved, and the network throughput is improved.
Further, the guaranteed bandwidth calculating module is specifically configured to calculate a minimum guaranteed bandwidth according to the following formula:
wherein the content of the first and second substances,
for minimum guaranteed bandwidth, PcycleFor a service period, n denotes n data connections, TgTransmission guard time, w, scheduled for a messageNCT_iAssigning a weight to the bandwidth of the preset node, CNCTLink capacity, R, of the corresponding time axis of the preset nodeNCTBandwidth rates reserved for periodic traffic and strong time-sensitive bursty traffic.
The beneficial effect of adopting the further scheme is that: according to the scheme, the minimum guaranteed bandwidth of each preset node is calculated through the bandwidth allocation weight, the rated bandwidth allocation of the burst service is realized, and the basic transmission of tasks of each node is guaranteed.
Further, the bandwidth guarantee calculation module is specifically configured to calculate a bandwidth allocation weight of the preset node according to the following formula:
wherein the content of the first and second substances,
requested bandwidth, Δ R, for the preset nodeNCTI represents the ith node, k represents k requests,
indicating the size of the nominal bandwidth allocated to bursty traffic.
The beneficial effect of adopting the further scheme is that: according to the scheme, the bandwidth allocation weight of each preset node is calculated according to the data transmission state and the request bandwidth, and the bandwidth requirements of each node transmission task are allocated according to the calculated weight value, so that the highest bandwidth utilization efficiency is realized.
Further, the nominal bandwidth allocation module is specifically configured to allocate a bandwidth to each of the preset nodes according to the following formula:
wherein the content of the first and second substances,
indicating a size of a nominal bandwidth allocated to bursty traffic on the preset node,
for the requested bandwidth of the preset node,
and the minimum guaranteed bandwidth of the preset node, i represents the ith node, and k represents k requests.
The beneficial effect of adopting the further scheme is that: according to the scheme, bandwidth allocation is carried out on each preset node according to the requested bandwidth and the minimum guaranteed bandwidth, rated bandwidth allocation is carried out on the burst service, and the basic transmission requirements of the nodes are met.
Further, still include: and the fixed bandwidth allocation module is used for respectively performing fixed bandwidth allocation on the periodic service and the strong timeliness burst service according to the first preset weight value and the second preset weight value.
The beneficial effect of adopting the further scheme is that: according to the scheme, the fixed bandwidth allocation is carried out on the periodic service and the strong timeliness burst service, and the dynamic bandwidth allocation is carried out on the time delay insensitive burst service, so that the certainty and the real-time performance of key data transmission are guaranteed.
Advantages of additional aspects of the invention will be set forth in part in the description which follows, and in part will be obvious from the description, or may be learned by practice of the invention.
Drawings
Fig. 1 is a schematic flowchart of a method for dynamically allocating burst service bandwidth based on weight matching according to an embodiment of the present invention;
fig. 2 is a structural framework diagram of a system for dynamically allocating burst service bandwidth based on weight matching according to another embodiment of the present invention;
Detailed Description
The principles and features of this invention are described below in conjunction with the following drawings, which are set forth to illustrate, but are not to be construed to limit the scope of the invention.
As shown in fig. 1, the method for dynamically allocating burst service bandwidth based on weight ratio according to the embodiment of the present invention includes S1, polling the data transmission state and the request bandwidth of each preset node in the burst service bandwidth allocation insensitive to time delay, calculating the bandwidth allocation weight of each preset node according to the data transmission state and the request bandwidth, and calculating the minimum guaranteed bandwidth of each preset node according to the bandwidth allocation weight; it should be noted that, in the bandwidth allocation scheme of the present invention, the bandwidth allocation scheme may be used in an NC transmission time axis, an NC reception time axis, and an NT reception time axis, and the preset node may be a node in the time axis for task transmission. NC denotes a network control device, NT denotes a network terminal.
In a certain embodiment, the bursty traffic adopts a dynamic bandwidth allocation manner, and as mentioned in the foregoing, data transmission of the entire network is abstracted into three types of time axes, and scheduling of each type of time axis is relatively opposite. Therefore, the bandwidth allocation of the whole network is simplified into the bandwidth allocation process of different connections on each time axis.
After the NC node counts the states of the polling terminals, the guaranteed bandwidth of each connection is calculated according to the load of each connection occupying different time axes. In each dynamic bandwidth scheduling period, when the NC allocates bandwidth to each connection of the NT node, there will be a case where a part of bandwidth requests of the NT node is smaller than the guaranteed bandwidth. At this time, the bandwidth exceeding the request part can be collected and then reallocated to achieve the highest bandwidth utilization efficiency,
s2, according to the request bandwidth and the minimum guarantee bandwidth, allocating the bandwidth to each preset node;
in some embodiments, the bandwidth allocation at the NC transmit timeline may include: for example, there are n DLKs on the NC transmission time axis of the FC-AE-1553 network, and the link capacity of the time axis is CNCTbits/s, bandwidth rate reserved for periodic service and strong time-effect burst service is RNCTbits/s, service period PcycleThe transmission guard time of the message scheduling is Tg，DLKiThe available bandwidth is assigned a weight of wNCT_iTo do so by
Represents DLKiThe minimum guaranteed bandwidth that can be obtained; where DLK (data-link) represents a single time axis derived data connection.
Assigning a weight wNCT_iIf the bandwidth request of a certain data connection is not completely satisfied in a scheduling period, the value is accumulated to the next scheduling period. Assigning a weight wNCT_iData connections with large values are allocated a large guaranteed bandwidth during the scheduling period. To be provided with
Respectively represent DLK received by NCiBandwidth request, Δ R, for incoming bursty trafficNCTThe sum of the bandwidth requirements which are not met in the last scheduling period; assigning a weight wNCT_iCan be calculated by the following formula:
and wNCT_iSatisfy the requirement of
Minimum guaranteed bandwidth
Can be calculated by the following formula:
and performing bandwidth allocation on the time delay insensitive bursty service, wherein the allocation process can include:
and performing rated bandwidth allocation on the bursty service: to be provided with
Representing the size of the rated bandwidth allocated to bursty traffic, the calculation formula may be as follows:
it should be noted that, in an embodiment, the bandwidth allocation may include: at the beginning of each scheduling period, the NC broadcasts a command frame to poll the NT node for data transmission status. An RT node of a time division command/response type multiplex transmission data bus MIL-STD-1553B in the traditional airplane applies for data transmission bandwidth in a mode of setting a request flag bit, an FC-AE-1553 network expands the transmission bandwidth by orders of magnitude, for example, the transmission bandwidth is upgraded to Gbps from Mbps, and an NT node can represent the bandwidth transmission requirement and the transmission data volume of the service in an expansion field after the request flag bit is set. The bandwidth allocation of each service period depends on two factors, the data transmission status information fed back by all NT nodes at the beginning of transmission and the bandwidth requirement. At the beginning of the next transmission, the NC node correspondingly adjusts and corrects the guaranteed bandwidth of each data connection according to the latest feedback state information of the NT node.
Because the three different service data types have different characteristics, the adoption of the mixed bandwidth allocation algorithm can ensure the certainty and the real-time performance of the critical data transmission and simultaneously utilize the transmission bandwidth of the bus to the maximum extent. The fixed bandwidth allocated service is a strong timeliness burst service and a periodic service; the service for dynamically allocating the bandwidth is a bursty service. Dynamic bandwidth allocation is allocated for data connections of a single time axis, and allocation algorithms of the time axes are the same
S3, acquiring the updated data transmission state and the updated request bandwidth of each preset node through polling, and dynamically adjusting and correcting the bandwidth allocation of each preset node according to the updated data transmission state and the updated request bandwidth before the next round of transmission;
in an embodiment, the allocating the extra bandwidth to the bursty traffic may include:
m denotes a set in which the bandwidth request of the bursty traffic along with the corresponding data connection has not been completely satisfied, and N denotes a set in which the bandwidth request of the data connection corresponding to the bursty traffic has been satisfied.
Indicating the total amount that can be used for iterative bandwidth allocation. Iterative bandwidth allocation of bursty traffic is performed on a node corresponding to the data connection of i e M, and the allocation method can be as follows:
initializing the variables:
If
and
then
entering step 3 to carry out the extra bandwidth iterative allocation of the burst service
Else
Ending the bandwidth allocation operation of the bursty service;
allocating extra bandwidth to all i e M according to the application requirement in proportion;
For all i ∈ M, if
Then there are:
If
and
then，
the loop iteration continues with step S3,
Else，
the bandwidth allocation operation is ended.
In an embodiment, S1 further includes performing fixed bandwidth allocation on the periodic traffic and the strong temporal bursty traffic according to a first preset weight value and a second preset weight value, respectively.
It should be noted that, the invention adopts a mode of service type classification, adopts static fixed bandwidth allocation for the time delay sensitive periodic service (PM) and the strong timeliness burst service (TCBM), and adopts dynamic weighted value allocation for the burst service (BM); the bandwidth allocation for the periodic service and the strong time-sensitive burst service according to the weight may include:
based on the control characteristics of the master-slave network, the dynamic bandwidth allocation algorithm is carried and executed by an nc (network control) to ensure the transmission characteristics of different nodes and different types of messages on the network and to ensure QoS (quality of service). When NC carries out dynamic bandwidth allocation, PM, TCBM and BM messages are respectively defined with a weight value: w is aPM、wTCBMAnd wBM. And when the NC carries out bandwidth allocation, the network bandwidth occupied by the three types of services is allocated according to the weight value.
wPM+wTCBM+wBM＝1，
According to the scheme, the fixed bandwidth allocation is carried out on the periodic service and the strong timeliness burst service, the dynamic bandwidth allocation is carried out on the delay insensitive burst service, the certainty and the real-time performance of key data transmission are guaranteed, meanwhile, the transmission bandwidth of the bus is utilized to the maximum extent, the bandwidth exceeding the request part is collected and then redistributed, the highest bandwidth utilization efficiency is achieved, the bandwidth transmission of the strong timeliness service, the delay sensitive service and the burst service is effectively guaranteed, the reliability of data transmission is enhanced, the network bandwidth utilization rate is improved, and the network throughput is improved.
Preferably, in any of the above embodiments, calculating the minimum guaranteed bandwidth of each preset node according to the data transmission status and the requested bandwidth specifically includes: the minimum guaranteed bandwidth is calculated according to the following formula:
wherein the content of the first and second substances,
for minimum guaranteed bandwidth, PcycleFor a service period, n denotes n data connections, TgTransmission guard time, w, scheduled for a messageNCT_iAssigning a weight to the bandwidth of a predetermined node, CNCTLink capacity, R, of the corresponding time axis for a preset nodeNCTBandwidth rates reserved for periodic traffic and strong time-sensitive bursty traffic.
According to the scheme, the minimum guaranteed bandwidth of each preset node is calculated through bandwidth allocation weight, the rated bandwidth allocation of the burst service is realized, and the basic transmission of each node task is guaranteed.
Preferably, in any of the above embodiments, S1 further specifically includes: calculating the bandwidth allocation weight of the preset node according to the following formula:
wherein the content of the first and second substances,
for presetting the requested bandwidth of the node, Δ RNCTI represents the ith node, k represents k requests,
indicating the size of the nominal bandwidth allocated to bursty traffic.
According to the scheme, the bandwidth allocation weight of each preset node is calculated according to the data transmission state and the request bandwidth, and the bandwidth requirements of each node transmission task are allocated according to the demand and the weight value obtained through calculation, so that the highest bandwidth utilization efficiency is realized.
Preferably, in any of the above embodiments, S2 specifically includes: allocating the bandwidth of each preset node according to the following formula:
wherein the content of the first and second substances,
indicating the size of the nominal bandwidth allocated to bursty traffic on a preset node,
in order to preset the requested bandwidth of the node,
and presetting the minimum guaranteed bandwidth of the nodes, wherein i represents the ith node, and k represents k requests.
According to the scheme, the bandwidth is allocated to each preset node according to the requested bandwidth and the minimum guaranteed bandwidth, the rated bandwidth is allocated to the burst service, and the basic transmission requirements of the nodes are met.
Preferably, in any of the above embodiments, further comprising: when the total amount of bandwidth for bandwidth allocation is greater than zero and there are preset nodes whose requested bandwidth is not satisfied, the process continues to step S3.
According to the scheme, when the total bandwidth amount for bandwidth allocation is larger than zero and the preset nodes with the bandwidth requests not met exist, the bandwidth allocation is continuously adjusted, so that iterative bandwidth allocation of the burst service to the nodes corresponding to the data connection is realized, bandwidth surplus is reduced to the maximum extent, and the bandwidth required by transmission tasks of all the nodes is met.
In one embodiment, the NC receiving the bandwidth allocation for the timeline may include:
suppose that there are m DLKs on the NC reception time axis of the FC-AE-1553 network, and the link capacity of the time axis is CNCRbits/s, bandwidth rate reserved for periodic service and strong time-effect burst service is RNCRbits/s, service period PcycleThe transmission guard time of the message scheduling is Tg，DLKiThe available bandwidth is assigned a weight of wNCR_iTo do so by
Represents DLKiThe minimum guaranteed bandwidth that can be achieved.
Assigning a weight wNCR_iIf the bandwidth request of a certain data connection is not completely satisfied in a scheduling period, the value is accumulated to the next scheduling period. Assigning a weight wNCR_iData connections with large values are allocated a large guaranteed bandwidth during the scheduling period. To be provided with
Respectively represent DLK received by NCiSending a bandwidth request, Δ R, for bursty traffic on the NC reception time axisNCRIs the sum of the bandwidth requirements that were not met in the last scheduling period.
And wNCR_iSatisfy the requirement of
The allocation algorithm of the NC reception time axis for bursty traffic is identical to the allocation algorithm of the transmission time axis.
In one embodiment, the bandwidth allocation of the NT receive timeline may include:
suppose that there are m DLKs on the NC reception time axis of the FC-AE-1553 network, and the link capacity of the time axis is CNTRbits/s, bandwidth rate reserved for periodic service and strong time-effect burst service is RNTRbits/s, service period PcycleThe transmission guard time of the message scheduling is Tg，DLKiThe available bandwidth is assigned a weight of wNTR_iTo do so by
Represents DLKiThe minimum guaranteed bandwidth that can be achieved.
Assigning a weight wNTR_iIf the bandwidth request of a certain data connection is not completely satisfied in a scheduling period, the value is accumulated to the next scheduling period. Assigning a weight wNTR_iData connections with large values are allocated a large guaranteed bandwidth during the scheduling period. To be provided with
Respectively represent DLK received by NCiSending a bandwidth request, Δ R, for bursty traffic on the NC reception time axisNTRIs the sum of the bandwidth requirements that were not met in the last scheduling period.
And wNTR_iSatisfy the requirement of
The distribution algorithm of the burst traffic on the NT reception time axis is consistent with the distribution algorithm described above
In one embodiment, as shown in fig. 2, a system for dynamically allocating bandwidth for burst traffic based on weight matching includes: a guaranteed bandwidth calculation module 110, a rated bandwidth allocation module 111, and an extra bandwidth allocation module 112;
the guaranteed bandwidth calculation module 110 is configured to poll a data transmission state and a requested bandwidth of each preset node in a time delay insensitive bursty service bandwidth allocation, calculate a bandwidth allocation weight of each preset node according to the data transmission state and the requested bandwidth, and calculate a minimum guaranteed bandwidth of each preset node according to the bandwidth allocation weight;
the nominal bandwidth allocation module 111 is configured to allocate a bandwidth to each preset node according to the requested bandwidth in combination with the minimum guaranteed bandwidth;
the extra bandwidth allocation module 112 is configured to obtain an updated data transmission status and an updated requested bandwidth of each preset node through polling, and dynamically adjust and modify the bandwidth allocation of each preset node according to the updated data transmission status and the updated requested bandwidth before a next round of transmission.
According to the scheme, the fixed bandwidth allocation is carried out on the periodic service and the strong timeliness burst service, the dynamic bandwidth allocation is carried out on the delay insensitive burst service, the certainty and the real-time performance of key data transmission are guaranteed, meanwhile, the transmission bandwidth of the bus is utilized to the maximum extent, the bandwidth exceeding the request part is collected and then redistributed, the highest bandwidth utilization efficiency is achieved, the bandwidth transmission of the strong timeliness service, the delay sensitive service and the burst service is effectively guaranteed, the reliability of data transmission is enhanced, the network bandwidth utilization rate is improved, and the network throughput is improved.
Preferably, in any of the above embodiments, the guaranteed bandwidth calculating module 110 is specifically configured to calculate the minimum guaranteed bandwidth according to the following formula:
wherein the content of the first and second substances,
for minimum guaranteed bandwidth, PcycleFor a service period, n denotes n data connections, TgTransmission guard time, w, scheduled for a messageNCT_iAssigning a weight to the bandwidth of a predetermined node, CNCTLink capacity, R, of the corresponding time axis for a preset nodeNCTBandwidth rates reserved for periodic traffic and strong time-sensitive bursty traffic.
According to the scheme, the minimum guaranteed bandwidth of each preset node is calculated through bandwidth allocation weight, the rated bandwidth allocation of the burst service is realized, and the basic transmission of each node task is guaranteed.
Preferably, in any embodiment described above, the guaranteed bandwidth calculating module 110 is specifically configured to calculate the bandwidth allocation weight of the preset node according to the following formula:
wherein the content of the first and second substances,
for presetting the requested bandwidth of the node, Δ RNCTI represents the ith node, k represents k requests,
indicating the size of the nominal bandwidth allocated to bursty traffic. .
According to the scheme, the bandwidth allocation weight of each preset node is calculated according to the data transmission state and the request bandwidth, and the bandwidth requirements of each node transmission task are allocated according to the demand and the weight value obtained through calculation, so that the highest bandwidth utilization efficiency is realized.
Preferably, in any embodiment above, the nominal bandwidth allocation module 111 is specifically configured to allocate a bandwidth to each preset node according to the following formula:
wherein the content of the first and second substances,
indicating the size of the nominal bandwidth allocated to bursty traffic on a preset node,
in order to preset the requested bandwidth of the node,
and presetting the minimum guaranteed bandwidth of the nodes, wherein i represents the ith node, and k represents k requests.
According to the scheme, the bandwidth is allocated to each preset node according to the requested bandwidth and the minimum guaranteed bandwidth, the rated bandwidth is allocated to the burst service, and the basic transmission requirements of the nodes are met.
Preferably, in any of the above embodiments, further comprising: the iterative bandwidth allocation module is used for acquiring the updated data transmission state and the updated request bandwidth of each preset node through polling when the total bandwidth amount for bandwidth allocation is larger than zero and the preset nodes with the request bandwidths not met are available, and dynamically adjusting and correcting the bandwidth allocation of each preset node according to the updated data transmission state and the updated request bandwidth before the next round of transmission.
According to the scheme, when the total bandwidth amount for bandwidth allocation is larger than zero and the preset nodes with the bandwidth requests not met exist, the bandwidth allocation is continuously adjusted, so that iterative bandwidth allocation of the burst service to the nodes corresponding to the data connection is realized, bandwidth surplus is reduced to the maximum extent, and the bandwidth required by transmission tasks of all the nodes is met.
Preferably, the method further comprises the following steps: and the fixed bandwidth allocation module is used for respectively performing fixed bandwidth allocation on the periodic service and the strong timeliness burst service according to the first preset weight value and the second preset weight value.
According to the scheme, the fixed bandwidth allocation is carried out on the periodic service and the strong timeliness burst service, and the dynamic bandwidth allocation is carried out on the time delay insensitive burst service, so that the certainty and the real-time performance of key data transmission are guaranteed.
It is understood that some or all of the alternative embodiments described above may be included in some embodiments.
It should be noted that the above embodiments are product embodiments corresponding to the previous method embodiments, and for the description of each optional implementation in the product embodiments, reference may be made to corresponding descriptions in the above method embodiments, and details are not described here again.
The reader should understand that in the description of this specification, reference to the description of the terms "one embodiment," "some embodiments," "an example," "a specific example," or "some examples," etc., means that a particular feature, structure, material, or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of the invention. In this specification, the schematic representations of the terms used above are not necessarily intended to refer to the same embodiment or example. Furthermore, the particular features, structures, materials, or characteristics described may be combined in any suitable manner in any one or more embodiments or examples. Furthermore, various embodiments or examples and features of different embodiments or examples described in this specification can be combined and combined by one skilled in the art without contradiction.
In the several embodiments provided in the present application, it should be understood that the disclosed apparatus and method may be implemented in other ways. For example, the above-described method embodiments are merely illustrative, and for example, the division of steps into only one logical functional division may be implemented in practice in another way, for example, multiple steps may be combined or integrated into another step, or some features may be omitted, or not implemented.
The above method, if implemented in the form of software functional units and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present invention essentially or partially contributes to the prior art, or all or part of the technical solution can be embodied in the form of a software product stored in a storage medium and including instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present invention. And the aforementioned storage medium includes: various media capable of storing program codes, such as a usb disk, a removable hard disk, a Read-only memory (ROM), a Random Access Memory (RAM), a magnetic disk, or an optical disk.
While the invention has been described with reference to specific embodiments, it will be understood by those skilled in the art that various changes in form and details may be made therein without departing from the spirit and scope of the invention as defined by the appended claims. Therefore, the protection scope of the present invention shall be subject to the protection scope of the claims.
Claims (10)
1. A method for dynamically allocating burst service bandwidth based on weight ratio is characterized by comprising the following steps:
s1, polling the data transmission state and the request bandwidth of each preset node in the time delay insensitive bursty service bandwidth allocation, calculating the bandwidth allocation weight of each preset node according to the data transmission state and the request bandwidth, and calculating the minimum guaranteed bandwidth of each preset node according to the bandwidth allocation weight;
s2, according to the request bandwidth and the minimum guaranteed bandwidth, performing bandwidth allocation on each preset node;
and S3, acquiring the updated data transmission state and the updated request bandwidth of each preset node through polling, and dynamically adjusting and correcting the bandwidth allocation of each preset node according to the updated data transmission state and the updated request bandwidth before the next round of transmission.
2. The method according to claim 1, wherein the minimum guaranteed bandwidth is calculated according to the following formula:
3. The method according to claim 2, wherein the S1 further includes: calculating the bandwidth allocation weight of the preset node according to the following formula:
wherein the content of the first and second substances,
requested bandwidth, Δ R, for the preset nodeNCTI represents the ith node, k represents k requests,
is shown to beThe size of the nominal bandwidth allocated for bursty traffic.
4. The method according to any one of claims 1 to 3, wherein the S2 specifically includes: allocating the bandwidth of each preset node according to the following formula:
wherein the content of the first and second substances,
indicating a size of a nominal bandwidth allocated to bursty traffic on the preset node,
for the requested bandwidth of the preset node,
and the minimum guaranteed bandwidth of the preset node, i represents the ith node, and k represents k requests.
5. The method of claim 1, wherein the step S1 further comprises performing fixed bandwidth allocation on the periodic traffic and the strong time-efficient bursty traffic according to a first preset weight value and a second preset weight value, respectively.
6. A system for dynamically allocating burst service bandwidth based on weight ratio is characterized by comprising: the system comprises a guaranteed bandwidth calculation module, a rated bandwidth allocation module and an extra bandwidth allocation module;
the guaranteed bandwidth calculation module is used for polling the data transmission state and the request bandwidth of each preset node in the time delay insensitive bursty service bandwidth allocation, calculating the bandwidth allocation weight of each preset node according to the data transmission state and the request bandwidth, and calculating the minimum guaranteed bandwidth of each preset node through the bandwidth allocation weight;
the rated bandwidth allocation module is used for allocating bandwidth to each preset node according to the requested bandwidth and the minimum guaranteed bandwidth;
the extra bandwidth allocation module is used for acquiring the updated data transmission state and the updated request bandwidth of each preset node through polling, and dynamically adjusting and correcting the bandwidth allocation of each preset node according to the updated data transmission state and the updated request bandwidth before the next round of transmission.
7. The system according to claim 6, wherein the guaranteed bandwidth calculating module is specifically configured to calculate a minimum guaranteed bandwidth according to the following formula;
wherein the content of the first and second substances,
for minimum guaranteed bandwidth, PcycleFor a service period, n denotes n data connections, TgTransmission guard time, w, scheduled for a messageNCT_iAssigning a weight to the bandwidth of the preset node, CNCTLink capacity, R, of the corresponding time axis of the preset nodeNCTBandwidth rates reserved for periodic traffic and strong time-sensitive bursty traffic.
8. The system according to claim 7, wherein the guaranteed bandwidth calculating module is specifically configured to calculate the bandwidth allocation weight of the preset node according to the following formula:
wherein the content of the first and second substances,
requested bandwidth, Δ R, for the preset nodeNCTI represents the ith node, k represents k requests,
indicating the size of the nominal bandwidth allocated to bursty traffic.
9. The system according to any one of claims 6 to 8, wherein the nominal bandwidth allocation module is specifically configured to allocate bandwidth to each of the preset nodes according to the following formula:
wherein the content of the first and second substances,
indicating a size of a nominal bandwidth allocated to bursty traffic on the preset node,
for the requested bandwidth of the preset node,
and the minimum guaranteed bandwidth of the preset node, i represents the ith node, and k represents k requests.
10. The system according to claim 6, further comprising: and the fixed bandwidth allocation module is used for respectively performing fixed bandwidth allocation on the periodic service and the strong timeliness burst service according to the first preset weight value and the second preset weight value.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010897459.1A CN112039804B (en) | 2020-08-31 | 2020-08-31 | Method and system for dynamically allocating burst service bandwidth based on weight ratio |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010897459.1A CN112039804B (en) | 2020-08-31 | 2020-08-31 | Method and system for dynamically allocating burst service bandwidth based on weight ratio |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112039804A true CN112039804A (en) | 2020-12-04 |
| CN112039804B CN112039804B (en) | 2022-04-22 |
Family
ID=73586006
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010897459.1A Active CN112039804B (en) | 2020-08-31 | 2020-08-31 | Method and system for dynamically allocating burst service bandwidth based on weight ratio |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112039804B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113079045A (en) * | 2021-03-26 | 2021-07-06 | 北京达佳互联信息技术有限公司 | Bandwidth allocation method, device, server and storage medium |
| CN115174407A (en) * | 2022-06-17 | 2022-10-11 | 上海仪电（集团）有限公司中央研究院 | Method and system for dynamically allocating bandwidth based on private cloud environment |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106385387A (en) * | 2016-09-27 | 2017-02-08 | 中国科学院空间应用工程与技术中心 | Resource scheduling method of information network links, system and application |
| CN109246013A (en) * | 2018-09-18 | 2019-01-18 | 桂林电子科技大学 | A kind of method for routing in FC-AE-1553 switching network |
-
2020
- 2020-08-31 CN CN202010897459.1A patent/CN112039804B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106385387A (en) * | 2016-09-27 | 2017-02-08 | 中国科学院空间应用工程与技术中心 | Resource scheduling method of information network links, system and application |
| CN109246013A (en) * | 2018-09-18 | 2019-01-18 | 桂林电子科技大学 | A kind of method for routing in FC-AE-1553 switching network |
Non-Patent Citations (3)
| Title |
|---|
| ZHAN YUEYING等: "Analysis and testing of total ionizing dose effect on several commercial optical transceivers via gamma-ray radiation", 《CHINESE OPTICS LETTERS》 * |
| 吴少俊等: "FC-AE-1553 网络的"并发交换式"动态带宽调度机制", 《北京航空航天大学学报》 * |
| 姜国义等: "基于FC-AE-1553 总线的空天电子网络带宽动态分配机制研究", 《导航与控制》 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113079045A (en) * | 2021-03-26 | 2021-07-06 | 北京达佳互联信息技术有限公司 | Bandwidth allocation method, device, server and storage medium |
| CN115174407A (en) * | 2022-06-17 | 2022-10-11 | 上海仪电（集团）有限公司中央研究院 | Method and system for dynamically allocating bandwidth based on private cloud environment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112039804B (en) | 2022-04-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107579926B (en) | QoS setting method of Ceph cloud storage system based on token bucket algorithm | |
| EP2222005B1 (en) | Dynamic bandwidth allocation circuit, dynamic bandwidth allocation method, dynamic bandwidth allocation program and recording medium | |
| US6590865B1 (en) | Transmission system, bandwidth management apparatus, and bandwidth management method | |
| US5799002A (en) | Adaptive bandwidth throttling for network services | |
| 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 | |
| CN112039804B (en) | Method and system for dynamically allocating burst service bandwidth based on weight ratio | |
| CN109617836B (en) | Intelligent bandwidth allocation method and system for satellite data transmission | |
| US7843940B2 (en) | Filling token buckets of schedule entries | |
| US10735554B1 (en) | System for controlling use of a network | |
| JP2001504316A (en) | System, apparatus and method for performing scheduling in a communication network | |
| CN113141590B (en) | Industrial Internet of things-oriented wireless communication scheduling method and device | |
| US6003062A (en) | Iterative algorithm for performing max min fair allocation | |
| EP3461085B1 (en) | Method and device for queue management | |
| CN113726690B (en) | Method, system, electronic equipment and storage medium for uploading protocol message | |
| Nolte et al. | Server-based scheduling of the CAN bus | |
| CN115118327B (en) | Satellite communication resource scheduling method and system based on dynamic measurement feedback | |
| CN112055382B (en) | Service access method based on refined distinction | |
| CN113453285B (en) | Resource adjusting method, device and storage medium | |
| CN113905448B (en) | Wireless network resource scheduling method, device and equipment | |
| CA2333447A1 (en) | Offered load estimation and applications for using same in a communication network | |
| CN114585024B (en) | Slice access control method of 5G/B5G network | |
| Bouhouch et al. | FlexRay static section scheduling using full model | |
| JPH1155276A (en) | Shaping device | |
| CN116996943A (en) | Method, device, electronic equipment and medium for accessing system to network | |
| CN113872881A (en) | Queue information processing method and device |
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 |