CN101577670A - Method, device and system for bandwidth allocation - Google Patents

Abstract

The embodiment of the present invention relates to a bandwidth allocation method, device and system, wherein the method includes: when the decrease of network bandwidth resources is detected, according to the preset minimum bandwidth, the bandwidth of each communication link is adjusted to the bandwidth of each communication link. The minimum value of the bandwidth corresponding to the link; if the adjusted network bandwidth resources increase, the bandwidth increment required by each communication link is obtained according to the maximum bandwidth of each communication link and the subjective quality of the video; according to the bandwidth increment, according to The priority of each communication link is from high to low, and the remaining bandwidth of the network is allocated to each communication link in turn. The embodiments of the present invention can ensure the optimization of the overall allocation of bandwidth resources, thereby ensuring the service quality of user communication terminals.

Description

Bandwidth allocation method, device and system

technical field

The embodiments of the present invention relate to the network field, and in particular to a bandwidth allocation method, device and system.

Background technique

Since the 1990s, Internet services have developed rapidly due to the provision of a large number of rich service content. At the same time, mobile communication services have also risen rapidly. Being able to communicate anytime and anywhere has become an urgent need for people's daily life. In this context, the idea of Next Generation Network (NGN) is proposed. The basic features of NGN are: provide a large number of broadband services to increase business revenue; integrate various network services, such as data, telephone, multimedia and various emerging Internet services, including streaming media services such as instant messaging and video-on-demand.

The NGN system and standards adopt Internet Protocol (Internet Protocol, hereinafter referred to as: IP) technology as the bearer network of NGN services. There are many kinds of NGN services, including multimedia services such as voice, data, and video. These services have different requirements for Quality of Service (QoS). For example, real-time services such as voice and video are sensitive to delay. It requires as little delay as possible, but allows a certain packet loss rate; services such as data files and still pictures are not sensitive to delay, but require a lower packet loss rate. Not only that, NGN may be composed of several operators' areas, and the transmission performance of these heterogeneous networks is also different. Therefore, in NGN, there are stricter requirements on end-to-end QoS, and the QoS of NGN must be effectively controlled to ensure the quality of NGN communication. However, the traditional IP technology is difficult to meet the requirements of NGN business diversity, real-time and security, and the existing public IP network cannot provide large-scale bearer services with QoS guarantee for the softswitch network.

Due to the continuous increase of network bandwidth, the easiest way for operators to solve network congestion and QoS problems is to "throw the problem to the bandwidth", resulting in continuous increase of network capacity. The goal of resource management is to flexibly allocate and dynamically adjust the available resources of the system under the condition of limited resources, to maximize the utilization of system resources, to prevent network congestion, and to provide service quality assurance for user communication terminals. Therefore, there is a close relationship between QoS and bandwidth management methods, and bandwidth management capabilities are the cornerstone for operators to solve QoS problems.

The prior art provides a method of allocating network bandwidth using a price strategy in an IP network. When the network cannot simultaneously meet the QoS requirements of all communicating users, the operator will suffer losses. In this case, the operator can The price strategy is adopted to allocate network bandwidth, so as to ensure the maximum profit of communication service operation. The so-called price strategy refers to a linear price strategy, and its service performance parameter is data packet delay. Assuming that i, j (i, j=1, 2, ..., n) is used to represent the service level (also called priority) of the user communication terminal, and d _i is used to represent the user communication terminal whose service level is i The packet delay of , using _ri (d _i ) to represent the price function, the price function is defined as the functional relationship between the QoS provided by the network provider and the price paid by the user, and its expression is:

r _i (d _i )＝b _i -k _i d _i (1.1)

Where _bi and _ki are parameters of the price function, _bi >0, ki _> 0. Usually, if the service level i is higher than the service level j, then bi _> b _j , _ki > k _j . Under this price strategy, users with higher service levels will pay higher fees. At the same time, when operators cannot meet the QoS requirements of users with higher service levels, they will also pay more compensation.

Assume that Cbit/s is used to represent the total bandwidth of the network, and λ ₁ , λ ₂ , ..., λ _n are used to represent the arrival rate of service flows of n service levels, and the arrival rate of service flows satisfies the Poisson distribution , the data packet length of the service flow is exponentially distributed, let L _i (bits) represent the average packet length of service level i, and use ω _i C to represent the bandwidth allocated to the service flow of service level i, where ω _i represents the bandwidth allocated to service level The ratio of the bandwidth of the business flow of i to the total bandwidth, the constraints on these ratios are:

${\mathrm{<span\; class="notranslate">\; \&Sigma;</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}<span\; class="notranslate">\; =</span>\mathrm{<span\; class="notranslate">\; 1</span>}}^{\mathrm{<span\; class="notranslate">\; no</span>}}{\mathrm{<span\; class="notranslate">\; \&omega;</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; =</span>\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; \&omega;</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; \&le;</span>\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; \&omega;</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; \&Element;</span><span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; 0,1</span>}<span\; class="notranslate">\; ]</span>$

Assuming that the allocated bandwidth matches the allocated processing capacity and buffer capacity (that is, the allocated bandwidth is not limited by the allocated processing capacity and can be fully utilized, and the system will not lose packets due to buffer overflow), then based on the queuing theory, when there is no packet loss In this case, the average packet delay d _i can be expressed as:

d _i =1/(ω _i c/L _i -λ _i )=L _i /(ω _i c-λ _i L _i )

The constraint condition of the above formula is ω _i c > λ _i L _i . Since the operating income of communication services is measured as the operating income of communication services per unit time, after substituting the above linear price function, the operating income REV of communication services obtained by network providers can be expressed as:

$\mathrm{<span\; class="notranslate">\; REV</span>}<span\; class="notranslate">\; =</span>\underset{\mathrm{<span\; class="notranslate">\; i</span>}<span\; class="notranslate">\; =</span>\mathrm{<span\; class="notranslate">\; 1</span>}}{\overset{\mathrm{<span\; class="notranslate">\; no</span>}}{\mathrm{<span\; class="notranslate">\; \&Sigma;</span>}}}{\mathrm{<span\; class="notranslate">\; \&lambda;</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}{\mathrm{<span\; class="notranslate">\; r</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; (</span>{\mathrm{<span\; class="notranslate">\; d</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; =</span>\underset{\mathrm{<span\; class="notranslate">\; i</span>}<span\; class="notranslate">\; =</span>\mathrm{<span\; class="notranslate">\; 1</span>}}{\overset{\mathrm{<span\; class="notranslate">\; no</span>}}{\mathrm{<span\; class="notranslate">\; \&Sigma;</span>}}}{\mathrm{<span\; class="notranslate">\; \&lambda;</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; (</span>{\mathrm{<span\; class="notranslate">\; b</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; -</span>\frac{{\mathrm{<span\; class="notranslate">\; k</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}\stackrel{<span\; class="notranslate">\; \&OverBar;</span>}{{\mathrm{<span\; class="notranslate">\; L</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}}}{{\mathrm{<span\; class="notranslate">\; \&omega;</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}\mathrm{<span\; class="notranslate">\; c</span>}<span\; class="notranslate">\; -</span>{\mathrm{<span\; class="notranslate">\; \&lambda;</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}\stackrel{<span\; class="notranslate">\; \&OverBar;</span>}{{\mathrm{<span\; class="notranslate">\; L</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}}}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; 1.2</span>}<span\; class="notranslate">\; )</span>$

Then the bandwidth allocation problem of maximizing communication service operating income under the linear price strategy can be expressed by the following optimization solution equation:

$\mathrm{<span\; class="notranslate">\; max</span>}\mathrm{<span\; class="notranslate">\; REV</span>}<span\; class="notranslate">\; =</span>\mathrm{<span\; class="notranslate">\; max</span>}\underset{\mathrm{<span\; class="notranslate">\; i</span>}<span\; class="notranslate">\; =</span>\mathrm{<span\; class="notranslate">\; 1</span>}}{\overset{\mathrm{<span\; class="notranslate">\; no</span>}}{\mathrm{<span\; class="notranslate">\; \&Sigma;</span>}}}{\mathrm{<span\; class="notranslate">\; \&lambda;</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; (</span>{\mathrm{<span\; class="notranslate">\; b</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; -</span>\frac{{\mathrm{<span\; class="notranslate">\; k</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}\stackrel{<span\; class="notranslate">\; \&OverBar;</span>}{{\mathrm{<span\; class="notranslate">\; L</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}}}{{\mathrm{<span\; class="notranslate">\; \&omega;</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}\mathrm{<span\; class="notranslate">\; c</span>}<span\; class="notranslate">\; -</span>{\mathrm{<span\; class="notranslate">\; \&lambda;</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}\stackrel{<span\; class="notranslate">\; \&OverBar;</span>}{{\mathrm{<span\; class="notranslate">\; L</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}}}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; 1.3</span>}<span\; class="notranslate">\; )</span>$

Among them, the following constraints are satisfied at the optimization point:

$\underset{\mathrm{<span\; class="notranslate">\; i</span>}<span\; class="notranslate">\; =</span>\mathrm{<span\; class="notranslate">\; 1</span>}}{\overset{\mathrm{<span\; class="notranslate">\; no</span>}}{\mathrm{<span\; class="notranslate">\; \&Sigma;</span>}}}{\mathrm{<span\; class="notranslate">\; \&omega;</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; =</span>\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; \&omega;</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; \&Element;</span><span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; 0,1</span>}<span\; class="notranslate">\; ]</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; 1.4</span>}<span\; class="notranslate">\; )</span>$

ω _i c > λ _i L _i (1.5)

Using the Lagrangian optimization algorithm, according to formula (1.3) and (1.4), construct the following Lagrangian equation:

$\mathrm{<span\; class="notranslate">\; p</span>}<span\; class="notranslate">\; =</span>\underset{\mathrm{<span\; class="notranslate">\; i</span>}<span\; class="notranslate">\; =</span>\mathrm{<span\; class="notranslate">\; 1</span>}}{\overset{\mathrm{<span\; class="notranslate">\; no</span>}}{\mathrm{<span\; class="notranslate">\; \&Sigma;</span>}}}{\mathrm{<span\; class="notranslate">\; \&lambda;</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; (</span>{\mathrm{<span\; class="notranslate">\; b</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; -</span>\frac{{\mathrm{<span\; class="notranslate">\; k</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}\stackrel{<span\; class="notranslate">\; \&OverBar;</span>}{{\mathrm{<span\; class="notranslate">\; L</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}}}{{\mathrm{<span\; class="notranslate">\; \&omega;</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}\mathrm{<span\; class="notranslate">\; c</span>}<span\; class="notranslate">\; -</span>{\mathrm{<span\; class="notranslate">\; \&lambda;</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}\stackrel{<span\; class="notranslate">\; \&OverBar;</span>}{{\mathrm{<span\; class="notranslate">\; L</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}}}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; \&sigma;</span>}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; -</span>\underset{\mathrm{<span\; class="notranslate">\; i</span>}<span\; class="notranslate">\; =</span>\mathrm{<span\; class="notranslate">\; 1</span>}}{\overset{\mathrm{<span\; class="notranslate">\; no</span>}}{\mathrm{<span\; class="notranslate">\; \&Sigma;</span>}}}{\mathrm{<span\; class="notranslate">\; \&omega;</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; 1.6</span>}<span\; class="notranslate">\; )</span>$

并使之等于0，便可得到ω_i，从而得到运营商的通信服务运营收益。当式(1.6)的二阶偏导数在(0，1)内严格大于0或严格小于0时，ω_i在(0，1)内有唯一的最优解。Take the partial differential of P

And make it equal to 0, then ω _i can be obtained, thus obtaining the operator's communication service operating income. When the second-order partial derivative of formula (1.6) is strictly greater than 0 or strictly smaller than 0 in (0, 1), ω _i has a unique optimal solution in (0, 1).

In the course of realizing the present invention, the inventor finds that the above-mentioned prior art has the following defects:

(1) This technical solution can guarantee the maximization of the interests of operators, but it cannot guarantee the overall optimal utilization of bandwidth resources, and thus cannot guarantee the quality of network services;

(2) This technical solution only uses packet delay as a network service performance parameter, which cannot comprehensively reflect the service quality of real-time video communication.

Contents of the invention

The bandwidth allocation method, device, and system provided by the embodiments of the present invention can ensure that bandwidth resources are optimally utilized as a whole, thereby ensuring network service quality.

An embodiment of the present invention provides a bandwidth allocation method, including:

When it is detected that the network bandwidth resources decrease, according to the preset minimum bandwidth value, the bandwidth of each communication link is adjusted to the minimum bandwidth value corresponding to each communication link;

If the adjusted network bandwidth resource is increased, the bandwidth increment required by each communication link is obtained according to the maximum bandwidth of each communication link and the subjective video quality;

According to the bandwidth increment, the remaining bandwidth of the network is allocated to each communication link in sequence in descending order of the priority of each communication link.

An embodiment of the present invention provides a bandwidth allocation device, including:

The monitoring module is used to monitor network bandwidth resources and determine the current status of network bandwidth resources;

The minimum value setting module is used to obtain the current network bandwidth resource status of the monitoring module. When the network bandwidth resource decreases, adjust the bandwidth of each communication link to the bandwidth corresponding to each communication link according to the preset bandwidth minimum value. bandwidth minimum;

The first obtaining module is used to obtain the current network bandwidth resource status of the monitoring module. When the network bandwidth resource adjusted by the minimum value setting module increases, according to the current bandwidth value of each communication link, the maximum bandwidth value and the subjective video quality, obtain Bandwidth increments required for each communication link;

The first allocation module is configured to sequentially allocate the remaining bandwidth of the network to each communication link in descending order of the priority of each communication link according to the bandwidth increment of the first acquisition module.

An embodiment of the present invention provides a bandwidth allocation system, including: a sending media gateway, a receiving media gateway, and a media gateway controller; the media gateway controller includes:

A monitoring module, configured to monitor the network bandwidth resource between the media gateway of the sending party and the media gateway of the receiving party, and determine the current status of the network bandwidth resource;

The minimum value setting module is used to obtain the current network bandwidth resource status of the monitoring module. When the network bandwidth resource decreases, adjust the bandwidth of each communication link to the bandwidth corresponding to each communication link according to the preset bandwidth minimum value. bandwidth minimum;

The first obtaining module is used to obtain the current network bandwidth resource status of the monitoring module. When the network bandwidth resource adjusted by the minimum value setting module increases, according to the current bandwidth value of each communication link, the maximum bandwidth value and the subjective video quality, obtain Bandwidth increments required for each communication link;

The first allocation module is configured to sequentially allocate the remaining bandwidth of the network to each communication link in descending order of the priority of each communication link according to the bandwidth increment of the first acquisition module.

The bandwidth allocation method, device, and system provided by the embodiments of the present invention first adjust the bandwidth of each communication link to the minimum bandwidth corresponding to each communication link when it is detected that the network bandwidth resource is reduced, and then adjust the bandwidth according to the available According to the bandwidth resources provided, the remaining bandwidth of the network is allocated to each communication link in order according to the priority of each communication link from high to low, so as to ensure the optimization of the overall allocation of bandwidth resources and the quality of network services.

Description of drawings

Fig. 1 is the flow chart of the embodiment of the bandwidth allocation method of the present invention;

2 is a flow chart of user communication terminal access in an embodiment of the bandwidth allocation method of the present invention;

3 is a schematic diagram of an embodiment of a bandwidth allocation device of the present invention;

Fig. 4 is a structural diagram of an embodiment of the bandwidth allocation system of the present invention.

Detailed ways

The technical solutions of the embodiments of the present invention will be described in further detail below with reference to the drawings and embodiments.

The embodiment of the present invention proposes a solution to ensure the optimization of the overall allocation of bandwidth resources. When it is detected that the bandwidth resources between the sender and the receiver (for example, two media gateways) suddenly decrease and the network condition deteriorates, firstly, according to the preset Minimum bandwidth, adjust the bandwidth of each communication link to the minimum bandwidth corresponding to each communication link; secondly, if the bandwidth resources that can be provided after adjustment are improved, then according to the maximum bandwidth of each communication link and the subjective video Quality, to obtain the bandwidth increment required by each communication link; according to the bandwidth increment, according to the priority order of each communication link from high to low, allocate the remaining bandwidth of the network to each communication link in turn.

Furthermore, an objectification model of video subjective quality is introduced in the embodiment of the present invention. The so-called subjective quality refers to the subjective experience of the user after using the product. The subjective quality of the video is obtained by evaluating the video images seen by a number of randomly selected users in a specific environment. Currently, the video quality is divided into the following 5 types Subjective quality, see Table 1, is five levels of video subjective quality.

Table 1.5 levels of subjective video quality

5 Excellent 4 Good 3 fire 2 Poor 1 Bad

However, it is time-consuming and infeasible to obtain the subjective quality of the video through experiments for each segment of the video. Therefore, the embodiment of the present invention solves this problem by introducing an objective model of the subjective quality of the video. The objective model of video subjective quality uses network quality statistical parameters and coding parameters, such as packet loss rate, frame rate and bit rate, etc., to obtain video subjective quality through calculation. The objective model of video subjective quality is as follows:

${\mathrm{<span\; class="notranslate">\; V</span>}}_{\mathrm{<span\; class="notranslate">\; q</span>}}<span\; class="notranslate">\; =</span>\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; +</span>{\mathrm{<span\; class="notranslate">\; I</span>}}_{\mathrm{<span\; class="notranslate">\; coding</span>}}<span\; class="notranslate">\; \&CenterDot;</span>\mathrm{<span\; class="notranslate">\; exp</span>}<span\; class="notranslate">\; (</span><span\; class="notranslate">\; -</span>\frac{{\mathrm{<span\; class="notranslate">\; P</span>}}_{\mathrm{<span\; class="notranslate">\; plv</span>}}}{{\mathrm{<span\; class="notranslate">\; D.</span>}}_{{\mathrm{<span\; class="notranslate">\; P</span>}}_{\mathrm{<span\; class="notranslate">\; plv</span>}}}}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; 2.1</span>}<span\; class="notranslate">\; )</span>$

表示与丢包率相关的视频质量健壮度；P_plv表示丢包率；其中，V_q的值域范围为1≤V_q≤5。Wherein, V _q represents the subjective quality of the video; I _coding represents the basic video quality (affected by coding distortion), which is determined by the video coding bit rate (represented by Br _V ) and the video frame rate (represented by Fr _V );

Indicates the video quality robustness related to the packet loss rate; P _plv indicates the packet loss rate; where, the value range of V _q is 1≤V _q ≤5.

I _coding can be expressed by the following formula:

${\mathrm{<span\; class="notranslate">\; I</span>}}_{\mathrm{<span\; class="notranslate">\; coding</span>}}<span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; I</span>}}_{\mathrm{<span\; class="notranslate">\; Ofr</span>}}\mathrm{<span\; class="notranslate">\; exp</span>}<span\; class="notranslate">\; \{</span><span\; class="notranslate">\; -</span>\frac{{<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; ln</span>}<span\; class="notranslate">\; (</span>{\mathrm{<span\; class="notranslate">\; Fr</span>}}_{\mathrm{<span\; class="notranslate">\; V</span>}}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; -</span>\mathrm{<span\; class="notranslate">\; ln</span>}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; Ofr</span>}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; )</span>}^{\mathrm{<span\; class="notranslate">\; 2</span>}}<span\; class="notranslate">\; \}</span>}{\mathrm{<span\; class="notranslate">\; 2</span>}{\mathrm{<span\; class="notranslate">\; D.</span>}}_{{\mathrm{<span\; class="notranslate">\; Fr</span>}}_{\mathrm{<span\; class="notranslate">\; V</span>}}}^{\mathrm{<span\; class="notranslate">\; 2</span>}}}<span\; class="notranslate">\; \}</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; 2.2</span>}<span\; class="notranslate">\; )</span>$

Among them, Ofr represents the optimal frame rate at a specific video encoding bit rate,

Ofr=v ₁ +v ₂ Br _V , 1≤Ofr≤30, v ₁ and v ₂ are constants; (2.3)

When the video frame rate is equal to the optimal frame rate, that is, when Fr _V =Ofr, I _coding = I _Ofr , I _Ofr represents the maximum video quality available under a specific video coding bit rate, and its expression is:

${\mathrm{<span\; class="notranslate">\; I</span>}}_{\mathrm{<span\; class="notranslate">\; Ofr</span>}}<span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; v</span>}}_{\mathrm{<span\; class="notranslate">\; 3</span>}}<span\; class="notranslate">\; -</span>\frac{{\mathrm{<span\; class="notranslate">\; <figure-callout\; id="3"\; label="v"\; filenames="A20081010599700281.png"\; state="\{\{state\}\}">v</figure-callout></span>}}_{\mathrm{<span\; class="notranslate">\; 3</span>}}}{\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; +</span>{<span\; class="notranslate">\; (</span>\frac{{\mathrm{<span\; class="notranslate">\; Br</span>}}_{\mathrm{<span\; class="notranslate">\; V</span>}}}{{\mathrm{<span\; class="notranslate">\; v</span>}}_{\mathrm{<span\; class="notranslate">\; 4</span>}}}<span\; class="notranslate">\; )</span>}^{{\mathrm{<span\; class="notranslate">\; v</span>}}_{\mathrm{<span\; class="notranslate">\; 5</span>}}}}<span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; 2.4</span>}<span\; class="notranslate">\; )</span>$

In the above formula, 0≤I _Ofr ≤4, v ₃ , v ₄ , v ₅ are constants;

表示与Fr_V相关的视频质量健壮度，其表达式为：

Indicates the video quality robustness related to Fr _V , and its expression is:

${\mathrm{<span\; class="notranslate">\; D.</span>}}_{{\mathrm{<span\; class="notranslate">\; Fr</span>}}_{\mathrm{<span\; class="notranslate">\; V</span>}}}<span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; <figure-callout\; id="6"\; label="v"\; filenames="A20081010599700281.png"\; state="\{\{state\}\}">v</figure-callout></span>}}_{\mathrm{<span\; class="notranslate">\; 6</span>}}<span\; class="notranslate">\; +</span>{\mathrm{<span\; class="notranslate">\; <figure-callout\; id="7"\; label="v"\; filenames="A20081010599700281.png"\; state="\{\{state\}\}">v</figure-callout></span>}}_{\mathrm{<span\; class="notranslate">\; 7</span>}}{\mathrm{<span\; class="notranslate">\; Br</span>}}_{\mathrm{<span\; class="notranslate">\; V</span>}}<span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; 2.5</span>}<span\; class="notranslate">\; )</span>$

In the above formula $0<{\mathrm{D.}}_{{\mathrm{Fr}}_V},$ v ₆ and v ₇ are constants.

的表达式为：

The expression is:

${\mathrm{<span\; class="notranslate">\; D.</span>}}_{{\mathrm{<span\; class="notranslate">\; P</span>}}_{\mathrm{<span\; class="notranslate">\; plV</span>}}}<span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; v</span>}}_{\mathrm{<span\; class="notranslate">\; 10</span>}}<span\; class="notranslate">\; +</span>{\mathrm{<span\; class="notranslate">\; v</span>}}_{\mathrm{<span\; class="notranslate">\; 11</span>}}\mathrm{<span\; class="notranslate">\; exp</span>}<span\; class="notranslate">\; (</span><span\; class="notranslate">\; -</span>\frac{{\mathrm{<span\; class="notranslate">\; Fr</span>}}_{\mathrm{<span\; class="notranslate">\; V</span>}}}{{\mathrm{<span\; class="notranslate">\; v</span>}}_{\mathrm{<span\; class="notranslate">\; 8</span>}}}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; +</span>{\mathrm{<span\; class="notranslate">\; v</span>}}_{\mathrm{<span\; class="notranslate">\; 12</span>}}\mathrm{<span\; class="notranslate">\; exp</span>}<span\; class="notranslate">\; (</span><span\; class="notranslate">\; -</span>\frac{{\mathrm{<span\; class="notranslate">\; Br</span>}}_{\mathrm{<span\; class="notranslate">\; V</span>}}}{{\mathrm{<span\; class="notranslate">\; v</span>}}_{\mathrm{<span\; class="notranslate">\; 9</span>}}}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; 2.6</span>}<span\; class="notranslate">\; )</span>$

In the above formula $0<{\mathrm{D.}}_{P_{\mathrm{plV}}},$ v ₉ , v ₉ , . . . , v ₁₂ are constants.

The selection of the above-mentioned parameters v ₁ , v ₂ ,..., v ₁₁ , v ₁₂ is related to factors such as encoding type, video format, frame refresh interval, and video display size, and v ₁ , v ₂ can be determined through experiments according to the above formula , ..., v ₁₁ , v ₁₂ . For example, firstly, for M (M is a natural number) different frame rates Fr _V , the subjective video quality V _q under different frame rates is obtained through experiments, and Table 2 is obtained;

Table 2. Relationship among the three parameters of Br _V , Fr _V , and V _q

Br _{V f V} b _n f ₁ V _q (b _n , f ₁ ) b _n f ₂ V _q (b _n , f ₂ ) ... ... ... b _n f _m V _q (b _n , f _m ) ... ... ... b _n f _M V _q (b _n , f _M )

三个参数的值可以通过使用最小二乘法(LST)算法得到，从而得到表3；Then, substitute the data in Table 2 into formula (2.1), for each b _n , I _Ofr , Ofr,

The values of the three parameters can be obtained by using the least squares (LST) algorithm, thereby obtaining Table 3;

Table 3. B _r V, I _Ofr , Ofr, The relationship between

Afterwards, substituting the b _n and 0 _n (n=1, 2, ..., N) obtained in Table 3 into formula (2.3), and using the LST algorithm, the estimated values of v ₁ and v ₂ can be obtained; Substituting b _n , I _n (n=1, 2,..., N) into formula (2.4), the estimated values of v ₃ , v ₄ , and v ₅ can be obtained by using the LST algorithm; b _n , D _n obtained in Table 3 (n=1, 2, ..., N) are substituted into formula (2.5), and the estimated values of v ₆ and v ₇ can be obtained by using the LST algorithm;

的估计值，如表4；Substituting the values in Table 3 into formula (2.2), the value of I _coding can be obtained, and substituting I _coding and video subjective quality V _q into formula (2.1), then for different frame rates and code rates, using the LST algorithm can be obtained A group

The estimated value of is shown in Table 4;

Br_V、Fr_V之间的关系Table 4.

Relationship between Br _V and Fr _V

will f _m and ${\mathrm{D.}}_{P_{\mathrm{plv}}}={\mathrm{D.}}_{b1\mathrm{fm}}(m=\mathrm{1,2},...,m)$ Substituting into formula (3.1), the estimated values of parameters a, b and _v8 can be calculated by using the LST algorithm;

${\mathrm{<span\; class="notranslate">\; D.</span>}}_{\mathrm{<span\; class="notranslate">\; wxya</span>}}<span\; class="notranslate">\; =</span>\mathrm{<span\; class="notranslate">\; a</span>}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; b</span>}<span\; class="notranslate">\; \&Center\; Dot;</span>\mathrm{<span\; class="notranslate">\; exp</span>}<span\; class="notranslate">\; (</span><span\; class="notranslate">\; -</span>\frac{{\mathrm{<span\; class="notranslate">\; f</span>}}_{\mathrm{<span\; class="notranslate">\; v</span>}}}{{\mathrm{<span\; class="notranslate">\; v</span>}}_{\mathrm{<span\; class="notranslate">\; 8</span>}}}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; 3.1</span>}<span\; class="notranslate">\; )</span>$

combine b _n and ${\mathrm{D.}}_{P_{\mathrm{plv}}}={\mathrm{D.}}_{\mathrm{bnf}1}(\mathrm{no}=\mathrm{1,2},...,N)$ Substituting into formula (3.2), the estimated values of parameters c, d and _v9 can be calculated by using the LST algorithm;

${\mathrm{<span\; class="notranslate">\; D.</span>}}_{\mathrm{<span\; class="notranslate">\; wxya</span>}}<span\; class="notranslate">\; =</span>\mathrm{<span\; class="notranslate">\; c</span>}<span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; d</span>}<span\; class="notranslate">\; \&CenterDot;</span>\mathrm{<span\; class="notranslate">\; exp</span>}<span\; class="notranslate">\; (</span><span\; class="notranslate">\; -</span>\frac{{\mathrm{<span\; class="notranslate">\; B</span>}}_{\mathrm{<span\; class="notranslate">\; v</span>}}}{{\mathrm{<span\; class="notranslate">\; v</span>}}_{\mathrm{<span\; class="notranslate">\; 9</span>}}}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; 3.2</span>}<span\; class="notranslate">\; )</span>$

Put v ₈ , v ₉ , ${\mathrm{D.}}_{P_{\mathrm{plv}}}={\mathrm{D.}}_{\mathrm{bnfm}},$ Br _V ＝b _n and Fr _V ＝f _m (n=1, 2,, N; m=1, 2,, M) are substituted into formula (2.6), using the LST algorithm, to obtain v ₁₀ , v ₁₁ , v ₁₂ estimated value;

Using the method shown above, the values of the H.264 standard corresponding parameters v ₁ , v ₂ , ..., v ₁₁ , v ₁₂ are as follows: v ₁ =23.840, v ₂ =0.003, v ₃ =4.685, v ₄ =231.652, v ₅ =0.913, v ₆ =1.957, v ₇ =0.001, v ₈ =0.373, v ₉ =481.597, v ₁₀ =49.73, v ₁₁ =46.257, v ₁₂ =82.30.

As shown in FIG. 1 , it is a flowchart of an embodiment of the bandwidth allocation method of the present invention. In this embodiment, there are n different signals between the sender and the receiver (for example, two media gateways), and they are numbered i (i=1, 2, ..., n) to identify different communication links. Different numbers represent communication links of different priority signals between the sender and receiver, where the smaller the communication link number, the higher the priority, for example, the priority of communication link i is higher than that of communication link i+1 , the communication link i=1 has the highest priority.

Step 101, when it is detected that the network bandwidth decreases, according to the preset minimum bandwidth, adjust the bandwidth of the communication link used by each user communication terminal to the minimum bandwidth corresponding to each communication link; the state of the network It changes with time. For example, the most typical change is that the instantaneous bandwidth of the network fluctuates, such as a sudden drop or rise in bandwidth. Therefore, the Media Gateway Controller (MediaGateway Controller, hereinafter referred to as: MGC) according to the statistical information of each communication link , can monitor the bandwidth between the sender and the receiver, when it is detected that the change in the communication quality of each channel is caused by the reduction of the bandwidth between the sender and the receiver, for example, the bandwidth required by the user’s communication link has not decreased , but the bandwidth that can be provided between the sender and the receiver is small, which cannot meet the bandwidth requirements of the communication link, thus reducing the available bandwidth of the communication link and affecting the quality of the communication link. The bandwidth of the communication link used by the terminal is reduced to the minimum bandwidth;

Step 102, after the adjustment in step 101, determine whether the network condition has been improved, if so, then perform step 103 for the communication link with the highest priority, such as communication link 1; otherwise, perform step 110; wherein, determine the network condition Whether it has been improved can be. After adjustment, if the bandwidth that can be provided between the sender and the receiver increases, it can be considered that the network has been improved. The network status can be monitored through the network dynamic monitoring and reporting mechanism. There are two feasible methods: (1) Send a detection message, (2) According to the report information fed back by a certain reporting protocol such as RTCP (Real Time Control Protocol), use the set estimation model to determine;

Step 103. For a communication link, calculate the remaining bandwidth of the network; wherein, the remaining bandwidth of the network is the remaining available bandwidth of the network, that is, the total bandwidth of the network minus the used bandwidth, and the used bandwidth includes the bandwidth newly allocated to the link and the link has occupied the bandwidth for communication;

Step 104, judging whether the current bandwidth value of the targeted communication link reaches the initial bandwidth value, if so, execute step 108; otherwise, execute step 105;

In this step, if the bandwidth of the communication link has reached the initial value of the communication link bandwidth, it can be considered that the bandwidth increment required by the communication link is zero, that is, the communication link does not need to increase the bandwidth. Quantity allocation can directly execute step 108;

Step 105, according to the current value of the bandwidth of the communication link, the maximum value of the bandwidth and the subjective video quality, obtain the bandwidth increment required by the communication link; wherein, according to the packet loss of the communication link Rate, video frame rate and video encoding bit rate and other parameters to determine the subjective quality of the video;

In this step, if the bandwidth of the communication link has not reached the initial value of the communication link bandwidth, the bandwidth required for the communication link can be calculated through the optimization strategy expression first, and then according to the communication link The current bandwidth, determine the bandwidth increment;

Step 106, judging whether the required bandwidth increment of the communication link is less than or equal to the remaining bandwidth of the network, if so, then execute step 107; otherwise, end;

Step 107, allocating the required bandwidth increment to the targeted communication link; adjusting the bandwidth of the targeted communication link to be the sum of the original bandwidth and the bandwidth increment;

Step 108, judging whether the next communication link whose priority is lower than the targeted communication link exists; if it exists, then perform step 103 for the next communication link, for example, if the targeted communication link is i, Then its next communication link is the communication link i+1 lower than the i priority; if the next communication link does not exist, then execute step 109, for example, the communication link targeted is already the communication link n, i.e. The last communication link with the lowest priority;

Step 109. After the adjustment, it is judged whether the receiving rate of the receiving party is improved, for example, whether the receiving rate is improved, and if so, step 103 is executed for the communication link with the highest priority, such as communication link 1; otherwise, end ;

Step 110, allocate the bandwidth according to the price policy.

After the above steps, the MGC completes the reallocation of bandwidth resources. For the multi-channel video transmission link between the sender and the receiver, when the bandwidth between the sender and the receiver decreases, the above technical solution ensures that the multi-channel video The overall optimization of transmission bandwidth resource allocation ensures the optimization of multi-channel video QoS.

Further, in step 105, the bandwidth required for a communication link can be calculated by optimizing the strategy expression, wherein the optimization strategy expression can be:

${\mathrm{<span\; class="notranslate">\; B</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; =</span>{\mathrm{<span\; class="notranslate">\; B</span>}}_{\mathrm{<span\; class="notranslate">\; normal</span>}}<span\; class="notranslate">\; +</span><span\; class="notranslate">\; (</span>{\mathrm{<span\; class="notranslate">\; B</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}\mathrm{<span\; class="notranslate">\; max</span>}}<span\; class="notranslate">\; -</span>{\mathrm{<span\; class="notranslate">\; B</span>}}_{\mathrm{<span\; class="notranslate">\; normal</span>}}<span\; class="notranslate">\; )</span>\mathrm{<span\; class="notranslate">\; exp</span>}<span\; class="notranslate">\; (</span><span\; class="notranslate">\; -</span>\frac{{\mathrm{<span\; class="notranslate">\; V</span>}}_{\mathrm{<span\; class="notranslate">\; q</span>}}<span\; class="notranslate">\; -</span>\mathrm{<span\; class="notranslate">\; 1</span>}}{\mathrm{<span\; class="notranslate">\; the\; s</span>}}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; 2.7</span>}<span\; class="notranslate">\; )</span>$

Among them, B _i represents the bandwidth that MGC needs to re-allocate to communication link i, B _normal represents the current bandwidth of communication link i, B _imax represents the maximum bandwidth of communication link i, s represents a positive constant, and V _q represents the aforementioned For the defined subjective quality of video, refer to formula (2.1); since 1≤V _q ≤5, it can be known from formula (2.7), the smaller V _q is, the larger the bandwidth to be redistributed to communication link i is, when V _q =1 When , the bandwidth to be reallocated to communication link i is the maximum bandwidth of communication link i.

The MGC adopts the above optimization strategy expression to adjust the bandwidth, firstly, according to the current packet loss rate, delay and other parameters of the data signal reported by the receiver of the communication link i, as well as the video frame rate and video coding bit reported by the sender Rate and other parameters, calculate the subjective video quality, and further calculate the bandwidth that needs to be redistributed to the communication link i according to the maximum bandwidth and the current bandwidth value.

After the adjustment in step 101, the network condition between the sender and the receiver cannot be improved. In this case, the network operator cannot meet the QoS requirements of all user communication terminals at the same time. The price strategy for maximizing operating revenue to allocate bandwidth, including:

Step 1100, according to parameters such as packet loss rate, video frame rate and video encoding bit rate, establish a functional relationship between video subjective quality and communication link bandwidth;

Step 1101, according to the relational expression of video subjective quality and price function, establish the functional relational expression of communication service operating revenue and communication link bandwidth;

Step 1102, according to the functional relationship between the communication service operating income and the communication link bandwidth, obtain the bandwidth of the communication link when the communication service operating income is maximized.

In step 1100, the functional relationship between the subjective video quality and the bandwidth of the communication link can be established in the following way: use Cbit/s to represent the total bandwidth of the network, and use λ ₁ , λ ₂ ,..., λ _n to represent n The arrival rate of service flows with a priority level, the arrival rate of service flows satisfies the Poisson distribution, and ω _i C represents the bandwidth allocated to communication link i, where ω _i represents the bandwidth allocated to communication link i in the total bandwidth proportions, the constraints on these proportions are: ${\mathrm{\&Sigma;}}_{i=1}^{\mathrm{no}}{\mathrm{\&omega;}}_i=1,$ ω _i ≤ 1, ω _i ∈ (0, 1]; use V _qii to represent the subjective video quality of communication link i, from (2.1) ~ (2.7), put (2.2) into (2.1) to get The expression of V _qi is:

${\mathrm{<span\; class="notranslate">\; V</span>}}_{\mathrm{<span\; class="notranslate">\; qi</span>}}<span\; class="notranslate">\; =</span>\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; +</span>{\mathrm{<span\; class="notranslate">\; I</span>}}_{\mathrm{<span\; class="notranslate">\; Ofri</span>}}<span\; class="notranslate">\; \&CenterDot;</span>\mathrm{<span\; class="notranslate">\; exp</span>}<span\; class="notranslate">\; \{</span><span\; class="notranslate">\; -</span>\frac{{<span\; class="notranslate">\; [</span>\mathrm{<span\; class="notranslate">\; ln</span>}<span\; class="notranslate">\; (</span>{\mathrm{<span\; class="notranslate">\; Fr</span>}}_{\mathrm{<span\; class="notranslate">\; Vi</span>}}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; -</span>\mathrm{<span\; class="notranslate">\; ln</span>}<span\; class="notranslate">\; (</span>{\mathrm{<span\; class="notranslate">\; Ofr</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; ]</span>}^{\mathrm{<span\; class="notranslate">\; 2</span>}}}{\mathrm{<span\; class="notranslate">\; 2</span>}{\mathrm{<span\; class="notranslate">\; D.</span>}}_{{\mathrm{<span\; class="notranslate">\; Fr</span>}}_{\mathrm{<span\; class="notranslate">\; Vi</span>}}}^{\mathrm{<span\; class="notranslate">\; 2</span>}}}<span\; class="notranslate">\; \}</span><span\; class="notranslate">\; \&CenterDot;</span>\mathrm{<span\; class="notranslate">\; exp</span>}<span\; class="notranslate">\; (</span><span\; class="notranslate">\; -</span>\frac{{\mathrm{<span\; class="notranslate">\; P</span>}}_{\mathrm{<span\; class="notranslate">\; PlVi</span>}}}{{\mathrm{<span\; class="notranslate">\; D.</span>}}_{{\mathrm{<span\; class="notranslate">\; P</span>}}_{\mathrm{<span\; class="notranslate">\; plVi</span>}}}}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; 2.8</span>}<span\; class="notranslate">\; )</span>$

Among them, the subscript i in formula (2.8) represents the parameter corresponding to the communication link i; set the video frame rate Fr _Vi equal to the optimal frame rate Ofr _i under a specific video coding bit rate, and set (2.3)～(2.6) Substitute into (2.8) to get:

${\mathrm{<span\; class="notranslate">\; V</span>}}_{\mathrm{<span\; class="notranslate">\; qi</span>}}<span\; class="notranslate">\; =</span>\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; +</span><span\; class="notranslate">\; [</span>{\mathrm{<span\; class="notranslate">\; v</span>}}_{\mathrm{<span\; class="notranslate">\; 3</span>}}<span\; class="notranslate">\; -</span>\frac{{\mathrm{<span\; class="notranslate">\; <figure-callout\; id="3"\; label="v"\; filenames="A20081010599700281.png"\; state="\{\{state\}\}">v</figure-callout></span>}}_{\mathrm{<span\; class="notranslate">\; 3</span>}}}{\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; +</span>{<span\; class="notranslate">\; (</span>\frac{{\mathrm{<span\; class="notranslate">\; Br</span>}}_{\mathrm{<span\; class="notranslate">\; Vi</span>}}}{{\mathrm{<span\; class="notranslate">\; v</span>}}_{\mathrm{<span\; class="notranslate">\; 4</span>}}}<span\; class="notranslate">\; )</span>}^{{\mathrm{<span\; class="notranslate">\; v</span>}}_{\mathrm{<span\; class="notranslate">\; 5</span>}}}}<span\; class="notranslate">\; ]</span><span\; class="notranslate">\; \&CenterDot;</span>\mathrm{<span\; class="notranslate">\; exp</span>}<span\; class="notranslate">\; [</span><span\; class="notranslate">\; -</span>\frac{{\mathrm{<span\; class="notranslate">\; P</span>}}_{\mathrm{<span\; class="notranslate">\; PlVi</span>}}}{{\mathrm{<span\; class="notranslate">\; v</span>}}_{\mathrm{<span\; class="notranslate">\; 10</span>}}<span\; class="notranslate">\; +</span>{\mathrm{<span\; class="notranslate">\; v</span>}}_{\mathrm{<span\; class="notranslate">\; 11</span>}}<span\; class="notranslate">\; \&CenterDot;</span>\mathrm{<span\; class="notranslate">\; exp</span>}<span\; class="notranslate">\; (</span><span\; class="notranslate">\; -</span>\frac{{\mathrm{<span\; class="notranslate">\; v</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; +</span>{\mathrm{<span\; class="notranslate">\; <figure-callout\; id="2"\; label="v"\; filenames="A20081010599700281.png"\; state="\{\{state\}\}">v</figure-callout></span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}{\mathrm{<span\; class="notranslate">\; Br</span>}}_{\mathrm{<span\; class="notranslate">\; Vi</span>}}}{{\mathrm{<span\; class="notranslate">\; v</span>}}_{\mathrm{<span\; class="notranslate">\; 8</span>}}}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; +</span>{\mathrm{<span\; class="notranslate">\; v</span>}}_{\mathrm{<span\; class="notranslate">\; 12</span>}}<span\; class="notranslate">\; \&CenterDot;</span>\mathrm{<span\; class="notranslate">\; exp</span>}<span\; class="notranslate">\; (</span><span\; class="notranslate">\; -</span>\frac{{\mathrm{<span\; class="notranslate">\; Br</span>}}_{\mathrm{<span\; class="notranslate">\; Vi</span>}}}{{\mathrm{<span\; class="notranslate">\; v</span>}}_{\mathrm{<span\; class="notranslate">\; 9</span>}}}<span\; class="notranslate">\; )</span>}<span\; class="notranslate">\; ]</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; 2.9</span>}<span\; class="notranslate">\; )</span>$

Without considering the underlying transmission mode, Br _Vi can be regarded as the bandwidth of communication link i, namely:

Br _Vi = ω _i C (2.10)

Substituting formula (2.10) into formula (2.9) can get:

${\mathrm{<span\; class="notranslate">\; V</span>}}_{\mathrm{<span\; class="notranslate">\; qi</span>}}<span\; class="notranslate">\; =</span>\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; +</span><span\; class="notranslate">\; [</span>{\mathrm{<span\; class="notranslate">\; v</span>}}_{\mathrm{<span\; class="notranslate">\; 3</span>}}<span\; class="notranslate">\; -</span>\frac{{\mathrm{<span\; class="notranslate">\; <figure-callout\; id="3"\; label="v"\; filenames="A20081010599700281.png"\; state="\{\{state\}\}">v</figure-callout></span>}}_{\mathrm{<span\; class="notranslate">\; 3</span>}}}{\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; +</span>{<span\; class="notranslate">\; (</span>\frac{{\mathrm{<span\; class="notranslate">\; \&omega;</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}\mathrm{<span\; class="notranslate">\; C</span>}}{{\mathrm{<span\; class="notranslate">\; v</span>}}_{\mathrm{<span\; class="notranslate">\; 4</span>}}}<span\; class="notranslate">\; )</span>}^{{\mathrm{<span\; class="notranslate">\; v</span>}}_{\mathrm{<span\; class="notranslate">\; 5</span>}}}}<span\; class="notranslate">\; ]</span><span\; class="notranslate">\; \&Center\; Dot;</span>\mathrm{<span\; class="notranslate">\; exp</span>}<span\; class="notranslate">\; [</span><span\; class="notranslate">\; -</span>\frac{{\mathrm{<span\; class="notranslate">\; P</span>}}_{{\mathrm{<span\; class="notranslate">\; plV</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}}}{{\mathrm{<span\; class="notranslate">\; v</span>}}_{\mathrm{<span\; class="notranslate">\; 10</span>}}<span\; class="notranslate">\; +</span>{\mathrm{<span\; class="notranslate">\; v</span>}}_{\mathrm{<span\; class="notranslate">\; 11</span>}}<span\; class="notranslate">\; \&CenterDot;</span>\mathrm{<span\; class="notranslate">\; exp</span>}<span\; class="notranslate">\; (</span><span\; class="notranslate">\; -</span>\frac{{\mathrm{<span\; class="notranslate">\; v</span>}}_{\mathrm{<span\; class="notranslate">\; 1</span>}}<span\; class="notranslate">\; +</span>{\mathrm{<span\; class="notranslate">\; <figure-callout\; id="2"\; label="v"\; filenames="A20081010599700281.png"\; state="\{\{state\}\}">v</figure-callout></span>}}_{\mathrm{<span\; class="notranslate">\; 2</span>}}{\mathrm{<span\; class="notranslate">\; \&omega;</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}\mathrm{<span\; class="notranslate">\; C</span>}}{{\mathrm{<span\; class="notranslate">\; v</span>}}_{\mathrm{<span\; class="notranslate">\; 8</span>}}}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; +</span>{\mathrm{<span\; class="notranslate">\; v</span>}}_{\mathrm{<span\; class="notranslate">\; 12</span>}}<span\; class="notranslate">\; \&Center\; Dot;</span>\mathrm{<span\; class="notranslate">\; exp</span>}<span\; class="notranslate">\; (</span><span\; class="notranslate">\; -</span>\frac{{\mathrm{<span\; class="notranslate">\; \&omega;</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}\mathrm{<span\; class="notranslate">\; C</span>}}{{\mathrm{<span\; class="notranslate">\; v</span>}}_{\mathrm{<span\; class="notranslate">\; 9</span>}}}<span\; class="notranslate">\; )</span>}<span\; class="notranslate">\; ]</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; 2.11</span>}<span\; class="notranslate">\; )</span>$

Thus, the functional relationship between the subjective quality of video and the bandwidth of the communication link is established.

In this embodiment, the linear price function expression is adopted, and the subjective video quality is used as the service performance parameter to obtain the bandwidth under the premise of maximizing the operating income of the communication service. Assuming that r _i (V _qi ) is used to represent the price function, the relationship between the video subjective quality and the price function can be:

r _i (V _qi ) = _bi -k _i /V _qi (2.12)

Where _bi and _ki are parameters of the price function, _bi >0, ki _> 0. Usually, if the priority of communication link i is higher than that of communication link j, then b _i > b _j , ki _> k _j , under this price strategy, users with higher priority will pay higher fees, At the same time, when the network operator cannot meet the QoS requirements of users with higher priority, it will pay higher compensation.

Among them, the communication service operating income is measured by the communication service operating income per unit time, and REV is used to represent the communication service operating income obtained by the network operator, then the relationship between the communication service operating income and the price function can be expressed as:

$\mathrm{<span\; class="notranslate">\; REV</span>}<span\; class="notranslate">\; =</span>\underset{\mathrm{<span\; class="notranslate">\; i</span>}<span\; class="notranslate">\; =</span>\mathrm{<span\; class="notranslate">\; 1</span>}}{\overset{\mathrm{<span\; class="notranslate">\; no</span>}}{\mathrm{<span\; class="notranslate">\; \&Sigma;</span>}}}{\mathrm{<span\; class="notranslate">\; \&lambda;</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}{\mathrm{<span\; class="notranslate">\; r</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; (</span>{\mathrm{<span\; class="notranslate">\; V</span>}}_{\mathrm{<span\; class="notranslate">\; qi</span>}}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; 2.13</span>}<span\; class="notranslate">\; )</span>$

Substituting Equation (2.11) into Equation (2.12) to obtain the functional relationship between the price function and communication link bandwidth, and then substituting the functional relationship between the price function and communication link bandwidth into Equation (2.13), the communication service operator can be established Revenue as a function of communication link bandwidth.

Using formula (2.13), the optimal solution equation is obtained as:

$\mathrm{<span\; class="notranslate">\; max</span>}\mathrm{<span\; class="notranslate">\; REV</span>}<span\; class="notranslate">\; =</span>\mathrm{<span\; class="notranslate">\; max</span>}\underset{\mathrm{<span\; class="notranslate">\; i</span>}<span\; class="notranslate">\; =</span>\mathrm{<span\; class="notranslate">\; 1</span>}}{\overset{\mathrm{<span\; class="notranslate">\; no</span>}}{\mathrm{<span\; class="notranslate">\; \&Sigma;</span>}}}{\mathrm{<span\; class="notranslate">\; \&lambda;</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}{\mathrm{<span\; class="notranslate">\; r</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; (</span>{\mathrm{<span\; class="notranslate">\; V</span>}}_{\mathrm{<span\; class="notranslate">\; qi</span>}}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; 2.14</span>}<span\; class="notranslate">\; )</span>$

Which satisfies on the optimal point:

${\mathrm{<span\; class="notranslate">\; \&Sigma;</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}<span\; class="notranslate">\; =</span>\mathrm{<span\; class="notranslate">\; 1</span>}}^{\mathrm{<span\; class="notranslate">\; no</span>}}{\mathrm{<span\; class="notranslate">\; \&omega;</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; =</span>\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; \&omega;</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; \&le;</span>\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; ,</span>{\mathrm{<span\; class="notranslate">\; \&omega;</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; \&Element;</span><span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; 0,1</span>}<span\; class="notranslate">\; ]</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; 2.15</span>}<span\; class="notranslate">\; )</span>$

Using the optimization algorithm based on Lagrangian multipliers, according to formulas (2.14) and (2.15), the Lagrangian equation is constructed as follows:

$\mathrm{<span\; class="notranslate">\; p</span>}<span\; class="notranslate">\; =</span>\underset{\mathrm{<span\; class="notranslate">\; i</span>}<span\; class="notranslate">\; =</span>\mathrm{<span\; class="notranslate">\; 1</span>}}{\overset{\mathrm{<span\; class="notranslate">\; no</span>}}{\mathrm{<span\; class="notranslate">\; \&Sigma;</span>}}}{\mathrm{<span\; class="notranslate">\; \&lambda;</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}{\mathrm{<span\; class="notranslate">\; r</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; (</span>{\mathrm{<span\; class="notranslate">\; V</span>}}_{\mathrm{<span\; class="notranslate">\; qi</span>}}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; +</span>\mathrm{<span\; class="notranslate">\; \&sigma;</span>}<span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; 1</span>}<span\; class="notranslate">\; -</span>\underset{\mathrm{<span\; class="notranslate">\; i</span>}<span\; class="notranslate">\; =</span>\mathrm{<span\; class="notranslate">\; 1</span>}}{\overset{\mathrm{<span\; class="notranslate">\; no</span>}}{\mathrm{<span\; class="notranslate">\; \&Sigma;</span>}}}{\mathrm{<span\; class="notranslate">\; \&omega;</span>}}_{\mathrm{<span\; class="notranslate">\; i</span>}}<span\; class="notranslate">\; )</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; -</span><span\; class="notranslate">\; (</span>\mathrm{<span\; class="notranslate">\; 2.16</span>}<span\; class="notranslate">\; )</span>$

并使p等于0，计算得到ω_i和通信服务运营收益。当式(2.16)的二阶偏导数在(0，1)内严格大于0或严格小于0时，ω_i在(0，1)内有唯一的最优解。因为ω_i确定了在各个通信链路之间分配带宽的比例，所以根据确定的最优解可以进行带宽分配，进而设置通信链路的带宽，完成带宽分配。In equation (2.16), for each ω _i , take the partial differential of p

And make p equal to 0, calculate ω _i and communication service operating income. When the second-order partial derivative of formula (2.16) is strictly greater than 0 or strictly smaller than 0 in (0, 1), ω _i has a unique optimal solution in (0, 1). Because ω _i determines the proportion of bandwidth allocated among the various communication links, the bandwidth allocation can be performed according to the determined optimal solution, and then the bandwidth of the communication link is set to complete the bandwidth allocation.

In addition to the above-mentioned bandwidth allocation scheme when network bandwidth resources are monitored to decrease, other embodiments may also include a bandwidth allocation scheme when a user communication terminal accesses, as shown in FIG. The flow chart of terminal access includes the following steps:

Step 201, when a new user communication terminal requests to access the network, receive the access request of the user communication terminal;

Step 202, according to the priority of the user communication terminal, query the stored access control table to obtain the minimum bandwidth, maximum bandwidth and initial bandwidth value that need to be allocated to the user communication terminal;

Step 203: Determine whether to accept the access request of the user communication terminal according to the network bandwidth resources; when the remaining bandwidth of the network cannot meet the bandwidth requirements of the user communication terminal, reject the access request, and allow the access request when it can be satisfied, specifically In other words, when the remaining bandwidth of the network is greater than or equal to the initial value of the bandwidth that needs to be allocated to the user communication terminal, the access request is allowed.

For user communication terminals with different priorities, different bandwidth resources are required. Therefore, an access control table is pre-stored in the MGC, and the MGC performs access control according to the access control table. The above step 202 includes:

Step 2021, according to the access request, query the priority of the user communication terminal through the application layer;

Step 2022, from the access control table, obtain the QoS parameters corresponding to the network layer according to the priority of the user communication terminal, and obtain the transmission layer parameters according to the QoS parameters;

Step 2023, according to the transport layer parameters, obtain the minimum bandwidth, maximum bandwidth and initial bandwidth that need to be allocated to the user communication terminal.

The access control table pre-saved in the above MGC includes the mapping table of user communication terminal priority and network layer QoS parameters (as shown in Table 5), the mapping table of network layer parameters and transport layer parameters (as shown in Table 6), and the transmission Layer parameter and bandwidth value mapping table (as shown in Table 7).

Table 5. Mapping table between communication terminal priority and network layer QoS parameters

Table 6. Mapping table of network layer parameters and transport layer parameters

Table 7. Mapping table of transport layer parameters and bandwidth values

For example, after receiving an access request from a user communication terminal, the MGC first queries the priority of the user communication terminal through the application layer, which stores the priority information of the user communication terminal; according to the priority of the user communication terminal, the query table 5 Obtain the network layer QoS parameter (L _n D _n C _n ) corresponding to the priority of the user communication terminal; According to the network layer parameter, the query table 6 obtains the corresponding transport layer parameter (CO _n ); according to the transport layer parameter, the query table 7 Obtain the minimum bandwidth (B _nmin ), maximum bandwidth (B _nmax ) and initial bandwidth value (B _ninit ) allocated to the user communication terminal, where the minimum bandwidth (B _nmin ) and maximum bandwidth of the user communication terminal The value (B _nmax ) and the bandwidth initial value (B _ninit ) may be configured and set according to user information such as user level.

In this embodiment, the bandwidth allocation scheme when the user communication terminal accesses uses the MGC to control the media gateway (Media Gateway, MG), and assigns the minimum bandwidth value, the maximum bandwidth value, and the initial bandwidth value required by the user communication terminal to the MG, so as to facilitate The MG implements the allocation policy of the MGC to realize the bandwidth allocation of the MG.

During the communication process after the user communication terminal accesses the network, the MGC monitors the communication quality of the user communication terminal. When the packet rate is high and the receiving rate of the service flow on the communication link does not drop, the MGC judges that the decrease in QoS is not caused by insufficient bandwidth, and then allocates bandwidth using a policy that guarantees the quality of service of a single channel. Specifically, the MGC may require the sender to use a forward error correction (Forward Error Correction, hereinafter referred to as: FEC) protection algorithm for the communication link to improve the user's video quality. Since the bandwidth allocated by the sender to each communication link is certain, using the FEC protection algorithm will result in a decrease in the video encoding bit rate, that is, the following relationship exists:

Bandwidth allocated to each video channel = video encoding bit rate + FEC protection redundant bit rate

To sum up, in this embodiment, when a user communication terminal accesses the network, the MGC is used to control the MG, and the MG is assigned the minimum bandwidth, maximum bandwidth, and initial bandwidth required by the user communication terminal, so as to facilitate the self-adaptation of the MG. Bandwidth allocation: In order to ensure the QoS of user communication terminals and ensure the overall optimization of network bandwidth resource allocation, after user communication terminals access the network, MGC also monitors the communication quality of user communication terminals. Changes, especially when it is detected that the receiver’s receiving rate drops due to insufficient network bandwidth resources, a solution to ensure the overall optimal allocation of bandwidth resources is provided, that is, firstly, the bandwidth occupied by each communication link is reduced to that of the user’s communication terminal. The minimum value of the bandwidth is required, and then the current value of the bandwidth of the communication link is gradually changed through a certain strategy to ensure the effective use of bandwidth resources and provide stable services for the user communication terminal, thereby ensuring the service quality of the user communication terminal; further, this The embodiment takes the subjective quality of video as the service performance parameter, considers the impact of parameters such as packet loss rate, video frame rate, and video encoding bit rate, and can comprehensively reflect the service quality of real-time video communication; in addition, when the MGC judges that the reduction of QoS is not If it is caused by insufficient bandwidth, the strategy of guaranteeing the quality of service of a single channel is used to allocate bandwidth. The bandwidth allocation method of this embodiment is widely applied to the situation of guaranteeing the QoS of video communication in various packet network environments.

As shown in Figure 3, it is a schematic diagram of an embodiment of the bandwidth allocation device of the present invention, which specifically includes: a monitoring module 1 for monitoring network bandwidth resources and determining the current network bandwidth resource status; a minimum value setting module 2 for obtaining the monitoring module 1 The current network bandwidth resource status, when the network bandwidth resource decreases, according to the preset minimum bandwidth, the bandwidth of each communication link is adjusted to the corresponding minimum bandwidth of each communication link; the first acquisition module 3 is used for Obtain the current network bandwidth resource status of the monitoring module 1, and when the network bandwidth resource adjusted by the minimum value setting module 2 increases, obtain the requirements of each communication link according to the current bandwidth value, the maximum bandwidth and the subjective quality of the video of each communication link. bandwidth increment; the first allocation module 4 is used to allocate the remaining bandwidth of the network to each communication link in sequence according to the order of priority of each communication link from high to low according to the bandwidth increment of the first acquisition module 3 .

Wherein the first acquisition module 3 may include: a judging unit 31, used to judge whether the current bandwidth value of the communication link reaches the initial bandwidth value; an increment unit 32, used for according to the result of the judging unit 31, if the communication link The current value of the bandwidth does not reach the initial value of the bandwidth, and according to the current value of the bandwidth of the communication link, the maximum value of the bandwidth, and the subjective quality of the video, the bandwidth increment required by the communication link that does not reach the initial value of the bandwidth is obtained.

This embodiment can also include: a second acquisition module 5, used to acquire the current network bandwidth resource status of the monitoring module 1, and when the network bandwidth resource adjusted by the minimum value setting module 2 is not improved, according to the price strategy, according to the packet loss rate , video frame rate, video encoding bit rate and price function, determine the bandwidth of the communication link when the communication service operating income is maximized; the second allocation module 6 is used to determine the maximum communication service operating income according to the second acquisition module 5 Bandwidth allocation is carried out according to the bandwidth of the communication link at the same time.

This embodiment may also include: a receiving module 7, configured to receive an access request from a user communication terminal; a parameter acquisition module 8, configured to query the saved access control table according to the priority of the user communication terminal requesting access to obtain the minimum bandwidth value, maximum bandwidth value and initial bandwidth value of the user communication terminal; the access module 9 is configured to determine whether to accept the An access request from a user communication terminal.

The parameter acquisition module 8 may include: an application layer acquisition unit 81, configured to query the priority of the user communication terminal through the application layer according to the access request; a network layer acquisition unit 82, configured to query the priority of the user communication terminal according to the access request Acquire the quality of service parameters of the corresponding network layer; the transport layer acquisition unit 83 is used to acquire the transport layer parameters according to the service quality parameters; the bandwidth acquisition unit 84 is used to acquire the parameters that need to be allocated to the The minimum bandwidth, maximum bandwidth and initial bandwidth of the user communication terminal.

To sum up, in this embodiment, when the user communication terminal accesses the network, the parameter acquisition module 8 is used to assign the required minimum bandwidth, maximum bandwidth and initial bandwidth value to the user communication terminal, so as to facilitate the realization of adaptive bandwidth of the MG. allocation; in order to ensure the QoS of user communication terminals and ensure the overall optimization of the allocation of network bandwidth resources, after the user communication terminal accesses the network, the communication quality of the user communication terminal must be monitored. When changes in network conditions are detected, especially When it is detected that the receiving rate of the receiving party drops due to insufficient network bandwidth resources, the first acquisition module 3 and the first distribution module 4 can ensure the optimization of the overall allocation of bandwidth resources, ensure the effective use of bandwidth resources, and serve the user communication terminal Provide stable service, thereby guaranteeing the service quality of user communication terminal; Further, this embodiment takes video subjective quality as service performance parameter, has considered the impact of parameters such as packet loss rate, video frame rate and video encoding bit rate, can synthesize Reflect the quality of real-time video communication service. The device for allocating bandwidth in this embodiment is widely used in situations of guaranteeing QoS of video communication in various packet network environments.

As shown in Figure 4, it is a structural diagram of an embodiment of the bandwidth allocation system of the present invention, the system includes: the media gateway MG41 of the sending party, the media gateway MG42 of the receiving party, and the media gateway controller MGC43, wherein the MGC43 may include: a monitoring module 431, used To monitor the network bandwidth resource between the sender MG and the receiver MG, determine the current network bandwidth resource status; the minimum value setting module 432 is used to obtain the current network bandwidth resource status of the monitoring module 431, when the network bandwidth resource decreases, according to The preset bandwidth minimum value adjusts the bandwidth of each communication link between the sender MG41 and the receiver MG42 to the bandwidth minimum value corresponding to each communication link; the first acquisition module 433 is used to acquire the bandwidth of the monitoring module 431 Current network bandwidth resource status, when the network bandwidth resource adjusted by the minimum value setting module 432 increases, according to the bandwidth current value, maximum bandwidth and video subjective quality of each communication link, obtain the bandwidth increment required by each communication link; The first allocation module 434 is configured to sequentially allocate the remaining bandwidth of the network to each communication link in descending order of the priority of each communication link according to the bandwidth increment of the first acquisition module 433 .

The MGC in this embodiment may be any bandwidth allocation device described in the bandwidth allocation device in the embodiment of the present invention.

In this embodiment, when the monitoring module detects that the network bandwidth resource decreases, firstly adjust the bandwidth of each communication link to the minimum bandwidth value corresponding to each communication link, and then according to the bandwidth resources that can be provided, according to The priority of each communication link is from high to low, and the remaining bandwidth of the network is allocated to each communication link in turn, so as to ensure the optimization of the overall allocation of bandwidth resources, thereby ensuring the quality of network service.

Those of ordinary skill in the art can understand that all or part of the steps for realizing the above-mentioned method embodiments can be completed by hardware related to program instructions, and the aforementioned program can be stored in a computer-readable storage medium. When the program is executed, the The steps of the above-mentioned method embodiments are included, and the aforementioned storage medium includes: ROM, RAM, magnetic disk or optical disk, and other various media that can store program codes.

Finally, it should be noted that: the above embodiments are only used to illustrate the technical solutions of the embodiments of the present invention, not to limit them; although the embodiments of the present invention have been described in detail with reference to the foregoing embodiments, those of ordinary skill in the art should understand : It is still possible to modify the technical solutions described in the foregoing embodiments, or perform equivalent replacements to some of the technical features; and these modifications or replacements do not make the essence of the corresponding technical solutions deviate from the technical aspects of the embodiments of the present invention. The spirit and scope of the programme.

Claims (14)

1. A bandwidth allocation method, characterized in that it comprises: When it is detected that the network bandwidth resources decrease, according to the preset minimum bandwidth value, the bandwidth of each communication link is adjusted to the minimum bandwidth value corresponding to each communication link; If the adjusted network bandwidth resource is increased, the bandwidth increment required by each communication link is obtained according to the maximum bandwidth of each communication link and the subjective video quality; According to the bandwidth increment, the remaining bandwidth of the network is allocated to each communication link in sequence in descending order of the priority of each communication link. 2. The bandwidth allocation method according to claim 1, wherein said obtaining the bandwidth increment required by each communication link according to the maximum bandwidth of each communication link and the subjective video quality comprises: Judging whether the current bandwidth value of each communication link is less than its corresponding initial bandwidth value, if so, according to the current bandwidth value of the communication link, the maximum bandwidth value and the subjective video quality, obtain the bandwidth increase required by the communication link. quantity. 3. The bandwidth allocation method according to claim 2, further comprising: determining the subjective video quality of the communication link according to the packet loss rate, video frame rate and video encoding bit rate of the communication link. 4. The bandwidth allocation method according to claim 1, further comprising: if the network bandwidth resources are not increased after adjustment, allocating the bandwidth according to the price policy. 5. The bandwidth allocation method according to claim 4, wherein the allocation of bandwidth according to the price strategy comprises: According to the packet loss rate, video frame rate, video encoding bit rate and price function, establish a functional relationship between communication service operating income and communication link bandwidth; According to the optimization algorithm, the bandwidth of the communication link is determined when the operating income of the communication service is maximized. 6. The bandwidth allocation method according to any one of claims 1-5, further comprising: receiving an access request from a user communication terminal; According to the priority of the user communication terminal, query the stored access control table to obtain the minimum bandwidth value, maximum bandwidth value and initial bandwidth value that need to be allocated to the user communication terminal; Determine whether to accept the access request of the user communication terminal according to network bandwidth resources. 7. The bandwidth allocation method according to claim 6, characterized in that, according to the priority of the user communication terminal, the stored access control table is queried to obtain the minimum bandwidth value and the bandwidth required to be allocated to the user communication terminal. Maximum and initial bandwidth values include: Querying the priority of the user communication terminal through the application layer according to the access request; Querying the stored access control table according to the priority of the user communication terminal, obtaining a corresponding network layer quality of service parameter, and obtaining a transport layer parameter according to the service quality parameter; Querying the stored access control table according to the transport layer parameters to obtain the minimum bandwidth, maximum bandwidth and initial bandwidth that need to be allocated to the user communication terminal. 8. The bandwidth allocation method according to any one of claims 1-5, further comprising: when it is detected that the user communication terminal has a higher priority, or the packet loss rate of the communication link used by the user communication terminal When the receiving rate of the service flow on the communication link is relatively high, and the receiving rate of the service flow on the communication link does not decrease, the forward error correction protection algorithm is used for data protection. 9. A bandwidth allocation device, characterized in that it comprises: The monitoring module is used to monitor network bandwidth resources and determine the current status of network bandwidth resources; The minimum value setting module is used to obtain the current network bandwidth resource status of the monitoring module. When the network bandwidth resource decreases, adjust the bandwidth of each communication link to the bandwidth corresponding to each communication link according to the preset bandwidth minimum value. bandwidth minimum; The first obtaining module is used to obtain the current network bandwidth resource status of the monitoring module. When the network bandwidth resource adjusted by the minimum value setting module increases, according to the current bandwidth value of each communication link, the maximum bandwidth value and the subjective video quality, obtain bandwidth increment required for each communication link; The first allocation module is configured to sequentially allocate the remaining bandwidth of the network to each communication link in descending order of the priority of each communication link according to the bandwidth increment of the first acquisition module. 10. The bandwidth allocation device according to claim 9, wherein the first obtaining module comprises: A judging unit, configured to judge whether the current value of the bandwidth of the communication link reaches the initial value of the bandwidth; Increment unit, for according to the result of the judging unit, if the current bandwidth value of the communication link does not reach the initial bandwidth value, according to the current bandwidth value of the communication link, the maximum bandwidth value and the subjective video quality, acquire the The value of the bandwidth increment required for the communication link. 11. The bandwidth allocation device according to claim 9, further comprising: The second acquisition module is used to obtain the current network bandwidth resource status of the monitoring module. When the network bandwidth resource adjusted by the minimum value setting module is not improved, according to the price strategy, according to the packet loss rate, video frame rate, video encoding bit rate and The price function, which determines the bandwidth of the communication link when the operating income of the communication service is maximized; The second allocating module is configured to allocate bandwidth according to the bandwidth of the communication link determined by the second acquiring module when the communication service operation revenue is maximized. 12. The bandwidth allocation device according to any one of claims 9-11, further comprising: A receiving module, configured to receive an access request from a user communication terminal; A parameter acquisition module, configured to query the saved access control table according to the priority of the user communication terminal requesting access, and obtain the minimum bandwidth value, maximum bandwidth value and initial bandwidth value of the user communication terminal; An access module, configured to determine whether to accept the access request of the user communication terminal according to the minimum bandwidth value, maximum bandwidth value, initial bandwidth value and network bandwidth resources. 13. The bandwidth allocation device according to claim 12, wherein the parameter acquisition module comprises: An application layer acquisition unit, configured to query the priority of the user communication terminal through the application layer according to the access request; A network layer acquisition unit, configured to acquire a corresponding network layer quality of service parameter according to the priority of the user communication terminal; a transport layer acquisition unit, configured to acquire transport layer parameters according to the quality of service parameters; The bandwidth acquiring unit is configured to acquire the minimum bandwidth, maximum bandwidth and initial bandwidth that need to be allocated to the user communication terminal according to the transport layer parameters. 14. A bandwidth allocation system, characterized by comprising: a sending media gateway, a receiving media gateway, and a media gateway controller; the media gateway controller includes: A monitoring module, configured to monitor the network bandwidth resource between the media gateway of the sending party and the media gateway of the receiving party, and determine the current status of the network bandwidth resource; The minimum value setting module is used to obtain the current network bandwidth resource status of the monitoring module. When the network bandwidth resource decreases, adjust the bandwidth of each communication link to the bandwidth corresponding to each communication link according to the preset bandwidth minimum value. bandwidth minimum; The first obtaining module is used to obtain the current network bandwidth resource status of the monitoring module. When the network bandwidth resource adjusted by the minimum value setting module increases, according to the current bandwidth value of each communication link, the maximum bandwidth value and the subjective video quality, obtain bandwidth increment required for each communication link; The first allocation module is configured to sequentially allocate the remaining bandwidth of the network to each communication link in descending order of the priority of each communication link according to the bandwidth increment of the first acquisition module.

Images