CN105207804B - A kind of real-time estimating method for service path stability - Google Patents
A kind of real-time estimating method for service path stability Download PDFInfo
- Publication number
- CN105207804B CN105207804B CN201510507224.6A CN201510507224A CN105207804B CN 105207804 B CN105207804 B CN 105207804B CN 201510507224 A CN201510507224 A CN 201510507224A CN 105207804 B CN105207804 B CN 105207804B
- Authority
- CN
- China
- Prior art keywords
- node
- service path
- path
- service
- stability
- 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
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The present invention relates to a kind of real-time estimating methods for service path stability, belong to information service field.The present invention includes stability influence power of the quantity to service path chosen service path to be calculated first, then calculate link node present in service path；Stability influence power of the processing capacity to service path of all link nodes is calculated again, then calculates influence power of the associated path to service path of all link nodes；Finally the stability of service path is calculated.The present invention passes through the quantity to connecting node in service path, the ability of each node processing service response and three elements of response demand of each node associated path consider, obtain the relative value of the stability of service path, for for service path selection and to the improvement of service path.
Description
Technical field
The present invention relates to a kind of real-time estimating methods for service path stability, belong to information service field.
Background technology
For user when carrying out requirement request, service system itself has a plurality of service path available, and user wishes
The service response process stable to one, so the quantum chemical method for how carrying out stability to a plurality of service path is our needs
The problem of research.
Existing many achievements are studied service path stability, but to the associated path pair of link node
The research of service path stability influence is seldom, and it is one how associated path to be introduced into the influence to service path stability
Important research topic.
Invention content
The present invention provides a kind of real-time estimating methods for service path stability, for for servicing road
The selection and improvement of diameter.
The present invention is realized in for the real-time estimating method of service path stability：
A, the routing information of the service path of stability to be assessed is obtained：
There are a plurality of response paths between demand node and response node, and the service stability of every service path is different,
Obtain the routing information of the service path of stability to be assessed；
B, stability influence power of the quantity to service path of link node present in service path is calculated：
The quantity of link node is G=2n to the stability influence power of service path, and wherein n is the connection knot of service path
Points do not include demand node；Wherein every service response path has multiple service link nodes, each node that can exist
Loss, it can lead to the unstable of service link or interrupt, therefore included link node in each service path is got over
More existing latent instabilities are higher；
C, stability influence power of the processing capacity to service path of each link node is calculated：
If link node L={ a, b, c, d, e, f, g }, service detection signal node H, node H are with identical request speed
Node into node set L sends requirement request V times, after undergoing the t times, obtains the backlog of requests number and hair of each node
Request the ratio between sum R, the processing capacity of all link nodes is sent to be to the stability influence power of service pathWherein
N is the link node number of service path, RiThe backlog of requests number and transmission for indicating node i ask the ratio between sum；
The speed that different node handles service request signal within the unit interval is different, if demand node node is in certain section
Service request is sent out to response node on a large scale in time, if the processing speed of node is slower, will produce a large amount of service letter
The congestion of breath leads to the collapse of node.
D, influence power of the associated path to service path of each link node is calculated：
If the service path collection that node O is connected is combined into D, m element is shared；Then the associated path of node O is to servicing road
The stability influence of diameter isd′iFor node O institute's Connection Services path diIncluded node quantity, all connections
The associated path of node is to the influence power of service pathWherein n is the link node number of service path, jiIt indicates
Stability influence value of the associated path of node i to service path；
E, last quantum chemical method is carried out to the stability of service path：
Calculate the overall stability T=GFK of service path, wherein the value of T is bigger, and the stability of service path is poorer, more holds
It is vulnerable to interference.
The ability that each node handles service response is calculated by service detection signal node.
Consider influence of the associated path of link node to service path stability.
The beneficial effects of the invention are as follows：By the quantity to link node in service path, each node processing service is rung
Considering for three elements of response demand of the ability and each node associated path answered, obtains the stability of service path
Relative value, for for service path selection and to the improvement of service path.
Description of the drawings
Fig. 1 is the flow chart in the present invention；
Fig. 2 is the service path figure of a response that may be implemented of the invention.
Specific implementation mode
Embodiment 1：As shown in Figure 1, a kind of real-time estimating method for service path stability,
A, the routing information of the service path of stability to be assessed is obtained：
There are a plurality of response paths between demand node and response node, and the service stability of every service path is different,
Obtain the routing information of the service path of stability to be assessed；
B, stability influence power of the quantity to service path of link node present in service path is calculated：
The quantity of link node is G=2n to the stability influence power of service path, and wherein n is the connection knot of service path
Points do not include demand node；Wherein every service response path has multiple service link nodes, each node that can deposit
It is being lost, it can lead to the unstable of service link or interrupt, therefore included link node in each service path
More existing latent instabilities are higher；
C, stability influence power of the processing capacity to service path of each link node is calculated：
If link node L={ a, b, c, d, e, f, g }, service detection signal node H, node H are with identical request speed
Node into node set L sends requirement request V times, after undergoing the t times, obtains the backlog of requests number and hair of each node
Request the ratio between sum R, the processing capacity of all link nodes is sent to be to the stability influence power of service pathWherein
N is the link node number of service path, RiThe backlog of requests number and transmission for indicating node i ask the ratio between sum；
The speed that different node handles service request signal within the unit interval is different, if demand node node is in certain section
Service request is sent out to response node on a large scale in time, if the processing speed of node is slower, will produce a large amount of service letter
The congestion of breath leads to the collapse of node.
D, influence power of the associated path to service path of each link node is calculated：
If the service path collection that node O is connected is combined into D, m element is shared；Then the associated path of node O is to servicing road
The stability influence of diameter isd′iFor node O institute's Connection Services path diIncluded node quantity, all connections
The associated path of node is to the influence power of service pathWherein n is the link node number of service path, jiIt indicates
Stability influence value of the associated path of node i to service path；
E, last quantum chemical method is carried out to the stability of service path：
Calculate the overall stability T=GFK of service path, wherein the value of T is bigger, and the stability of service path is poorer, more holds
It is vulnerable to interference.
Embodiment 2：As shown in Figs. 1-2, a kind of real-time estimating method for service path stability,
The method is as follows：
A, the routing information of the service path of stability to be assessed is obtained：
There are a plurality of response paths between demand node and response node, and the service stability of every service path is different,
Obtain the routing information of the service path of stability to be assessed；
B, stability influence power of the quantity to service path of link node present in service path is calculated：
The quantity of link node is G=2n to the stability influence power of service path, and wherein n is the connection knot of service path
Points do not include demand node；Wherein every service response path has multiple service link nodes, each node that can exist
Loss, it can lead to the unstable of service link or interrupt, therefore included link node in each service path is got over
More existing latent instabilities are higher；
C, stability influence power of the processing capacity to service path of each link node is calculated：
If link node L={ a, b, c, d, e, f, g }, service detection signal node H, node H are with identical request speed
Node into node set L sends requirement request V times, after undergoing the t times, obtains the backlog of requests number and hair of each node
Request the ratio between sum R, the processing capacity of all link nodes is sent to be to the stability influence power of service pathWherein
N is the link node number of service path, RiThe backlog of requests number and transmission for indicating node i ask the ratio between sum；
The speed that different node handles service request signal within the unit interval is different, if demand node node is in certain section
Service request is sent out to response node on a large scale in time, if the processing speed of node is slower, will produce a large amount of service letter
The congestion of breath leads to the collapse of node.
D, influence power of the associated path to service path of each link node is calculated：
If the service path collection that node O is connected is combined into D, m element is shared；Then the associated path of node O is to servicing road
The stability influence of diameter isd′iFor node O institute's Connection Services path diIncluded node quantity, all connections
The associated path of node is to the influence power of service pathWherein n is the link node number of service path, jiIt indicates
Stability influence value of the associated path of node i to service path；
E, last quantum chemical method is carried out to the stability of service path：
Calculate the overall stability T=GFK of service path, wherein the value of T is bigger, and the stability of service path is poorer, more holds
It is vulnerable to interference.
The ability that each node handles service response is calculated by service detection signal node.
Consider influence of the associated path of link node to service path stability.
Step s1：Obtain the routing information of the service path of stability to be assessed：
There are a plurality of response paths between demand node and response node, when carrying out service response, because of every service road
The service stability of diameter is different, can carry out calculating the service road for obtaining stability to be assessed to the service stability of each path
The routing information of diameter chooses probing into for the path progress service stability that service response may be implemented.
Step s2：Calculate stability influence power of the quantity to service path of link node present in service path：
There are multiple service link nodes in every service response path, because each node can have loss, it can lead
It causes the unstable of service link or interrupts, dive so link node included in each service path is more existing
It is higher in unstability.The quantity of link node is G=2n to the stability influence power of service path, and wherein n is link node
Sum (do not include demand node).
Example 1：The service path of one response that may be implemented such as Fig. 2：
This service path link node sum is 6, then stability influence of the quantity of link node to service path
Power is G=2n=12.
Step s3：Calculate stability influence power of the processing capacity to service path of each link node：
The speed that different node handles service request signal within the unit interval is different, if demand node node is in certain section
Service request is sent out to response node V times, if the processing speed of node is slower, will produce a large amount of service on a large scale in time
The congestion of information leads to the collapse of node.
If link node L={ a, b, c, d, e, f, g }, service detection signal node H, node H are with identical request speed
Node into node set L sends requirement request, after undergoing the t times, obtains backlog of requests number and the transmission of each node
Ask the ratio between sum R.The processing capacity of all link nodes is to the stability influence power of service pathWherein n
For the link node number of service path, RiThe backlog of requests number and transmission for indicating node i ask the ratio between sum.
Link node 2 in example 1,3,4,5,6,7 carry out processing service response aptitude tests, suspend node 2,3,4,5,6,
7 information service.Service detection signal node H is chosen, requirement request is sent to node 2,3,4,5,6,7 with identical speed
1000 times (transmission speed is much larger than the processing speed of each node, ignores information transfer time), after 10s, interception is each
The processing information of node obtains the processed information request amount of each node.
One node of table handles information content
| Node number | 2 | 3 | 4 | 5 | 6 | 7 |
| Treating capacity | 400 | 450 | 200 | 430 | 320 | 600 |
Then the processing capacity of link node is to the stability influence of service path
Step s4：Calculate influence power of the associated path to service path of each link node：
The a plurality of different service path of each Node connectedness, so the service path of Node connectedness is more, at node
The information on services amount of reason is higher.
If the service path collection that node O is connected is combined into D, m element is shared；Then the associated path of node O is to servicing road
The stability influence of diameter isd′iFor node O institute's Connection Services path diIncluded node quantity.All connections
The associated path of node is to the influence power of service pathWherein n is the link node number of service path, jiIt indicates
Stability influence value of the associated path of node i to service path.
The data of other associated paths by link node are obtained in example 1.
The associated path data of two node of table
| Node number | The quantity of associated path | The nodal point number of every associated path |
| 2 | 4 | 10,8,6,8 |
| 3 | 2 | 6,6 |
| 4 | 1 | 4 |
| 5 | 1 | 8 |
| 6 | 3 | 4,4,5 |
| 7 | 2 | 5,3 |
Then influence of the associated path of all link nodes to service path be
Step s5：Last quantum chemical method is carried out to the stability of service path：
Calculate the overall stability T=GFK of service path.The value of T is bigger, and the stability of service path is poorer, it is easier by
To interference.
In example 1, G=12, F=3.6, K=2.458, then overall stability T=GFK=12 × 3.6 of last service path
× 2.458=106.1856.
Field of industrial production will can often build the service path between two new nodes, in conjunction with already present
It is available that the case where node, has mulitpath, it is intended that more more stable better when signal transmits in service path.Most manage
The case where thinking is the signal testing at full capacity all carried out to each paths in a period of time, but spends the time more, at
This is higher.Tradition selection is generally acknowledged that the fewer stability of intermediate node in a service roadbed is higher, but in actual conditions
It is lower and exactly so.Our experimental simulations at different conditions when legacy paths selection and this method Path selection at full capacity
Signal testing under Path selection comparable situation.
The comparison of three distinct methods of table and Path selection under signal testing at full capacity
| Distinct methods | It is selected with service path under signal testing at full capacity mutually unison |
| Conventional method | 86% |
| The method designed herein | 91% |
Conventional method refers to the method for carrying out Path selection using only single pass number of nodes, it may be seen that logical
Improvement conventional method is crossed, is added to after the considering of the associated path of the processing capacity and link node of link node, setting herein
The mutually unison higher of the selection of service path of the method for meter compared to conventional method under signal testing at full capacity, i.e., herein
Method is better than conventional method in the selection in service path.
The specific implementation mode of the present invention is explained in detail above in conjunction with attached drawing, but the present invention is not limited to above-mentioned
Embodiment within the knowledge of a person skilled in the art can also be before not departing from present inventive concept
Put that various changes can be made.
Claims (1)
1. a kind of real-time estimating method for service path stability, it is characterised in that：It is described to be directed to service path stability
Real-time estimating method be as follows：
A, the routing information of the service path of stability to be assessed is obtained：
There are a plurality of service paths between demand node and response node, and the stability of every service path is different, obtains to be evaluated
Estimate the routing information of the service path of stability；
B, stability influence power of the quantity to service path of link node present in service path is calculated：
The quantity of link node is G=2n to the stability influence power of service path, and wherein n is the link node of service path
Number does not include demand node；Wherein every service path has multiple link nodes, each node that can have loss, its meeting
Lead to the unstable of service path or interrupt, therefore included in each service path link node is more existing
Latent instability it is higher；
C, stability influence power of the processing capacity to service path of each link node is calculated：
If link node L={ a, b, c, d, e, f, g }, service detection signal node H, node H are with identical request speed to knot
Each node in point set L sends request V times, after undergoing the t times, obtains backlog of requests number and the transmission of each node
The ratio between request sum R, the processing capacity of all link nodes are to the stability influence power of service pathWherein n
For the link node number of service path, RiThe backlog of requests number and transmission for indicating node i ask the ratio between sum；
D, influence power of the associated path to service path of each link node is calculated：
If the service path collection that node i is connected be combined into d=d | d=di, 0 ＜ i≤m }, share m element；The then pass of node i
Connection path is to the stability influence of service pathdi' for node i institute's Connection Services path diIncluded node
The associated path of quantity, all link nodes is to the influence power of service pathWherein n is the connection of service path
Nodal point number, jiIndicate stability influence value of the associated path to service path of node i；
E, last quantum chemical method is carried out to the stability of service path：
Calculate service path overall stability T=GFK, wherein the value of T is bigger, and the stability of service path is poorer, it is easier by
To interference.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510507224.6A CN105207804B (en) | 2015-08-18 | 2015-08-18 | A kind of real-time estimating method for service path stability |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510507224.6A CN105207804B (en) | 2015-08-18 | 2015-08-18 | A kind of real-time estimating method for service path stability |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105207804A CN105207804A (en) | 2015-12-30 |
| CN105207804B true CN105207804B (en) | 2018-08-10 |
Family
ID=54955257
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510507224.6A Active CN105207804B (en) | 2015-08-18 | 2015-08-18 | A kind of real-time estimating method for service path stability |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105207804B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113037628B (en) * | 2021-03-03 | 2022-11-22 | 上海天旦网络科技发展有限公司 | Method, system and medium for automatically discovering service path |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101119303A (en) * | 2007-08-30 | 2008-02-06 | 浙江工业大学 | Dynamic cluster based multi-objective programming wireless sensing network routing algorithm |
| CN101242431A (en) * | 2008-01-21 | 2008-08-13 | 北京航空航天大学 | Layer-cross mobile Ad Hoc network service discovery method |
| EP2395792A1 (en) * | 2009-02-09 | 2011-12-14 | Nec Corporation | Path control system, path control device, communication device, path control method, and program |
| CN103259744A (en) * | 2013-03-26 | 2013-08-21 | 北京航空航天大学 | Method for mapping mobile virtual network based on clustering |
| CN103647715A (en) * | 2013-11-21 | 2014-03-19 | 山东大学 | An MANET-access-Internet self-adaptive gateway discovery algorithm based on gateway information elements |
-
2015
- 2015-08-18 CN CN201510507224.6A patent/CN105207804B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101119303A (en) * | 2007-08-30 | 2008-02-06 | 浙江工业大学 | Dynamic cluster based multi-objective programming wireless sensing network routing algorithm |
| CN101242431A (en) * | 2008-01-21 | 2008-08-13 | 北京航空航天大学 | Layer-cross mobile Ad Hoc network service discovery method |
| EP2395792A1 (en) * | 2009-02-09 | 2011-12-14 | Nec Corporation | Path control system, path control device, communication device, path control method, and program |
| CN103259744A (en) * | 2013-03-26 | 2013-08-21 | 北京航空航天大学 | Method for mapping mobile virtual network based on clustering |
| CN103647715A (en) * | 2013-11-21 | 2014-03-19 | 山东大学 | An MANET-access-Internet self-adaptive gateway discovery algorithm based on gateway information elements |
Non-Patent Citations (1)
| Title |
|---|
| 基于路径稳定性及协议离差分析的网络性能优化研究;王晓燕;《福建电脑》;20121125(第11期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105207804A (en) | 2015-12-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103870340B (en) | Data processing method, control node and stream calculation system in stream calculation system | |
| Gao et al. | Disease transmission models with density-dependent demographics | |
| CN103763174B (en) | Virtual network mapping method based on function block | |
| Wolfe et al. | Modeling a million-node slim fly network using parallel discrete-event simulation | |
| JP6753874B2 (en) | Distributed deep learning system | |
| CN106845137A (en) | A kind of sacred disease analysis method based on brain network structure | |
| Avrachenkov et al. | Beta current flow centrality for weighted networks | |
| CN105488581B (en) | A kind of transport need amount estimation method based on simulated annealing | |
| CN108880846A (en) | The method and device of vector representation is determined for nodes | |
| CN106789161A (en) | A kind of RapidIO routing configuration devices and method based on VPX systems | |
| Hajek et al. | Community recovery in a preferential attachment graph | |
| CN108076103A (en) | A kind of message treatment method, system and message producer's cluster | |
| CN105808454A (en) | Method and device for accessing to shared cache by multiple ports | |
| CN108574594B (en) | Method and system for transmitting network service | |
| CN105207804B (en) | A kind of real-time estimating method for service path stability | |
| CN109587072A (en) | Distributed system overall situation speed limiting system and method | |
| CN105071963A (en) | Multi-service traffic estimation method facing big data Internet | |
| CN108123891A (en) | The dynamic load balancing method realized in SDN network using distributed domain controller | |
| JP7001004B2 (en) | Distributed deep learning system, distributed deep learning method, and computing interconnect device | |
| CN106354552A (en) | Parallel Computer Task Distribution Method and Device | |
| JP2015228545A (en) | Information processing device and program | |
| CN108833162A (en) | A kind of network node sort method and mapping method of virtual network | |
| CN111379965B (en) | Memory, hydrogen system optimization method, device and equipment | |
| CN105978714B (en) | The expansion planning method and expansion planning system of Internet data center | |
| Niu et al. | Study on a new model for network traffic matrix estimation |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |