CN108881045A - A kind of jamming control method ensured in heterogeneous network based on QoS - Google Patents
A kind of jamming control method ensured in heterogeneous network based on QoS Download PDFInfo
- Publication number
- CN108881045A CN108881045A CN201810564786.8A CN201810564786A CN108881045A CN 108881045 A CN108881045 A CN 108881045A CN 201810564786 A CN201810564786 A CN 201810564786A CN 108881045 A CN108881045 A CN 108881045A
- Authority
- CN
- China
- Prior art keywords
- network
- bandwidth
- wireless
- rate
- business
- 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
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/12—Avoiding congestion; Recovering from congestion
-
- 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/24—Traffic characterised by specific attributes, e.g. priority or QoS
-
- 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/27—Evaluation or update of window size, e.g. using information derived from acknowledged [ACK] packets
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/50—Queue scheduling
- H04L47/62—Queue scheduling characterised by scheduling criteria
- H04L47/625—Queue scheduling characterised by scheduling criteria for service slots or service orders
- H04L47/6275—Queue scheduling characterised by scheduling criteria for service slots or service orders based on priority
-
- 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
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
- H04L47/82—Miscellaneous aspects
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
A kind of jamming control method ensured in heterogeneous network based on QoS, heterogeneous network includes the cable network and wireless network communicated to connect by bottleneck link, wherein cable network accesses several source nodes, and wireless network accesses several destination nodes, and control method includes the following steps：S1, building heterogeneous network simultaneously determine network state；S2, network parameter is calculated according to network state, network parameter includes wireless bandwidth and service rate；S3, dynamic interconnection model is established according to network parameter, dynamic interconnection model includes three network bandwidth, congestion window and queue length parameters, and three parameters influence each other, and network bandwidth and wireless bandwidth are positively correlated, and congestion window and service rate are positively correlated；S4, start network transmission and monitoring network state and network parameter；S5, S2 is returned to if network state changes, if network parameter, which changes, returns to S3.The present invention has higher network performance and service quality.
Description
Technical field
The present invention relates to web impact factor technical field, ensured in specifically a kind of heterogeneous network based on QoS
Jamming control method.
Background technique
QoS (Quality of Service, service quality) refers to that a network can be specified using various basic technologies
Network communication better service ability is provided, be a kind of security mechanism of network, be for solving network delay and obstruction etc.
A kind of technology of problem.The service quality of network be considered as web application to user offer service complexity with
Its uniformity.In the internet, its fundamental characteristics is to provide to have (best effort) matter as possible between appointed two o'clock
The transmission service of amount, network transfer data to destination, and service has connectivity.Therefore, network performance is influenced in network
Relevant parameter is all the key factor of service quality, for example, packet loss, handling capacity, time delay etc..
It is well known that Transmission Control Protocol is designed in cable network, with the gradually development of network technology, isomery
Network becomes the most common network gradually, and Transmission Control Protocol structure is complicated and changeable heterogeneous network in cash it is poor.Because
Under cable network environment, link is more stable, without factors such as wireless competition conflicts.But in heterogeneous network environment, nothing
Line part is simultaneously unstable, can generate packet loss because of environment or link privacy at any time, cause the decline of network throughput, cause
Transmission Control Protocol is had no idea good adaptation.
In conventional TCP protocols, congestion control is mainly carried out using TCP Reno agreement, but in TCP Reno agreement
There are many fixed values, can not lead to the continuous variation congestion control with network according to dynamic change the case where network change
Ability decline.For example, usually set certain initial value for congestion window at network operation initial stage in TCP Reno agreement, originally this
The purpose done is to allow the exploratory growth of network to cause network bandwidth in order to avoid growth is too fast to lead to network generation congestion
It wastes significantly.But if excessively high initial value will lead to network congestion window again, growth is too fast, can enter congestion control rank in advance
Section, or even periods of network disruption occurs, so usually initial value design is a message field (MFLD).In another example the thresholding in congestion control procedure
Value, separation of the threshold value as slow start stage and congestion avoidance phase, if threshold value cannot be designed according to network dynamic,
It will cause the waste of bandwidth and resource.Specifically, if when network condition is poor threshold value be arranged it is excessively high, will cause
Slow start-up time is too long, increases the burden of network, be easy to cause congestion and collapse phenomenon occurs, if preferable in network environment
In the case where threshold value be arranged it is too low, network can be allowed to enter congestion avoidance phase in advance, network bandwidth utilization factor is caused to decline,
Cause the raising of throughput degradation and packet loss.
In order to solve the defect of TCP Reno agreement reply dynamic change scarce capacity, also it has been born in the prior art very much
Dynamic jamming control method, such as natural heuristic algorithm, by by network analog at natural ecology model by nature
Dynamic Evolution is brought into network, to preferably adapt to network change.But this method also has certain deficiency, main body
It arrives now to the assessment of the intrinsic bearing capacity of network inaccuracy and to the otherness between business is inconsiderate, leads to actual performance
It is promoted limited.
Summary of the invention
In order to solve deficiency in the prior art, the present invention provides the congestion control ensured in a kind of heterogeneous network based on QoS
Method processed has higher network performance and service quality.
To achieve the goals above, the concrete scheme that the present invention uses for：It being gathered around in a kind of heterogeneous network based on what QoS was ensured
Control method is filled in, the heterogeneous network includes the cable network and wireless network communicated to connect by bottleneck link, wherein wired
Several source node Ss of network insertioni, wireless network accesses several destination nodes Di, the control method includes the following steps：
S1, the building heterogeneous network simultaneously determine network state；
S2, network parameter is calculated according to network state, network parameter includes wireless bandwidth and service rate；
S3, dynamic interconnection model is established according to network parameter, dynamic interconnection model includes that network bandwidth, congestion window and queue are long
Three parameters are spent, three parameters influence each other, and network bandwidth and the wireless bandwidth are positively correlated, congestion window and business speed
Rate is positively correlated；
S4, start network transmission and monitoring network state and network parameter；
S5, S2 is returned to if network state changes, if network parameter, which changes, returns to S3.
In S3, the dynamic interconnection model is embodied as：
It is C network bandwidth, W in formulaiIt is congestion window, Q is queue length, and α is the natural growth of C, and β is C by WiAfter influence
Negative growth rate, χiIt is WiNatural growth, δ is WiGrowth rate after being influenced by C, ε are WiNegative growth rate after being influenced by Q,
φiIt is WiGrowth rate after being influenced by Q, and γ is the natural negative growth rate of Q, CWIt is the amount of bandwidth of bottleneck link, CWIt is network
Total bandwidth, P(i)It is scale coefficient, wherein BW is bandwidth, and σ is a positive smoothing factor.
BW=min (BWwireless,BWwired), wherein BWwirelessIt is wireless bandwidth, BWwiredIt is wired bandwidth；
P (i) indicates that the service rate of Business Stream i accounts for the scale coefficient of TCP flow, and T (i) indicates Business Stream i
Service rate.
The specific calculation method of wireless bandwidth is：
pcol=1- (1-ptr)N-1；
Wherein L indicates the payload length of each Successful transmissions, wherein ptrFor node-node transmission probability, pcolFor collision probability, pidleTable
Show idle time of channel, and pidle=1-ptr-pcol, Ttr、TcolAnd TidleChannel is respectively indicated to be used for transmission, conflict and empty
Time shared by spare time, W be initial contention window size, 2mW is node maximum contention window size, and N is radio node number.
The calculation method of service rate includes the following steps：
T1, all business are divided into two class of high priority and low priority；
T2, T (i)=TGBR(i)+TNGBR(i), i=1,2 ..., k；
T in formulaGBR(i) it is to ensure bit rate, ensures that bit rate corresponds to the business of high priority, TNGBRIt (i) is non-guarantee bit
Rate, the non-business for ensureing bit rate and corresponding to low priority.
Beneficial effect：The present invention can be adjusted in real time by building dynamic interconnection model according to current network state, thus
The adaptivity of network is improved, and improves network performance.The present invention introduces on the basis of accurately calculating network bandwidth simultaneously
Service rate and type of service two parameters finally mention so as to carry out congestion control according to the actual conditions of business
High QoS.
Detailed description of the invention
Fig. 1 is the topological diagram of heterogeneous network of the present invention；
Fig. 2 is flow chart of the invention；
Throughput performance comparing result figure when Fig. 3 is concept transfer quantity in emulation experiment；
Packet loss performance comparison result figure when Fig. 4 is concept transfer quantity in emulation experiment；
Service with different priority levels throughput performance comparing result figure when Fig. 5 is stationary nodes quantity in emulation experiment；
Service with different priority levels packet loss performance comparison result figure when Fig. 6 is stationary nodes quantity in emulation experiment.
Specific embodiment
Following will be combined with the drawings in the embodiments of the present invention, and technical solution in the embodiment of the present invention carries out clear, complete
Site preparation description, it is clear that described embodiments are only a part of the embodiments of the present invention, instead of all the embodiments.It is based on
Embodiment in the present invention, it is obtained by those of ordinary skill in the art without making creative efforts every other
Embodiment shall fall within the protection scope of the present invention.
Please refer to Fig. 1 and 2, the jamming control method ensured in a kind of heterogeneous network based on QoS, including S1 to S5.
S1, building heterogeneous network simultaneously determine network state.Heterogeneous network includes cable network and wireless network, wherein wired
Network includes router and several source node Ss for being connect by wired mode with router communicationi, wireless network includes WLAN
Equipment and wirelessly several destination nodes D with wlan device communication connectioni, lead between router and wlan device
Cross bottleneck link communication connection.Network state can be connection status.
S2, network parameter is calculated according to network state, network parameter includes wireless bandwidth and service rate.
S3, dynamic interconnection model is established according to network parameter, dynamic interconnection model includes network bandwidth, congestion window and team
Three parameters of column length, three parameters influence each other, and specific influence mode is：The size constraint network bandwidth of congestion window
Size, the size of the size constraint congestion window of queue length.In these three parameters, existing jamming control method is to network
What the calculating of bandwidth was usually directly carried out using the bandwidth of cable network, but because cable network is usually more stable,
And the fluctuation situation of wireless network is relatively more, this results in the network bandwidth calculated in the prior art and actually available bandwidth phase
Difference is more, influences network performance.Therefore network bandwidth and wireless bandwidth are positively correlated in the present invention, emphasize the weight of wireless network bandwidth
The property wanted, so as to obtain accurate network bandwidth.Meanwhile congestion window and service rate are positively correlated, because of different business
Demand of the rate to congestion window size is also different, and adjusts congestion window according to customer service rate, can effectively be mentioned
High QoS.
Dynamic interconnection model is embodied as：
And have
BW=min (BWwireless,BWwired)；
It is C network bandwidth, W in formulaiIt is congestion window, Q is queue length, and α is the natural growth of C, and β is C by WiAfter influence
Negative growth rate, χiIt is WiNatural growth, δ is WiGrowth rate after being influenced by C, ε are WiNegative growth rate after being influenced by Q,
φiIt is WiGrowth rate after being influenced by Q, and γ is the natural negative growth rate of Q, CWIt is the amount of bandwidth of bottleneck link, CWIt is network
Total bandwidth, P(i)It is scale coefficient, wherein BW is bandwidth, and σ is a positive smoothing factor.
BW=min (BWwireless,BWwired), wherein BWwirelessIt is wireless bandwidth, BWwiredIt is wired bandwidth, P (i) indicates industry
The service rate of business stream i accounts for the scale coefficient of TCP flow, and T (i) indicates the service rate of Business Stream i.
Wireless bandwidth BWwirelessSpecifically calculation method is：
pcol=1- (1-ptr)N-1；
Wherein L indicates the payload length of each Successful transmissions, wherein ptrFor node-node transmission probability, pcolFor collision probability, pidleTable
Show idle time of channel, and pidle=1-ptr-pcol, Ttr、TcolAnd TidleChannel is respectively indicated to be used for transmission, conflict and empty
Time shared by spare time, W be initial contention window size, 2mW is node maximum contention window size, and N is radio node number.
The calculation method of service rate includes the following steps：
T1, all business are divided into two class of high priority and low priority；
T2, T (i)=TGBR(i)+TNGBR(i), i=1,2 ..., k；
T in formulaGBR(i) it is to ensure bit rate, ensures that bit rate corresponds to the business of high priority, TNGBRIt (i) is non-guarantee bit
Rate, the non-business for ensureing bit rate and corresponding to low priority.
In heterogeneous network, data are needed across cable network and wireless network, so the actual bottleneck band of bottleneck link
Width should be that network bandwidth takes wired bandwidth and the smaller value in wireless bandwidth, therefore opposite frequency will be fluctuated in dynamic interconnection model
Numerous wireless network bandwidth more accurately can obtain net according to the real-time condition of network as the factor for calculating network bandwidth
Network bandwidth, and then improve QoS.
Further, because node needs to obtain channel resource, net by random competition mode in the wireless network
The bandwidth of network cannot be equivalent to physical layer transmission rate, but its portfolio that can really carry.Meanwhile it competing and believing in node
During road resource, there are the conflict expenses and random back expense between radio node.So in dynamic interconnection model
In, consider that Multiple factors finally determine wireless bandwidth, ensure that the accuracy calculated network bandwidth.
Further, because demand of the different types of business to bandwidth is different, such as video traffic is to bandwidth
Need to be higher than text information business, so needing on the basis of accurately calculating network bandwidth according to specific type of service
Carry out reasonable distribution bandwidth, if bandwidth too small will lead to that the high-priority service high to network resource requirement is distributed is unable to satisfy
The needs of the business, if the low priority traffice low to network resource requirement, which distributes excessively high bandwidth, will cause the wasting of resources,
Influence network throughput.In dynamic interconnection model, high-priority service obtains higher bandwidth, to ensure high-priority service
QoS, and the bandwidth of low priority traffice distribution is reallocated remaining bandwidth after meeting high-priority service, since user is low
The QoS requirement of priority service is big without high-priority service, so low priority traffice is distributed than high-priority service
Bandwidth it is smaller.More specifically, the calculation method for the accounting that the bandwidth of high-priority service distribution accounts for total bandwidth is as follows：
K is the number of total business in formula.
S4, start network transmission and monitoring network state and network parameter, network transmission process is that a dynamic is changeable
Process needs constantly to be adjusted, it is therefore desirable to continue to monitor network to guarantee that network can be stablized, constantly run
State and network parameter.
S5, S2 is returned to if network state changes, if network parameter, which changes, returns to S3.With network condition
Continuous variation, the present invention corrects dynamic interconnection model in real time, so as to keep high QoS.
The present invention can be adjusted in real time, to improve network by building dynamic interconnection model according to current network state
Adaptivity, and improve network performance.The present invention introduces business speed on the basis of accurately calculating network bandwidth simultaneously
Two parameters of rate and type of service finally improve QoS so as to carry out congestion control according to the actual conditions of business.
In order to verify to congestion control effect of the invention, following emulation experiment is set.
If source node shares 20, the raw four kinds of business of common property, four kinds of service rates be respectively 0.1Mbps, 0.2Mbps,
0.3Mbps and 0.4Mbps, and every kind of service rate node number is 1/4.The calculation method of queue length Q is as follows：
Bandwidth is link bandwidth in formula, and RTT is time delay, and Packetsize is packet size, and the unit of Packetsize is usual
For byte, Packetsize*8 indicates to be that unit is calculated according to bit here.
The setting of other experiment parameters is as shown in table 1.
1 network simulation parameter setting of table
Then it is emulated by NS2 network law, and is carried out with TCP Reno agreement and natural heuristic algorithm
Compare.As shown in figure 3, handling capacity highest of the invention, natural heuristic algorithm takes second place, TCP Reno when number of nodes is smaller
Agreement is worst.This is because natural heuristic algorithm and the present invention can according to the suitable threshold value of Network status dynamic select,
System is allowed gradually to tend towards stability state, and TCP Reno algorithm is not fully consider that network the present situation blindly reduces congestion
Window causes network throughput to decline.When interstitial content is further promoted, adjustment industry that natural heuristic algorithm can not be adaptive
The congestion window of business rate difference node, what its every data stream all distributed is identical congestion window, the value of congestion window
There is " spilling " or " deficiency " accordingly, the congestion window for every data stream that " cannot distribute according to need ", therefore under handling capacity is continuous
Drop, and the present invention is then always maintained at highest handling capacity, since data flow of the present invention to different rates can be according to the ratio of setting
Coefficient distributes different bandwidth, meets the needs of data with different rate stream, can preferably promote bandwidth availability ratio, to improve
Network throughput.When number of nodes is 24, network throughput can entire lowering, this is because excessive wireless in the wireless network
Node can cause more network conflicts, the chance of data transmission be reduced, to influence the handling capacity of overall network.
Packet loss comparison as shown in figure 4, it can be seen that packet loss of the invention be in three kinds of models it is minimum,
Because the TCP Reno agreement of natural heuristic algorithm is run in the case that network can be maintained to a stable state, net can be improved
The packet loss of network, and the present invention can be according to the demand assignment of different data streams bandwidth required for it, if high to rate
Data flow distributes small bandwidth, then will lead to the promotion of packet loss.Nature heuristic algorithm and the present invention are compared, when opening naturally
When congestion window can not be distributed according to the rate difference condition of every data stream by sending out algorithm, natural heuristic algorithm, model gives every
Data flow distribution is identical bandwidth, is that can promote the fairness of handling capacity, but will cause band on the surface in this way
Wide waste and spilling, that is, on state distribution congestion window deficiency when, congestion will occur for network, lead to packet loss
Rise.And the present invention can be different according to the rate-allocation of every data stream congestion window, the thus improved present invention
Network throughput can be not only promoted, but also packet loss can be reduced.
When the points of fixed knot in simulations is 24 and service rate is fixed as 200Kbps, wherein 8 business are Gao You
First grade (guarantee bit rate is 200Kbps), 8 business are that (guarantee bit rate is 100Kbps to middle priority, non-guarantee bit rate
It is low priority for 100Kbps), 8 business (non-guarantee bit rate is 200Kbps).The handling capacity and packet loss of different priorities
Rate performance is as shown in Figure 5 and Figure 6.There it can be seen that due to TCP Reno and natural heuristic algorithm not differentiated service priority,
Therefore either handling capacity or packet loss, the service feature difference of different priorities is little, can not ensure high priority industry
The QoS demand of business, but for natural heuristic algorithm, since natural heuristic algorithm can improve the handling capacity of network and lose
Packet rate, so its performance is got well than TCP Reno.For the present invention, it has been fully considered in algorithm for design different preferential
Grade business has different priority factors, and more Internet resources can be distributed when network carries out bandwidth allocation to high preferential
Grade business, to guarantee the service quality of high-priority service.Therefore, the present invention in high priority business handling capacity highest, packet loss
Rate is minimum, and the handling capacity of low priority traffice is minimum, packet loss highest.Service with different priority levels is provided with according to formula in emulation
Priority factor.
It should also be noted that, herein, relational terms such as first and second and the like are used merely to one
Entity or operation are distinguished with another entity or operation, without necessarily requiring or implying between these entities or operation
There are any actual relationship or orders.Moreover, the terms "include", "comprise" or its any other variant are intended to contain
Lid non-exclusive inclusion, so that the process, method, article or equipment including a series of elements is not only wanted including those
Element, but also including other elements that are not explicitly listed, or further include for this process, method, article or equipment
Intrinsic element.In the absence of more restrictions, the element limited by sentence "including a ...", it is not excluded that
There is also other identical elements in process, method, article or equipment including the element.
The foregoing description of the disclosed embodiments enables those skilled in the art to implement or use the present invention.
Various modifications to these embodiments will be readily apparent to those skilled in the art, as defined herein
General Principle can be realized in other embodiments without departing from the spirit or scope of the present invention.Therefore, of the invention
It is not intended to be limited to the embodiments shown herein, and is to fit to and the principles and novel features disclosed herein phase one
The widest scope of cause.
Claims (4)
1. the jamming control method ensured in a kind of heterogeneous network based on QoS, the heterogeneous network includes logical by bottleneck link
Believe the cable network and wireless network of connection, wherein cable network accesses several source node Ssi, wireless network accesses several
Destination node Di, it is characterised in that：The control method includes the following steps：
S1, the building heterogeneous network simultaneously determine network state；
S2, network parameter is calculated according to network state, network parameter includes wireless bandwidth and service rate；
S3, dynamic interconnection model is established according to network parameter, dynamic interconnection model includes that network bandwidth, congestion window and queue are long
Three parameters are spent, three parameters influence each other, and network bandwidth and the wireless bandwidth are positively correlated, congestion window and business speed
Rate is positively correlated；
S4, start network transmission and monitoring network state and network parameter；
S5, S2 is returned to if network state changes, if network parameter, which changes, returns to S3.
2. the jamming control method ensured in a kind of heterogeneous network as described in claim 1 based on QoS, it is characterised in that：S3
In, the dynamic interconnection model is embodied as：
It is C network bandwidth, W in formulaiIt is congestion window, Q is queue length, and α is the natural growth of C, and β is C by WiAfter influence
Negative growth rate, χiIt is WiNatural growth, δ is WiGrowth rate after being influenced by C, ε are WiNegative growth rate after being influenced by Q, φi
It is WiGrowth rate after being influenced by Q, and γ is the natural negative growth rate of Q, CWIt is the amount of bandwidth of bottleneck link, CWIt is that network is total
Bandwidth, P(i)It is scale coefficient, wherein BW is bandwidth, and σ is a positive smoothing factor.BW=min (BWwireless,
BWwired), wherein BWwirelessIt is wireless bandwidth, BWwiredIt is wired bandwidth；
P (i) indicates that the service rate of Business Stream i accounts for the scale coefficient of TCP flow, and T (i) indicates Business Stream i
Service rate.
3. the jamming control method ensured in a kind of heterogeneous network as claimed in claim 2 based on QoS, it is characterised in that：Nothing
The wide specific calculation method of tape is：
pcol=1- (1-ptr)N-1；
Wherein L indicates the payload length of each Successful transmissions, wherein ptrFor node-node transmission probability, pcolFor collision probability, pidleTable
Show idle time of channel, and pidle=1-ptr-pcol, Ttr、TcolAnd TidleChannel is respectively indicated to be used for transmission, conflict and empty
Time shared by spare time, W be initial contention window size, 2mW is node maximum contention window size, and N is radio node number.
4. the jamming control method ensured in a kind of heterogeneous network as claimed in claim 2 based on QoS, it is characterised in that：Industry
The calculation method of business rate includes the following steps：
T1, all business are divided into two class of high priority and low priority；
T2, T (i)=TGBR(i)+TNGBR(i), i=1,2 ..., k；
T in formulaGBR(i) it is to ensure bit rate, ensures that bit rate corresponds to the business of high priority, TNGBRIt (i) is non-guarantee bit rate,
The non-business for ensureing bit rate and corresponding to low priority.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810564786.8A CN108881045B (en) | 2018-06-04 | 2018-06-04 | QoS guarantee-based congestion control method in heterogeneous network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810564786.8A CN108881045B (en) | 2018-06-04 | 2018-06-04 | QoS guarantee-based congestion control method in heterogeneous network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108881045A true CN108881045A (en) | 2018-11-23 |
| CN108881045B CN108881045B (en) | 2022-03-01 |
Family
ID=64335281
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810564786.8A Active CN108881045B (en) | 2018-06-04 | 2018-06-04 | QoS guarantee-based congestion control method in heterogeneous network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108881045B (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110505105A (en) * | 2019-09-26 | 2019-11-26 | 中国联合网络通信集团有限公司 | Control method, device, equipment and the storage medium of network service quality |
| CN110535778A (en) * | 2019-08-29 | 2019-12-03 | 河南科技大学 | Transmission rate allocation method for Transmission Control Protocol in data center network |
| CN113906720A (en) * | 2019-06-12 | 2022-01-07 | 华为技术有限公司 | Traffic scheduling method, device and storage medium |
| CN114071580A (en) * | 2021-11-04 | 2022-02-18 | 中国联合网络通信集团有限公司 | Data transmission method and device and electronic equipment |
| CN114679413A (en) * | 2022-05-27 | 2022-06-28 | 鹏城实验室 | Congestion control method, device, equipment and storage medium for heterogeneous network |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101115002A (en) * | 2007-03-19 | 2008-01-30 | 重庆邮电大学 | Method for improving wireless self-organizing network performance using TCP Veno |
| CN101860488A (en) * | 2010-06-08 | 2010-10-13 | 电子科技大学 | Network congestion control method |
| CN102104912A (en) * | 2011-03-24 | 2011-06-22 | 黄东 | Heterogeneous service-based congestion control method for wireless mesh network |
| US20150043339A1 (en) * | 2011-12-28 | 2015-02-12 | Cdf Ke Yuan | Tcp congestion control for large latency networks |
| CN105357138A (en) * | 2015-09-30 | 2016-02-24 | 四川大学 | Self-adaptive reliable transmission method based on low priority |
| CN105704055A (en) * | 2016-01-18 | 2016-06-22 | 河南科技大学 | Network congestion preventing method based on natural heuristic algorithm |
-
2018
- 2018-06-04 CN CN201810564786.8A patent/CN108881045B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101115002A (en) * | 2007-03-19 | 2008-01-30 | 重庆邮电大学 | Method for improving wireless self-organizing network performance using TCP Veno |
| CN101860488A (en) * | 2010-06-08 | 2010-10-13 | 电子科技大学 | Network congestion control method |
| CN102104912A (en) * | 2011-03-24 | 2011-06-22 | 黄东 | Heterogeneous service-based congestion control method for wireless mesh network |
| US20150043339A1 (en) * | 2011-12-28 | 2015-02-12 | Cdf Ke Yuan | Tcp congestion control for large latency networks |
| CN105357138A (en) * | 2015-09-30 | 2016-02-24 | 四川大学 | Self-adaptive reliable transmission method based on low priority |
| CN105704055A (en) * | 2016-01-18 | 2016-06-22 | 河南科技大学 | Network congestion preventing method based on natural heuristic algorithm |
Non-Patent Citations (2)
| Title |
|---|
| WANG HUI ET AL.: ""Enhancing the Flexibility of TCP in Heterogeneous Network"", 《PLOS ONE》 * |
| 魏旭晖: ""基于捕食模型的异构网络拥塞预防控制算法的研究"", 《中国优秀硕士学位论文全文数据库 信息科技辑》 * |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113906720A (en) * | 2019-06-12 | 2022-01-07 | 华为技术有限公司 | Traffic scheduling method, device and storage medium |
| CN113906720B (en) * | 2019-06-12 | 2024-05-10 | 华为技术有限公司 | Traffic scheduling method, traffic scheduling device and storage medium |
| CN110535778A (en) * | 2019-08-29 | 2019-12-03 | 河南科技大学 | Transmission rate allocation method for Transmission Control Protocol in data center network |
| CN110535778B (en) * | 2019-08-29 | 2022-09-23 | 河南科技大学 | Transmission rate distribution method for TCP protocol in data center network |
| CN110505105A (en) * | 2019-09-26 | 2019-11-26 | 中国联合网络通信集团有限公司 | Control method, device, equipment and the storage medium of network service quality |
| CN114071580A (en) * | 2021-11-04 | 2022-02-18 | 中国联合网络通信集团有限公司 | Data transmission method and device and electronic equipment |
| CN114071580B (en) * | 2021-11-04 | 2024-06-07 | 中国联合网络通信集团有限公司 | Data transmission method and device and electronic equipment |
| CN114679413A (en) * | 2022-05-27 | 2022-06-28 | 鹏城实验室 | Congestion control method, device, equipment and storage medium for heterogeneous network |
| CN114679413B (en) * | 2022-05-27 | 2022-08-09 | 鹏城实验室 | Congestion control method, device, equipment and storage medium for heterogeneous network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108881045B (en) | 2022-03-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108881045A (en) | A kind of jamming control method ensured in heterogeneous network based on QoS | |
| US10009156B2 (en) | Service differentiation and service level agreements for wireless access clients | |
| US20140281034A1 (en) | System and Method for Compressing Data Associated with a Buffer | |
| Farmanbar et al. | Traffic engineering for software-defined radio access networks | |
| US11871265B2 (en) | Method and an electronic device for dynamically controlling TCP congestion window | |
| CN103327542B (en) | A kind of QoS support method and device that is applied to MANET network | |
| Lopez-Aguilera et al. | An asymmetric access point for solving the unfairness problem in WLANs | |
| JP2022046434A (en) | Method and device for communication network | |
| Bonald et al. | Is the''Law of the Jungle''Sustainable for the Internet? | |
| Petkov et al. | Collision-free medium access based on traffic forecasting | |
| Bonald et al. | On the stability of flow-aware CSMA | |
| CN105007586A (en) | Two-factor based self-adaptive contention window adjusting method for SMAC protocol of wireless sensor network | |
| Wu et al. | Mobile data offloading under attractor selection in heterogeneous networks | |
| CN102202344B (en) | Cross-layer congestion control method based on game theory in wireless Mesh network | |
| EP3468262B1 (en) | Energy efficient scheduling method and algorithm for the non-deterministic traffic in ieee 802.15.4e time slotted channel hopping (tsch) medium access control | |
| Ksentini et al. | ETXOP: A resource allocation protocol for QoS-sensitive services provisioning in 802.11 networks | |
| Kamra et al. | Fair adaptive bandwidth allocation: a rate control based active queue management discipline | |
| Khalil et al. | IoT service QoS guarantee using QBAIoT wireless access method | |
| CN105792287A (en) | Protection time slot self-adaptive distribution and performance evaluation method of wireless body area network | |
| CN114980155B (en) | Periodic data stream scheduling and aggregation method for 6TiSCH network | |
| Lakrami et al. | Towards the enhancement of QoS in 802.11 e for ad hoc networks | |
| Dimitriou et al. | Promoting effective service differentiation with Size-oriented Queue Management | |
| Marchang et al. | Hop-Based dynamic fair scheduler for wireless Ad-Hoc networks | |
| Hou et al. | Fair QoS multi-resource allocation for uplink traffic in WLAN | |
| Oksiiuk et al. | Analysis of methods providing qos for use in tactical mobile radio 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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |