CN115087035A - Bandwidth resource allocation method applied to civil aviation communication system - Google Patents
Bandwidth resource allocation method applied to civil aviation communication systemDownload PDFInfo
- Publication number
- CN115087035A CN115087035ACN202210648380.4ACN202210648380ACN115087035ACN 115087035 ACN115087035 ACN 115087035ACN 202210648380 ACN202210648380 ACN 202210648380ACN 115087035 ACN115087035 ACN 115087035A
- Authority
- CN
- China
- Prior art keywords
- bandwidth
- average
- link
- queue
- tokens
- 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
- 238000000034methodMethods0.000titleclaimsabstractdescription42
- 238000004891communicationMethods0.000titleclaimsabstractdescription21
- 238000013468resource allocationMethods0.000titleclaimsabstractdescription13
- 230000008447perceptionEffects0.000claimsabstractdescription8
- 230000005540biological transmissionEffects0.000claimsdescription10
- 230000008569processEffects0.000claimsdescription10
- 230000001174ascending effectEffects0.000claimsdescription5
- 230000003139buffering effectEffects0.000claimsdescription2
- 230000007246mechanismEffects0.000abstractdescription3
- 238000004364calculation methodMethods0.000description6
- 230000000694effectsEffects0.000description3
- 235000003642hungerNutrition0.000description3
- 230000037351starvationEffects0.000description3
- 230000008859changeEffects0.000description2
- 238000006243chemical reactionMethods0.000description2
- 238000010586diagramMethods0.000description2
- 230000009286beneficial effectEffects0.000description1
- 238000010276constructionMethods0.000description1
- 230000006872improvementEffects0.000description1
- 230000000977initiatory effectEffects0.000description1
- 238000011835investigationMethods0.000description1
- 230000007774longtermEffects0.000description1
- 230000004048modificationEffects0.000description1
- 238000012986modificationMethods0.000description1
- 238000005457optimizationMethods0.000description1
Images
Classifications
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
- H04W28/0289—Congestion control
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/215—Flow control; Congestion control using token-bucket
- 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
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L49/00—Packet switching elements
- H04L49/90—Buffering arrangements
- H04L49/9015—Buffering arrangements for supporting a linked list
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
- H04W16/14—Spectrum sharing arrangements between different networks
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/30—Services specially adapted for particular environments, situations or purposes
- H04W4/40—Services specially adapted for particular environments, situations or purposes for vehicles, e.g. vehicle-to-pedestrians [V2P]
- H04W4/42—Services specially adapted for particular environments, situations or purposes for vehicles, e.g. vehicle-to-pedestrians [V2P] for mass transport vehicles, e.g. buses, trains or aircraft
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/04—Wireless resource allocation
- H04W72/044—Wireless resource allocation based on the type of the allocated resource
- H04W72/0453—Resources in frequency domain, e.g. a carrier in FDMA
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Aviation & Aerospace Engineering (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
Description
Translated fromChinese技术领域technical field
本发明属于带宽资源分配技术领域，具体涉及一种应用于民航通信系统的带宽资源分配方法。The invention belongs to the technical field of bandwidth resource allocation, and in particular relates to a bandwidth resource allocation method applied to a civil aviation communication system.
背景技术Background technique
民航通信系统中带宽资源有限，且带宽属于一种共享资源，通常在多业务流之间进行共享带宽的分配。同时，业务流的带宽请求具有时效性，业务流申请的带宽资源，只能在当前时刻使用。为了保证每个业务流都能占用共享的带宽资源，通常是将链路中剩余的带宽进行二次分配，优先满足高优先级业务流的带宽需求，但这种带宽分配方式更适用于带宽资源充足条件下的资源分配，不适用于拥塞状态下的链路带宽资源的分配。一方面，当带宽资源不足时，容易造成低优先级业务流的饥饿现象的发生；另一方面，基于剩余带宽的分配方式，是一种理论上的带宽分配方式，这种基于剩余带宽的分配，没有考虑当前链路的时时情况，容易进一步引发链路的拥塞，造成数据包的大量丢失以及系统吞吐量的下降。In the civil aviation communication system, the bandwidth resources are limited, and the bandwidth belongs to a kind of shared resources. The shared bandwidth is usually allocated among multiple service flows. At the same time, the bandwidth request of the service flow is time-sensitive, and the bandwidth resources requested by the service flow can only be used at the current moment. In order to ensure that each service flow can occupy the shared bandwidth resources, the remaining bandwidth in the link is usually re-allocated to first meet the bandwidth requirements of high-priority service flows, but this bandwidth allocation method is more suitable for bandwidth resources. Resource allocation under sufficient conditions does not apply to link bandwidth resource allocation in a congested state. On the one hand, when the bandwidth resources are insufficient, it is easy to cause starvation of low-priority service flows; on the other hand, the allocation method based on the remaining bandwidth is a theoretical bandwidth allocation method. , without considering the current situation of the current link, it is easy to further cause the congestion of the link, resulting in a large number of data packets lost and a drop in system throughput.
发明内容SUMMARY OF THE INVENTION
为解决以上现有技术存在的问题，本发明提出了一种应用于民航通信系统的带宽资源分配方法，该方法包括：构建通信系统，该系统包括应用层、感知层以及决策层；系统应用层根据优先级业务流的数量构建缓存队列，并周期上传各业务流的队列信息和队列利用率；感知层获取当前链路的状态信息，将获取的状态信息上传到决策层；决策层根据当前链路的状态信息采用令牌桶算法和比例公平算法对系统的带宽资源进行分配。In order to solve the above problems in the prior art, the present invention proposes a bandwidth resource allocation method applied to a civil aviation communication system. The method includes: constructing a communication system, the system including an application layer, a perception layer and a decision layer; a system application layer Build a cache queue according to the number of priority service flows, and periodically upload the queue information and queue utilization of each service flow; the perception layer obtains the status information of the current link, and uploads the obtained status information to the decision-making layer; The state information of the road uses the token bucket algorithm and the proportional fair algorithm to allocate the bandwidth resources of the system.
优选的，应用层构建缓存队列的过程包括：根据优先级业务流的数量为每条业务流创建一个链表，并规定链表的最大长度；将优先级业流的数据包缓存在链表中，得到缓存队列。Preferably, the process of constructing the cache queue at the application layer includes: creating a linked list for each service flow according to the number of priority service flows, and specifying the maximum length of the linked list; caching the data packets of the priority service flow in the linked list to obtain the cache queue.
进一步的，将优先级业流的数据包缓存在链表中的平均入栈速率和平均出栈速率的公式为：Further, the formulas for the average push rate and average push rate for buffering the data packets of the priority flow in the linked list are:
其中，InAverageVelocity(t)表示缓存队列的平均入栈速率，InAverageVelocity(t-T)表示在周期T之前的数据包进入链表的平均入栈速率，t表示从系统初始化开始到当前时刻的运行时间，T表示一个周期的统计时间，InCurrentVelocity(t)表示当前时刻数据包进入队列的速率，OutAverageVelocity(t)表示数据包从缓存队列的平均出栈速率，OutAverageVelocity(t-T)表示在周期T之前的数据包离开链表的平均入栈速率，OutCurrentVelocity(t)表示当前时刻数据包进出队列的速率。Among them, InAverageVelocity(t) represents the average stacking rate of the cache queue, InAverageVelocity(t-T) represents the average stacking rate of data packets entering the linked list before period T, t represents the running time from the system initialization to the current moment, T represents Statistical time of a cycle, InCurrentVelocity(t) represents the rate at which packets enter the queue at the current moment, OutAverageVelocity(t) represents the average out-of-stack rate of packets from the buffer queue, and OutAverageVelocity(t-T) represents that packets before cycle T leave the linked list The average stacking rate of , OutCurrentVelocity(t) represents the rate of data packets entering and leaving the queue at the current moment.
优选的，当前链路的状态信息包括各条链路的通断情况、链路平均流量以及链路平均丢包率。Preferably, the status information of the current link includes the on-off status of each link, the average traffic of the link, and the average packet loss rate of the link.
优选的，决策层采用令牌桶算法和比例公平算法对系统的带宽资源进行分配的过程包括：Preferably, the process that the decision-making layer adopts the token bucket algorithm and the proportional fairness algorithm to allocate the bandwidth resources of the system includes:
S1：决策层为每个链表中的优先级业务流数据包分配令牌数token，通过令牌数token控制链表删除结点的速率，即数据包的出栈速率；S1: The decision-making layer allocates the number of tokens to the priority service flow data packets in each linked list, and controls the rate at which nodes are deleted from the linked list through the number of tokens, that is, the rate of outgoing data packets;
S2：根据当前链路的状态信息确定当前链路的状态，若当前链路状态为空闲状态，则将归属链路的令牌数置0，每个队列按照轮询方式全速发送入队的数据；否则执行步骤S3；S2: Determine the status of the current link according to the status information of the current link. If the current link status is idle, set the number of tokens of the home link to 0, and each queue sends the queued data at full speed in a polling manner. ; otherwise, go to step S3;
S3：判断高优先级业务流带宽是否满足业务需求，若不满足，则执行步骤S4，若满足，则执行步骤S5；S3: determine whether the high-priority service flow bandwidth meets the service requirements, if not, execute step S4, and if so, execute step S5;
S4：为最优高优先级业务分配带宽；采用比例公平算法重新计算其余业务的优先级，并根据重新计算的优先级，根据重新计算的优先级分配剩余带宽；S4: Allocate bandwidth for the optimal high-priority service; use proportional fairness algorithm to recalculate the priorities of the remaining services, and allocate the remaining bandwidth according to the recalculated priorities according to the recalculated priorities;
S5：获取业务流实际请求带宽，将实际请求带宽与该业务分配的逻辑带宽进行对比，得到业务流实际请求带宽需要借调的令牌数，并将该令牌数划分为Borrow组和Lend组；S5: Obtain the actual requested bandwidth of the service flow, compare the actual requested bandwidth with the logical bandwidth allocated by the service, obtain the number of tokens that need to be borrowed for the actual requested bandwidth of the service flow, and divide the number of tokens into Borrow group and Lend group;
S6：设置阈值；S6: set the threshold;
S7：根据设置的阈值对Borrow组和Lend组中的令牌数进行相互借调；S7: According to the set threshold, the number of tokens in the Borrow group and the Lend group are borrowed from each other;
S8：根据调度后的令牌数控制各个队列的出栈速率，实现流量控制。S8: Control the stacking rate of each queue according to the number of tokens after scheduling, so as to realize flow control.
进一步的，根据当前链路的状态信息确定当前链路的状态包括根据链路的通断情况、链路平均流量以及链路平均丢包率将链路状态划分为4种信息状态，分别为前链路关闭状态、当前链路空闲状态、当前链路忙碌状态以及当前链路拥塞状态；其中空闲状态链路的平均利用率低于80％，平均丢包率低于10％；忙碌状态链路的平均利用率高于80％，平均丢包率低于10％；拥塞状态链路的平均丢包率高于10％。Further, determining the status of the current link according to the status information of the current link includes dividing the link status into four information statuses according to the on-off status of the link, the average traffic flow of the link, and the average packet loss rate of the link, which are the previous Link down status, current link idle status, current link busy status, and current link congestion status; the average utilization rate of links in idle status is lower than 80%, and the average packet loss rate is lower than 10%; links in busy status The average utilization rate of the link is higher than 80%, and the average packet loss rate is lower than 10%; the average packet loss rate of the congested link is higher than 10%.
优选的，判断高优先级业务流带宽是否满足业务需求的过程包括：获取业务流数据，将获取的业务流数据划分为高优先级业务流和低优先级业务流；计算高优先级业务流总的带宽，根据计算出的总带宽得到高优先级需要借用的带宽数total_b；计算系统总的可借出的带宽total_l；将需要借用的带宽数total_b与可借出的带宽total_l进行对比，若total_b<total_l，则满足业务需求，否则不满足业务需求。Preferably, the process of judging whether the bandwidth of the high-priority service flow meets the service requirements includes: obtaining service flow data, dividing the obtained service flow data into high-priority service flows and low-priority service flows; calculating the total number of high-priority service flows Calculate the total bandwidth that needs to be borrowed for high priority according to the calculated total bandwidth, total_b; calculate the total lent bandwidth total_l of the system; <total_l, the business requirement is met, otherwise the business requirement is not met.
进一步的，计算高优先级业务流总的带宽包括将重要或紧急的高优先级业务流的实际的请求带宽求和，每条业务流需要借用的带宽为实际的请求带宽减去逻辑分配的带宽；将所有求出来的每条业务流需要借用的带宽求和，得到高优先级业务流总的带宽。Further, calculating the total bandwidth of high-priority service flows includes summing the actual requested bandwidths of important or urgent high-priority service flows, and the bandwidth that each service flow needs to borrow is the actual requested bandwidth minus the logically allocated bandwidth. ; Sum up all the bandwidths that need to be borrowed for each service flow obtained to obtain the total bandwidth of the high-priority service flow.
优选的，采用比例公平算法重新计算业务的优先级包括：Preferably, using the proportional fairness algorithm to recalculate the priority of the service includes:
其中，Ri(t)表示业务流i在t时刻的传输速率，
优选的，设置的阈值包括第一阈值和第二阈值，第一阈值的大小为1.1，第二阈值的大小为0.05。Preferably, the set threshold includes a first threshold and a second threshold, the size of the first threshold is 1.1, and the size of the second threshold is 0.05.
优选的，对Borrow组和Lend组中的令牌数进行相互借调的过程包括：初始分配令牌数量granted_tokens，并根据队列计算数据的平均入栈速率average_arriving；将平均入栈速率与令牌数进行对比，若average_arriving>granted_tokens，则该flow需要借用令牌，借用数量为average_arriving-granted_tokens；若average_arriving<granted_tokens，则该flow可借出令牌，可借出数量为a*(granted_tokens-average_arriving)，其中a为可借出权重；计算lend组可借出token总数sum_l和borrow组需要借用的token总数sum_b；根据sum_l和sum_b计算比例ratio，其表达式为ratio＝sum_l/sum_b；若ratio>1.1，则可将需要每个需要借用token放大(ratio-0.05)倍，否则结束；Borrow组根据优先级降序排列，lend组根据优先级升序排列。Preferably, the process of mutually borrowing the number of tokens in the Borrow group and the Lend group includes: initially assigning the number of tokens granted_tokens, and calculating the average entry rate average_arriving of the data according to the queue; comparing the average entry rate with the number of tokens In contrast, if average_arriving>granted_tokens, the flow needs to borrow tokens, and the borrowed quantity is average_arriving-granted_tokens; if average_arriving<granted_tokens, the flow can lend tokens, and the loanable quantity is a*(granted_tokens-average_arriving), where a is the loanable weight; calculate the total number of tokens that can be borrowed in the lend group sum_l and the total number of tokens to be borrowed in the borrow group sum_b; calculate the ratio ratio according to sum_l and sum_b, and its expression is ratio=sum_l/sum_b; if ratio>1.1, then You can magnify (ratio-0.05) times each token that needs to be borrowed, otherwise it ends; the Borrow group is arranged in descending order of priority, and the lend group is arranged in ascending order of priority.
本发明的有益效果：Beneficial effects of the present invention:
本发明通过应用层队列的缓存机制，可以很好的平滑突发业务流，有效的缓解链路的拥塞，同时提高了整个通信系统的吞吐量和带宽利用率；本发明提出的民航通信系统的带宽资源分配方法，涉及到跨层的操作，链路层和应用层之间信息的交互，打破了层与层之间相互独立互不感知的方式，为跨层协同流控提供了一种参考；本发明提出的民航通信系统的带宽资源分配方法，主要是拥塞链路下带宽的分配，不仅仅考虑带宽资源充足的情况下，资源的相互借调；同时，结合链路的拥塞状态，考虑链路剩余的带宽情况，提出不同的带宽分配策略，除了降低了链路发生拥塞和丢包的风险，还提高了网络的服务质量和系统的稳定性。Through the caching mechanism of the application layer queue, the invention can smoothly smooth the burst service flow, effectively relieve the congestion of the link, and at the same time improve the throughput and bandwidth utilization rate of the entire communication system; The bandwidth resource allocation method involves cross-layer operations and information exchange between the link layer and the application layer. ; The bandwidth resource allocation method of the civil aviation communication system proposed by the present invention is mainly the allocation of bandwidth under the congested link, and not only considers the mutual borrowing of resources when the bandwidth resources are sufficient; According to the remaining bandwidth of the road, different bandwidth allocation strategies are proposed, which not only reduces the risk of link congestion and packet loss, but also improves the quality of service of the network and the stability of the system.
附图说明Description of drawings
图1为本发明的系统拥塞状态下满足高优先级业务流的带宽分布图；Fig. 1 is the bandwidth distribution diagram that satisfies the high-priority service flow under the system congestion state of the present invention;
图2为本发明的系统拥塞状态下不满足高优先级业务流的带宽分布图Fig. 2 is the bandwidth distribution diagram of the service flow that does not meet the high priority under the system congestion state of the present invention
图3为本发明的对系统的带宽资源进行分配的流程图。FIG. 3 is a flow chart of allocating bandwidth resources of the system according to the present invention.
具体实施方式Detailed ways
下面将结合本发明实施例中的附图，对本发明实施例中的技术方案进行清楚、完整地描述，显然，所描述的实施例仅仅是本发明一部分实施例，而不是全部的实施例。基于本发明中的实施例，本领域普通技术人员在没有做出创造性劳动前提下所获得的所有其他实施例，都属于本发明保护的范围。The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present invention. Obviously, the described embodiments are only a part of the embodiments of the present invention, but not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those of ordinary skill in the art without creative efforts shall fall within the protection scope of the present invention.
一种应用于民航通信系统的带宽资源分配方法是为尽可能提高空地通信链路利用率的前提下保障多类优先级业务传输服务质量(QsS)需求和系统吞吐量和系统稳定而设计,本方法利用区分服务网络的令牌桶调度方法和比例公平(PF)方法思想，建立应用层流量控制方法,使得采用本方法的机载应用可及时、高效地应对空地无线通信链路拥塞状态变化,提高带宽资源的利用率和系统吞吐量，实现民航机载数据的可靠传输。A bandwidth resource allocation method applied to the civil aviation communication system is designed to ensure the quality of service (QsS) requirements, system throughput and system stability of multi-class priority service transmission on the premise of improving the utilization rate of air-ground communication links as much as possible. Method Using the token bucket scheduling method and proportional fairness (PF) method of DiffServ network, an application layer flow control method is established, so that the airborne application adopting this method can timely and efficiently deal with the congestion state change of the air-ground wireless communication link. Improve the utilization rate of bandwidth resources and system throughput, and achieve reliable transmission of civil aviation airborne data.
本方法采用中心计算和结果分发的模式，采用将计算和调度分离的方式，高效的完成全局的优化决策。首先，根据优先级业务流的数量对应的动态创建应用层队列，用于缓存各业务流数据包，并周期上报各业务流的队列信息和队列利用率等信息；其次，通过感知层获取当前链路的丢包率和利用率等信息，并周期上报链路状态信息；最后，由决策层采用令牌桶算法思想和比例公平(PF)算法思想，依据链路信息和队列信息以及业务流信息计算权重并向队列下发权重token，通过权重控制队列的出栈速率。当队列利用率超过设定门限，同时，链路利用率也超过设定门限时，经标准接口发起通信能力重协商消息以请求更改业务流带宽,避免链路和队列的拥塞，从而提高带宽资源的利用率和系统的吞吐量，达到提高Qos的效果。The method adopts the mode of central calculation and result distribution, and adopts the method of separating calculation and scheduling, so as to efficiently complete the global optimization decision. First, dynamically create application layer queues according to the number of priority service flows, which are used to buffer data packets of each service flow, and periodically report queue information and queue utilization information of each service flow; secondly, obtain the current chain through the perception layer. information such as packet loss rate and utilization rate of the road, and periodically report link status information; finally, the decision layer adopts the idea of token bucket algorithm and proportional fairness (PF) algorithm, based on link information, queue information and service flow information Calculate the weight and issue the weight token to the queue, and control the stacking rate of the queue through the weight. When the queue utilization exceeds the set threshold and the link utilization also exceeds the set threshold, a communication capability renegotiation message is initiated through the standard interface to request to change the bandwidth of the service flow to avoid link and queue congestion, thereby increasing bandwidth resources The utilization rate and the throughput of the system are improved to achieve the effect of improving QoS.
一种应用于民航通信系统的带宽资源分配方法的具体实施方式，该方法包括：构建通信系统，该系统包括应用层、感知层以及决策层；系统应用层根据优先级业务流的数量构建缓存队列，并周期上传各业务流的队列信息和队列利用率；感知层获取当前链路的状态信息，将获取的状态信息上传到决策层；决策层根据当前链路的状态信息采用令牌桶算法和比例公平算法对系统的带宽资源进行分配。A specific embodiment of a bandwidth resource allocation method applied to a civil aviation communication system, the method includes: constructing a communication system, the system including an application layer, a perception layer and a decision layer; the system application layer constructs a cache queue according to the number of priority service flows , and periodically upload the queue information and queue utilization of each service flow; the perception layer obtains the status information of the current link, and uploads the obtained status information to the decision layer; the decision layer adopts the token bucket algorithm and The proportional fairness algorithm allocates the bandwidth resources of the system.
应用层构建缓存队列包括：采用令牌桶原理创建缓存队列，并根据令牌数token调度每一个队列在单位周期T(1s)内的令牌使用数量，从而确定每个队列出栈速率为tokens*CELL_LEN KB/s。令牌数量由决策层根据周期上报的链路信息和队列信息以及业务流等信息计算得到权重token。队列的构建是为了作为一个缓存，来平滑突发流量，重要就是通过令牌来控制业务流的流出速率。(如果觉得有问题可以修改，主要就是用于缓存)The construction of the cache queue at the application layer includes: using the token bucket principle to create a cache queue, and scheduling the number of tokens used in each queue within the unit period T (1s) according to the number of tokens, so as to determine the stacking rate of each queue as tokens*CELL_LEN KB/s. The number of tokens is calculated by the decision layer according to the periodically reported link information, queue information, service flow and other information to obtain the weight token. The queue is built to serve as a buffer to smooth out burst traffic, and the most important thing is to control the outflow rate of business flow through tokens. (If you think there is a problem, you can modify it, mainly for caching)
队列的MAJOR门限为队列总长度的75％，即为6K，CRITICAL门限为队列总长度的90％，即为7.2K。(队列上限设为8K)The MAJOR threshold of the queue is 75% of the total queue length, which is 6K, and the CRITICAL threshold is 90% of the total queue length, which is 7.2K. (queue cap is set to 8K)
队列的平均入栈速率和平均出栈速率的计算公式如下：The calculation formulas of the average stacking rate and the average stacking rate of the queue are as follows:
其中，InAverageVelocity(t)表示缓存队列的平均入栈速率，InAverageVelocity(t-T)表示在周期T之前的数据包进入链表的平均入栈速率，t表示从系统初始化开始到当前时刻的运行时间，T表示一个周期的统计时间，InCurrentVelocity(t)表示当前时刻数据包进入队列的速率，OutAverageVelocity(t)表示数据包从缓存队列的平均出栈速率，OutAverageVelocity(t-T)表示在周期T之前的数据包离开链表的平均入栈速率，OutCurrentVelocity(t)表示当前时刻数据包进出队列的速率。Among them, InAverageVelocity(t) represents the average stacking rate of the cache queue, InAverageVelocity(t-T) represents the average stacking rate of data packets entering the linked list before period T, t represents the running time from the system initialization to the current moment, T represents Statistical time of a cycle, InCurrentVelocity(t) represents the rate at which packets enter the queue at the current moment, OutAverageVelocity(t) represents the average out-of-stack rate of packets from the buffer queue, and OutAverageVelocity(t-T) represents that packets before cycle T leave the linked list The average stacking rate of , OutCurrentVelocity(t) represents the rate of data packets entering and leaving the queue at the current moment.
感知层获取当前链路状态包括：链路状态数据统计，主要包含各条链路的通断情况、链路平均流量、链路平均丢包率。根据链路的上述三种信息将链路状态分为4种状态信息，包括CLOSED、IDLE、BUSY和HIGH_LOSS，其中CLOSED代表当前链路已经关闭，IDLE代表当前链路处于空闲状态，BUSY代表当前链路的带宽占用率较高，处于忙碌状态，HIGH_LOSS代表当前链路出现了较高的丢包率，处于拥塞状态。根据每条链路的平均利用率和平均丢包率，将链路状态定义为三种状态：The perception layer obtains the current link status including: link status data statistics, mainly including the on-off status of each link, the average traffic of the link, and the average packet loss rate of the link. According to the above three kinds of information of the link, the link status is divided into 4 kinds of status information, including CLOSED, IDLE, BUSY and HIGH_LOSS, where CLOSED means that the current link has been closed, IDLE means that the current link is in an idle state, and BUSY means that the current link is in an idle state. The link has a high bandwidth occupancy rate and is in a busy state. HIGH_LOSS indicates that the current link has a high packet loss rate and is in a congested state. According to the average utilization and average packet loss rate of each link, the link state is defined as three states:
(1)IDLE，表示链路当前处于空闲状态，且当前的链路平均利用率低于80％，平均丢包率低于10％；(1) IDLE, indicating that the link is currently in an idle state, and the current average utilization rate of the link is lower than 80%, and the average packet loss rate is lower than 10%;
(2)BUSY，表示当前链路处于忙碌的状态，且当前链路的平均利用率高于80％，平均丢包率低于10％；(2) BUSY, indicating that the current link is in a busy state, and the average utilization rate of the current link is higher than 80%, and the average packet loss rate is lower than 10%;
(3)HIGH_LOSS，表示当前链路处于高丢包率的状态，当链路的平均丢包率高于10％，则为高丢包率的状态。(3) HIGH_LOSS, indicating that the current link is in a state of high packet loss rate. When the average packet loss rate of the link is higher than 10%, it is in a state of high packet loss rate.
如图3所示，决策层采用令牌桶算法和比例公平算法对系统的带宽资源进行分配的过程包括：As shown in Figure 3, the decision-making layer uses the token bucket algorithm and proportional fairness algorithm to allocate the bandwidth resources of the system, including:
S1：决策层为每个链表中的优先级业务流数据包分配令牌数token，通过令牌数token控制链表删除结点的速率，即数据包的出栈速率；S1: The decision-making layer allocates the number of tokens to the priority service flow data packets in each linked list, and controls the rate at which nodes are deleted from the linked list through the number of tokens, that is, the rate of outgoing data packets;
S2：根据当前链路的状态信息确定当前链路的状态，若当前链路状态为空闲状态，则将归属链路的令牌数置0，每个队列按照轮询方式全速发送入队的数据；否则执行步骤S3；S2: Determine the status of the current link according to the status information of the current link. If the current link status is idle, set the number of tokens of the home link to 0, and each queue sends the queued data at full speed in a polling manner. ; otherwise, go to step S3;
S3：判断高优先级业务流带宽是否满足业务需求，若不满足，则执行步骤S4，若满足，则执行步骤S5；S3: determine whether the high-priority service flow bandwidth meets the service requirements, if not, execute step S4, and if so, execute step S5;
判断高优先级业务流带宽是否满足业务需求的过程包括：获取业务流数据，将获取的业务流数据划分为高优先级业务流和低优先级业务流；计算高优先级业务流总的带宽，根据计算出的总带宽得到高优先级需要借用的带宽数total_b；计算系统总的可借出的带宽total_l；将需要借用的带宽数total_b与可借出的带宽total_l进行对比，若total_b<total_l，则满足业务需求，否则不满足业务需求。The process of judging whether the bandwidth of the high-priority service flow meets the service requirements includes: obtaining service flow data, dividing the obtained service flow data into high-priority service flows and low-priority service flows; calculating the total bandwidth of the high-priority service flows, According to the calculated total bandwidth, the number of bandwidth to be borrowed for high priority, total_b, is obtained; the total bandwidth that can be borrowed by the system, total_l, is calculated; The business needs are met, otherwise the business needs are not met.
S4：为最优高优先级业务分配带宽；采用比例公平算法重新计算其余业务的优先级，并根据重新计算的优先级，根据重新计算的优先级分配剩余带宽；S4: Allocate bandwidth for the optimal high-priority service; use proportional fairness algorithm to recalculate the priorities of the remaining services, and allocate the remaining bandwidth according to the recalculated priorities according to the recalculated priorities;
S5：获取业务流实际请求带宽，将实际请求带宽与该业务分配的逻辑带宽进行对比，得到业务流实际请求带宽需要借调的令牌数，并将该令牌数划分为Borrow组和Lend组；S5: Obtain the actual requested bandwidth of the service flow, compare the actual requested bandwidth with the logical bandwidth allocated by the service, obtain the number of tokens that need to be borrowed for the actual requested bandwidth of the service flow, and divide the number of tokens into Borrow group and Lend group;
S6：设置阈值；S6: set the threshold;
S7：根据设置的阈值对Borrow组和Lend组中的令牌数进行相互借调；S7: According to the set threshold, the number of tokens in the Borrow group and the Lend group are borrowed from each other;
对Borrow组和Lend组中的令牌数进行相互借调的过程包括：初始分配令牌数量granted_tokens，并根据队列计算数据的平均入栈速率average_arriving；将平均入栈速率与令牌数进行对比，若average_arriving>granted_tokens，则该flow需要借用令牌，借用数量为average_arriving-granted_tokens；若average_arriving<granted_tokens，则该flow可借出令牌，可借出数量为a*(granted_tokens-average_arriving)，其中a为可借出权重；计算lend组可借出token总数sum_l和borrow组需要借用的token总数sum_b；根据sum_l和sum_b计算比例ratio，其表达式为ratio＝sum_l/sum_b；若ratio>1.1，则可将需要每个需要借用token放大(ratio-0.05)倍，否则结束；Borrow组根据优先级降序排列，lend组根据优先级升序排列。The process of borrowing the number of tokens in the Borrow group and the Lend group includes: initially assigning the number of tokens granted_tokens, and calculating the average entry rate average_arriving of the data according to the queue; comparing the average entry rate with the number of tokens, if average_arriving>granted_tokens, the flow needs to borrow tokens, and the borrowed quantity is average_arriving-granted_tokens; if average_arriving<granted_tokens, the flow can lend tokens, and the loanable quantity is a*(granted_tokens-average_arriving), where a is available Lending weight; calculate the total number of tokens that can be borrowed in the lend group sum_l and the total number of tokens that the borrow group needs to borrow sum_b; calculate the ratio ratio according to sum_l and sum_b, and its expression is ratio=sum_l/sum_b; if ratio>1.1, you can Each need to borrow a token to enlarge (ratio-0.05) times, otherwise it ends; Borrow groups are arranged in descending order of priority, and lend groups are arranged in ascending order of priority.
S8：根据调度后的令牌数控制各个队列的出栈速率，实现流量控制。S8: Control the stacking rate of each queue according to the number of tokens after scheduling, so as to realize flow control.
决策层计算权重的过程包括：应用层创建缓存队列，队列需要完成变速控制的操作，即当链路未发生拥塞时，队列可以全速发送token为0；当链路产生拥塞时，队列需根据协商的令牌数token限速操作；各队列间存在优先级、按比例划分的关系，根据对现有流控算法的综合调研，采用类似令牌桶模型算法进行限速，采用轮询机制对多队列实行统一调度。The process of calculating the weight at the decision-making layer includes: the application layer creates a cache queue, and the queue needs to complete the operation of variable speed control, that is, when the link is not congested, the queue can send the token at full speed to 0; when the link is congested, the queue needs to negotiate According to the comprehensive investigation of the existing flow control algorithm, a similar token bucket model algorithm is used to limit the speed, and the polling mechanism is used to control the speed of multiple queues. The queue implements unified scheduling.
对参数进行定义，包括每个队列每秒钟可获得令牌数量为tecqi，其中，e代表该队列对应Flow的路由出口编号，对应了MAGIC中每个出口的编号；c代表当前队列属于的AQMClient的编号，此编号在AQM Client启动时，通过对AQM发起注册流程，分配编号；q代表当前队列对应Flow的QoS值，取值范围7～0，值越大优先级越高；i代表当前队列对应Flow的id号，与MAGIC中的client profile对应。Define the parameters, including the number of tokens that each queue can obtain per second as tecqi , where e represents the routing exit number of the flow corresponding to the queue, which corresponds to the number of each exit in MAGIC; c represents the current queue belongs to The number of the AQMClient. When the AQM Client starts, the number is allocated by initiating the registration process to the AQM; q represents the QoS value of the current queue corresponding to the Flow, ranging from 7 to 0. The larger the value, the higher the priority; i represents the current queue. The id number of the queue corresponding to the Flow corresponds to the client profile in MAGIC.
若每个令牌对应允许发送1个单位的数据元，每个单位数据元的大小固定为1KB(可调整)，则通过按秒分配令牌，控制队列的发送速率为8×tecqiKbps。If each token corresponds to one unit of data element that is allowed to be sent, and the size of each unit of data element is fixed at 1KB (adjustable), then by allocating tokens by second, the sending rate of the control queue is 8×tecqi Kbps.
若设定每个队列长度为8K，则每秒最多赋予该队列8K个令牌，单一Flow最快发送速率为8K×8Kbps＝64Mbps。If the length of each queue is set to be 8K, a maximum of 8K tokens are assigned to the queue per second, and the fastest sending rate of a single Flow is 8K×8Kbps=64Mbps.
队列的MAJOR门限为队列总长度的75％，即为6K，CRITICAL门限为队列总长度的90％，即为7.2K。The MAJOR threshold of the queue is 75% of the total queue length, which is 6K, and the CRITICAL threshold is 90% of the total queue length, which is 7.2K.
每个队列需存储的数据除tecqi、e、c、q、i外，还需要存储av_tecqi和av_arecqi；其中，av_tecqi表示队列平均令牌使用量，即每秒钟使用令牌的平均值，av_arecqi表示队列平均的数据元到达率。In addition to tecqi , e, c, q, and i, the data to be stored in each queue also needs to store av_tecqi and av_arecqi ; among them, av_tecqi represents the average token usage of the queue, that is, the average token usage per second value, av_arecqi represents the average arrival rate of data elements in the queue.
当队列处于未拥塞状态：当MAGIC中所有出口未出现拥塞时，令牌规则无需生效token为0，每个队列按照轮询方式全速发送入队的数据。When the queue is in an uncongested state: When all the exits in the MAGIC are not congested, the token rule does not need to take effect. The token is 0, and each queue sends the incoming data at full speed in a polling manner.
当队列处于拥塞状态且重要的高优先级业务流的带宽可以得到保障，则如图1所示，业务流Flow_3、Flow_2、Flow_1按照优先级由高到低，每个业务流都会分配一个逻辑带宽。随着业务流实际带宽的变化，当链路拥塞时，按照优先级顺序，将业务流Flow_3的多余带宽分配给带宽不足的业务流使用。When the queue is in a congested state and the bandwidth of important high-priority service flows can be guaranteed, as shown in Figure 1, service flows Flow_3, Flow_2, and Flow_1 are assigned a logical bandwidth in descending order of priority. . As the actual bandwidth of the service flow changes, when the link is congested, according to the priority order, the excess bandwidth of the service flow Flow_3 is allocated to the service flow with insufficient bandwidth for use.
(1)检测到发生拥塞，队列缓存未明显增长(1) Congestion is detected, and the queue buffer does not grow significantly
当某一条出口e出现拥塞情况后，则令牌规则生效，若当前出口的总带宽为Ke,当前链路的冗余系数为n每条Flow的Granted Bandwith为GBi，则全局t需要满足：When a certain outlet e is congested, the token rule takes effect. If the total bandwidth of the current outlet is Ke and the redundancy coefficient of the current link isn , the Granted Bandwith of each Flow is GBi , then the global t needs to satisfy :
此时，将每个队列的令牌桶数量设置为GBi/8，即可实现对该队列FLOW按照Granted Bandwith进行限速。At this time, setting the number of token buckets of each queue to GBi /8 can realize the speed limit of the queue FLOW according to the Granted Bandwith.
(2)检测到发生拥塞，队列缓存明显增长，但未进入MAJOR状态(2) Congestion is detected, and the queue buffer increases significantly, but does not enter the MAJOR state
当对队列进行令牌桶限速之后，各队列将会逐渐累积缓存数据，队列缓存加长，如出现某条队列av_arecqi>av_tecqi，首先需尝试将路由至同出口的其他flow的令牌借于当前队列，以缓解队列溢出风险，此时After the token bucket rate limit is applied to the queues, each queue will gradually accumulate cached data, and the queue cache will be lengthened. If a queue av_arecqi >av_tecqi appears , first try to borrow tokens from other flows that are routed to the same exit. in the current queue to mitigate the risk of queue overflow, at this time
但仍然需要满足：But still need to satisfy:
主要思路考虑借调更低优先级，且av_tecqi＜＜GBi/8的队列的令牌，但保证低优先级队列不被完全停止发送，且在拥塞缓解的时候能够恢复低优先级队列的发送速率。The main idea is to consider seconding the tokens of queues with lower priority and av_tecqi << GBi /8, but ensure that the low-priority queues are not completely stopped from sending, and can resume the sending of low-priority queues when congestion is relieved rate.
(3)检测到发生拥塞，队列缓存明显增长，进入MAJOR状态(3) Congestion is detected, the queue buffer increases significantly, and enters the MAJOR state
当某条队列进入MAJOR状态后算法将发起通信能力重协商，此时携带Request-Bandwidth的值RBi可以取值为av_arecqi-av_tecqi。When a queue enters the MAJOR state, the algorithm will initiate communication capability renegotiation. At this time, the value RBi carrying the Request-Bandwidth can be av_arecqi -av_tecqi .
(4)检测到发生拥塞，队列进入CRITICAL状态(4) When congestion is detected, the queue enters the CRITICAL state
保持当前策略不做调整，等待上层协商后的降速操作释放缓存资源。Keep the current policy unchanged, and wait for the deceleration operation negotiated by the upper layer to release the cache resources.
当队列处于拥塞状态且重要的高优先级业务流的带宽不能得到保障，则如图2所示，随着业务流实际带宽的变化，当链路拥塞且高优先级业务流带宽无法得到满足时，优先满足高优先级业务流的带宽需求，并按照优先级顺序，采用比例公平的方法PF，将业务流的剩余带宽分配给带宽不足的业务流使用。When the queue is congested and the bandwidth of important high-priority service flows cannot be guaranteed, as shown in Figure 2, as the actual bandwidth of the service flow changes, when the link is congested and the bandwidth of the high-priority service flow cannot be satisfied , to meet the bandwidth requirements of high-priority service flows first, and use proportional fairness method PF to allocate the remaining bandwidth of service flows to service flows with insufficient bandwidth according to the priority order.
当链路处于拥塞状态，且高优先级业务流的带宽无法得到保障时，核心思想是优先确保重要的高优先级的业务需求，将带宽优先分配给重要的高优先级，低优先级采用比例公平算法思想(PF)动态更改优先级顺序，分配剩余带宽，平滑突发流量，确保系统稳定。When the link is congested and the bandwidth of the high-priority service flow cannot be guaranteed, the core idea is to give priority to ensuring the important and high-priority service requirements, and to allocate the bandwidth to the important high-priority first, and the low-priority use ratio The fair algorithm idea (PF) dynamically changes the priority order, allocates the remaining bandwidth, smoothes the burst traffic, and ensures the stability of the system.
PF算法的优先级计算公式为：The priority calculation formula of the PF algorithm is:
其中，n表示业务流总数，Ri(t)表示业务流i在t时刻的传输速率，Ti(t)表示第i个用户在第t时隙中的吞吐量。Among them, n represents the total number of service flows, Ri (t) represents the transmission rate of service flow i at time t, and Ti (t) represents the throughput of the i-th user in the t-th time slot.
业务流是以RB资源块为基本单位，假设第m个RB资源块在t调度时刻分配给业务流i的状态为
对于业务流i，
比例公平(PF)算法则可以获得公平性和吞吐量的折中，从而从一定程度上满足航空场景下多飞机的调度需求，保证在带宽资源紧缺的情况下，优先级的业务流的航空业务通信需求。因此我们考虑每个调度周期内的资源调度，保证在上一段时间的调度周期内没有被调度到的业务流，在本次调度周期内拥有较高的优先级以保证航空业务的可靠传输。所提出的优先级计算方法表达式如下The proportional fairness (PF) algorithm can obtain a trade-off between fairness and throughput, so as to meet the scheduling requirements of multiple aircraft in aviation scenarios to a certain extent, and ensure that in the case of shortage of bandwidth resources, priority service flows for aviation services communication needs. Therefore, we consider the resource scheduling in each scheduling period to ensure that the service flow that was not scheduled in the previous scheduling period has a higher priority in this scheduling period to ensure the reliable transmission of aviation services. The proposed priority calculation method is expressed as follows
其中，Ri(t)表示业务流i在t时刻的传输速率；
其中T(1s)表示一个周期的运行时间，t表示当前运行的时间。
本申请中的令牌借调规则有三种，包括情况一：链路处于IDLE状态，则队列不需要限速，队列的权重参数token赋值为0，表示队列不限速，此时，队列会按照业务流的逻辑分配带宽控制队列中业务流的出去的速率(链表)。There are three token loaning rules in this application, including case 1: if the link is in the IDLE state, the queue does not need to limit the speed. The weight parameter token of the queue is assigned a value of 0, indicating that the queue has no speed limit. At this time, the queue will follow the service The logical allocation bandwidth of the flow controls the outgoing rate (linked list) of the service flow in the queue.
情况二：链路处于BUSY状态，且剩余可分配带宽可以确保重要高优先级业务流带宽需求；具体步骤包括：Scenario 2: The link is in the BUSY state, and the remaining allocatable bandwidth can ensure the bandwidth requirements of important and high-priority service flows; the specific steps include:
(1)初始分配令牌数量为granted_tokens；(1) The number of initial allocated tokens is granted_tokens;
(2)分析average_arriving(即为队列处计算得到的平均入栈速率InAverageVelocity)，得到平均到达率。若average_arriving>granted_tokens，则该flow需要借用令牌，借用数量为average_arriving-granted_tokens；若average_arriving<granted_tokens，则该flow可借出令牌，可借出数量为：0.8*(granted_tokens-average_arriving)。将所有flow分为lend组合borrow组。(0.8借出自身多余令牌的80％，要留有一定的令牌缓解自身业务流的突发流量，避免拥塞)；(2) Analyze the average_arriving (that is, the average entry rate InAverageVelocity calculated at the queue) to obtain the average arrival rate. If average_arriving>granted_tokens, the flow needs to borrow tokens, and the borrowed amount is average_arriving-granted_tokens; if average_arriving<granted_tokens, the flow can lend tokens, and the loanable amount is: 0.8*(granted_tokens-average_arriving). Divide all flows into lend-combination borrow groups. (0.8 lends 80% of its own excess tokens, and reserves a certain amount of tokens to ease the burst traffic of its own business flow and avoid congestion);
(3)计算lend组可借出token总数sum_l(即flow可借出的令牌求和)和borrow组需要借用的token总数sum_b(flow需要借用令牌求和)，如ratio＝sum_l/sum_b>1.1则可将需要每个需要借用token放大(ratio-0.05)倍(以使拥塞队列尽快疏通)(1.1即sum_l*90％＝sum_b→1/0.9＝1.11..借出令牌的90％。0.05:1.1-0.05＝1.05→sum_l*90％＝sum_b→1/0.95＝1.05263)(阈值1.1和0.05可根据具体需求进行分配和设置)。(3) Calculate the total number of tokens that can be borrowed in the lend group sum_l (that is, the sum of the tokens that can be lent by flow) and the total number of tokens that the borrow group needs to borrow sum_b (the sum of the borrowed tokens is required for flow), such as ratio=sum_l/sum_b> 1.1 You can multiply (ratio-0.05) times each token that needs to be borrowed (to clear the congested queue as soon as possible) (1.1 ie sum_l*90%=sum_b→1/0.9=1.11.. 90% of the loaned tokens. 0.05:1.1-0.05=1.05→sum_l*90%=sum_b→1/0.95=1.05263) (thresholds 1.1 and 0.05 can be assigned and set according to specific needs).
(4)Borrow组根据优先级降序排列(高优先级在前，低优先级在后，优先满足需要借调令牌的高优先级业务流需求)，lend组根据优先级升序排列(低优先级在前，高优先级在后，即先借调完可借出组中低优先级的令牌)。由Borrow[0]组开始借用lend[0]组令牌(如果lend[0]借完，则接着借lend[1]，以此类推—相互借调)。(4) Borrow groups are arranged in descending order of priority (high priority is first, low priority is last, and priority is to meet the needs of high-priority business flows that require seconded tokens), and the lend group is arranged in ascending order of priority (low priority is in Tokens with low priority in the loanable group are loaned out first, with high priority last. Borrow[0] group starts to borrow the tokens of the lend[0] group (if the lend[0] is fully borrowed, then the lend[1] is borrowed, and so on - borrowing each other).
目的是为了确保高优先级业务流的带宽需求，同时，保证低优先级队列不被完全停止发送，且在拥塞缓解的时候能够恢复低优先级队列的发送速率。The purpose is to ensure the bandwidth requirements of high-priority service flows, and at the same time, to ensure that low-priority queues are not completely stopped from sending, and the sending rate of low-priority queues can be restored when congestion is relieved.
情况三：链路处于BUSY状态，但剩余可分配带宽不能确保重要高优先级业务流带宽需求。算法步骤包括：Case 3: The link is in the BUSY state, but the remaining allocatable bandwidth cannot ensure the bandwidth requirements of important and high-priority service flows. The algorithm steps include:
(1)得到总的业务流分配逻辑令牌数total_granted_tokens(每条业务流初始化时都会分配一个逻辑分配带宽，规定数据包大小、单位换算就可以的到对应的逻辑分配令牌数，例如：granted_tokens＝granted_bandwidth*1000)/(CELL_LEN*8)规定CELL_LEN为1000单位为B/s，granted_bandwidth为分配逻辑带宽bit/s，经过换算就可以得到对应的逻辑分配令牌数)。(1) Obtain the total number of business flow allocation logic tokens total_granted_tokens (a logic allocation bandwidth will be allocated when each business flow is initialized, and the corresponding number of logic allocation tokens can be obtained by specifying the packet size and unit conversion, for example: granted_tokens =granted_bandwidth*1000)/(CELL_LEN*8) specifies that CELL_LEN is 1000 units of B/s, and granted_bandwidth is the allocated logical bandwidth bit/s. After conversion, the corresponding number of logically allocated tokens can be obtained).
(2)优先满足重要的高优先级业务流的带宽需求(令牌需求)。(2) The bandwidth requirements (token requirements) of important high-priority service flows are preferentially satisfied.
(3)重新计算低优先级业务流的优先级等级。(3) Recalculate the priority level of the low-priority service flow.
(4)按照新的优先级顺序，将剩余带宽分配给低优先级使用，避免整个业务流中处于低优先级业务流长期的不到带宽，饥饿现象的发生。(4) According to the new priority order, the remaining bandwidth is allocated to the low-priority use, so as to avoid the long-term lack of bandwidth and starvation of the low-priority service flow in the entire service flow.
情况1和情况2中，令牌借调规则：将业务流实际请求带宽和逻辑分配带宽进行比较，并对需要借入或借出的令牌数token划分为借入Borrow组和借出Lend组，并得到总令牌的借入数total_borrow和借出数total_lent。将Borrow组根据优先级降序排列，Lend组根据优先级升序排列。排序完成后，将Borrow组和Lend组按照优先级顺序相互借调，得到各队列的调度参数token，控制业务流的出栈速率。(如果
情况3中，令牌借调规则：重要的高优先级业务流抢占低优先级业务流带宽资源，优先满足重要的高优先级业务流的带宽需求。对低一些的优先级业务流，采用比例公平算法PF思想(防止饥饿现象的发生)，重新计算低优先级业务流的优先等级，并按照新的优先级顺序，将业务流的剩余带宽分配给低优先级业务流使用，相同优先级情况下，按照原优先级大小比较。In
以上所举实施例，对本发明的目的、技术方案和优点进行了进一步的详细说明，所应理解的是，以上所举实施例仅为本发明的优选实施方式而已，并不用以限制本发明，凡在本发明的精神和原则之内对本发明所作的任何修改、等同替换、改进等，均应包含在本发明的保护范围之内。The above-mentioned embodiments further describe the purpose, technical solutions and advantages of the present invention in detail. It should be understood that the above-mentioned embodiments are only preferred embodiments of the present invention, and are not intended to limit the present invention. Any modification, equivalent replacement, improvement, etc. made to the present invention within the spirit and principle of the present invention shall be included within the protection scope of the present invention.
Claims (10)
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210648380.4ACN115087035B (en) | 2022-06-09 | 2022-06-09 | A bandwidth resource allocation method for civil aviation communication system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210648380.4ACN115087035B (en) | 2022-06-09 | 2022-06-09 | A bandwidth resource allocation method for civil aviation communication system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN115087035Atrue CN115087035A (en) | 2022-09-20 |
| CN115087035B CN115087035B (en) | 2024-12-27 |
Family
ID=83251191
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210648380.4AActiveCN115087035B (en) | 2022-06-09 | 2022-06-09 | A bandwidth resource allocation method for civil aviation communication system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115087035B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN119697134A (en)* | 2025-02-24 | 2025-03-25 | 麒麟软件有限公司 | A method and device for allocating network resources |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070280245A1 (en)* | 2006-05-31 | 2007-12-06 | Zvi Rosberg | Method and apparatus for fair flow control and congestion avoidance supporting multiple qos class requirements |
| US7619971B1 (en)* | 2005-05-16 | 2009-11-17 | Extreme Networks, Inc. | Methods, systems, and computer program products for allocating excess bandwidth of an output among network users |
| CN102014500A (en)* | 2010-12-23 | 2011-04-13 | 柳州职业技术学院 | Method for efficiently allocating bandwidths in wireless access network |
| US20160072691A1 (en)* | 2014-09-08 | 2016-03-10 | Hughes Network Systems, Llc | Bandwidth management across logical groupings of access points in a shared access broadband network |
| US20160072574A1 (en)* | 2014-09-08 | 2016-03-10 | Hughes Network Systems, Llc | Dynamic bandwidth management with spectrum efficiency for logically grouped terminals in a broadband satellite network |
| CN106533982A (en)* | 2016-11-14 | 2017-03-22 | 西安电子科技大学 | Dynamic queue scheduling device and method based on bandwidth borrowing |
| CN107231317A (en)* | 2016-03-25 | 2017-10-03 | 重庆邮电大学 | A kind of packet mixed scheduling strategy for 6LoWPAN and Internet Interworking GateWays |
- 2022
- 2022-06-09CNCN202210648380.4Apatent/CN115087035B/enactiveActive
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7619971B1 (en)* | 2005-05-16 | 2009-11-17 | Extreme Networks, Inc. | Methods, systems, and computer program products for allocating excess bandwidth of an output among network users |
| US20070280245A1 (en)* | 2006-05-31 | 2007-12-06 | Zvi Rosberg | Method and apparatus for fair flow control and congestion avoidance supporting multiple qos class requirements |
| CN102014500A (en)* | 2010-12-23 | 2011-04-13 | 柳州职业技术学院 | Method for efficiently allocating bandwidths in wireless access network |
| US20160072691A1 (en)* | 2014-09-08 | 2016-03-10 | Hughes Network Systems, Llc | Bandwidth management across logical groupings of access points in a shared access broadband network |
| US20160072574A1 (en)* | 2014-09-08 | 2016-03-10 | Hughes Network Systems, Llc | Dynamic bandwidth management with spectrum efficiency for logically grouped terminals in a broadband satellite network |
| CN107231317A (en)* | 2016-03-25 | 2017-10-03 | 重庆邮电大学 | A kind of packet mixed scheduling strategy for 6LoWPAN and Internet Interworking GateWays |
| CN106533982A (en)* | 2016-11-14 | 2017-03-22 | 西安电子科技大学 | Dynamic queue scheduling device and method based on bandwidth borrowing |
Non-Patent Citations (2)
| Title |
|---|
| 刘治国: "基于动态令牌桶的卫星网络带宽分配方法", 《计算机工程》第42卷第2期, 15 February 2016 (2016-02-15)* |
| 潘越: "卫星网络路由技术研究", 中国优秀硕士学位论文全文数据库, 15 March 2018 (2018-03-15)* |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN119697134A (en)* | 2025-02-24 | 2025-03-25 | 麒麟软件有限公司 | A method and device for allocating network resources |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115087035B (en) | 2024-12-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP2317701B1 (en) | Priority-based hierarchical bandwidth sharing | |
| CN113141590B (en) | Industrial Internet of things-oriented wireless communication scheduling method and device | |
| CN114268537B (en) | Deterministic network-oriented network slice generation and dynamic configuration system and method | |
| JP3306705B2 (en) | Packet transfer control device and scheduling method thereof | |
| JP2002543669A (en) | Route setting device | |
| WO2008095397A1 (en) | Traffic scheduling method and apparatus thereof | |
| JP4163044B2 (en) | BAND CONTROL METHOD AND BAND CONTROL DEVICE THEREOF | |
| CN101286949A (en) | MAC Layer Resource Scheduling Strategy of Wireless Mesh Network Based on IEEE802.16d Standard | |
| CN101442495A (en) | Quantum hash scheduling method based on service gradation protocol | |
| EP3029898B1 (en) | Virtual output queue authorization management method and device, and computer storage medium | |
| CN113747597B (en) | Network data packet scheduling method and system based on mobile 5G network | |
| CN110808920A (en) | A satellite communication flow control method with coexistence of CCSDS frame and IP message | |
| CN102104545A (en) | Credit scheduling method and device and bypass device for solving linear speed of packet | |
| US11336582B1 (en) | Packet scheduling | |
| CN101719869B (en) | Method and device for dynamically allocating bandwidth by adopting associated token bucket algorithm | |
| CN113079107A (en) | Dynamic priority congestion control method for programmable switching network | |
| CN117640525A (en) | A scheduling method considering communication delay | |
| CN100466593C (en) | A Realization Method of Integrated Queue Scheduling Supporting Multiple Services | |
| CN115087035A (en) | Bandwidth resource allocation method applied to civil aviation communication system | |
| CN1750517B (en) | A Method for Realizing Service Bandwidth Guarantee | |
| CN107896200A (en) | Message scheduling method compatible with virtual link and packet switching mechanism | |
| CN103023819B (en) | A kind of coarseness distribution method of dynamic bandwidth | |
| KR20120055947A (en) | Method and apparatus for providing Susbscriber-aware per flow | |
| CN101902405A (en) | Emergency service-oriented temporary bandwidth allocation method and system thereof | |
| Zhu et al. | An efficient priority-driven congestion control algorithm for data center networks |
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 | ||
| TA01 | Transfer of patent application right | ||
| TA01 | Transfer of patent application right | Effective date of registration:20241203 Address after:Room 101, Building 1, Yard 1, Renhe Garden, Shunyi District, Beijing 101300 Applicant after:Beijing Urban Construction Intelligent Control Technology Co.,Ltd. Country or region after:China Address before:400065 Chongwen Road, Nanshan Street, Nanan District, Chongqing Applicant before:CHONGQING University OF POSTS AND TELECOMMUNICATIONS Country or region before:China | |
| GR01 | Patent grant | ||
| GR01 | Patent grant |