CN112448895A - Method and device for distributing internet traffic flow and storage medium - Google Patents
Method and device for distributing internet traffic flow and storage medium Download PDFInfo
- Publication number
- CN112448895A CN112448895A CN202011213292.9A CN202011213292A CN112448895A CN 112448895 A CN112448895 A CN 112448895A CN 202011213292 A CN202011213292 A CN 202011213292A CN 112448895 A CN112448895 A CN 112448895A
- Authority
- CN
- China
- Prior art keywords
- link
- state
- kth
- cache resource
- road side
- 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.)
- Pending
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/11—Identifying 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/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/50—Queue scheduling
- H04L47/52—Queue scheduling by attributing bandwidth to queues
- H04L47/522—Dynamic queue service slot or variable bandwidth allocation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/12—Protocols specially adapted for proprietary or special-purpose networking environments, e.g. medical networks, sensor networks, networks in vehicles or remote metering networks
Abstract
The invention discloses a method, a device and a storage medium for distributing internet traffic flow, wherein the method comprises the following steps: acquiring K links in a road side unit to be monitored; wherein K is more than 1; comparing the occupancy rate of the first cache queue corresponding to each link with a first threshold corresponding to the link and a second threshold corresponding to the link respectively, and obtaining a cache resource releasing value and a link state corresponding to each link according to a comparison result; obtaining a total released cache resource value corresponding to the K links according to the released cache resource value corresponding to each link; and distributing the total release cache resource value to the link with the link state being the congestion state according to a preset proportion. The invention can effectively avoid the phenomenon that the link in the road side unit to be monitored is congested, thereby realizing the requirement of network networking on the real-time performance of the network.
Description
Technical Field
The invention relates to the technical field of traffic flow distribution, in particular to a method and a device for distributing internet traffic flow and a storage medium.
Background
With the development of the internet-of-vehicles technology, corresponding software and hardware operating environments need to be matched for automatic driving development to realize the acquisition, integration and calculation of vehicle operating data and road environment information data, real-time calculation and integration of longitudinal data from a traffic management level to a vehicle operating level are realized by strengthening vehicle-road-network connection by means of internet of things, edge calculation and cloud calculation, a fusion analysis and intelligent processing system of vehicle operating data, road environment data and external data of various sizes of vehicle-road-network is researched, and the construction of an internet-of-vehicles intelligent management and control cloud platform with the functions of vehicle-road-network multi-size real-time monitoring, intelligent decision and cooperative control is completed. The network is used as a transmission medium to connect bridges among all equipment unit nodes, and has extremely high requirements on data transmission real-time performance in the networking of the networked vehicles.
In the prior art, no method for distributing the internet traffic flow is found, and the traffic cannot be effectively shunted, so that the road side unit to be monitored is congested, and the requirement of the internet on the network real-time performance cannot be met.
Disclosure of Invention
The technical problem to be solved by the embodiments of the present invention is to provide a method, an apparatus, and a storage medium for allocating network connection traffic, which can effectively avoid congestion of a link in a roadside unit to be monitored, thereby implementing a requirement of network connection on network real-time performance.
In order to solve the above technical problem, an embodiment of the present invention provides a method for allocating internet traffic, including:
acquiring K links in a road side unit to be monitored; wherein K is more than 1;
comparing the occupancy rate of the first cache queue corresponding to each link with a first threshold corresponding to the link and a second threshold corresponding to the link respectively, and obtaining a cache resource releasing value and a link state corresponding to each link according to a comparison result;
obtaining a total released cache resource value corresponding to the K links according to the released cache resource value corresponding to each link;
and distributing the total release cache resource value to the link with the link state being the congestion state according to a preset proportion.
Further, the method compares any one of the K links with a first threshold corresponding to the link and a second threshold corresponding to the link, and obtains a released cache resource value and a link state corresponding to the link according to a comparison result by the following steps:
the occupancy rate of a first buffer queue corresponding to the k link
First threshold values respectively corresponding to the k-th links
A second threshold corresponding to the k link
Comparing; wherein K is more than or equal to K and is more than 1;
when in use
When the current link state is the idle state, the buffer resource releasing value corresponding to the kth link is obtained by calculating the occupancy rate of a first buffer queue corresponding to the kth link and the buffer resource corresponding to the kth link;
when in use
When the link state corresponding to the kth link is a normal state, the value of the released cache resource corresponding to the kth link is 0;
when in use
And if so, the link state corresponding to the kth link is a congestion state, and the released cache resource value corresponding to the kth link is 0.
Go toStep one, the
When the buffer resource releasing value is obtained by calculating the occupancy rate of the first buffer queue corresponding to the kth link and the buffer resource corresponding to the kth link, the link state corresponding to the kth link is an idle state, and the method specifically includes:
when in use
When the current link state is the idle state, the released cache resource value corresponding to the kth link is obtained by calculation according to the following calculation formula;
wherein Q iskfreeBuffering resource value, Q, for release of kth linkkFor the cache resource corresponding to the k-th link,
and the occupancy rate of the first buffer queue corresponding to the kth link.
Further, the obtaining a total released cache resource value corresponding to the K links according to the released cache resource value corresponding to each link specifically includes:
and accumulating the released cache resource values corresponding to all the links to obtain a total released cache resource value corresponding to the K links.
Further, the allocating the total released cache resource value to the link with the link state being the congestion state according to a preset proportion specifically includes:
and distributing the total released cache resource value to each link with the congestion state according to the cache resource demand proportion corresponding to the 1 st link.
Further, after the allocating the total released buffer resource value to the link with the link state being the congestion state according to the preset proportion, the method further includes:
acquiring the occupancy rate of a second cache queue corresponding to each link;
comparing the occupancy rate of the second cache queue corresponding to each link with the first threshold corresponding to the link and the second threshold corresponding to the link respectively, and obtaining the link state corresponding to each link according to the comparison result;
judging whether a link with a congestion state exists in the road side unit to be monitored;
and if the road side unit to be monitored has a link with the link state being the congestion state, controlling a neighbor road side unit to send the traffic originally sent to the link in the direction to other neighbor road side units according to a preset proportion for any link with the link state being the congestion state.
Further, if there is a link with a link state being a congestion state in the to-be-monitored road side unit, for the link with any link state being the congestion state, controlling a neighboring road side unit to send the traffic volume originally sent to the link to other neighboring road side units according to a preset proportion, specifically including:
if the road side unit to be monitored has a link with a link state being a congestion state, controlling a neighbor road side unit to send the traffic originally sent to the link in the original direction to other neighbor road side units according to the proportion of (1-X)% for any link with the link state being the congestion state; wherein, X is the service forwarding proportion of the adjacent road side unit.
Further, the method obtains a first threshold and a second threshold corresponding to any one of the K links by the following steps:
calculating to obtain a first threshold corresponding to a kth link according to the output flow of the kth link, the bandwidth of the kth link, a monitoring period, a single-hop propagation delay, the time consumption of a routing path calculated by a shortest path algorithm, cache resources corresponding to the kth link and the size of an array packet; wherein K is more than or equal to K and is more than 1;
and calculating to obtain a second threshold corresponding to the kth link according to the output flow of the kth link, the bandwidth of the kth link, the time consumption of the routing path calculated by the shortest path algorithm, the cache resource corresponding to the kth link and the size of the array group.
Correspondingly, an embodiment of the present invention further provides a device for allocating internet traffic, including:
the acquisition module is used for acquiring K links in the road side unit to be monitored; wherein K is more than 1;
the comparison module is used for comparing the occupancy rate of the first cache queue corresponding to each link with a first threshold corresponding to the link and a second threshold corresponding to the link respectively, and obtaining a cache resource releasing value and a link state corresponding to each link according to a comparison result;
the calculation module is used for obtaining a total released cache resource value corresponding to the K links according to the released cache resource value corresponding to each link;
and the first allocation module is used for allocating the total release cache resource value to the link with the link state being the congestion state according to a preset proportion.
Accordingly, an embodiment of the present invention further provides a computer-readable storage medium, where the computer-readable storage medium includes a stored computer program; the computer program controls, when running, a device where the computer-readable storage medium is located to execute any one of the above methods for allocating internet traffic.
The embodiment of the invention has the following beneficial effects:
the embodiment of the invention provides a method, a device and a storage medium for distributing internet traffic flow, wherein the method comprises the following steps: acquiring K links in a road side unit to be monitored; wherein K is more than 1; comparing the occupancy rate of the first cache queue corresponding to each link with a first threshold corresponding to the link and a second threshold corresponding to the link respectively, and obtaining a cache resource releasing value and a link state corresponding to each link according to a comparison result; obtaining a total released cache resource value corresponding to the K links according to the released cache resource value corresponding to each link; distributing the total release cache resource value to a link with a link state being a congestion state according to a preset proportion; the invention distributes the total release cache resources to the link with the link state being the congestion state according to a certain proportion, and can avoid the phenomenon of congestion of the link, thereby realizing the requirement of the internet connection vehicle on the real-time performance of the network.
Drawings
Fig. 1 is a flowchart of a preferred embodiment of a method for allocating internet traffic according to the present invention;
fig. 2 is a block diagram of a preferred embodiment of a distribution device for internet traffic provided by the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without any inventive step, are within the scope of the present invention.
An embodiment of the present invention provides a method for allocating internet traffic, which is a flowchart of an embodiment of the method for allocating internet traffic provided by the present invention, as shown in fig. 1, and the method includes steps S11 to S14:
s11, acquiring K links in the road side unit to be monitored; wherein K is more than 1;
step S12, comparing the occupancy rate of the first buffer queue corresponding to each link with the first threshold corresponding to the link and the second threshold corresponding to the link respectively, and obtaining the release buffer resource value and the link state corresponding to each link according to the comparison result;
step S13, obtaining a total released cache resource value corresponding to the K links according to the released cache resource value corresponding to each link;
and step S14, allocating the total released buffer resource value to the link with the link state being the congestion state according to a preset proportion.
Specifically, 4 links in a road side unit to be monitored are obtained; comparing the occupancy rate of the first cache queue corresponding to each link with a first threshold corresponding to the link and a second threshold corresponding to the link respectively, and obtaining a cache resource releasing value and a link state corresponding to each link according to a comparison result; obtaining a total released cache resource value corresponding to 4 links according to the released cache resource value corresponding to each link; distributing the total release cache resource value to a link with a link state being a congestion state according to a preset proportion; the invention distributes the total release cache resources to the link with the link state being the congestion state according to a certain proportion, and can avoid the phenomenon of congestion of the link, thereby realizing the requirement of the internet connection vehicle on the real-time performance of the network.
In another preferred embodiment, the method compares any one of the K links with a first threshold corresponding to the link and a second threshold corresponding to the link, and obtains a released cache resource value and a link state corresponding to the link according to a comparison result:
the occupancy rate of a first buffer queue corresponding to the k link
First threshold values respectively corresponding to the k-th links
A second threshold corresponding to the k link
Comparing; wherein K is more than or equal to K and is more than 1; when in use
When the current link state is the idle state, the buffer resource releasing value corresponding to the kth link is obtained by calculating the occupancy rate of a first buffer queue corresponding to the kth link and the buffer resource corresponding to the kth link; when in use
When the link state corresponding to the kth link is a normal state, the value of the released cache resource corresponding to the kth link is 0; when in use
And if so, the link state corresponding to the kth link is a congestion state, and the released cache resource value corresponding to the kth link is 0.
In yet another preferred embodiment, said
When the buffer resource releasing value is obtained by calculating the occupancy rate of the first buffer queue corresponding to the kth link and the buffer resource corresponding to the kth link, the link state corresponding to the kth link is an idle state, and the method specifically includes:
when in use
When the current link state is the idle state, the released cache resource value corresponding to the kth link is obtained by calculation according to the following calculation formula;
wherein Q iskfreeBuffering resource value, Q, for release of kth linkkFor the cache resource corresponding to the k-th link,
and the occupancy rate of the first buffer queue corresponding to the kth link.
Specifically, if the link state corresponding to the kth link is an idle state, the length of the first buffer queue is adjusted to be equal to the length of the first buffer queue
The buffer resource released by the link is
In another preferred embodiment, step S14 specifically includes: and accumulating the released cache resource values corresponding to all the links to obtain a total released cache resource value corresponding to the K links. For example, if there are 4 links in the roadside unit to be monitored, the total released cache resource value Q corresponding to the 4 linkssumfree＝∑Qkfree。
In another preferred embodiment, the allocating the total released buffer resource value to the link with the link state being the congestion state according to a preset ratio specifically includes:
the total released cache resource value is in accordance with the cache resource demand proportion Q corresponding to the 1 st linkkneedEach link whose link state is a congestion state is assigned.
In another preferred embodiment, the method obtains the first threshold and the second threshold corresponding to any one of the K links by:
calculating to obtain a first threshold corresponding to a kth link according to the output flow of the kth link, the bandwidth of the kth link, a monitoring period, a single-hop propagation delay, the time consumption of a routing path calculated by a shortest path algorithm, cache resources corresponding to the kth link and the size of an array packet; wherein K is more than or equal to K and is more than 1;
and calculating to obtain a second threshold corresponding to the kth link according to the output flow of the kth link, the bandwidth of the kth link, the time consumption of the routing path calculated by the shortest path algorithm, the cache resource corresponding to the kth link and the size of the array group.
Specifically, in order to avoid packet loss in the buffer queue, the second threshold corresponding to the kth link is used
Should satisfy
Thus obtaining
(1) (ii) a First threshold corresponding to k link
It should be guaranteed that there is enough time to recalculate the routing path before re-entering the congested state, assuming that the shortest path algorithm takes t to calculate the routing pathDSPThen, then
Should satisfy
(2) Can be obtained according to the formula (1) and the formula (2)
Finally according to the formula
Calculating to obtain a first threshold corresponding to the k link
According to the formula
Calculating to obtain a second threshold corresponding to the k link
Wherein the content of the first and second substances,
is the output flow of the k link, B is the bandwidth of the k link, tδFor monitoring the period, tdFor a single hop propagation delay, tDSPTime consuming, Q, for a routing path computed by a shortest path algorithmkFor the value of the cache resource, P, corresponding to the kth linkavgIs the data packet size. It should be noted that the single-hop propagation delay tdAccording toThe timestamp in the network packet is calculated and obtained, and the data packet size is Pavg1KB can be taken based on empirical values.
In another preferred embodiment, the output flow of the kth link is calculated as follows:
specifically, the flow output condition of each link in the road side unit to be monitored is periodically monitored, and the monitoring period is set as tδAssume that in the last monitoring period, i.e. (t-t)δT) the output flow of the k link is
And (0, t-t)δ) Average output flow over time is
Now using the formula
Calculating the output flow corresponding to the k link
Wherein, alpha is a forgetting factor, the value range of alpha is 0-1, and the output flow is
The average value is a long-term average value, and the rapid decrease of the flow rate when the flow rate is short and slight is avoided, when alpha is too small, the change of the output flow rate is very slow and is difficult to represent the long-term average value, so that the efficiency of cache resource allocation is influenced, when alpha is too large, the change of the output flow rate is numbered along with the short-term flow rate fluctuation, and the accurate prediction of the flow rate is difficult to realize, therefore, the method is implementedFor example, α is calculated by equation (4), where α0＝0.025，α1＝0.15，α2＝0.35。
In another preferred embodiment, the k-th link corresponds to a cache resource QkThe calculation method of (2) is as follows:
Ji＝∑Cn (5)
J1ij＝Jij+∑Jneighj (7)
wherein, JiFor road side unit V to be monitorediAccessing the sum of the traffic flows of the vehicles; cnService flow of a vehicle node is accessed into a road side unit to be monitored; j. the design is a squareijFor road side unit V to be monitorediWith the first neighbouring road side unit VjThe flow rate of (c); j. the design is a squarejFor the first neighbor roadside unit VjAccessing the sum of the traffic flows of the vehicles; len (a)ijFor road side unit V to be monitorediWith the first neighbouring road side unit VjThe distance between them; vmThe method comprises the following steps that (1) M is 1, 2, M is greater than 1 for the mth neighbor road side unit to be screened; j. the design is a squaremThe traffic flow sum of the access vehicles of the mth neighbor road side unit to be screened; len (a)imFor road side unit V to be monitorediAnd the mth to-be-screened neighbor road side unit VmThe distance between them; vneighIs a neighbor road side unit to be calculated; j. the design is a squareneighjFor a neighbouring road side unit V to be calculatedneighWith the first neighbouring road side unit VjThe flow rate of (c); j1ijFor road side unit V to be monitorediWith the first neighbouring road side unit VjTotal flow rate in between;
for road side unit V to be monitorediThe service flow flowing out of the kth link;
the flow of the kth link in the road side unit to be monitored is obtained; q is the total cache resource of the road side unit to be monitored; qkThe buffer resources corresponding to the k link in the road side unit to be monitored.
In particular, since the road side unit V to be monitorediWith the first neighbouring road side unit VjThe potential flow in between is affected by: the size of the service flow of each access vehicle node in the network, and a road side unit V to be monitorediWith the first neighbouring road side unit VjDistance of roadside unit V to be monitorediAnd the distance between each neighboring road side unit to be screened. Calculating the shortest path between each neighbor road side unit to be screened and the first neighbor road side unit according to a conventional universal signal strength RSSI ranging formula, and if the next hop side unit in the shortest path is the road side unit to be monitored, indicating that the road side unit to be monitored is likely to receive the service flow of the neighbor road side unit to be screened, so that the neighbor road side unit to be screened, which meets the requirement that the next hop side unit in the shortest path is the road side unit to be monitored, is taken as the neighbor road side unit V to be calculatedneigh. It should be noted that the neighbor road side units to be screened are neighbor road side units except the first neighbor road side unit;
is 0, it is emphasized that only traffic transmitted over this link will be accounted for, if at all
The traffic of (1) is not transmitted through the k-th link, and is not counted in
In yet another preferred embodiment, after step S14, the method further comprises:
acquiring the occupancy rate of a second cache queue corresponding to each link;
comparing the occupancy rate of the second cache queue corresponding to each link with the first threshold corresponding to the link and the second threshold corresponding to the link respectively, and obtaining the link state corresponding to each link according to the comparison result;
judging whether a link with a congestion state exists in the road side unit to be monitored;
and if the road side unit to be monitored has a link with the link state being the congestion state, controlling a neighbor road side unit to send the traffic originally sent to the link in the direction to other neighbor road side units according to a preset proportion for any link with the link state being the congestion state.
In another preferred embodiment, if there is a link with a link state being a congestion state in the rsu to be monitored, for a link with any link state being a congestion state, controlling a neighboring rsu to send traffic originally directed to the link to other neighboring rsus according to a preset ratio specifically includes:
if the road side unit to be monitored has a link with a link state being a congestion state, controlling a neighbor road side unit to send the traffic originally sent to the link in the original direction to other neighbor road side units according to the proportion of (1-X)% for any link with the link state being the congestion state; wherein, X is the service forwarding proportion of the adjacent road side unit.
Specifically, if the link status is an idle status or a normal status, the occupancy rate of the second buffer queue corresponding to the link is determined
Is equal to the first buffer queue occupancy rate
If the link state is the congestion state, the occupancy rate of a second cache queue corresponding to the link
Occupancy by first buffer queue
And calculating the resources allocated to the total released cache resource value obtained by the link, and calculating and obtaining the service forwarding proportion of the neighbor road side unit according to a formula (11), a formula (12) and a formula (13).
Wherein the content of the first and second substances,
sending new service flow to the kth link for the adjacent road side unit;
the output flow of the kth link; b is the bandwidth of the kth link; pavgIs the data packet size;
a second cache queue occupancy rate corresponding to the kth link;
a first occupancy rate corresponding to the kth link; qkA cache resource value corresponding to the kth link; t is tθIs a preset time period;
a second occupancy rate corresponding to the kth link; t is tdIs a single hop propagation delay.
The embodiment of the present invention further provides a device for allocating internet traffic, which can implement all the processes of the method for allocating internet traffic described in any of the above embodiments, and the functions and implemented technical effects of each module and unit in the device are respectively the same as those of the method for allocating internet traffic described in the above embodiment and the implemented technical correlation, and are not described herein again.
Referring to fig. 2, it is a block diagram of a preferred embodiment of a distribution device for internet traffic provided in the present invention, and the device includes:
the acquisition module 11 is configured to acquire K links in the roadside unit to be monitored; wherein K is more than 1;
the comparison module 12 is configured to compare the occupancy rate of the first cache queue corresponding to each link with a first threshold corresponding to the link and a second threshold corresponding to the link, and obtain a released cache resource value and a link state corresponding to each link according to a comparison result;
the calculating module 13 is configured to obtain a total released cache resource value corresponding to the K links according to the released cache resource value corresponding to each link;
a first allocating module 14, configured to allocate the total released buffer resource value to a link whose link state is a congestion state according to a preset proportion.
Preferably, the comparing module 13 specifically includes:
a comparison unit for comparing the occupancy rate of the first buffer queue corresponding to the k-th link
Respectively corresponding to the k-th linkFirst threshold value
A second threshold corresponding to the k link
Comparing; wherein K is more than or equal to K and is more than 1;
a first execution unit for executing
When the current link state is the idle state, the buffer resource releasing value corresponding to the kth link is obtained by calculating the occupancy rate of a first buffer queue corresponding to the kth link and the buffer resource corresponding to the kth link;
a second execution unit for executing
When the link state corresponding to the kth link is a normal state, the value of the released cache resource corresponding to the kth link is 0;
a third execution unit for executing
And if so, the link state corresponding to the kth link is a congestion state, and the released cache resource value corresponding to the kth link is 0.
Preferably, the first execution unit is specifically configured to:
when in use
When the current link state is the idle state, the released cache resource value corresponding to the kth link is obtained by calculation according to the following calculation formula;
wherein Q iskfreeBuffering resource value, Q, for release of kth linkkFor the cache resource corresponding to the k-th link,
and the occupancy rate of the first buffer queue corresponding to the kth link.
Preferably, the calculating module 13 is specifically configured to:
and accumulating the released cache resource values corresponding to all the links to obtain a total released cache resource value corresponding to the K links.
Preferably, the first allocating module 14 is specifically configured to:
and distributing the total released cache resource value to each link with the congestion state according to the cache resource demand proportion corresponding to the 1 st link.
Preferably, the apparatus further comprises: a second assignment module, the second assignment module specifically including:
the acquisition unit is used for acquiring the occupancy rate of a second cache queue corresponding to each link;
the comparison unit is used for comparing the occupancy rate of the second cache queue corresponding to each link with the first threshold corresponding to the link and the second threshold corresponding to the link respectively, and obtaining the link state corresponding to each link according to the comparison result;
the judging unit is used for judging whether a link with a congestion state exists in the road side unit to be monitored;
and the distribution unit is used for controlling the adjacent road side unit to send the traffic volume originally sent to the link in the direction to other adjacent road side units according to a preset proportion for the link with the congestion state in any link state.
Preferably, the allocation unit is specifically configured to:
if the road side unit to be monitored has a link with a link state being a congestion state, controlling a neighbor road side unit to send the traffic originally sent to the link in the original direction to other neighbor road side units according to the proportion of (1-X)% for any link with the link state being the congestion state; wherein, X is the service forwarding proportion of the adjacent road side unit.
An embodiment of the present invention further provides a computer-readable storage medium, where the computer-readable storage medium includes a stored computer program; when the computer program runs, the device where the computer-readable storage medium is located is controlled to execute the method for allocating internet traffic according to any one of the above embodiments.
To sum up, the method, the device and the storage medium for allocating the internet traffic flow provided by the embodiment of the invention have the following beneficial effects:
1. the total released cache resources are distributed to the link with the link state being the congestion state according to a certain proportion, so that the phenomenon of congestion of the link can be avoided, and the requirement of network networking on network real-time performance is met;
2. the traffic originally sent to the link in the specific direction is sent to other neighbor road side units according to the preset proportion through the neighbor road side units, so that the phenomenon that the link is congested can be further avoided, and the requirement of the internet connection vehicle on the network real-time performance is further met.
The above description is only a preferred embodiment of the present invention, and it should be noted that, for those skilled in the art, several modifications and variations can be made without departing from the technical principle of the present invention, and these modifications and variations should also be regarded as the protection scope of the present invention.
Claims (10)
1. A method for distributing Internet traffic, comprising:
acquiring K links in a road side unit to be monitored; wherein K is more than 1;
comparing the occupancy rate of the first cache queue corresponding to each link with a first threshold corresponding to the link and a second threshold corresponding to the link respectively, and obtaining a cache resource releasing value and a link state corresponding to each link according to a comparison result;
obtaining a total released cache resource value corresponding to the K links according to the released cache resource value corresponding to each link;
and distributing the total release cache resource value to the link with the link state being the congestion state according to a preset proportion.
2. The method according to claim 1, wherein any one of the K links is compared with a first threshold corresponding to the link and a second threshold corresponding to the link, and a released cache resource value and a link state corresponding to the link are obtained according to a comparison result, by the following steps:
the occupancy rate of a first buffer queue corresponding to the k link
First threshold values respectively corresponding to the k-th links
A second threshold corresponding to the k link
Comparing; wherein K is more than or equal to K and is more than 1;
when in use
When the current link state is the idle state, the buffer resource releasing value corresponding to the kth link is obtained by calculating the occupancy rate of a first buffer queue corresponding to the kth link and the buffer resource corresponding to the kth link;
when in use
When the link state corresponding to the kth link is a normal state, the value of the released cache resource corresponding to the kth link is 0;
when in use
And if so, the link state corresponding to the kth link is a congestion state, and the released cache resource value corresponding to the kth link is 0.
3. The method for distributing internet traffic of claim 2, wherein the time is when
When the buffer resource releasing value is obtained by calculating the occupancy rate of the first buffer queue corresponding to the kth link and the buffer resource corresponding to the kth link, the link state corresponding to the kth link is an idle state, and the method specifically includes:
when in use
When the current link state is the idle state, the released cache resource value corresponding to the kth link is obtained by calculation according to the following calculation formula;
wherein Q iskfreeBuffering resource value, Q, for release of kth linkkFor the cache resource corresponding to the k-th link,
and the occupancy rate of the first buffer queue corresponding to the kth link.
4. The method for allocating internet traffic according to claim 1, wherein the obtaining a total released cache resource value corresponding to K links according to the released cache resource value corresponding to each link specifically includes:
and accumulating the released cache resource values corresponding to all the links to obtain a total released cache resource value corresponding to the K links.
5. The method for allocating internet traffic flow according to claim 1, wherein the allocating the total released cache resource value to the link whose link state is the congestion state according to a preset ratio specifically includes:
and distributing the total released cache resource value to each link with the congestion state according to the cache resource demand proportion corresponding to the 1 st link.
6. The method for allocating internet traffic according to claim 1, wherein after the allocating the total released buffered resource value to the link with the link state being the congested state according to the preset proportion, the method further comprises:
acquiring the occupancy rate of a second cache queue corresponding to each link;
comparing the occupancy rate of the second cache queue corresponding to each link with the first threshold corresponding to the link and the second threshold corresponding to the link respectively, and obtaining the link state corresponding to each link according to the comparison result;
judging whether a link with a congestion state exists in the road side unit to be monitored;
and if the road side unit to be monitored has a link with the link state being the congestion state, controlling a neighbor road side unit to send the traffic originally sent to the link in the direction to other neighbor road side units according to a preset proportion for any link with the link state being the congestion state.
7. The method according to claim 6, wherein if there is a link with a congested link state in the rsus to be monitored, controlling a neighboring rsu to send traffic originally directed to the link to other neighboring rsus according to a preset ratio for any link with a congested link state, specifically comprising:
if the road side unit to be monitored has a link with a link state being a congestion state, controlling a neighbor road side unit to send the traffic originally sent to the link in the original direction to other neighbor road side units according to the proportion of (1-X)% for any link with the link state being the congestion state; wherein, X is the service forwarding proportion of the adjacent road side unit.
8. The method for distributing the internet traffic according to any one of claims 1 to 7, wherein the method obtains the first threshold and the second threshold corresponding to any one of the K links by:
calculating to obtain a first threshold corresponding to a kth link according to the output flow of the kth link, the bandwidth of the kth link, a monitoring period, a single-hop propagation delay, the time consumption of a routing path calculated by a shortest path algorithm, cache resources corresponding to the kth link and the size of an array packet; wherein K is more than or equal to K and is more than 1;
and calculating to obtain a second threshold corresponding to the kth link according to the output flow of the kth link, the bandwidth of the kth link, the time consumption of the routing path calculated by the shortest path algorithm, the cache resource corresponding to the kth link and the size of the array group.
9. An apparatus for distributing internet traffic, comprising:
the acquisition module is used for acquiring K links in the road side unit to be monitored; wherein K is more than 1;
the comparison module is used for comparing the occupancy rate of the first cache queue corresponding to each link with a first threshold corresponding to the link and a second threshold corresponding to the link respectively, and obtaining a cache resource releasing value and a link state corresponding to each link according to a comparison result;
the calculation module is used for obtaining a total released cache resource value corresponding to the K links according to the released cache resource value corresponding to each link;
and the first allocation module is used for allocating the total release cache resource value to the link with the link state being the congestion state according to a preset proportion.
10. A computer-readable storage medium, characterized in that the computer-readable storage medium comprises a stored computer program; wherein the computer program controls the device in which the computer readable storage medium is located to execute the method for allocating internet traffic according to any one of claims 1 to 8 when running.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011213292.9A CN112448895A (en) | 2020-11-03 | 2020-11-03 | Method and device for distributing internet traffic flow and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011213292.9A CN112448895A (en) | 2020-11-03 | 2020-11-03 | Method and device for distributing internet traffic flow and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN112448895A true CN112448895A (en) | 2021-03-05 |
Family
ID=74735848
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011213292.9A Pending CN112448895A (en) | 2020-11-03 | 2020-11-03 | Method and device for distributing internet traffic flow and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112448895A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114979008A (en) * | 2022-05-19 | 2022-08-30 | 中国电子科技集团公司第五十八研究所 | Link flow control limit adjusting method, device and on-chip processing system |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20050262266A1 (en) * | 2002-06-20 | 2005-11-24 | Niclas Wiberg | Apparatus and method for resource allocation |
| WO2010142227A1 (en) * | 2009-06-12 | 2010-12-16 | 中兴通讯股份有限公司 | Method and device for controlling switching network traffic |
-
2020
- 2020-11-03 CN CN202011213292.9A patent/CN112448895A/en active Pending
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20050262266A1 (en) * | 2002-06-20 | 2005-11-24 | Niclas Wiberg | Apparatus and method for resource allocation |
| WO2010142227A1 (en) * | 2009-06-12 | 2010-12-16 | 中兴通讯股份有限公司 | Method and device for controlling switching network traffic |
Non-Patent Citations (1)
| Title |
|---|
| 王卫东: "《基于流量预测的物联网卫星节点动态缓存分配路由策略》", 《通信学报》 * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114979008A (en) * | 2022-05-19 | 2022-08-30 | 中国电子科技集团公司第五十八研究所 | Link flow control limit adjusting method, device and on-chip processing system |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US6556578B1 (en) | Early fair drop buffer management method | |
| JP4796668B2 (en) | Bus control device | |
| CN110932989B (en) | Elephant flow path monitoring and scheduling method based on SDN data center network | |
| US20110176554A1 (en) | Packet relay apparatus and method of relaying packet | |
| CN109618375B (en) | UAV ad hoc network time slot scheduling method based on service priority and channel interruption probability | |
| CN102811176B (en) | A kind of data flow control method and device | |
| CN105827528A (en) | Routing method suitable for frequency spectrum-flexible optical network | |
| CN102668471B (en) | Method and device for aggregating data from multiple data source | |
| CN104270790A (en) | Congestion control method based on equitable distribution of communication channel | |
| CN114268537B (en) | Deterministic network-oriented network slice generation and dynamic configuration system and method | |
| CN109150756B (en) | Queue scheduling weight quantification method based on SDN power communication network | |
| CN109714795A (en) | A kind of method for managing resource, resource management system and device based on SDN network slice | |
| CN112448895A (en) | Method and device for distributing internet traffic flow and storage medium | |
| Jang et al. | Traffic-aware traffic signal control framework based on sdn and cloud-fog computing | |
| CN115051953B (en) | Programmable data plane distributed load balancing method based on switch queue behavior | |
| Sonmez et al. | SUIT: A cross layer image transport protocol with fuzzy logic based congestion control for wireless multimedia sensor networks | |
| EP1947810A1 (en) | A method and equipment for admitting and controlling the integration service model | |
| EP2800295B1 (en) | Device and method for scheduling packet transmission | |
| Verma et al. | Performance evaluation and validation of session-expiration scheduling technique for queued CAMs in vehicular ad-hoc networks | |
| Hao et al. | An extended GI X/M/1/N queueing model for evaluating the performance of AQM algorithms with aggregate traffic | |
| CN101958843A (en) | Intelligent routing selection method based on flow analysis and node trust degree | |
| CN115604724A (en) | SRv6 method for evaluating risk of congestion of backbone network flow | |
| Li et al. | Lower bound of weighted fairness guaranteed congestion control protocol for WSNs | |
| CN1389799A (en) | Multiple-priority level and optimal dynamic threshold buffer storage managing algorithm | |
| US20050223056A1 (en) | Method and system for controlling dataflow to a central system from distributed systems |
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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20210305 |
|
| RJ01 | Rejection of invention patent application after publication |