CN110191056A - A kind of automatic routing algorithm of network topology - Google Patents
A kind of automatic routing algorithm of network topology Download PDFInfo
- Publication number
- CN110191056A CN110191056A CN201910460076.5A CN201910460076A CN110191056A CN 110191056 A CN110191056 A CN 110191056A CN 201910460076 A CN201910460076 A CN 201910460076A CN 110191056 A CN110191056 A CN 110191056A
- Authority
- CN
- China
- Prior art keywords
- path
- 120kbps
- wider
- link
- band
- 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.)
- Pending
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/122—Shortest path evaluation by minimising distances, e.g. by selecting a route with minimum of number of hops
-
- 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/12—Shortest path evaluation
- H04L45/125—Shortest path evaluation based on throughput or bandwidth
Abstract
The invention belongs to algorithm network routing technical field and disclose a kind of automatic routing algorithm of network topology, including selecting all reachable paths between A-Z, all bands are selected to be wider than the optional tunnel path of 120kbps and sort, by path length sequence after all reachable tunnel paths be select it is optimal.The present invention realizes automatically generating for tunnel path.
Description
Technical field
The present invention relates to a kind of automatic routing algorithms of network topology, belong to algorithm network routing technical field.
Background technique
Existing network management prepares system software, and in configuration service, user can only manually select certain links, then forms tunnel
Path, if number of devices is huge, the path of selection is very long, and user's operation is got up very troublesome and time-consuming, greatly reduces
The ease for use of network management.
It, need to be under the premise of limiting tunnel bandwidth, by routing automatically for the efficient ease for use for improving webmastering software system
Algorithm calculates reachable path between given network element automatically, and provides 3 optimal available paths, and the operation of user is reduced with this
Amount, improves the intelligence and ease for use of network management.
Summary of the invention
The technical problem to be solved in the present invention overcomes existing defect, this patent is primarily to solution NMS user cannot
Enough the problem of intelligently selecting tunnel path, reducing network management ease for use.
In order to solve the above-mentioned technical problems, the present invention provides the following technical solutions:
The present invention provides a kind of automatic routing algorithm of network topology comprising the steps of:
Step 1: selecting all reachable paths between A-Z；
1) all links are traversed, the lower level network element B and D of A are first selected；
2) step in 1) is repeated, then finds out the lower level network element C and Z of B, because Z is terminal network element, therefore selects path A- > B- > Z;
3) step repeated in 1) continues to look for the lower level network element Z of C, selects path A- > B- > C- > Z;
4) lower level network element that the step in 1) finds out D again is repeated, path A- > D- > Z is selected；
Step 2: all bands are filtered out and is wider than the optional tunnel path of 120kbps and sorts；
1) link for A- > B- > band is wider than 120Kbps between Z:A, B has one 2, and band is wider than the link of 120Kbps between B, Z
There is one 6, so, the optional tunnel path in this path has 2-6；
2) link that band is wider than 120Kbps between A- > B- > C- > Z:A, B has one 2, and band is wider than 120Kbps's between B, C
Link has one 3, and the link that band is wider than 120Kbps between C, Z has one 8, so, the optional tunnel path in this path has 2-
3-8；
3) link for A- > D- > band is wider than 120Kbps between Z:A, D has two rules 4,5, and band is wider than 120Kbps's between D, Z
Link has one 7, so, the optional tunnel path in this path has 4-7,5-7；
Step 3: all reachable tunnel paths after length sequence are by path；
2-6、4-7、5-7、2-3-8
Optimal 3 are 2-6,4-7,5-7
As a preferred technical solution of the present invention, four paths 2-6,4-7,5-7,2-3-8 in the step 3 are carried out
Length compares and selects optimal.
The beneficial effects obtained by the present invention are as follows being: realizing automatically generating for tunnel path.
Detailed description of the invention
Attached drawing is used to provide further understanding of the present invention, and constitutes part of specification, with reality of the invention
It applies example to be used to explain the present invention together, not be construed as limiting the invention.
In the accompanying drawings:
Fig. 1 is a kind of automatic routing algorithm integrated stand composition of network topology described in the embodiment of the present invention.
Figure label:
Network element number: A, B, C, D, Z
Link number: 1,2,3,4,5,6,7,8
Link bandwidth: 100kbps, 200kbps, 220kbps.
Specific embodiment
Hereinafter, preferred embodiments of the present invention will be described with reference to the accompanying drawings, it should be understood that preferred reality described herein
Apply example only for the purpose of illustrating and explaining the present invention and is not intended to limit the present invention.
Embodiment: it comprises the steps of:
Step 1: selecting all reachable paths between A-Z；
1) all links are traversed, the lower level network element B and D of A are first selected；
2) step in 1) is repeated, then finds out the lower level network element C and Z of B, because Z is terminal network element, therefore selects path A- > B- > Z;
3) step repeated in 1) continues to look for the lower level network element Z of C, selects path A- > B- > C- > Z;
4) lower level network element that the step in 1) finds out D again is repeated, path A- > D- > Z is selected；
Step 2: all bands are filtered out and is wider than the optional tunnel path of 120kbps and sorts；
1) link for A- > B- > band is wider than 120Kbps between Z:A, B has one 2, and band is wider than the link of 120Kbps between B, Z
There is one 6, so, the optional tunnel path in this path has 2-6；
2) link that band is wider than 120Kbps between A- > B- > C- > Z:A, B has one 2, and band is wider than 120Kbps's between B, C
Link has one 3, and the link that band is wider than 120Kbps between C, Z has one 8, so, the optional tunnel path in this path has 2-
3-8；
3) link for A- > D- > band is wider than 120Kbps between Z:A, D has two rules 4,5, and band is wider than 120Kbps's between D, Z
Link has one 7, so, the optional tunnel path in this path has 4-7,5-7；
Step 3: all reachable tunnel paths after length sequence are by path；
2-6、4-7、5-7、2-3-8
Optimal 3 are 2-6,4-7,5-7
Four paths 2-6,4-7,5-7,2-3-8 in the step 3 carry out length and compare and select optimal.
Finally, it should be noted that the foregoing is only a preferred embodiment of the present invention, it is not intended to restrict the invention,
Although the present invention is described in detail referring to the foregoing embodiments, for those skilled in the art, still may be used
To modify the technical solutions described in the foregoing embodiments or equivalent replacement of some of the technical features.
All within the spirits and principles of the present invention, any modification, equivalent replacement, improvement and so on should be included in of the invention
Within protection scope.
Claims (2)
1. a kind of automatic routing algorithm of network topology, it is characterised in that: comprise the steps of:
Step 1: selecting all reachable paths between A-Z；
1) all links are traversed, the lower level network element B and D of A are first selected；
2) step in 1) is repeated, then finds out the lower level network element C and Z of B, because Z is terminal network element, therefore selects path A- > B- > Z;
3) step repeated in 1) continues to look for the lower level network element Z of C, selects path A- > B- > C- > Z;
4) lower level network element that the step in 1) finds out D again is repeated, path A- > D- > Z is selected；
Step 2: all bands are filtered out and is wider than the optional tunnel path of 120kbps and sorts；
1) link for A- > B- > band is wider than 120Kbps between Z:A, B has one 2, and band is wider than the link of 120Kbps between B, Z
There is one 6, so, the optional tunnel path in this path has 2-6；
2) link that band is wider than 120Kbps between A- > B- > C- > Z:A, B has one 2, and band is wider than 120Kbps's between B, C
Link has one 3, and the link that band is wider than 120Kbps between C, Z has one 8, so, the optional tunnel path in this path has 2-
3-8；
3) link for A- > D- > band is wider than 120Kbps between Z:A, D has two rules 4,5, and band is wider than 120Kbps's between D, Z
Link has one 7, so, the optional tunnel path in this path has 4-7,5-7；
Step 3: all reachable tunnel paths after length sequence are by path；
2-6、4-7、5-7、2-3-8
Optimal 3 are 2-6,4-7,5-7.
2. the automatic routing algorithm of a kind of network topology according to claim 1, it is characterised in that: four in the step 3
Paths 2-6,4-7,5-7,2-3-8 carry out length and compare and select optimal.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910460076.5A CN110191056A (en) | 2019-05-30 | 2019-05-30 | A kind of automatic routing algorithm of network topology |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910460076.5A CN110191056A (en) | 2019-05-30 | 2019-05-30 | A kind of automatic routing algorithm of network topology |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110191056A true CN110191056A (en) | 2019-08-30 |
Family
ID=67718764
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910460076.5A Pending CN110191056A (en) | 2019-05-30 | 2019-05-30 | A kind of automatic routing algorithm of network topology |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110191056A (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105991521A (en) * | 2015-01-30 | 2016-10-05 | 阿里巴巴集团控股有限公司 | Network risk assessment method and network risk assessment device |
| CN106341187A (en) * | 2016-09-08 | 2017-01-18 | 国家电网公司 | Communication flow request forwarding method in OTN and apparatus thereof |
| CN107301129A (en) * | 2017-06-28 | 2017-10-27 | 百度在线网络技术（北京）有限公司 | Method and apparatus for generating test case |
| CN109067648A (en) * | 2018-07-27 | 2018-12-21 | 西安电子科技大学 | The calculation method of multiple constraint routing optimality based on DAG |
-
2019
- 2019-05-30 CN CN201910460076.5A patent/CN110191056A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105991521A (en) * | 2015-01-30 | 2016-10-05 | 阿里巴巴集团控股有限公司 | Network risk assessment method and network risk assessment device |
| CN106341187A (en) * | 2016-09-08 | 2017-01-18 | 国家电网公司 | Communication flow request forwarding method in OTN and apparatus thereof |
| CN107301129A (en) * | 2017-06-28 | 2017-10-27 | 百度在线网络技术（北京）有限公司 | Method and apparatus for generating test case |
| CN109067648A (en) * | 2018-07-27 | 2018-12-21 | 西安电子科技大学 | The calculation method of multiple constraint routing optimality based on DAG |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN1905748B (en) | Method of identifying a radio link | |
| US7366108B2 (en) | Network topologies | |
| CN1171420C (en) | Method and system for communication of data via optimum data path in network | |
| CN103812930B (en) | A kind of method and device of scheduling of resource | |
| US8451736B2 (en) | Network assessment and short-term planning procedure | |
| CN105474588A (en) | Adaptive traffic engineering configuration | |
| CN109362093B (en) | Resource optimization method for maximizing total throughput of network function virtualization | |
| CN106254265A (en) | Process the methods, devices and systems of message | |
| CN106936683A (en) | A kind of method and device for realizing tunnel configuration | |
| Li et al. | Joint optimization of BBU pool allocation and selection for C-RAN networks | |
| US8532045B2 (en) | Method and system for spectrum management | |
| CN102480377B (en) | Management method and system of aggregation link | |
| Sen | Intelligent Admission and Placement of O-RAN Slices Using Deep Reinforcement Learning | |
| CN104242993B (en) | Mesolow power communication Access Network bandwidth prediction method | |
| CN110191056A (en) | A kind of automatic routing algorithm of network topology | |
| CN103582005B (en) | A kind of method and apparatus carrying out traffic assignments between network | |
| CN110009061B (en) | AP self-adaptive optimization selection method based on machine learning | |
| Yu et al. | Midhaul transmission using edge data centers with split PHY processing and wavelength reassignment for 5G wireless networks | |
| US8929234B1 (en) | Intermediate network bandwidth requirement determination | |
| US20230362060A1 (en) | Systems and methods for closed loop automation between wireless network nodes | |
| Dravida et al. | Narrowband and broadband infrastructure design for wireless networks | |
| CN103826280B (en) | Mobile communication network route optimizing method and system | |
| CN108173555A (en) | A kind of waveform controlling method based on multi-parameter state machine | |
| CN109379646B (en) | Passive optical network system and communication method thereof | |
| Castro et al. | A comparison of dynamic traffic grooming algorithms for elastic optical 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 | ||
| CB02 | Change of applicant information |
Address after: 518000, building 10, two software park, Shenzhen Road, Nanshan District hi tech Zone, Shenzhen, Guangdong, 202 Applicant after: Shenzhen AVIC bit Communication Technology Co.,Ltd. Address before: 518000, building 10, two software park, Shenzhen Road, Nanshan District hi tech Zone, Shenzhen, Guangdong, 202 Applicant before: SHENZHEN CITY AVIC BIT COMMUNICATION TECHNOLOGY Co.,Ltd. |
|
| CB02 | Change of applicant information | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20190830 |
|
| RJ01 | Rejection of invention patent application after publication |