CN109756422A - A kind of forwarding routing node choosing method - Google Patents
A kind of forwarding routing node choosing method Download PDFInfo
- Publication number
- CN109756422A CN109756422A CN201910236876.9A CN201910236876A CN109756422A CN 109756422 A CN109756422 A CN 109756422A CN 201910236876 A CN201910236876 A CN 201910236876A CN 109756422 A CN109756422 A CN 109756422A
- Authority
- CN
- China
- Prior art keywords
- routing node
- forwarding routing
- forwarding
- degree
- betweenness
- 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
Abstract
The present invention discloses a kind of forwarding routing node choosing method, is related to technical field of the computer network；Obtain forwarding routing node relational graph, analysis obtains the degree of each forwarding routing node and the betweenness of each forwarding routing node, and the degree of each forwarding routing node and betweenness are arranged as needed, degree of ignoring and the maximum forwarding routing node of betweenness ratio, selection is less than and the degree of approach and the maximum forwarding routing node of betweenness ratio, as routing transit node；The present invention is that the forwarding routing node choosing method based on " deleting side " strategy forces network flow to evenly spread to each link of network, to improve the efficiency of transmission of network entirety by logically removing certain intermediate bottleneck nodes.
Description
Technical field
The present invention discloses a kind of forwarding routing node choosing method, is related to technical field of the computer network.
Background technique
Overlay network is the virtual network established on this basis based on the physical network of bottom.In overlay network
Node between virtual link be in logic, compared with the Physical Network of bottom, overlay network have better flexibility.Covering
Node in network has processing function, i.e. storage --- processing --- forwarding capability compared with the node in traditional network.
Existing network sends data and all concentrates on single optimal path, and network flow is not balanced enough, and congestion is difficult to avoid that,
By setting up nerve of a covering, deployment transfer routing node enhances the diversification in path, can effectively promote the performance of network transmission,
Improve quality of service.
Transfer routing node selecting technology is the key link in covering network system, inefficient forward node Choice meeting
Seriously affect the scalability and whole routing optimality performance of network.Forward node Choice at present in covering network system is main
It chooses to randomly select, based on detection mode and is chosen based on simple topology knowledge.It randomly selects and is mainly seen in Un-structured
P2P system, the neighbor list of terminal node random search oneself submit the data that need to be forwarded, and this method is simple, but efficiency
It is very low, it is often necessary to largely to be retried.The covering network systems such as elastic overlapping, principle are common in based on detection mode selection
It is to be ranked up by delay or the parameters such as packet loss or bandwidth to forward node.Spare forward node is chosen based on detection mode
Scheme although greatly reduce and retry in vain, but still there are more serious scalability and efficiencies: on the one hand, to all
Forward node, which carries out periodical dynamic instrumentation, can generate mass communication expense, constrain the scale of covering network system；On the other hand,
To classify by detection performance, a large amount of forward node paths for often leading to choose are overlapped in bottom-layer network topology, and one
Denier generates network failure, and often these path collectives fail, and is unable to reach performance effect of optimization.
The present invention provides a kind of forwarding routing node choosing method, and the forwarding based on the decentralization for deleting side strategy routes section
Point choosing method forces network flow to evenly spread to each chain of network by logically deleting certain intermediate bottleneck nodes
Road, to improve the efficiency of transmission of network entirety.
Summary of the invention
The present invention is directed to problem of the prior art, provides a kind of forwarding routing node choosing method, can solve nerve of a covering
The problem of routing forwarding node randomly selects path reliability and conventional bifurcated earliest choose the congestion problems that may cause, and both may be used
To avoid the single-point congestion of network, and the length of forward-path can be shortened, to improve the reliability of network transmission.
Concrete scheme proposed by the present invention is:
A kind of forwarding routing node choosing method obtains forwarding routing by bottom-layer network topology information in overlay network
Node relationships figure, analysis obtain the degree of each forwarding routing node and the betweenness of each forwarding routing node, and as needed by each turn
The degree and betweenness for sending out routing node are arranged, and degree of ignoring and the maximum forwarding routing node of betweenness ratio, selection are less than and connect
Recency and the maximum forwarding routing node of betweenness ratio, as routing transit node.
Bottom-layer network topology information is collected and surveyed in the method in overlay network, forms backbone connection figure, it will be corresponding
Forwarding routing node be attached relationship map, constitute forwarding routing node relational graph.
The connection number of some forwarding routing node to remaining forwarding routing node forwards routing to save thus in the method
The degree of point.
Pass through the number in the path of some forwarding routing node in the method in overlay network in all shortest paths
The ratio for accounting for shortest path sum forwards the betweenness of routing node thus.
The degree of each forwarding routing node and betweenness are subjected to descending arrangement as needed in the method or ascending order arranges.
A kind of forwarding routing node select tool, including acquiring unit, analytical calculation unit and selection unit,
Wherein acquiring unit is obtained by bottom-layer network topology information and forwards routing node relational graph in overlay network, is turned
Analytical calculation unit is sent out, the analysis of analytical calculation unit obtains the degree of each forwarding routing node and the betweenness of each forwarding routing node,
And as needed arrange the degree of each forwarding routing node and betweenness, forward selection unit, selection unit degree of ignoring and Jie
The number maximum forwarding routing nodes of ratio, selection is less than and the degree of approach and the maximum forwarding routing node of betweenness ratio, as road
By transit node.
Acquiring unit collects and surveys bottom-layer network topology information in overlay network in the tool, forms backbone connection
Corresponding forwarding routing node is attached relationship map, constitutes forwarding routing node relational graph by figure.
Some forwarding routing node is forwarded the connection number of routing node by analytical calculation unit to remaining in the tool
Degree as this forwarding routing node.
Analytical calculation unit will pass through some forwarding in overlay network and route in the tool in all shortest paths
The number in the path of node accounts for betweenness of the ratio as this forwarding routing node of shortest path sum.
The degree of each forwarding routing node and betweenness are carried out descending row as needed by analytical calculation unit in the tool
Column or ascending order arrangement.
Usefulness of the present invention is:
The present invention provides a kind of forwarding routing node choosing method, obtains forwarding routing node relational graph, and analysis obtains each
Forward routing node degree and it is each forwarding routing node betweenness, and as needed by it is each forwarding routing node degree and betweenness into
Row arrangement, degree of ignoring and the maximum forwarding routing node of betweenness ratio, selection is less than and the degree of approach and maximum turn of betweenness ratio
Routing node is sent out, as routing transit node；The present invention is the forwarding routing node choosing method based on " deleting side " strategy, is passed through
Certain intermediate bottleneck nodes are logically removed, force network flow to evenly spread to each link of network, to improve net
The efficiency of transmission of network entirety.
Node selection method proposed by the present invention has the advantage that:
Network flow is unlikely to concentrate to central node, can effectively avoid network congestion；
Second shortest path ensure that the richness and independence in path simultaneously, improve the reliability of forwarding routing；
When network failure fails, based on the decentralization choosing method for deleting side strategy, path will not collective fail, can be effective
Avoid scale paralysis problem.
Detailed description of the invention
Fig. 1 is the method for the present invention flow diagram；
Fig. 2 is that side strategy schematic diagram is deleted in decentralization；
Fig. 3 is the network topological diagram of embodiment.
Specific embodiment
The present invention provides a kind of forwarding routing node choosing method, is obtained in overlay network by bottom-layer network topology information
Forwarding routing node relational graph is taken, analyzes and obtains each degree for forwarding routing node and each betweenness for forwarding routing node, and according to
It needs to arrange the degree of each forwarding routing node and betweenness, degree of ignoring and the maximum forwarding routing node of betweenness ratio, choosing
It takes and is less than and the degree of approach and the maximum forwarding routing node of betweenness ratio, as routing transit node.
The forwarding routing node select tool corresponded to the above method, including acquiring unit, analytical calculation are provided simultaneously
Unit and selection unit,
Wherein acquiring unit is obtained by bottom-layer network topology information and forwards routing node relational graph in overlay network, is turned
Analytical calculation unit is sent out, the analysis of analytical calculation unit obtains the degree of each forwarding routing node and the betweenness of each forwarding routing node,
And as needed arrange the degree of each forwarding routing node and betweenness, forward selection unit, selection unit degree of ignoring and Jie
The number maximum forwarding routing nodes of ratio, selection is less than and the degree of approach and the maximum forwarding routing node of betweenness ratio, as road
By transit node.
The present invention will be further explained below with reference to the attached drawings and specific examples, so that those skilled in the art can be with
It more fully understands the present invention and can be practiced, but illustrated embodiment is not as a limitation of the invention.
For choosing forwarding routing node in a certain application network, referring to figs. 2 and 3, the mistake of the method for the present invention is utilized
Journey are as follows:
Information collection and analysis is carried out to bottom-layer network topology first, backbone connection figure is formed, then will forward accordingly again
Routing node is attached relationship map, constitutes forwarding routing node relational graph,
In Fig. 3, by taking two terminals in AS1, AS2 are communicated as an example, by the communication of A → D, pass through B, C nerve of a covering
Node carries out flow and forwards to form different forwarding routings, and B, C are forwarding routing node, obtains B, C forwarding routing node and arrives it
The connection number of remaining forwarding routing node forwards the degree of routing node thus, Degree (C)=4, Degree (B)=2,
And the betweenness of B, C two forwarding routing nodes, Wherein σst(C) shortest path of s → t by forwarding routing node C is indicated
Diameter item number, σst(B) indicate by forwarding routing node B s → t shortest path item number, V indicate A B C D E F node group
At set, through analytical calculation Betweeness (C)=6/13, Betweeness (B)=1/11, B, C forward routing node
Degree and betweenness can carry out descending arrangement,
Degree of ignoring and the maximum forwarding routing node C of betweenness ratio, selection is less than and the degree of approach and betweenness ratio are maximum
Routing node B is forwarded, as routing transit node.Traditional theory is wherein pressed, it is maximum Degree/Betweenness should to be chosen
Point is shortest on average for all forward-paths of overall network, but flow can always tend to toward central node
It concentrates, the congestion of central node is easily led to, moreover, being usually forwarded by central node, although its path richness has more
Good guarantee, but its forward-path may be it is longest, will cause the decline of forwarding reliability instead, and utilize the method for the present invention
Choosing B is forwarding routing node, is equivalent to the removal maximum Core node C of Betweeness, and corresponding flow is carried out by B
Transfer, network flow are unlikely to concentrate to central node, can effectively avoid network congestion, while second shortest path ensure that path
Richness and independence improve the reliability of forwarding routing, in network failure failure, based on the decentralization for deleting side strategy
Choosing method, path will not collective failure, can effectively avoid scale paralysis problem.
When using inventive article, process is similar with the above method,
Acquiring unit carries out information collection and analysis to bottom-layer network topology first, backbone connection figure is formed, then again by phase
The forwarding routing node answered is attached relationship map, constitutes forwarding routing node relational graph,
In Fig. 3, by taking two terminals in AS1, AS2 are communicated as an example, by the communication of A → D, pass through B, C nerve of a covering
Node carries out flow and forwards to form different forwarding routings, and B, C are forwarding routing node, and analytical calculation unit obtains B, C forwarding
The connection number of routing node to remaining forwarding routing node forwards the degree of routing node, Degree (C)=4, Degree (B) thus
=2,
And the betweenness of B, C two forwarding routing nodes, Wherein σst(C) shortest path of s → t by forwarding routing node C is indicated
Diameter item number, σst(B) indicate by forwarding routing node B s → t shortest path item number, V indicate A B C D E F node group
At set, through analytical calculation Betweeness (C)=6/13, Betweeness (B)=1/11, B, C forward routing node
Degree and betweenness can carry out descending arrangement,
Selection unit degree of ignoring and the maximum forwarding routing node C of betweenness ratio, selection is less than and the degree of approach and betweenness ratio
It is worth maximum forwarding routing node B, as routing transit node.
Embodiment described above is only to absolutely prove preferred embodiment that is of the invention and being lifted, protection model of the invention
It encloses without being limited thereto.Those skilled in the art's made equivalent substitute or transformation on the basis of the present invention, in the present invention
Protection scope within.Protection scope of the present invention is subject to claims.
Claims (10)
1. a kind of forwarding routing node choosing method turns it is characterized in that being obtained in overlay network by bottom-layer network topology information
Routing node relational graph is sent out, analysis obtains the degree of each forwarding routing node and the betweenness of each forwarding routing node, and as needed
The degree of each forwarding routing node and betweenness are arranged, degree of ignoring and the maximum forwarding routing node of betweenness ratio are chosen small
In and the degree of approach and the maximum forwarding routing node of betweenness ratio, as routing transit node.
2. according to the method described in claim 1, it is characterized in that collection and analysis bottom-layer network topology information, formation in overlay network
Corresponding forwarding routing node is attached relationship map, constitutes forwarding routing node relational graph by backbone connection figure.
3. method according to claim 1 or 2, it is characterized in that some forwarding routing node forwards routing node to remaining
Connection number forwards the degree of routing node thus.
4. according to the method described in claim 3, it is characterized in that by some forwarding road in all shortest paths in overlay network
Forward the betweenness of routing node thus by the ratio that the number in the path of node accounts for shortest path sum.
5. according to the method described in claim 4, it is characterized in that the degree of each forwarding routing node and betweenness are carried out as needed
Descending arrangement or ascending order arrangement.
6. a kind of forwarding routing node select tool, it is characterized in that including acquiring unit, analytical calculation unit and selection unit,
Wherein acquiring unit is obtained by bottom-layer network topology information and forwards routing node relational graph in overlay network, forwarding point
Computing unit is analysed, the analysis of analytical calculation unit obtains the degree of each forwarding routing node and the betweenness of each forwarding routing node, and root
According to needing to arrange the degree of each forwarding routing node and betweenness, selection unit, selection unit degree of ignoring and betweenness ratio are forwarded
It is worth maximum forwarding routing node, selection is less than and the degree of approach and the maximum forwarding routing node of betweenness ratio, as in routing
Trochanterion.
7. according to right want 6 described in tool, it is characterized in that acquiring unit collected and surveyed in overlay network bottom-layer network topology
Information forms backbone connection figure, and corresponding forwarding routing node is attached relationship map, constitutes forwarding routing node relationship
Figure.
8. tool according to claim 6 or 7, it is characterized in that analytical calculation unit by some forwarding routing node to remaining
Forward the connection number of routing node as the degree of this forwarding routing node.
9. tool according to claim 8, it is characterized in that analytical calculation unit is in overlay network by all shortest paths
The number in the middle path by some forwarding routing node accounts for Jie of the ratio as this forwarding routing node of shortest path sum
Number.
10. tool according to claim 9, it is characterized in that analytical calculation unit is as needed by each forwarding routing node
Degree and betweenness carry out descending arrangement or ascending order arrangement.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910236876.9A CN109756422B (en) | 2019-03-27 | 2019-03-27 | Forwarding routing node selection method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910236876.9A CN109756422B (en) | 2019-03-27 | 2019-03-27 | Forwarding routing node selection method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109756422A true CN109756422A (en) | 2019-05-14 |
| CN109756422B CN109756422B (en) | 2021-07-20 |
Family
ID=66409284
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910236876.9A Active CN109756422B (en) | 2019-03-27 | 2019-03-27 | Forwarding routing node selection method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109756422B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110730388A (en) * | 2019-12-19 | 2020-01-24 | 北京天仪百康科贸有限公司 | Node connection method in P2P video-on-demand system |
| CN112003750A (en) * | 2020-08-24 | 2020-11-27 | 浪潮云信息技术股份公司 | Data center host Overlay network access control method |
| CN114501161A (en) * | 2022-04-11 | 2022-05-13 | 中兴通讯股份有限公司 | Audio and video system, access method, route forwarding method and readable storage medium |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20030223587A1 (en) * | 2002-05-29 | 2003-12-04 | Hitachi, Ltd. | Classified communication system which classifies the signal between interfaces and supports a media transport encoding scheme for a direct current balanced stream simultaneously |
| CN103020400A (en) * | 2013-01-05 | 2013-04-03 | 桂林电子科技大学 | Module division method based on complex network edge betweennesses |
| CN103476051A (en) * | 2013-09-11 | 2013-12-25 | 华北电力大学（保定） | Method for evaluating importance of nodes in communication network |
| CN107038247A (en) * | 2017-04-20 | 2017-08-11 | 南京航空航天大学 | Nominator's search mechanisms based on core search strategy in commending system |
| CN107333320A (en) * | 2017-06-30 | 2017-11-07 | 湖北工程学院 | Data forwarding method and device |
| CN107343302A (en) * | 2017-07-11 | 2017-11-10 | 南京航空航天大学 | A kind of routing of sensor networks structural optimization method based on polycaryon processor |
| CN107784327A (en) * | 2017-10-27 | 2018-03-09 | 天津理工大学 | A kind of personalized community discovery method based on GN |
| CN108255987A (en) * | 2017-12-28 | 2018-07-06 | 清华大学 | Community-based node betweenness center degree update method |
-
2019
- 2019-03-27 CN CN201910236876.9A patent/CN109756422B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20030223587A1 (en) * | 2002-05-29 | 2003-12-04 | Hitachi, Ltd. | Classified communication system which classifies the signal between interfaces and supports a media transport encoding scheme for a direct current balanced stream simultaneously |
| CN103020400A (en) * | 2013-01-05 | 2013-04-03 | 桂林电子科技大学 | Module division method based on complex network edge betweennesses |
| CN103476051A (en) * | 2013-09-11 | 2013-12-25 | 华北电力大学（保定） | Method for evaluating importance of nodes in communication network |
| CN107038247A (en) * | 2017-04-20 | 2017-08-11 | 南京航空航天大学 | Nominator's search mechanisms based on core search strategy in commending system |
| CN107333320A (en) * | 2017-06-30 | 2017-11-07 | 湖北工程学院 | Data forwarding method and device |
| CN107343302A (en) * | 2017-07-11 | 2017-11-10 | 南京航空航天大学 | A kind of routing of sensor networks structural optimization method based on polycaryon processor |
| CN107784327A (en) * | 2017-10-27 | 2018-03-09 | 天津理工大学 | A kind of personalized community discovery method based on GN |
| CN108255987A (en) * | 2017-12-28 | 2018-07-06 | 清华大学 | Community-based node betweenness center degree update method |
Non-Patent Citations (2)
| Title |
|---|
| 张国清: "小世界网络中的删边扩容效应", 《中国科学:信息科学》 * |
| 程灿: "网络路由传输策略的研究进展", 《电子科技大学学报》 * |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110730388A (en) * | 2019-12-19 | 2020-01-24 | 北京天仪百康科贸有限公司 | Node connection method in P2P video-on-demand system |
| CN110730388B (en) * | 2019-12-19 | 2020-08-04 | 千脉文化传媒(上海)有限公司 | Node connection method in P2P video-on-demand system |
| CN112003750A (en) * | 2020-08-24 | 2020-11-27 | 浪潮云信息技术股份公司 | Data center host Overlay network access control method |
| CN112003750B (en) * | 2020-08-24 | 2023-11-21 | 浪潮云信息技术股份公司 | Data center host computer Overlay network access control method |
| CN114501161A (en) * | 2022-04-11 | 2022-05-13 | 中兴通讯股份有限公司 | Audio and video system, access method, route forwarding method and readable storage medium |
| CN114501161B (en) * | 2022-04-11 | 2022-08-02 | 中兴通讯股份有限公司 | Audio and video system, access method, route forwarding method and readable storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109756422B (en) | 2021-07-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109756422A (en) | A kind of forwarding routing node choosing method | |
| Schurgot et al. | Beyond traditional DTN routing: social networks for opportunistic communication | |
| CN108173761B (en) | SDN and NFV fused resource optimization method | |
| CN101965715B (en) | Tie-Breaking in Shortest Path Determination | |
| Van Renesse et al. | Willow: DHT, aggregation, and publish/subscribe in one protocol | |
| CN103036787B (en) | A kind of network routing convergence treating method and apparatus | |
| CN103678531B (en) | Friend recommendation method and friend recommendation device | |
| CN103416010B (en) | The network automatic conversion between agreement | |
| CN106161610A (en) | A kind of method and system of distributed storage | |
| Guo et al. | Exploiting efficient and scalable shuffle transfers in future data center networks | |
| CN105721311A (en) | System and method for efficient name-based content routing using link-state information in information-centric networks | |
| CN104506230B (en) | A kind of parallel method for reliable transmission of multipath suitable for satellite network | |
| CN104038418B (en) | Method for routing, path detection mechanism and Message processing mechanism for mixed type topology data center | |
| CN106470168A (en) | A kind of data transmission method, the switch using the method and network control system | |
| CN103119901A (en) | Communication system, control apparatus, configuration method for processing rules, and program | |
| CN1240004C (en) | Route calculating apparatus wiht switchable route selective standard | |
| CN103117957A (en) | Cache management method based on numbers of message replications and comprehensive effectiveness in opportunistic network | |
| CN104580165A (en) | Cooperative caching method in intelligence cooperative network | |
| CN108833271A (en) | A kind of power grid wide-area control service communication routing resource and server | |
| CN113660140A (en) | Service function chain fault detection method based on data control plane hybrid sensing | |
| CN105610707A (en) | Implementation method of AntNet routing algorithm in two-dimensional mesh topology network-on-chip | |
| CN110095134A (en) | It is a kind of using the preference of user as the method and system of the path planning of core and navigation | |
| CN106059861B (en) | System and method for constructing minimum dynamic aggregation tree of Internet of things in distributed mode | |
| CN103532872A (en) | Method for reducing link state packet flooding and router | |
| CN114513449A (en) | Method and system for optimizing routing in domain |
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 | ||
| CB03 | Change of inventor or designer information |
Inventor after: Li Yanjun Inventor after: Xiao Xue Inventor after: Gao Chuanji Inventor before: Li Yanjun |
|
| CB03 | Change of inventor or designer information | ||
| CB02 | Change of applicant information |
Address after: 250100 No. 1036 Tidal Road, Jinan High-tech Zone, Shandong Province, S01 Building, Tidal Science Park Applicant after: Inspur cloud Information Technology Co.,Ltd. Address before: 250100 No. 1036 Tidal Road, Jinan High-tech Zone, Shandong Province, S01 Building, Tidal Science Park Applicant before: Tidal Cloud Information Technology Co.,Ltd. Address after: 250100 No. 1036 Tidal Road, Jinan High-tech Zone, Shandong Province, S01 Building, Tidal Science Park Applicant after: Tidal Cloud Information Technology Co.,Ltd. Address before: 250100 S06 tower, 1036, Chao Lu Road, hi tech Zone, Ji'nan, Shandong. Applicant before: SHANDONG INSPUR CLOUD INFORMATION TECHNOLOGY Co.,Ltd. |
|
| CB02 | Change of applicant information | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |