CN112616157B - Wireless multi-hop Mesh network end-to-end time delay upper bound acquisition method based on network algorithm - Google Patents
Wireless multi-hop Mesh network end-to-end time delay upper bound acquisition method based on network algorithm Download PDFInfo
- Publication number
- CN112616157B CN112616157B CN202011452952.9A CN202011452952A CN112616157B CN 112616157 B CN112616157 B CN 112616157B CN 202011452952 A CN202011452952 A CN 202011452952A CN 112616157 B CN112616157 B CN 112616157B
- Authority
- CN
- China
- Prior art keywords
- delay
- node
- upper bound
- time delay
- service
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 24
- 238000004422 calculation algorithm Methods 0.000 title claims abstract description 20
- 230000005540 biological transmission Effects 0.000 claims abstract description 59
- 238000012545 processing Methods 0.000 claims abstract description 15
- 230000002776 aggregation Effects 0.000 claims description 19
- 238000004220 aggregation Methods 0.000 claims description 19
- 238000004364 calculation method Methods 0.000 claims description 7
- 238000004088 simulation Methods 0.000 abstract description 15
- 238000011160 research Methods 0.000 abstract description 5
- 238000004458 analytical method Methods 0.000 description 9
- 230000000694 effects Effects 0.000 description 5
- 238000010586 diagram Methods 0.000 description 3
- 230000007423 decrease Effects 0.000 description 2
- 230000001934 delay Effects 0.000 description 2
- 230000007774 longterm Effects 0.000 description 2
- 238000005457 optimization Methods 0.000 description 2
- 230000001174 ascending effect Effects 0.000 description 1
- 238000010835 comparative analysis Methods 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000002474 experimental method Methods 0.000 description 1
- 238000012795 verification Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W24/00—Supervisory, monitoring or testing arrangements
- H04W24/06—Testing, supervising or monitoring using simulated traffic
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
The invention discloses a wireless multi-hop Mesh network end-to-end time delay upper bound acquisition method based on network algorithm, which obtains a single-node time delay upper bound by solving queuing time delay and processing time delay of system nodes; setting an arrival curve and a service curve of the node and combining a wireless multi-hop mesh network research method to calculate a time delay upper bound of a single transmission system of the wireless multi-hop mesh network; and acquiring the multi-transmission system time delay upper bound based on the single-transmission system time delay upper bound. By comparing the three aspects of system simulation, single transmission system and multi-transmission system through simulation experiments, the end-to-end delay upper bound of the wireless multi-hop mesh network obtained by the invention is close to the actual end-to-end delay simulation value of the network, and the QoS service of the network can be ensured.
Description
Technical Field
The invention relates to a group decision method, in particular to a wireless multi-hop Mesh network end-to-end time delay upper bound acquisition method based on network calculation.
Background
As a broadband access technology, the wireless multi-hop Mesh network has the advantages of flexible node movement, various access modes and the like compared with the traditional wireless network, and is paid attention to by researchers in recent years. The network is mainly composed of three layers, namely an Internet access layer, a core network layer and an output access layer. The core network layer is arranged between the Internet access layer and the output access layer, is a key for influencing the performance of the wireless multi-hop Mesh network, and the analysis of the performance of the core network brings references for the design of the wireless Mesh network architecture, the network optimization and the like.
The end-to-end delay is an important index of network performance and is also an important parameter for measuring network quality of service QoS and user experience. The accuracy of the end-to-end delay upper bound analysis directly influences the network QoS guarantee level, and is also an important basis for network admission control and route optimization.
The traditional research method mainly utilizes a network algorithm theory to analyze the upper bound of time delay in single-path transmission of the wireless multi-hop Mesh network and the upper bound of time delay jitter between paths in multi-path transmission, but the upper bound of time delay from end to end of a multi-path transmission system is not considered, and in addition, the network parameter modeling method mainly researches the approximate upper bound of time delay from end to end of the wireless multi-hop Mesh network.
Disclosure of Invention
In view of the problem that the traditional upper bound research method of time delay cannot accurately obtain the upper bound of the time delay from end to end of the wireless multi-hop Mesh network, the application provides an end-to-end time delay upper bound acquisition method based on network calculation so as to ensure network QoS service.
In order to achieve the above purpose, the technical scheme of the application is as follows: the method for acquiring the end-to-end time delay upper bound of the wireless multi-hop Mesh network based on network algorithm comprises the following steps:
acquiring a single-node time delay upper bound;
obtaining an end-to-end time delay upper bound of a wireless multi-hop Mesh network single-path transmission system by utilizing a network algorithm according to the single-node time delay upper bound;
and acquiring the end-to-end time delay upper bound of the multipath transmission system through the end-to-end time delay upper bound of the single-path transmission system.
Further, before acquiring the single-node delay upper bound, it is assumed that a service flow a (t) is constrained by an arrival curve through a node p, where the arrival curve is:
where ρ is the average arrival rate of the data stream and σ is the maximum burst size of the data stream;
service is provided through a service curve beta (t) expressed by a time delay-Rate function LR (Latency-Rate), wherein the service curve is:
where R is the service rate and T is the service delay of the data stream in the system, i.e. the packet processing delay, denoted as t=l/r+l/C.
Further, the single-node delay consists of queuing delay and processing delay cached by the system, wherein the processing delay is a delay parameter T, and the queuing delay D queue The upper bound is considered as the maximum busy interval, and the single node queuing delay upper bound is:
the single node i delay upper bound is expressed as:
further, obtaining the end-to-end time delay upper bound of the wireless multi-hop Mesh network single-path transmission system by utilizing a network algorithm according to the single-node time delay upper bound comprises two parts: one part is variable delay, queuing delay for a system buffer area; another part is fixed delay including node system processing delay, forwarding delay and link propagation delay, while for fixed delay, phase among n nodes is assumedThe fixed time delay between two adjacent nodes is d in turn 1 ,d 2 ,…,d n-1 ；
For a path containing n nodes, the arrival curve of the data flow of the ith node is alpha i (t)＝σ i +ρ i t, transmission service system capacity is beta i ＝R i [t-T i ] + The single path end-to-end delay of nodes 1 to n is
1) When n=1, the single node delay upper boundAnd equation (4) obtaining an end-to-end delay upper bound; when n=2, the upper delay bound of the 1 st node is obtained by the horizontal deviation theorem>The output of node 1 is limited to the arrival curve, node 1 transmits the data stream onto the link and propagates to the 2 nd node, so the 2 nd node arrives at curve α (t) =α * (t); and similarly, obtaining a node 2 time delay upper bound ++according to a single node time delay upper bound calculation formula>In combination with the fixed delay between two adjacent nodes, the end-to-end delay between the 1 st and 2 nd nodes is:
2) Let n=k-1 be the end-to-end delay upper bound:
3) When n=k, kthArrival curve of nodeBy single node delay upper bound->The upper bound of the time delay of the kth node is obtained as follows:
the single path end-to-end delay upper bound containing k nodes is equal to the delay upper bound of the first k-1 nodesFixed delay d between kth-1 node and kth node k-1 And the delay upper bound of the kth node +.>The sum of the three, namely
Further, the end-to-end delay upper bound of the multipath transmission system is obtained through the end-to-end delay upper bound of the single path transmission system, specifically: assuming that there are m paths between the source node g and the aggregation node a, a data stream R (t) entering the network system will first pass through the source node g and then be divided into m paths for transmission, denoted as R i (t), i=1, 2, …, m, and hasBeta for setting service curve of jth node on ith path (i,j) Represented where j=1, 2, …, n i ，n i Representing the number of nodes on the ith path, the service capability of the aggregate node a is represented as beta a The method comprises the steps of carrying out a first treatment on the surface of the For aggregate node a, it is assumed that the cache queue area of that node is large enough not toCausing data overflow;
nodes g through a have m paths, and the ith path has n i Each node, the service capability of each node is respectively expressed as beta a ＝R a [t-T a ] + ，β (i,j) ＝R (i,j) [t-T (i,j) ] + ，β g ＝R g [t-T g ] + ，i＝1,2,…,m；j＝1,2,…,n i Since the maximum delay in multipath transmission from g to a before data stream aggregation is the transmission delay of the path with the maximum transmission delay, expressed as:
from the end-to-end delay of the single path, the output data stream of the ith path is subjected to curveConstraint, assuming that aggregation node a needs all data flows to arrive before it is processed, traffic enters aggregation node a and needs to be plotted:
after transmission through m paths, the upper bound of the delay of the aggregation node satisfies the following relation
Wherein T is a ＝L/R a To aggregate the service delay of node a, ρ a ＝ρ 1 +ρ 2 +…+ρ m 。
To sum up, the end-to-end delay upper bound of the multipath transmission system is obtained as
The invention has advantages over existing methods in terms of: according to the method, a single-node time delay upper bound is obtained by solving queuing time delay and processing time delay of the system node; setting an arrival curve and a service curve of the node and combining a wireless multi-hop mesh network research method to calculate a time delay upper bound of a single transmission system of the wireless multi-hop mesh network; and acquiring the multi-transmission system time delay upper bound based on the single-transmission system time delay upper bound. By comparing the three aspects of system simulation, single transmission system and multi-transmission system through simulation experiments, the end-to-end delay upper bound of the wireless multi-hop mesh network obtained by the invention is close to the actual end-to-end delay simulation value of the network, and the QoS service of the network can be ensured.
Drawings
FIG. 1 arrival graph;
FIG. 2 is a single path transmission diagram;
FIG. 3 is a multipath transmission diagram;
FIG. 4 is a simulation diagram of a single transmission system scenario;
fig. 5 is an end-to-end delay plot when 5R =150 Mb/s;
FIG. 6 is a graph of two end-to-end delay upper bound analysis;
FIG. 7 is a graph of single path end-to-end delay versus number of link nodes;
FIG. 8 is a graph of end-to-end latency versus network service rate;
FIG. 9 is a graph of end-to-end delay versus three service weight assignments;
FIG. 10 is a graph of the relationship between the multipath end-to-end delay bound and the network service rate;
fig. 11 is a graph of the multipath end-to-end delay bound versus the number of multipath stripes.
Detailed Description
The invention is described in further detail below with reference to the attached drawings and to specific embodiments: this is taken as an example to describe the present application further.
The embodiment provides a method for acquiring an end-to-end time delay upper bound of a wireless multi-hop Mesh network based on network algorithm, which comprises the following steps:
1. acquiring a single-node time delay upper bound;
in particular, the delay of a single node is composed of queuing delay and processing delay of a system cache, when a service flow A (t) arrives at the node, the delay is limited by a token bucket with the node parameter of (ρ, sigma), namely the delay is limited by an arrival curve alpha (t) of the node,
where ρ is the average arrival rate of the data stream and σ is the maximum burst size of the data stream. And provides services through a service curve beta (t) expressed by a delay-Rate function LR (Latency-Rate):
where R is the service rate and T is the service delay of the data stream in the system, i.e. the packet processing delay, denoted t=l/r+l/C.
The single-node delay consists of queuing delay and processing delay of a system cache, wherein the processing delay is delay parameter T, and the queuing delay D queue The upper bound is regarded as the maximum busy interval, and the single node queuing delay upper bound is
So the single node i delay upper bound is obtained as follows:
2. obtaining an end-to-end time delay upper bound of a wireless multi-hop Mesh network single-path transmission system by utilizing a network algorithm according to the single-node time delay upper bound;
specifically, as shown in fig. 2, the end-to-end single-path transmission of the wireless multi-hop Mesh network comprises two parts: part of the delay is variable delay, mainly queuing delay of a system buffer area; another part is fixed time delay, the main partThe method comprises the steps of node system processing delay, forwarding delay and link propagation delay. For the fixed time delay, the application assumes that the fixed time delay between two adjacent nodes in the n nodes is d in turn 1 ,d 2 ,…,d n-1 。
For a path containing n nodes, the arrival curve of the data flow of the ith node is alpha i (t)＝σ i +ρ i t, transmission service system capacity is beta i ＝R i [t-T i ] + The single path end-to-end delay of nodes 1 to n is
1) When n=1, the single node delay upper boundAnd equation (4) obtaining an end-to-end delay upper bound; when n=2, the upper delay bound of the 1 st node is derived from the horizontal deviation theorem +.>The output of node 1 is limited to a curve, node 1 transmits the data stream onto the link and propagates to the 2 nd node, so the 2 nd node reaches the curve α (t) =α * (t). And similarly, obtaining a node 2 time delay upper bound ++according to a single node time delay upper bound calculation formula>In combination with the fixed delay between two adjacent nodes, the end-to-end delay between the 1,2 th nodes is:
2) Let n=k-1 be the end-to-end delay upper bound:
3) When n=k, the arrival curve of the kth nodeBy single-node delay upper boundThe upper bound of the time delay of the kth node is obtained as
The single path end-to-end delay upper bound containing k nodes is equal to the delay upper bound of the first k-1 nodesFixed delay d between kth-1 node and kth node k-1 And the delay upper bound of the kth node +.>The sum of the three, namely
3. Acquiring an end-to-end time delay upper bound of the multipath transmission system through the end-to-end time delay upper bound of the single-path transmission system;
specifically, as shown in fig. 3, according to the network algorithm and the end-to-end delay upper bound of the single-path transmission system, assuming that m paths exist between the source end node g and the aggregation node a of the multi-path transmission, a data stream R (t) entering the network system will first pass through the source end node g and then be divided into m paths for transmission, which is denoted as R i (t), i=1, 2, …, m, and hasLet j on the i-th pathBeta for service curve of node (i,j) Represented where j=1, 2, …, n i ，n i Representing the number of nodes on the ith path, the service capability of the aggregate node a is represented as beta a . For aggregation node a, the present application assumes that the cache queue area of that node is large enough to not cause data overflow.
The nodes g to a have m paths, and the ith path has n i Each node, the service capability of each node is respectively expressed as beta a ＝R a [t-T a ] + ，β (i,j) ＝R (i,j) [t-T (i,j) ] + ，β g ＝R g [t-T g ] + ，i＝1,2,…,m；j＝1,2,…,n i Since the maximum delay in multipath transmission from g to a before data stream aggregation is the transmission delay of the path with the maximum transmission delay, expressed as
From the single-path end-to-end delay, the output data stream of the ith path is subjected to a curveConstraint, assuming that aggregation node a needs all data flows to be processed after reaching, traffic enters aggregation node a and needs to be subjected to curves
After transmission through m paths, the upper bound of the delay of the aggregation node satisfies the following relation
Wherein T is a ＝L/R a To aggregate the service delay of node a ρ a ＝ρ 1 +ρ 2 +…+ρ m 。
To sum up, the end-to-end delay upper bound of the multipath transmission system is obtained as follows:
in order to verify the effectiveness and correctness of the wireless multi-hop Mesh network end-to-end time delay upper bound acquisition method based on network algorithm, a single transmission system is simulated to perform end-to-end time delay statistics, and an OPNET simulation tool is used for setting a single path transmission system, as shown in fig. 4. Experimental scenario: 1000 m.1000m, the client sending rate of the source node router1 is 120Mb/s, the initial value of the service rate of each router is set to 150Mb/s, the node buffer size is set to 500MTU, and the distances from router1 to router7 are 250m in sequence. Other network parameters employ the set parameters in table 1.
Table 1 network experimental parameter settings
Table 1 Network Experiment Parameter Settings
Note that: maximum packet length is set according to MTU (maximum transmission unit) specified in computer network Ethernet
The application carries out end-to-end time delay upper bound numerical simulation verification from two angles of a single-path transmission system and a multi-path transmission system respectively. For a single-path transmission system, analysis is performed in two aspects, namely, an end-to-end delay upper bound obtained through calculation based on a network algorithm theory is compared with a simulated end-to-end delay upper bound analysis to verify a result, and the influence of the calculated end-to-end delay upper bound under different conditions is described through data flows with the following three different characteristics. Assume that the long-term average rate and burst size of X are 120Mb/s and 200 kbits respectively; the average rate and burst quantity of Y are 200Mb/s and 200 kbits respectively; the long-term average rate and burst size of Z are 120Mb/s,300 kbits, respectively.
1. End-to-end delay upper bound of single-path transmission system
In order to maintain the consistency of the simulation analysis of the present invention, service parameters in the stream X are uniformly adopted, and the network end-to-end delay upper bound value obtained by simulation according to fig. 5 is compared with the end-to-end delay upper bound obtained by calculation of the present application, as shown in fig. 6, it can be seen that the end-to-end delay upper bound calculated by the present application is increasingly close to the simulation delay upper bound simulation value as the network service rate increases.
In addition, fig. 7, fig. 8, and fig. 9 are the effects of three aspects of link node number, network service rate, and service weight assignment on the upper bound of the end-to-end delay of the data flows with three different characteristics of X, Y, and Z.
(1) Relation between number of link nodes and end-to-end time delay
Fig. 7 shows the effect of the number of link nodes on the end-to-end delay in the case of a single path, and it can be seen that the delay increases with the increase of the number of nodes of the link, and the result reflects the characteristics of network operation and actual delay, i.e. when the number of nodes on the link is greater, the convolution value of the network operation can reflect the actual network performance.
(2) Relation between network service rate and end-to-end delay
Fig. 8 shows the relationship between the end-to-end delay and the network service rate, and it is easy to see that the two are in negative correlation, i.e. the end-to-end delay decreases with increasing network service rate, which is consistent with the actual network situation. In addition, when the service rate is smaller than 350Mb/s, the descending amplitude of the end-to-end time delay along with the increase of the network service rate is larger, and when the service rate is larger than 350Mb/s, the descending amplitude is stable. The curves between the end-to-end delay and the network service rate of the data streams X and Z almost overlap, because the two services have the same, and the input-output relationship between the nodes just changes with the convolution value of the network algorithm, which is mainly affected by the burst quantity, but not greatly affected, but the delay of Z is slightly larger. While a significant difference in the curves between the end-to-end delays of X and Y and the network service rate is verifying this.
(3) Relation between service rate weight and end-to-end delay
Fig. 9 shows the relationship between end-to-end delay and service rate weight assignment with a fixed number of link nodes. Assuming a total service rate of 800Mb/s, the service rate allocation weights for data flow X, Y, Z are 0.2,0.5,0.3, respectively. The three end-to-end time delays are all in an ascending trend, wherein the X end-to-end time delay is highest, the Y times are the same, and the Z time delay is lowest, which is consistent with the analysis result. Because the service rate allocated by Z is greater than the rate allocated by X under the condition of the same arrival rate, the burst quantity also has little influence on the delay, but the naturally calculated end-to-end delay is smaller; while a large arrival rate has an effect when Y is compared to X, the same effect is less pronounced for the highest service rate assigned to Y.
2. End-to-end delay upper bound for multipath transmission system
Under the condition of multipath, the influence of the upper bound of the end-to-end time delay is mainly analyzed from two aspects of path number and network service rate. In the transmission process, the data output by the source node g is set to reach the aggregation node a through three paths, and the service rates provided by each link are respectively 90Mb/s,100Mb/s and 110Mb/s. Meanwhile, for the convenience and effectiveness of comparative analysis, the application only discusses the corresponding change condition of the end-to-end time delay upper bound of the analysis data stream X under different conditions under the multipath.
(1) Relation between flow distribution mode and end-to-end time delay
Fig. 10 reveals the influence of the network service rate and the flow distribution mode on the end-to-end delay upper bound under the condition of multipath, the delay upper bound of the two flow distribution modes gradually decreases along with the increase of the service rate, in addition, the delay through the weight distribution mode can be seen to be lower, which indicates that the effect of distributing proper flows according to the service demands of different links is better, and the influence of network congestion caused by large load on the local links on the overall end-to-end delay upper bound is reduced.
(2) Relation between flow distribution mode and end-to-end time delay
Fig. 11 shows the influence of the multipath number and the flow distribution mode on the upper bound of the end-to-end delay when the total service rate of the link is set to 300Mb/s and the service rates of the source node and the aggregation node are both 500Mb/s, and the change condition of the upper bound of the end-to-end delay of the data flow X under different conditions is simulated and analyzed. It can be seen that the end-to-end delay upper bounds of the two flow distribution modes are increased along with the increase of the multipath number, and the end-to-end delay upper bounds obtained by weight distribution are lower than the average distribution delay upper bounds, which is also attributed to the fact that the weight distribution mode avoids the influence of network congestion caused by large load on local links so as to influence the overall end-to-end delay upper bounds.
By using different indexes to carry out simulation analysis, the wireless multi-hop mesh network end-to-end delay upper bound based on network algorithm provided by the invention is close to the actual network end-to-end delay simulation value, and can ensure network QoS service.
While the invention has been described with reference to the preferred embodiments, it will be understood by those skilled in the art that various changes in form and detail may be made therein without departing from the spirit and scope of the invention as defined by the appended claims.
Claims (4)
1. The method for acquiring the end-to-end time delay upper bound of the wireless multi-hop Mesh network based on network algorithm is characterized by comprising the following steps:
acquiring a single-node time delay upper bound;
obtaining an end-to-end time delay upper bound of a wireless multi-hop Mesh network single-path transmission system by utilizing a network algorithm according to the single-node time delay upper bound;
acquiring an end-to-end time delay upper bound of the multipath transmission system through the end-to-end time delay upper bound of the single-path transmission system;
obtaining an end-to-end time delay upper bound of the wireless multi-hop Mesh network single-path transmission system by utilizing a network algorithm according to the single-node time delay upper bound comprises two parts: one part is variable delay, queuing delay for a system buffer area; another part is fixed delay including node system processing delay, forwarding delay and link propagation delay, and for fixed delay, it is assumed that between two adjacent nodes in n nodesThe fixed time delay is d in turn 1 ,d 2 ,…,d n-1 ；
For a path containing n nodes, the arrival curve of the data flow of the ith node is alpha i (t)＝σ i +ρ i t, transmission service system capacity is beta i ＝R i [t-T i ] + The single path end-to-end delay of nodes 1 to n is
1) When n=1, the single node delay upper boundAnd equation (4) obtaining an end-to-end delay upper bound; when n=2, the upper delay bound of the 1 st node is obtained by the horizontal deviation theorem>The output of node 1 is limited to the arrival curve, node 1 transmits the data stream onto the link and propagates to the 2 nd node, so the 2 nd node arrives at curve α (t) =α * (t); and similarly, obtaining a node 2 time delay upper bound ++according to a single node time delay upper bound calculation formula>In combination with the fixed delay between two adjacent nodes, the end-to-end delay between the 1 st and 2 nd nodes is:
2) Let n=k-1 be the end-to-end delay upper bound:
3) When n=k, the arrival curve of the kth nodeBy single node delay upper bound->The upper bound of the time delay of the kth node is obtained as follows:
the single path end-to-end delay upper bound containing k nodes is equal to the delay upper bound of the first k-1 nodesFixed delay d between kth-1 node and kth node k-1 And the delay upper bound of the kth node +.>The sum of the three, namely
Wherein d i For a fixed time delay between two adjacent nodes, T i Is the service delay of the data flow in the ith node.
2. The method for obtaining the end-to-end delay upper bound of the wireless multi-hop Mesh network based on network algorithm according to claim 1, wherein before obtaining the single-node delay upper bound, it is assumed that a service flow a (t) is constrained by an arrival curve through a node p, and the arrival curve is:
where ρ is the average arrival rate of the data stream and σ is the maximum burst size of the data stream;
service is provided by a service curve beta (t) represented by a time delay-rate function LR, the service curve being:
where R is the service rate, T is the service delay of the data stream in the system, i.e. the packet processing delay, denoted as t=l/r+l/C, where L is the maximum packet length and C is the link transmission rate.
3. The method for obtaining the end-to-end delay upper bound of the wireless multi-hop Mesh network based on network algorithm according to claim 2, wherein the single-node delay consists of queuing delay and processing delay of system nodes, wherein the processing delay is a delay parameter T, and the queuing delay D queue The upper bound is considered as the maximum busy interval, and the single node queuing delay upper bound is:
the single node i delay upper bound is expressed as:
4. the method for acquiring the end-to-end delay upper bound of the wireless multi-hop Mesh network based on network algorithm according to claim 1, wherein the method for acquiring the end-to-end delay upper bound of the multi-path transmission system by the end-to-end delay upper bound of the single-path transmission system is specifically as follows: assuming that there are m paths between the source node g and the aggregation node a, the data stream R (t) entering the network system will first pass through the source node g, butThen divided into m paths for transmission, denoted as R i (t), i=1, 2, …, m, and hasBeta for setting service curve of jth node on ith path (i,j) Represented where j=1, 2, …, n i ，n i Representing the number of nodes on the ith path, the service capability of the aggregate node a is represented as beta a The method comprises the steps of carrying out a first treatment on the surface of the For the aggregation node a, the buffer queue area of the node is assumed to be large enough, so that data overflow cannot be caused;
nodes g through a have m paths, and the ith path has n i Each node, the service capability of each node is respectively expressed as beta a ＝R a [t-T a ] + ，β (i,j) ＝R (i,j) [t-T (i,j) ] + ，β g ＝R g [t-T g ] + ，i＝1,2,…,m；j＝1,2,…,n i Since the maximum delay in multipath transmission from g to a before data stream aggregation is the transmission delay of the path with the maximum transmission delay, expressed as:
from the end-to-end delay of the single path, the output data stream of the ith path is subjected to curveConstraint, assuming that aggregation node a needs all data flows to arrive before it is processed, traffic enters aggregation node a and needs to be plotted:
after transmission through m paths, the upper bound of the delay of the aggregation node satisfies the following relation
Wherein T is a ＝L/R a To aggregate the service delay of node a, ρ a ＝ρ 1 +ρ 2 +…+ρ m ；
To sum up, the end-to-end delay upper bound of the multipath transmission system is obtained as
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011452952.9A CN112616157B (en) | 2020-12-11 | 2020-12-11 | Wireless multi-hop Mesh network end-to-end time delay upper bound acquisition method based on network algorithm |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011452952.9A CN112616157B (en) | 2020-12-11 | 2020-12-11 | Wireless multi-hop Mesh network end-to-end time delay upper bound acquisition method based on network algorithm |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112616157A CN112616157A (en) | 2021-04-06 |
| CN112616157B true CN112616157B (en) | 2024-03-08 |
Family
ID=75233640
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011452952.9A Active CN112616157B (en) | 2020-12-11 | 2020-12-11 | Wireless multi-hop Mesh network end-to-end time delay upper bound acquisition method based on network algorithm |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112616157B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113328879B (en) * | 2021-05-21 | 2022-08-23 | 西北工业大学 | Cloud data center network QoS (quality of service) guaranteeing method based on network calculus |
| CN116566903B (en) * | 2023-07-05 | 2023-09-26 | 南京信息工程大学 | End-to-end time delay analysis method for converging flow of heterogeneous links of finger control network |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1941737A (en) * | 2005-09-30 | 2007-04-04 | 富士通株式会社 | Method and device for pre-determining time delay in node, and method and device for guarantee of time delay |
| CN103312606A (en) * | 2013-05-23 | 2013-09-18 | 杭州卓沃电子商务有限公司 | Wireless Mesh network routing based on multi-path concurrence and method thereof |
| CN103338471A (en) * | 2013-06-27 | 2013-10-02 | 南京邮电大学 | Service quality index evaluating method for wireless multi-hop network based on model |
| CN106102084A (en) * | 2016-05-24 | 2016-11-09 | 重庆邮电大学 | Wireless sensor network end-to-end time delay upper bound appraisal procedure based on retransmission feedback |
| CN107346988A (en) * | 2017-06-20 | 2017-11-14 | 大连大学 | A kind of appearance based on low-track satellite network late/hold circuit network route computing method |
| CN110708716A (en) * | 2019-08-28 | 2020-01-17 | 华北电力大学（保定） | Short packet communication transmission performance analysis method based on multi-antenna energy capture |
| CN111711961A (en) * | 2020-04-30 | 2020-09-25 | 南京邮电大学 | Service end-to-end performance analysis method introducing random probability parameter |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7729268B2 (en) * | 2002-06-28 | 2010-06-01 | Ntt Docomo, Inc. | Method and apparatus for quality of service determination |
| US8619756B2 (en) * | 2009-07-15 | 2013-12-31 | Qualcomm Incorporated | Systems and methods for providing resource allocation meeting communication constraints for multi-hop network data flows |
| CN112671656B (en) * | 2019-10-16 | 2023-03-10 | 华为技术有限公司 | Method and equipment for configuring network |
-
2020
- 2020-12-11 CN CN202011452952.9A patent/CN112616157B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1941737A (en) * | 2005-09-30 | 2007-04-04 | 富士通株式会社 | Method and device for pre-determining time delay in node, and method and device for guarantee of time delay |
| CN103312606A (en) * | 2013-05-23 | 2013-09-18 | 杭州卓沃电子商务有限公司 | Wireless Mesh network routing based on multi-path concurrence and method thereof |
| CN103338471A (en) * | 2013-06-27 | 2013-10-02 | 南京邮电大学 | Service quality index evaluating method for wireless multi-hop network based on model |
| CN106102084A (en) * | 2016-05-24 | 2016-11-09 | 重庆邮电大学 | Wireless sensor network end-to-end time delay upper bound appraisal procedure based on retransmission feedback |
| CN107346988A (en) * | 2017-06-20 | 2017-11-14 | 大连大学 | A kind of appearance based on low-track satellite network late/hold circuit network route computing method |
| CN110708716A (en) * | 2019-08-28 | 2020-01-17 | 华北电力大学（保定） | Short packet communication transmission performance analysis method based on multi-antenna energy capture |
| CN111711961A (en) * | 2020-04-30 | 2020-09-25 | 南京邮电大学 | Service end-to-end performance analysis method introducing random probability parameter |
Non-Patent Citations (7)
| Title |
|---|
| A Survey on Evolution of RSVP;Flavius Pana等;《IEEE》;全文 * |
| SAGA:一种面向任务的卫星网络资源分配算法;杨力;杨恒;魏德宾;潘成胜;;小型微型计算机系统;20200115(第01期);全文 * |
| 刘宴兵 ; 吕娟 ; 黄俊 ; 熊姿 ; .面向云服务的网络参数建模与定量分析.数学的实践与认识.2014,(第04期),第2-3节. * |
| 基于网络演算的无线自组网QoS性能确定上界研究;李庆华;陈志刚;张连明;曾锋;李翔;;通信学报;20080925(第09期);全文 * |
| 无线mesh网中时延约束抖动优化的多路径流量分配算法;陈志刚;曾锋;李庆华;;通信学报(第01期);第2-4节 * |
| 陈志刚 ; 曾锋 ; 李庆华 ; .无线mesh网中时延约束抖动优化的多路径流量分配算法.通信学报.2011,(第01期),第2-4节. * |
| 面向云服务的网络参数建模与定量分析;刘宴兵;吕娟;黄俊;熊姿;;数学的实践与认识(第04期);第2-3节 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112616157A (en) | 2021-04-06 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN112616157B (en) | Wireless multi-hop Mesh network end-to-end time delay upper bound acquisition method based on network algorithm | |
| Kurose | On computing per-session performance bounds in high-speed multi-hop computer networks | |
| US6226266B1 (en) | End-to-end delay estimation in high speed communication networks | |
| Figueira et al. | Leave-in-time: A new service discipline for real-time communications in a packet-switching network | |
| US20030223428A1 (en) | Method and apparatus for scheduling aggregated resources | |
| CN1643860A (en) | Method and arrangement for dinamic allocation of network resources | |
| Lin et al. | On the connection-level stability of congestion-controlled communication networks | |
| Qian et al. | QoS scheduling for NoCs: Strict priority queueing versus weighted round robin | |
| Yuan et al. | Fair round-robin: A low complexity packet schduler with proportional and worst-case fairness | |
| CN109150756B (en) | Queue scheduling weight quantification method based on SDN power communication network | |
| CN108183828B (en) | Flow control method based on local wireless network topology | |
| Wang et al. | Adaptive placement and routing for service function chains with service deadlines | |
| Gopalan et al. | Probabilistic delay guarantees using delay distribution measurement | |
| Wang et al. | Toward statistical QoS guarantees in a differentiated services network | |
| Li et al. | Schedulability criterion and performance analysis of coordinated schedulers | |
| Li et al. | Jms: Joint bandwidth allocation and flow assignment for transfers with multiple sources | |
| Kanhere et al. | On the latency bound of pre-order deficit round robin | |
| Cano-Cano et al. | A methodology to enable QoS provision on InfiniBand hardware | |
| Ruan et al. | S3: size-aware sequential scheduling to meet deadlines in data center networks | |
| Lien et al. | Timeliness and QoS aware packet scheduling for next generation networks | |
| Liebeherr et al. | Design and analysis of a high-performance packet multiplexer for multiservice networks with delay guarantees | |
| Xu et al. | A packet-scheduling strategy for heterogeneous traffic of Internet of Things | |
| Martínez et al. | A framework to provide quality of service over Advanced Switching | |
| Dosciatti et al. | Time frame optimization using PSO to guarantee QoS in IEEE 802.16 networks | |
| Goebbels | Traffic Theory Approach for Heterogeneous Mobile Communication 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 |