CN113949659A - Intelligent routing method and device for traffic bearing path - Google Patents
Intelligent routing method and device for traffic bearing path Download PDFInfo
- Publication number
- CN113949659A CN113949659A CN202111199259.XA CN202111199259A CN113949659A CN 113949659 A CN113949659 A CN 113949659A CN 202111199259 A CN202111199259 A CN 202111199259A CN 113949659 A CN113949659 A CN 113949659A
- Authority
- CN
- China
- Prior art keywords
- path
- node
- bandwidth
- paths
- topology
- 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
- 238000000034 method Methods 0.000 title claims abstract description 15
- 238000010586 diagram Methods 0.000 description 5
- 238000004891 communication Methods 0.000 description 2
- 230000001934 delay Effects 0.000 description 2
- 230000004075 alteration Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000005457 optimization Methods 0.000 description 1
- 230000000750 progressive effect Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Images
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/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/302—Route determination based on requested QoS
Abstract
The invention relates to an intelligent routing method for a traffic bearing path, which comprises the steps of obtaining the priority, the bandwidth and the sending delay of a user service level protocol requirement and a head node and a tail node of a forwarding path; acquiring all nodes from a head node to a tail node of the forwarding path, the bandwidth and the sending time delay of the nodes and link information of two adjacent nodes from a network element layer; traversing all paths of the link from the head node to the tail node to form a plurality of single-topology paths; respectively calculating the corresponding bandwidth and the sending time delay of a plurality of single-topology paths, selecting an optimal forwarding path for a user according to the priority, the bandwidth and the sending time delay required by a user service level protocol in a user requirement module, and equally dividing the bandwidth and the time delay of the network into a plurality of forwarding paths by adopting the technical scheme so as to realize the intelligent routing method of the flow bearing path for fully and effectively utilizing network resources.
Description
Technical Field
The invention relates to the field of communication, in particular to an intelligent routing method and device for a traffic bearing path.
Background
The future 5G network service has higher requirements on performance indexes such as clock precision, time delay, reliability and the like: the clock precision reaches nanosecond level, and the time delay reaches microsecond level. In order to meet the service requirements such as bandwidth, time delay and reliability, the service concepts such as urrllc, mtc and eMBB are developed, but the traditional QoS policy cannot meet the requirements. The network slicing technology can allocate different network resources to different services, divide a plurality of logical networks on an independent physical network, further realize pre-allocation and pre-optimization of resources according to the Service-Level Agreement (SLA) Level of the slices, and accurately control the bandwidth, the time delay and the like of the services on different slices so as to realize full and effective utilization of the network resources.
The patent application number CN201810340195.2 discloses a method, a device and equipment for managing network slices, which divide network resources into a plurality of time delay slice resources, each time delay slice can operate service connection corresponding to a service level protocol level, when a user needs to operate services on the corresponding time delay slice, only a direct connection virtual link corresponding to a virtual node pair needs to be opened, but the bandwidth calculation of the services on the slices is lacked, the requirements of the user on different service level protocols cannot be met, and the full and effective utilization of the network resources is realized.
Disclosure of Invention
Aiming at the defects of the prior art, the invention provides the intelligent routing method for the traffic bearing path, which divides the bandwidth and the time delay of the network into a plurality of forwarding paths so as to realize the full and effective utilization of network resources.
The invention discloses an intelligent routing method for a traffic bearing path, which adopts the following technical scheme: it includes:
s1, acquiring the priority, bandwidth, sending time delay and head node and end node of the forwarding path required by the user service level protocol;
s2, acquiring all nodes from the head node to the end node of the forwarding path, the bandwidth and the sending time delay of the nodes and the link information of two adjacent nodes from the network element layer;
s3, traversing all paths of the link from the head node to the tail node to form a plurality of single-topology paths;
and S4, respectively calculating the corresponding bandwidth and sending delay of the single topological paths, and selecting the optimal forwarding path for the user according to the priority, bandwidth and sending delay required by the user service level protocol in the user requirement module.
Further, the transmission delay corresponding to the single-topology path in step S4 is an accumulated value of delays of each node in the single-topology path.
Further, the bandwidth corresponding to the single-topology path in step S4 is the minimum bandwidth of each node in the single-topology path.
Furthermore, the optimal forwarding paths have multiple numbers, so that multiple optimal forwarding paths or one optimal forwarding path is provided for user requirements, and the rest are used as alternative forwarding paths.
And further, storing the optimal forwarding path, and directly using the optimal forwarding path when the user service level protocol requires the same priority, bandwidth, sending delay and forwarding path head node and tail node under the condition that the link service level protocol is not changed.
An intelligent routing device for a traffic bearing path applies the intelligent routing method for the traffic bearing path, and is characterized in that: it includes:
a user requirement module: acquiring the priority, bandwidth, sending delay and forwarding path head node and tail node required by a user service level protocol;
the path resource information acquisition module acquires node and link information from the network element layer;
a node topology information module: acquiring node information of a path between any two nodes in a network from a path resource information acquisition module;
a node link interconnection information module: acquiring information of all interconnected links between adjacent nodes from a path resource information acquisition module;
a link state information module: acquiring the state information of the existing link service level protocol of the node interconnection link from a path resource information acquisition module, wherein the state information comprises bandwidth and sending time delay;
the intelligent path selecting module: selecting an optimal forwarding path for a user according to the user demand module;
the path selection issuing module: the optimal forwarding path information selected by the path intelligent routing module is sent to a network element layer;
the intelligent path routing module acquires all nodes in the physical topology of the user forwarding path and adjacent node topology path links from the node topology information module and the link state information module according to the head node and the tail node of the forwarding path in the user demand module to form a plurality of single topology paths, acquires the bandwidth and the sending delay of the nodes from the link state information module, calculates the bandwidth and the sending delay corresponding to the single topology paths, and selects the optimal forwarding path for the user according to the priority, the bandwidth and the sending delay required by the user service level protocol in the user demand module.
Compared with the prior art, the invention has the following beneficial effects: all forwarding paths are quickly determined by adopting a node topology, a link topology and a service level protocol information base hierarchical progressive mode, and then the optimal paths are screened out from the network through bandwidth, time delay and the like, so that the flow of the network resources which are fully and effectively utilized is realized.
Drawings
The accompanying drawings, which are described herein to provide a further understanding of the application, are included in the following description:
fig. 1 is a network topology diagram of a single-node topology and a single relay path according to a first embodiment of the present invention;
fig. 2 is a network topology diagram of a single-node topology multi-relay path according to a second embodiment of the present invention;
fig. 3 is a network topology diagram of a single-node topology multi-relay path applied to other nodes according to a second embodiment of the present invention;
FIG. 4 is a network topology diagram of a multi-node topology multi-hop path according to the third embodiment of the present invention;
fig. 5 is a network topology diagram of four multi-node topology multi-hop paths according to an embodiment of the present invention.
Detailed Description
Referring to fig. 1, in a first embodiment, a node topology path for link forwarding may be determined according to user interworking information and service level protocol requirements;
firstly, the information of a flow forwarding path initial router Node A and a termination router Node C can be obtained according to the user communication requirement;
reading Node topological graph information, confirming the topological graph information between the starting Node and the stopping Node, if the Node A to the Node C only has one Node topology, representing the Node A as a single topological graph; the access node A accesses the access node C and can only access the access node B;
after the path node topology is determined, whether the adjacent node interconnection relay in the topology is unique is determined, and if only one relay interconnection exists between the nodes AB and BC, the forwarding path is a single-topology single-relay path;
the relay service level protocol information table is read to obtain link a and link b time delay bandwidth information, wherein the path time delay is the sum of the relay time delays: path delay sum (link delay);
the available bandwidth on the bandwidth path is the minimum available bandwidth of the relay on the path: a path bandwidth min (link bandwidth);
determining whether the path is available with reference to the user service level agreement requirement;
for the single-node topology single-relay condition, a preset forwarding segment list can be used, and multiple flows can share a forwarding path sharing the same single-node topology single-relay, so that the path selection efficiency is improved.
Referring to fig. 2, in the second embodiment, a node topology path for link forwarding can be determined according to user interworking information and service level protocol requirements;
reading node topological graph information, wherein the path from node A to node C must only pass through node B to be in single topology
After the path node topology is determined, whether the adjacent node interconnection relay in the topology is unique is determined, and two interconnection relays are arranged between nodes AB and BC of the graph and are single-topology multi-relay paths;
the single-node topology multi-relay needs to consider relay selection, comparison of service level protocols of forwarding paths under different relay combinations is carried out by reading a relay service level protocol information table, the combination is (link a, link b), (link c, link d), (link a, link d), (link c, link b) and related service level protocols have consistent calculation modes, and the forwarding paths are determined according to the requirements of user service level protocols such as the priority required on time delay and bandwidth;
for the single-node topology multi-relay situation, different segment list can be formed according to different service level agreement requirements:
for the requirement of a certain service level agreement of customer flow, a plurality of available forwarding paths can be formed for the paths which all meet the requirement;
different forwarding paths can be formed according to different service level protocols, such as the requirement of time delay or the requirement of bandwidth;
referring to fig. 3, the forwarding path from Node a to Node C may be applied to other Node topologies, for example, the path from Node X to Node Y, and a-C may directly use the calculated segment list forwarding result of the a-C end;
referring to fig. 4, in the third embodiment, a node topology path for link forwarding can be determined according to user interworking information and service level protocol requirements;
reading node topological graph information, wherein paths from a node A to a node C can pass through a plurality of node devices, and the nodes are interconnected into a plurality of relays;
for the case of multi-node topology and multi-relay, the topology is disassembled into a single topology; after the disassembly is completed, for the condition of single topology single relay, the service level agreement value of the optimal path of the related service level agreement under the condition of single topology is selected to be compared by combining the requirement of the user service level agreement, such as time delay, and the final optimal path is selected.
Referring to fig. 5, in the fourth embodiment, in the case that a traffic user is brought into a VPN channel and is forwarded through an IP bearer network, the input table 1 in the user service level agreement requirement module is as follows:
| inputting parameters | Numerical value |
| Slice start node | Node A |
| Slice termination node | Node D |
| Priority SLA requirements | Time delay |
| Suboptimal SLA requirements | Bandwidth of |
| Time delay requirement | <＝4ms |
| Bandwidth requirement | ＝100M |
| Belonging VPN | vpn1 |
The node topology information module obtains information as in table 2:
| starting node | Termination node | Whether or not to be multipath | Topological sequences | Node topology path | Whether there are multiple relays |
| Node A | Node D | Y | 1 | A-B-D | Y |
| Node A | Node D | Y | 2 | A-C-D | N |
The link state information module is as in table 3:
| Link num | link bandwidth | Available bandwidth | Time delay |
| link a | 100m | 100M | 1ms |
| link b | 100m | 80M | 1ms |
| link c | 100m | 100M | 2ms |
| link d | 100m | 100M | 2ms |
| link e | 100m | 100M | 3ms |
The node link interconnection information module obtains information as shown in table 4:
| starting node | Termination node | Whether there are multiple relays | Link num |
| Node A | Node B | N | link a |
| Node A | Node C | N | link b |
| Node C | Node D | N | link c |
| Node B | Node D | Y | link d |
| Node B | Node D | Y | link e |
The path intelligent routing module obtains paths as shown in table 5:
Option A
Option B
Option C
combining the service level protocol requirement of a user, the time delay is the priority service level protocol requirement, the requirements of < 4ms Option B and Option C can be met, the bandwidth requirement 100M selects Option C, and Segment list information is generated.
The forwarding information of the path selection issuing module is as shown in table 6:
if multiple paths exist to meet the requirements of the user service level agreement, multiple forwarding paths or alternative available paths may be provided according to the requirements of the user.
Although embodiments of the present invention have been shown and described, it will be appreciated by those skilled in the art that changes, modifications, substitutions and alterations can be made in these embodiments without departing from the principles and spirit of the invention, the scope of which is defined in the appended claims and their equivalents.
Claims (6)
1. An intelligent routing method for a traffic bearing path is characterized in that: it includes:
s1, acquiring the priority, bandwidth, sending time delay and head node and end node of the forwarding path required by the user service level protocol;
s2, acquiring all nodes from the head node to the end node of the forwarding path, the bandwidth and the sending time delay of the nodes and the link information of two adjacent nodes from the network element layer;
s3, traversing all paths of the link from the head node to the tail node to form a plurality of single-topology paths;
and S4, respectively calculating the corresponding bandwidth and sending delay of the single topological paths, and selecting the optimal forwarding path for the user according to the priority, bandwidth and sending delay required by the user service level protocol in the user requirement module.
2. The intelligent routing method for traffic-bearing paths according to claim 1, wherein: the sending delay corresponding to the single-topology path in the step S4 is a delay accumulated value of each node in the single-topology path.
3. The intelligent routing method for traffic-bearing paths according to claim 1, wherein: the bandwidth corresponding to the single-topology path in step S4 is the minimum bandwidth of each node in the single-topology path.
4. The intelligent routing method for traffic-bearing paths according to claim 1, wherein: the optimal forwarding paths are multiple, multiple optimal forwarding paths are provided for user requirements or one optimal forwarding path is provided, and the rest forwarding paths are used as alternative forwarding paths.
5. The intelligent routing method for traffic-bearing paths according to claim 1, wherein: and storing the optimal forwarding path, and directly using the optimal forwarding path when the user service level protocol requires the same priority, bandwidth, sending time delay and forwarding path head node and tail node under the condition that the link service level protocol is not changed.
6. An intelligent routing device for a traffic-bearing path, applying the intelligent routing method for a traffic-bearing path according to claim 1, characterized in that: it includes:
a user requirement module: acquiring the priority, bandwidth, sending delay and forwarding path head node and tail node required by a user service level protocol;
the path resource information acquisition module acquires node and link information from the network element layer;
a node topology information module: acquiring node information of a path between any two nodes in a network from a path resource information acquisition module;
a node link interconnection information module: acquiring information of all interconnected links between adjacent nodes from a path resource information acquisition module;
a link state information module: acquiring the state information of the existing link service level protocol of the node interconnection link from a path resource information acquisition module, wherein the state information comprises bandwidth and sending time delay;
the intelligent path selecting module: selecting an optimal forwarding path for a user according to the user demand module;
the path selection issuing module: the optimal forwarding path information selected by the path intelligent routing module is sent to a network element layer;
the intelligent path routing module acquires all nodes in the physical topology of the user forwarding path and adjacent node topology path links from the node topology information module and the link state information module according to the head node and the tail node of the forwarding path in the user demand module to form a plurality of single topology paths, acquires the bandwidth and the sending delay of the nodes from the link state information module, calculates the bandwidth and the sending delay corresponding to the single topology paths, and selects the optimal forwarding path for the user according to the priority, the bandwidth and the sending delay required by the user service level protocol in the user demand module.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111199259.XA CN113949659A (en) | 2021-10-14 | 2021-10-14 | Intelligent routing method and device for traffic bearing path |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111199259.XA CN113949659A (en) | 2021-10-14 | 2021-10-14 | Intelligent routing method and device for traffic bearing path |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN113949659A true CN113949659A (en) | 2022-01-18 |
Family
ID=79330524
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111199259.XA Pending CN113949659A (en) | 2021-10-14 | 2021-10-14 | Intelligent routing method and device for traffic bearing path |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113949659A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116471225A (en) * | 2023-06-12 | 2023-07-21 | 中仪英斯泰克科技有限公司 | Multicast stream transmission path optimization method and device, electronic equipment and storage medium |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20040246912A1 (en) * | 2003-06-06 | 2004-12-09 | Hoang Khoi Nhu | Source based scheme to establish communication paths in an optical network |
| CN106713141A (en) * | 2015-11-18 | 2017-05-24 | 华为技术有限公司 | Method for obtaining target transmission path and network node thereof |
| CN108512760A (en) * | 2018-03-09 | 2018-09-07 | 西安电子科技大学 | The method for routing of QoS of survice is ensured based on SDN |
| CN110391920A (en) * | 2018-04-16 | 2019-10-29 | 中兴通讯股份有限公司 | A kind of network slice management method and device and equipment |
| CN112333717A (en) * | 2020-11-13 | 2021-02-05 | 国网安徽省电力有限公司信息通信分公司 | 5G access network slice resource allocation method and device considering power multi-service requirements |
-
2021
- 2021-10-14 CN CN202111199259.XA patent/CN113949659A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20040246912A1 (en) * | 2003-06-06 | 2004-12-09 | Hoang Khoi Nhu | Source based scheme to establish communication paths in an optical network |
| CN106713141A (en) * | 2015-11-18 | 2017-05-24 | 华为技术有限公司 | Method for obtaining target transmission path and network node thereof |
| CN108512760A (en) * | 2018-03-09 | 2018-09-07 | 西安电子科技大学 | The method for routing of QoS of survice is ensured based on SDN |
| CN110391920A (en) * | 2018-04-16 | 2019-10-29 | 中兴通讯股份有限公司 | A kind of network slice management method and device and equipment |
| CN112333717A (en) * | 2020-11-13 | 2021-02-05 | 国网安徽省电力有限公司信息通信分公司 | 5G access network slice resource allocation method and device considering power multi-service requirements |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116471225A (en) * | 2023-06-12 | 2023-07-21 | 中仪英斯泰克科技有限公司 | Multicast stream transmission path optimization method and device, electronic equipment and storage medium |
| CN116471225B (en) * | 2023-06-12 | 2023-08-18 | 中仪英斯泰克科技有限公司 | Multicast stream transmission path optimization method and device, electronic equipment and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN114073052B (en) | Systems, methods, and computer readable media for slice-based routing | |
| EP2911348B1 (en) | Control device discovery in networks having separate control and forwarding devices | |
| US6594268B1 (en) | Adaptive routing system and method for QOS packet networks | |
| Sarkar et al. | End-to-end bandwidth guarantees through fair local spectrum share in wireless ad-hoc networks | |
| US8493869B2 (en) | Distributed constraints-based inter-domain network traffic management | |
| CN102055665B (en) | OSPF point-to-multipoint over broadcast or NBMA mode | |
| WO2001095641A2 (en) | Multi-path dynamic routing algorithm | |
| WO2000024164A1 (en) | Method and apparatus for network control | |
| CN103957158A (en) | Determining method and device for flow forwarding path and communication system | |
| US10523553B2 (en) | Implementing an E-LAN between multi-nodes utilizing a transport network controller | |
| Jung et al. | Low delay scheduling in wireless network | |
| CN113949659A (en) | Intelligent routing method and device for traffic bearing path | |
| CN107872385B (en) | SDN network routing calculation and control method | |
| KR100271856B1 (en) | Optimal path selective routing method | |
| TWI556599B (en) | Network controlling method and network controller | |
| KR100523903B1 (en) | Method for Reorganizing Wavelength Division Multiplexing Network using Dynamic Watermarks | |
| Chu et al. | New architecture and algorithms for fast construction of hose-model VPNs | |
| JP6633502B2 (en) | Communication device | |
| Klincewicz | Optimization issues in quality of service | |
| RU2775146C1 (en) | Method for automated provision of a virtual channel by a communication operator between data processing centers | |
| Chi et al. | Lazy flooding: a new technique for information dissemination in distributed network systems | |
| Biernacka | Elastic Optical Bypasses in Multi-Layer Networks | |
| Mamidisetty | Generalizing contour guided dissemination in mesh topologies | |
| CN114268577A (en) | Method, device, equipment and storage medium for establishing network connection | |
| Kigodi et al. | Review on network performance: Meaning, quantification and measurement |
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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20220118 |
|
| RJ01 | Rejection of invention patent application after publication |