CN1195363C - Method for evaluating route performances of quality of service based on linear structure - Google Patents
Method for evaluating route performances of quality of service based on linear structure Download PDFInfo
- Publication number
- CN1195363C CN1195363C CNB021599297A CN02159929A CN1195363C CN 1195363 C CN1195363 C CN 1195363C CN B021599297 A CNB021599297 A CN B021599297A CN 02159929 A CN02159929 A CN 02159929A CN 1195363 C CN1195363 C CN 1195363C
- Authority
- CN
- China
- Prior art keywords
- path
- route
- link
- sigma
- quality
- 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.)
- Expired - Fee Related
Links
- 238000000034 method Methods 0.000 title abstract description 17
- 238000011156 evaluation Methods 0.000 claims abstract description 14
- 238000010586 diagram Methods 0.000 claims description 4
- 238000004422 calculation algorithm Methods 0.000 abstract description 27
- 238000004088 simulation Methods 0.000 abstract description 3
- 238000005259 measurement Methods 0.000 abstract 3
- 238000009826 distribution Methods 0.000 description 5
- 238000012886 linear function Methods 0.000 description 3
- 230000000996 additive effect Effects 0.000 description 2
- 238000004519 manufacturing process Methods 0.000 description 2
- 239000013598 vector Substances 0.000 description 2
- 239000000654 additive Substances 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 230000002950 deficient Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000010606 normalization Methods 0.000 description 1
- 238000005457 optimization Methods 0.000 description 1
- 238000012797 qualification Methods 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The present invention relates to a method for evaluating the route performance of service quality based on a linear structure, which belongs to the technical field for evaluating the route performance of the internet. The present invention is characterized in that a multiple measurement path problem of the interne t is converted into a method using the Dijkstra algorithm to calculate a minimum energy path problem based on the lineal energy function g (e) =sigma k 1-1 (a1w1 (e)), wherein the e is a link; 1 is the serial number of k dimension measurement, and 1 is less than or equal to 1 and is less than or equal to k; alpha-[1] epsilon [0, 1] is a coefficient which is irrespective with the link e, satisfies with sigma <K> = L-[1] a-[1] = 1; the node pair (s, t) of sources and targets is selected at a topological graph randomly; then, the route with the minimum energy value is established with the Dijkstra algorithm on the principle that route lineal energy function is equal to the sum of the lineal energy functions of all links on the route from s to t; thus, the path measurement value is used as the limit condition c of the quality service request of the node pair (s, t); thus, the service quality request generated by simulation is ensured to have a feasible path. A test result indicates that the evaluation method not only can represent actual application service but also can well reflect the route performance.
Description
Technical field
Service quality routing performance evaluation method based on lineament belongs to routing performance assessment technique field, the Internet, relates in particular to have the service quality route evaluation method of a plurality of QoS parameters as constraints.
Background technology
(Quality-of-service, QoS) common method of routing algorithm performance has two kinds to estimate service quality.(1) contention: algorithm can find the request number and the ratio that has the request number of feasible path of feasible path; (2) route success rate: algorithm can find the request number of feasible path and the ratio of total request number of being simulated.
The difference of these two kinds of evaluation methods is whether necessarily have feasible path as the QoS request of denominator.These two kinds of methods all have a common defective: result of calculation depends on the qualifications of the QoS request that is produced, the i.e. distribution of QoS constraint to a great extent.And, whether have feasible path owing to be difficult to judge a QoS request, so the route success rate has obtained using widely for large-scale network topological figure.Yet the route success rate depends on the constraints of QoS request to a greater extent, different documents adopts different production methods, this causes the route success rate to lose the evaluation meaning of absolute figure, only same batch data relatively in just meaningful, so the given performance evaluation data of different document can't directly compare.
Summary of the invention
The object of the present invention is to provide a kind of service quality routing performance evaluation method based on lineament.
Method proposed by the invention is characterised in that: it gives one group of weights (w that the k heavy phase is irrelevant mutually in every link e association earlier with calculating prow in the service quality route
1(e), w
2(e) ..., w
k(e)), i.e. the quality of service measures w (e) of link e is again based on the linear function of link
The routing problem of the multiple tolerance of the Internet is converted into the routing problem that can promptly have minimum energy value with the single tolerance that dijkstra's algorithm calculates, and wherein 1 is the sequence number of k severe amount, 1≤l≤k, a
l∈ [0,1] is with the irrelevant coefficient of link e and satisfies
It earlier on network topological diagram picked at random source node and destination node to (s, t), the principle that equals the linear energy function sum of each link on the path according to the path linear energy function from the source node to the destination node is set up the path with minimum energy value with dijkstra's algorithm again, and then the metric in this path as node to (s, the constraints c of quality of service request t), thus guarantee that the quality of service request that produces of simulating has feasible path.Its steps in sequence is as follows:
(1) use a computer the input every link have k severe value (w
1(e), w
2(e) ..., w
k(e)) the Internet topological diagram G;
(2) produce source node s, the destination node t of quality of service request at random, and guarantee (s, t) minimum hop count between (promptly from s to t the node number of process) is not less than 3;
(3) to all l=1,2 ..., k is at the equally distributed random number b of [0,1] interval generation
l~uniform (0,1) (i.e. [0,1] interval interior even distribution), order then
(4) energy value of every link of calculating
(5) according to above-mentioned energy value, with s be tree root calculate with energy value g (e) be evaluation criterion shortest path tree (Shortestpath tree, SPT);
(6) to arrive the path of t along this SPT from s, calculate each metric in this path.
Experimental results show that: this method of evaluating performance not only can simulate the quality of service request with practical significance, and the request of being simulated all has feasible path, thereby the performance index route success rate that can only be used for relative evaluation originally can be expanded to the absolute index contention, this method is surprised than the easier performance of telling between the algorithms of different of additive method simultaneously.
Description of drawings
Fig. 1. the method for evaluating performance flow chart
Fig. 2. method of evaluating performance operation instruction example
Fig. 3. the method for evaluating performance application result is for example
Embodiment
For convenience of description, we at first provide directed graph model and several definition.
(wherein V is a set of node for V, E) network of expression, and element v ∈ V is called the summit (node) of figure G with directed graph G; E is the arc collection, element e
Ij∈ E is designated as e=v
i→ v
jA limit that is called figure G.In QoSR, give one group of weights (w that is independent of each other in each link e association
1(e), w
2(e) ..., w
k(e)) QoS that is called link e measures, and is abbreviated as w (e).W wherein
l(e) ∈ R
+Be the tolerance of path constraint type, to 1≤l≤k.Just for path p=v
0→ v
1→ ... → v
n, weights
Satisfy additive property.
Definition 1: multiple constraint path
(V E), comprises the heavy weight w in source node s, destination node t and k 〉=2 for given directed graph G
k(e) ∈ R
+, and constrained vector c=(c
1, c
2..., c
k), the path p from s to t is called the multiple constraint path, if w
l(p)≤c
l,, be abbreviated as w (p)≤c to 1≤l≤k.□
W here (e) and c are the k dimensional vectors.And for given QoS request and restrictive condition c thereof, the main task of QoSR is exactly to seek the path p that meets the demands under current network state, makes w (p)≤c.
1. linear energy function
Dijkstra has provided the algorithm that calculates shortest path tree SPT (Shortest Path Tree) under the single tolerance, and has lower algorithm complex.Yet relate to for multiple limited service quality route QoSR (QoS Routing) problem and to consider multiple tolerance simultaneously, therefore cause problem become NP fully (being the polynomial time intangibility) complexity and can't use original algorithm.A kind of possible thinking of finding the solution is that multiple tolerance is converted into single tolerance.
Definition 2: linear energy function g
a
Make linear function
Be the energy function of link e, represent the value that expends of e.A wherein
l∈ [0,1] be the coefficient irrelevant with e (l=1,2 ..., k), and
, and will satisfy the vectorial a=(a of this condition
1, a
2..., a
k) be called energy coefficient.□
Based on such linear energy function, we are converted into the minimal energy path problem with original multiple constrained path problem.Each coefficient of energy function has then shown when calculating " optimal path ", the relative significance level that the pairing tolerance of this coefficient is compared with other tolerance.
Theorem 1: to minimize g
a(e) use dijkstra's algorithm for target, can set up with node s is the least energy tree T (g of root
a), satisfy along T (g
a) path p from s to any node t
TG is arranged
a(p
T)=min
P (s, t) ∈ Gg
a(p (s, t)).
Proof: because g
a(e) be linear function, satisfy
。So can at first calculate the energy value g of each link
a(e), then with single weights g
a(e) spend for keyword replaces the link in the former dijkstra's algorithm, use original algorithm to set up SPT as the source then with s.Because former algorithm can guarantee to have minimum cost from the path of s to any node along this SPT, therefore with g
a(e) be the algorithm assurance p of keyword
TBe the path from s to t, promptly with least energy
g
a(p
T)=min
p(s,t)∈Gg
a(p(s,t))。□
Energy coefficient a with satisfied definition 2 is an independent variable, and we set T (g with least energy
a) brief note is for T
a, and will be along T (g
a) path p from s to t
TBe designated as p
a
In the QoSR routing performance is estimated, even if we notice that source purpose to same network and QoS request is to collection { (s, t) }, as long as different distributions or different scopes are deferred in the generation of its constraints, the performance of algorithm is also with far from each other, and this also is to cause the algorithm of different documents to estimate the main cause that given data can't compare.Yet because Internet lacks typical structure, the constraints of QoS request more lacks enough understanding to future, therefore is difficult to provide rational model and distribution.A lot of QoS business are different to the degree of attentiveness of multiple tolerance on the path in the reality, and for example in order to improve the performance of file transfer, the importance that it has been generally acknowledged that Loss Rate is than postponing big several times.Based on this thought, we on the basis of normalization link metric, to given source purpose to (s, t) QoS request has designed the weight proportion simulation method for producing its constraints, the flow chart of this method is as shown in Figure 1.
At each source purpose to (s when t) producing QoS constraints, at first gets random number b
l~uniform[0,1] (i.e. [0,1] interval interior even distribution), order then
, a wherein
lFor being concerned about coefficient, represent that this QoS business is to w
lDegree of attentiveness.Thereby use linear energy function recited above
, calculate the energy value of every link.And then (s, t) (theorem 1) make this path pairing tolerance w (p (s at last to use dijkstra's algorithm to calculate the path p with minimum energy value from s to t, t)) be corresponding QoS request (s, constraints t), i.e. c (s, t)=w (p (s, t)).Because the QoS of structure request must have feasible path like this, therefore " route success rate " can be expanded in the evaluation to the absolute performance of algorithm.
For example, in the network shown in Fig. 2 .a, picked at random source purpose is to being that (s t), is that now it produces constraints.Get random number b
0=0, b
1=1, then be concerned about coefficient a
0=0, a
1=1, so linear energy function g (e)=w
1(e).When using dijkstra's algorithm, the target of optimization is for minimizing g (e)=w
1(e).For example wherein during the connection state of computing node c, find path g (sac)=7 and g (sbc)=10, (s t) is (sacdt), and energy value is 9, shown in Fig. 2 .b therefore to calculate the path p with minimum energy value from s to t.The metric in this path is (16,9), and therefore simulation has produced the QoS business that has constraints (16,9) from s to t.Obviously, path (sacdt) satisfies this constraints.
In addition, different care coefficients may cause different constraints.For example, get random number b
0=1, b
1=0, then be concerned about coefficient a
0=1, a
1=0, so linear energy function g (e)=w
0(e).(s t) is (sbcdt), and energy value is 12, shown in Fig. 2 .c to use dijkstra's algorithm to calculate the path p with minimum energy value from s to t.The metric in this path is (12,12), therefore is equivalent to produce the QoS business that has constraints (12,12) from s to t, and should business has a feasible path, i.e. (sbcdt) at least.
At present, we are applied to this routing performance evaluation method in the middle of the reality, adopt CPU and the 256MB internal memory of Pentium III 933MHz, experimental result as shown in Figure 3, wherein abscissa is represented the tolerance number of network, ordinate is represented the route success rate, and number of network node is respectively 50,100,200 and 500.The diagram result shows that use different algorithm or algorithm configuration, under this method of evaluating performance, algorithm performance can more significantly embody.Because quality-of-service based network is the inevitable direction of Internet development, and the router in the network just needs to use the QoSR algorithm for the support of QoS is provided, so the method for evaluating performance of QoSR algorithm also will be applied in the middle of the reality widely.
This shows that the present invention has reached intended purposes.
Claims (1)
1. based on the service quality routing performance evaluation method of lineament, it is characterized in that it contains successively and has the following steps:
(1) use a computer the input every link have k severe value (w
1(e), w
2(e) ..., w
k(e)) the Internet topological diagram G;
(2) produce source node s, the destination node t of quality of service request at random, and guarantee (s, t) minimum hop count between is not less than 3;
(3) to all l=1,2 ..., k is at the equally distributed random number b of [0,1] interval generation
l~uniform (0,1), order then
(4) energy value of every link of calculating
(5), be that tree root calculating is the shortest path tree of evaluation criterion with energy value g (e) with s according to above-mentioned energy value;
(6) to arrive the path of t along this shortest path tree from s, calculate each metric in this path.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CNB021599297A CN1195363C (en) | 2002-12-30 | 2002-12-30 | Method for evaluating route performances of quality of service based on linear structure |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CNB021599297A CN1195363C (en) | 2002-12-30 | 2002-12-30 | Method for evaluating route performances of quality of service based on linear structure |
Publications (2)
Publication Number | Publication Date |
---|---|
CN1416242A CN1416242A (en) | 2003-05-07 |
CN1195363C true CN1195363C (en) | 2005-03-30 |
Family
ID=4753359
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CNB021599297A Expired - Fee Related CN1195363C (en) | 2002-12-30 | 2002-12-30 | Method for evaluating route performances of quality of service based on linear structure |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN1195363C (en) |
Families Citing this family (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7111188B2 (en) * | 2003-07-31 | 2006-09-19 | International Business Machines Corporation | Dynamically configurable fault tolerance in autonomic computing with multiple service points |
ITTO20060149A1 (en) * | 2006-03-01 | 2007-09-02 | Cisco Tech Inc | TECHNIQUE FOR THE OPTIMIZED FLOW OF DATA FLOWS ON AN IP DORSAL IN A COMPUTER NETWORK. |
CN101321134B (en) * | 2008-07-21 | 2012-05-23 | 西安电子科技大学 | Service quality routing selection method under dynamic network condition |
CN116155790A (en) * | 2021-11-17 | 2023-05-23 | 中兴通讯股份有限公司 | Routing method, routing device, storage medium, and program product |
-
2002
- 2002-12-30 CN CNB021599297A patent/CN1195363C/en not_active Expired - Fee Related
Also Published As
Publication number | Publication date |
---|---|
CN1416242A (en) | 2003-05-07 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Dengiz et al. | Efficient optimization of all-terminal reliable networks, using an evolutionary approach | |
US20100058257A1 (en) | Topology optimization method using equivalent static loads | |
Mo et al. | A multiple-valued decision diagram based method for efficient reliability analysis of non-repairable phased-mission systems | |
Ding et al. | Fuzzy universal generating functions for multi-state system reliability assessment | |
Yeh et al. | OBDD-based evaluation of k-terminal network reliability | |
Won et al. | Cumulative update of all-terminal reliability for faster feasibility decision | |
CN105701568B (en) | A kind of didactic distribution network status estimation adjustment location fast Optimization | |
CN1195363C (en) | Method for evaluating route performances of quality of service based on linear structure | |
Yeh | A sequential decomposition method for estimating flow in a multi-commodity, multistate network | |
CN113630171A (en) | Satellite network k-terminal reliability analysis method based on QoS | |
CN116484175A (en) | Power battery usage data repairing system and method | |
CN1195364C (en) | Adjustable heuristic routing method of quality of service based on width first search | |
CN112380606B (en) | Method for evaluating importance of components and vulnerability of system in civil structure system | |
CN111756587B (en) | Method for predicting time sequence network link by using GraphSAGE | |
CN107204616B (en) | Power system random state estimation method based on self-adaptive sparse pseudo-spectral method | |
Tang et al. | QoS information approximation for aggregated networks | |
Terruggia | Reliability analysis of probabilistic networks | |
CN108400907B (en) | Link packet loss rate reasoning method under uncertain network environment | |
Hayhurst et al. | A factoring approach for the stochastic shortest path problem | |
Brunat et al. | Computing the canonical representation of constructible sets | |
CN105721196A (en) | Link importance evaluation method of directed communication network | |
Gu et al. | Optimizing distributed computing workflows in heterogeneous network environments | |
Mukhamejanova et al. | Traffic simulation in the LoRaWAN network | |
Green et al. | A fast algorithm for incremental betweenness centrality | |
CN115579896A (en) | Power grid load flow calculation method for checking path pureness and physical realizability |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
C06 | Publication | ||
PB01 | Publication | ||
C10 | Entry into substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
C14 | Grant of patent or utility model | ||
GR01 | Patent grant | ||
C19 | Lapse of patent right due to non-payment of the annual fee | ||
CF01 | Termination of patent right due to non-payment of annual fee |