CN109327388A - A kind of network path difference quantitative evaluation method of service-oriented - Google Patents
A kind of network path difference quantitative evaluation method of service-oriented Download PDFInfo
- Publication number
- CN109327388A CN109327388A CN201811480390.1A CN201811480390A CN109327388A CN 109327388 A CN109327388 A CN 109327388A CN 201811480390 A CN201811480390 A CN 201811480390A CN 109327388 A CN109327388 A CN 109327388A
- Authority
- CN
- China
- Prior art keywords
- channel
- path
- service
- node
- network
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
- H04L45/123—Evaluation of link metrics
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
- H04L45/124—Shortest path evaluation using a combination of metrics
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/30—Routing of multiclass traffic
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/70—Routing based on monitoring results
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a kind of network path difference quantitative evaluation methods of service-oriented, are related to field of communication technology.Firstly, determining the network topological diagram of business demand, and for the source node v in topological diagramsWith destination node vt, determine the practical business channel pathB that information is transmitted between two nodes；Different routing measurement indexs is selected simultaneously, a service channel is selected to each index, the service channel under all indexs constitutes service channel set pathA.For service channel set pathA and practical business channel pathB, the line set that each channel is included is determined respectively, sequence node set and edge sequence correspond to the set of weight, find out in service channel set pathA each channel respectively with practical business channel pathst_jBetween coincidence factor, carry out the quantitative assessment of network path difference.The invention enables the practical business channels in network quantitative evaluation, to improve network environment, improves network resource utilization and provides the direction of a change.
Description
Technical field
The present invention relates to field of communication technology, the network path difference quantitative assessment side of specifically a kind of service-oriented
Method.
Background technique
Service path selection is always to need to consider the problems of in detail in network communication, classical graph theory and has been continued to develop
Effective combination of kind computer data structure and algorithm, so that the algorithm about service path selection continuously emerges.They
Space complexity, time complexity, easy implementation and application range etc. are with their own characteristics.
Currently, having there is a large amount of document to study network path selection problem, to the measurement master of network routing
There are path length, reliability, time delay, bandwidth, load and communications cost etc., in conjunction with measurement index, occurs many accordingly
Classical algorithm and its innovatory algorithm, such as constraint-based routing algorithm, dijkstra's algorithm and negative Circuit Algorithms.
Very fast to transmit information, we are using the time delay in path as the measurement standard of routing；For make information transmission at
This is lower, we can select shortest path.But real network routing in, not be simply with most short time-delay or least cost determine
The selection of network routing is determined, service-oriented considers the factors such as time delay and cost, the universality and practicability of boosting algorithm simultaneously
It is the standard that we select network to route.It is therefore desirable to which the service-oriented network routing to a certain fixation carries out quantitative assessment.
Summary of the invention
The present invention, will in view of the above-mentioned problems, propose a kind of network path difference quantitative evaluation method of service-oriented
The side in channel is showed in network route selection with aggregate form, by line set, is calculated the coincidence factor in channel, is carried out network
Path difference quantitative assessment can route the qualitative assessment for carrying out more optimization aims to business network, also certainly for subsequent intelligence
The dynamic network optimization provides data foundation, can also carry out depth iterative analysis to artificial network optimization empirical data.
Specific step is as follows:
Step 1: determining the network topological diagram G={ V, E } of the business, and in topological diagram according to some business demand
Source node vsWith destination node vt, determine the practical business channel pathB that information is transmitted between two nodes.
Topological interior joint collection is combined into V={ v1,v2,....vi..., viIndicate the node that number is i,
Line set in topologyFor from node viTo node vjDirect-connected directed edge；
Practical business channel pathB is denoted as pathst_j；pathst_jIt indicates from source node vsTo destination node vtBetween jth
Feasible channel, is joined end to end by several sides, not repeatedly side or node.
Step 2: under No Assets restrictive condition, different routing measurement indexs is selected, to every according to the business demand
A kind of index selects a service channel, and the service channel under all indexs constitutes service channel set pathA；
Routing measurement index includes minimal time delay, shortest path, reliability, bandwidth, load and communications cost etc..
Service channel set pathA is indicated are as follows: { pathst_1,pathst_2,...pathst_i,...}。pathst_iIndicate from
Source node vsTo destination node vtBetween i-th feasible channel and the corresponding channel of i-th of routing measurement index.
Step 3: being determined respectively for each channel and practical business channel pathB in service channel set pathA
The line set that each channel is included, sequence node set and edge sequence correspond to the set of weight.
Sequence node set in every channel is arranged according to the sequence from source node to destination node；
Channel pathst_iLine set Est_iMiddle element is the direct-connected directed edge of node-to-node, and each element is according to from source
The sequence of node to destination node arranges；ElementIt is set Est_iIn kth directed edge.
Similarly, channel pathst_jLine set be Est_j。
Channel pathst_iThe collection that middle edge sequence corresponds to weight is combined intowkiIt is sideIt is corresponding
Weight.
Channel pathst_jThe collection that middle edge sequence corresponds to weight is combined intowkjIt is sideIt is corresponding
Weight.
Step 4: corresponding to the set of weight according to line set and edge sequence, finds out in service channel set pathA and each lead to
Road respectively with practical business channel pathst_jBetween coincidence factor.
Specific step is as follows:
Step 401 chooses service channel one by one from set pathA, calculates current business channel pathst_iLine set
With practical business channel pathst_jLine set intersection, be denoted as Est_i,j=Est_i∩Est_j；
Step 402, with channel pathst_iAs channel is measured, intersection E is calculatedst_i,jThe set of corresponding weight；
The corresponding weight collection of intersection is combined into
Step 403, according to intersection Est_i,jCorresponding weight set calculates practical business channel pathst_jAnd current business
Channel pathst_iBetween coincidence factor；
Calculation formula is as follows:
Coincidence factor refers to: the sum of the corresponding weight of same edge and current channel path between two channelsst_iSide it is corresponding
Weight and between ratio.
Step 404 judges whether the service channel in set pathA has taken, if it is, terminating algorithm；Otherwise
Return step 401 selects next service channel to continue to calculate and practical business channel pathst_jBetween coincidence factor.
Step 5: according to each channel in service channel set pathA respectively with practical business channel pathst_jBetween
Coincidence factor carries out the quantitative assessment of network path difference；
Specific evaluation procedure are as follows:
Step 501 averages all coincidence factors acquired, judges whether the average value is lower than threshold value A, if so,
Enter step 502；Otherwise, 503 are entered step；
Threshold value A is manually set according to practical business demand.
Step 502 illustrates network there may be problem, and bandwidth chahnel is smaller to be likely to result in practical business channel pathB
Larger with the service channel gap in service channel set pathA, overall thinking promotes network performance；
Step 503, the channel that the coincidence factor lower than threshold value B is judged whether there is from the service channel in set pathA are deposited
, if so, optimization practical business channel pathB is then removed in terms of the measurement index of the coincidence factor corresponding channel lower than threshold value,
Otherwise, practical business channel pathB performance is advantageous.
Threshold value B is manually set according to practical business demand.
The present invention has the advantages that 1), a kind of network path difference quantitative evaluation method of service-oriented, according to towards
The network topological diagram of business, using graph theory and probabilistic knowledge, by algorithms of different difference measurement index obtain slave source node to place
Feasible channel between node, is converted into set expression, and calculates the coincidence factor in channel, carrys out quantitative analysis path network routing letter
The otherness of breath.
2) a kind of, the network path difference quantitative evaluation method of service-oriented, for different business demands, selection is not
Same algorithm network routing, to improve network environment, improves net so that there is quantitative evaluation in the practical business channel in network
Network resource utilization provides the direction of a change.
Detailed description of the invention
Fig. 1 is a kind of flow chart of the network path difference quantitative evaluation method of service-oriented of the present invention；
Fig. 2 is the flow chart that the present invention calculates each channel coincidence factor between practical business channel respectively；
Fig. 3 is the network topological diagram of service-oriented described in embodiment of the present invention.
Specific embodiment
Below in conjunction with drawings and examples, the present invention is described in further detail.
It is in the prior art the network routing for determining service-oriented, many algorithms can achieve requirement.The present invention passes through true
Fixed a certain algorithm network routing, a certain measurement index represent channel information in network route results in the form of edge sequence
Come, the coincidence factor of any two passes can be calculated.Consider realistic meaning, it is ensured that realize identical business demand to be needed
The channel to be compared, and realize that the individual channel source node of information transmitting is identical with destination node, realize the calculation of identical services demand
Method can be arbitrary.With the coincidence factor in channel is obtained, the network path difference quantitative assessment of service-oriented is carried out, for determination
Comprehensive measurement index provides quantitative evaluation method in real network.
As shown in Figure 1, the specific steps are as follows:
Step 1: determining the network topological diagram G={ V, E } of the business, and in topological diagram according to some business demand
Source node vsWith destination node vt, determine the practical business channel pathB that information is transmitted between two nodes.
Topological interior joint collection is combined into V={ v1,v2,....vi...vn, viIndicate the node that number is i, n is number of nodes.
Line set in topologyFor from node viTo node vjDirect-connected directed edge；If section
Point viTo node vjThere are a plurality of direct-connected sides, then need first to be merged into a line, if node viTo node vjBetween there is no direct-connected
Side, then without corresponding side element.
Practical business channel pathB is denoted as pathst_j；pathst_jIt indicates from source node vsTo destination node vtBetween jth
Feasible channel, is joined end to end by several sides, not repeatedly side or node.
In emulation, to practical business, resource constraint is considered, the possible congestion in the channel elected, i.e. pathB is sky, directly
Terminate this Quantitative Evaluation Algorithm；Or this business physical channel is exported to be empty as prompt；Otherwise, subsequent step is carried out.
Step 2: under No Assets restrictive condition, different routing measurement indexs is selected, to every according to the business demand
A kind of index selects a service channel, and the service channel under all indexs constitutes service channel set pathA；
Routing measurement index includes minimal time delay, shortest path, reliability, bandwidth, load and communications cost etc..
Service channel set pathA is indicated are as follows: { pathst_1,pathst_2,...pathst_i,...}。pathst_iIndicate from
Source node vsTo destination node vtBetween i-th feasible channel and the corresponding channel of i-th of routing measurement index.
Step 3: being determined respectively for each channel and practical business channel pathB in service channel set pathA
The line set that each channel is included, sequence node set and edge sequence correspond to the set of weight.
Sequence node set in every channel is arranged according to the sequence from source node to destination node；
Channel pathst_iLine set Est_iMiddle element is the direct-connected directed edge of node-to-node, and each element is according to from source
The sequence of node to destination node arranges；ElementIt is set Est_iIn kth directed edge.
Similarly, channel pathst_jLine set be Est_j。
Channel pathst_iThe collection that middle edge sequence corresponds to weight is combined intowkiIt is sideIt is corresponding
Weight is the scalar of additive property.
Channel pathst_jThe collection that middle edge sequence corresponds to weight is combined intowkjIt is sideIt is corresponding
Weight.
Step 4: corresponding to the set of weight according to line set and edge sequence, finds out in service channel set pathA and each lead to
Road respectively with practical business channel pathst_jBetween coincidence factor.
As shown in Figure 2, the specific steps are as follows:
Step 401 chooses service channel one by one from set pathA, calculates current business channel pathst_iLine set
With practical business channel pathst_jLine set intersection, be denoted as Est_i,j=Est_i∩Est_j；
Step 402, with channel pathst_iAs channel is measured, intersection E is calculatedst_i,jThe set of corresponding weight；
The corresponding weight collection of intersection is combined into
Step 403, according to intersection Est_i,jCorresponding weight set calculates practical business channel pathst_jAnd current business
Channel pathst_iBetween coincidence factor Pst_i,j；
Calculation formula is as follows:
Coincidence factor refers to: the sum of the corresponding weight of same edge and current channel path between two channelsst_iSide it is corresponding
Weight and between ratio.
The practical significance that weight set represents is determined by algorithm network routing.
Step 404 judges whether the service channel in set pathA has taken, if it is, terminating algorithm；Otherwise
Return step 401 selects next service channel to continue to calculate and practical business channel pathst_jBetween coincidence factor.
According under same input condition (topological structure and business demand), business physical channel pathB and nothing are judged
Different channel selecting algorithms obtain whether different service channels all compared under resource constraint, determine to execute step.Here it is
By the algorithm of comparison in need all select corresponding service channel and be compared with practical business channel.
Algorithms of different may consider different optimization aims, or be limited by different constraint condition
Step 5: according to each channel in service channel set pathA respectively with practical business channel pathst_jBetween
Coincidence factor carries out network path difference comprehensive quantitative evaluation；
Two passes are called every time, carry out the quantitative analysis of network route information otherness, and it is logical can to obtain practical business
Superiority and inferiority of the road under a kind of algorithm and measurement index, by the way that all coincidence factors acquired are averaged, if average value is lower
Words then illustrate network there may be problem, and bandwidth chahnel is smaller to be likely to result in practical business channel and obtain at algorithm A
Service channel gap is larger, can promote network performance with overall thinking；If only other coincidence factor is lower, the business
Away from larger, this also provides one to promote network performance and changes the channel difference that channel only has some aspects performance and algorithm A to obtain
Kind direction.Specific evaluation procedure are as follows:
Step 501 averages all coincidence factors acquired, judges whether the average value is lower than threshold value A, if so,
Enter step 502；Otherwise, 503 are entered step；
Threshold value A is manually set according to practical business demand.
Step 502 illustrates network there may be problem, and bandwidth chahnel is smaller to be likely to result in practical business channel pathB
Larger with the service channel gap in service channel set pathA, overall thinking promotes network performance；
Step 503, the channel that the coincidence factor lower than threshold value B is judged whether there is from the service channel in set pathA are deposited
, if so, optimization practical business channel pathB is then removed in terms of the measurement index of the coincidence factor corresponding channel lower than threshold value,
Otherwise, practical business channel pathB performance is advantageous.
Threshold value B is manually set according to practical business demand.
Each channel and practical business channel pathB in the present invention in service channel set pathA are arbitrary network road
By channel.Algorithm network routing is arbitrary network routing algorithm, and routing measurement index is that arbitrary network routes measurement condition.
Consider practical significance, each channel and practical business channel pathB in set pathA will be in similarly input items
It is obtained under part, record does not consider that system or capacity of trunk limitation, that is, routing do not distribute the result of resource as set
Channel in pathA；Algorithm is pathB to the network router-level topology result of each business after considering constraint, and algorithms of different may
Consider different optimization aims, or is limited by different constraint condition.
As shown in figure 3, illustrating this method for lifting two kinds of channel selecting algorithms；The calculating side of the channel information coincidence factor
Method is suitable for any channel selecting algorithm.
It first according to business demand, determines network topology G={ V, E }, topological interior joint collection is combined into V={ vs,v1,v2,v3,
vt, line setAssuming that some business need is from source node vsTo destination node vtInformation is transmitted,
Assuming that practical business channel pathst_1It indicates, V1={ vs,v2,v3,vtIt is channel pathst_1Interior joint arrangement set,It is channel pathst_1Middle edge sequence set, Wst_1={ 1,1,2 } are channel pathst_1Middle edge sequence pair
Answer the set of weight；
Under same input condition, the service path for calling shortest path algorithm network routing to obtain is pathst_2, V2
={ vs,v1,vtIt is channel pathst_2Interior joint arrangement set,It is channel pathst_2Middle edge sequence set,
Wst_2={ 1,1 } indicate channel pathst_2Middle edge sequence corresponds to the set of weight；
Under same input condition, the service path for calling minimal time delay algorithm network routing to obtain is pathst_3, V3
={ vs,v2,vtIt is channel pathst_3Interior joint arrangement set,It is channel pathst_3Middle edge sequence set,
Wst_3={ 1,2 } indicate channel pathst_3Middle edge sequence corresponds to the set of weight；
By practical business channel pathst_1With the service channel path obtained according to shortest path algorithm network routingst_2Into
Row network path difference quantitative assessment, the edge sequence set intersection of the two are denoted as Est_1,2=Est_1∩Est_2, edge sequence set
The set that intersection corresponds to weight is denoted asThen from source node vsTo destination node vtBetween the 1st article
Channel pathst_1With the 2nd article of channel pathst_2Between coincidence factor be denoted as:
Illustrate practical business channel pathst_1With service channel pathst_2There is no intersection.
By practical business path pathst_1With the service path path obtained according to minimal time delay algorithm network routingst_3Into
Row network path difference quantitative assessment, the edge sequence set intersection of the two are denoted as Est_1,3=Est_1∩Est_3, edge sequence set
The set that intersection corresponds to weight is denoted asThen from source node vsTo destination node vtBetween the 1st article
Channel pathst_1With the 3rd article of channel pathst_3Between coincidence factor be denoted as:
Illustrate practical business channel pathst_1With service channel pathst_3There is 33.3% coincidence.
To sum up, it practical business channel and determines that the coincidence factor in each preferred channel of business under algorithm is higher, illustrates by business
When channel is switched over to the optimization service channel under the algorithm, impacted route is fewer in network, but according to specific business
The difference of channel deployment, set coincidence factor optimize for multi-target networks it is merely meant that a kind of relationship of registration out and provide one
Kind qualitative assessment mechanism.
The present invention is designed specifically to modules, comprising: 1), network topology determining module, for according to business demand, really
Fixed specific network topology；2), algorithm route selection module, for determining algorithm network routing and measurement index, with this measurement index
Required service channel is selected for standard, algorithm and measurement index can be arbitrary, to make network path difference evaluation result
Significant, the channel that each algorithms of different is selected is preferably provided with identical source node and destination node；3), network route information set
Change module, after which obtains channel, determines the node and side that channel is included, with line set, sequence node set and side sequence
The set expression for arranging corresponding weight comes out.4), network route information coincidence factor computing module and 5), network path difference point
Module is analysed, the otherness according to the coincidence factor in channel, between the network route information of quantitative analysis service-oriented.
Claims (4)
1. a kind of network path difference quantitative evaluation method of service-oriented, which is characterized in that specific step is as follows:
Step 1: determining the network topological diagram G={ V, E } of the business, and for the source in topological diagram according to some business demand
Node vsWith destination node vt, determine the practical business channel pathB that information is transmitted between two nodes；
Topological interior joint collection is combined into V={ v1,v2,....vi..., viIndicate the node that number is i,
Line set in topology For from node viTo node vjDirect-connected directed edge；
Practical business channel pathB is denoted as pathst_j；pathst_jIt indicates from source node vsTo destination node vtBetween j-th strip it is feasible
Channel is joined end to end by several sides, not repeatedly side or node；
Step 2: under No Assets restrictive condition, different routing measurement indexs is selected, to each according to the business demand
Index selects a service channel, and the service channel under all indexs constitutes service channel set pathA；
Service channel set pathA is indicated are as follows: { pathst_1,pathst_2,...pathst_i,...}；pathst_iIt indicates to save from source
Point vsTo destination node vtBetween i-th feasible channel and the corresponding channel of i-th of routing measurement index；
Step 3: being determined respectively each logical for each channel and practical business channel pathB in service channel set pathA
The line set that road is included, sequence node set and edge sequence correspond to the set of weight；
Step 4: corresponding to the set of weight according to line set and edge sequence, each channel point in service channel set pathA is found out
Not with practical business channel pathst_jBetween coincidence factor；
Specific step is as follows:
Step 401 chooses service channel one by one from set pathA, calculates current business channel pathst_iLine set and reality
Border service channel pathst_jLine set intersection, be denoted as Est_i,j=Est_i∩Est_j；
Step 402, with channel pathst_iAs channel is measured, intersection E is calculatedst_i,jThe set of corresponding weight；
The corresponding weight collection of intersection is combined into
Step 403, according to intersection Est_i,jCorresponding weight set calculates practical business channel pathst_jWith current business channel
pathst_iBetween coincidence factor；
Calculation formula is as follows:
Coincidence factor refers to: the sum of the corresponding weight of same edge and current channel path between two channelsst_iSide correspond to weight
Ratio between and；
Step 404 judges whether the service channel in set pathA has taken, if it is, terminating algorithm；Otherwise it returns
Step 401 selects next service channel to continue to calculate and practical business channel pathst_jBetween coincidence factor；
Step 5: according to each channel in service channel set pathA respectively with practical business channel pathst_jBetween coincidence
Rate carries out the quantitative assessment of network path difference.
2. a kind of network path difference quantitative evaluation method of service-oriented as described in claim 1, which is characterized in that step
Routing measurement index described in rapid two includes minimal time delay, shortest path, reliability, bandwidth, load and communications cost.
3. a kind of network path difference quantitative evaluation method of service-oriented as described in claim 1, which is characterized in that institute
Sequence node set in the step of stating three in every channel is arranged according to the sequence from source node to destination node；
Channel pathst_iLine set Est_iMiddle element is the direct-connected directed edge of node-to-node, and each element is according to from source node
Sequence to destination node arranges；ElementIt is set Est_iIn kth directed edge；
Similarly, channel pathst_jLine set be Est_j；
Channel pathst_iThe collection that middle edge sequence corresponds to weight is combined intowkiIt is sideCorresponding weight；
Channel pathst_jThe collection that middle edge sequence corresponds to weight is combined intowkjIt is sideCorresponding weight.
4. a kind of network path difference quantitative evaluation method of service-oriented as described in claim 1, which is characterized in that institute
The specific evaluation procedure of the step of stating five are as follows:
Step 501 averages all coincidence factors acquired, judges whether the average value is lower than threshold value A, if so, into
Step 502；Otherwise, 503 are entered step；
Step 502 illustrates network there may be problem, and bandwidth chahnel is smaller to be likely to result in practical business channel pathB and industry
The service channel gap being engaged in channel set pathA is larger, and overall thinking promotes network performance；
Step 503, the channel that the coincidence factor lower than threshold value B is judged whether there is from the service channel in set pathA exist, such as
Fruit has, then optimization practical business channel pathB is removed in terms of the measurement index of the coincidence factor corresponding channel lower than threshold value, otherwise,
Practical business channel pathB performance is advantageous.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811480390.1A CN109327388B (en) | 2018-12-05 | 2018-12-05 | Service-oriented network routing difference quantitative evaluation method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811480390.1A CN109327388B (en) | 2018-12-05 | 2018-12-05 | Service-oriented network routing difference quantitative evaluation method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109327388A true CN109327388A (en) | 2019-02-12 |
| CN109327388B CN109327388B (en) | 2020-04-24 |
Family
ID=65256589
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811480390.1A Active CN109327388B (en) | 2018-12-05 | 2018-12-05 | Service-oriented network routing difference quantitative evaluation method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109327388B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113965400A (en) * | 2021-11-01 | 2022-01-21 | 电子科技大学长三角研究院(衢州) | Method for determining flow key point in communication network |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105897329A (en) * | 2016-06-08 | 2016-08-24 | 大连大学 | Multi-service routing optimization method of LEO satellite network based on multi-objective decisions |
| CN107103169A (en) * | 2017-06-26 | 2017-08-29 | 上海交通大学 | It is a kind of to be used to meet the transportation network equilibrium calculation method that trip continuation of the journey is required |
| CN107135158A (en) * | 2017-07-11 | 2017-09-05 | 北京工业大学 | Optimal route selection method in a kind of multi-path transmission |
| CN107708174A (en) * | 2017-11-06 | 2018-02-16 | 江苏省邮电规划设计院有限责任公司 | Terminal direct connection D2D route selection methods in a kind of 5G systems |
-
2018
- 2018-12-05 CN CN201811480390.1A patent/CN109327388B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105897329A (en) * | 2016-06-08 | 2016-08-24 | 大连大学 | Multi-service routing optimization method of LEO satellite network based on multi-objective decisions |
| CN107103169A (en) * | 2017-06-26 | 2017-08-29 | 上海交通大学 | It is a kind of to be used to meet the transportation network equilibrium calculation method that trip continuation of the journey is required |
| CN107135158A (en) * | 2017-07-11 | 2017-09-05 | 北京工业大学 | Optimal route selection method in a kind of multi-path transmission |
| CN107708174A (en) * | 2017-11-06 | 2018-02-16 | 江苏省邮电规划设计院有限责任公司 | Terminal direct connection D2D route selection methods in a kind of 5G systems |
Non-Patent Citations (1)
| Title |
|---|
| 毛宏宝: ""多域光网络的生存性机制研究"", 《中国优秀硕士学位论文全文数据库》 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113965400A (en) * | 2021-11-01 | 2022-01-21 | 电子科技大学长三角研究院(衢州) | Method for determining flow key point in communication network |
| CN113965400B (en) * | 2021-11-01 | 2023-06-30 | 电子科技大学长三角研究院(衢州) | Method for determining flow key points in communication network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109327388B (en) | 2020-04-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10673763B2 (en) | Learning or emulation approach to traffic engineering in information-centric networks | |
| CN105897329B (en) | LEO satellite network multi-service routing optimization method based on multiobjective decision-making | |
| CN108173761B (en) | SDN and NFV fused resource optimization method | |
| Christodoulopoulos et al. | Time-varying spectrum allocation policies and blocking analysis in flexible optical networks | |
| US8275866B2 (en) | Assigning telecommunications nodes to community of interest clusters | |
| CN105515987B (en) | A kind of mapping method based on SDN framework Virtual optical-fiber networks | |
| Botero et al. | A novel paths algebra-based strategy to flexibly solve the link mapping stage of VNE problems | |
| CN111800352B (en) | Service function chain deployment method and storage medium based on load balancing | |
| CN105978811B (en) | A kind of route selecting method and device based on business transmission | |
| CN105472484A (en) | Wave channel balancing route wavelength allocation method of power backbone optical transport network | |
| CN113300861B (en) | Network slice configuration method, device and storage medium | |
| CN109327388A (en) | A kind of network path difference quantitative evaluation method of service-oriented | |
| CN102546286A (en) | Method for on-line detection of shared network congestion paths | |
| CN105263166A (en) | Priority-based wireless access control method for dual-path routing | |
| JP2008165468A (en) | Network topology design method and design system using ahp | |
| Hojeij et al. | Dynamic placement of O-CU and O-DU functionalities in open-ran architecture | |
| CN108174446B (en) | Network node link resource joint distribution method with minimized resource occupancy | |
| US20050060395A1 (en) | Network global expectation model for rapidly quantifying network needs and costs | |
| CN110139173A (en) | A kind of network dividing area method reducing optical transfer network end-to-end time delay | |
| Pham et al. | Multi-domain non-cooperative VNF-FG embedding: A deep reinforcement learning approach | |
| Avonts et al. | A framework to compare topology algorithms in multi-channel multi-radio wireless mesh networks | |
| CN105917621A (en) | Methods and systems for data routing | |
| Li et al. | QoS routing algorithm based on entropy granularity in the network transmission | |
| Rao et al. | A deep learning-based constrained intelligent routing method | |
| Hong et al. | Neural network-assisted decision-making for adaptive routing strategy in optical datacenter 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 |