CN111327525A - Network routing method and device based on segmented routing - Google Patents
Network routing method and device based on segmented routing Download PDFInfo
- Publication number
- CN111327525A CN111327525A CN201811533483.6A CN201811533483A CN111327525A CN 111327525 A CN111327525 A CN 111327525A CN 201811533483 A CN201811533483 A CN 201811533483A CN 111327525 A CN111327525 A CN 111327525A
- Authority
- CN
- China
- Prior art keywords
- port
- mesh
- pcc
- path
- pce
- 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
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/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/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 embodiment of the invention provides a network routing method and a device based on segmented routing, wherein an SDN deployment architecture constructed based on different large-flow service scene data flows comprehensively considers grid information constructed based on test data among access routers and port state information acquired from the routers as a metric value calculation optimal path method, and aiming at the SDN deployment architecture, the method adapts to different large-flow service routing adjustment by using existing network equipment as much as possible; based on grid information constructed by test data among access routers and port state information collected from the routers, metric values of differentiation adjustment are carried out according to the requirements of service flow, and PCE (path computation optimization) is carried out based on the metric values.
Description
Technical Field
The embodiment of the invention relates to the technical field of communication, in particular to a network routing method and device based on segmented routing.
Background
After more than forty years of rapid development, the internet has gradually penetrated into the aspects of people's life from the development of the original special academic network to the development of the current wider business platform. However, as global user sizes and network applications have exploded, the existing internet has exposed various deficiencies and drawbacks of the original design. For example, the original design idea of the existing network is that a network mainly faces a specific service, such as a telecommunication network mainly faces voice service, a television network mainly faces video service, and the internet mainly faces data transmission service, and the support for other services is poor. Therefore, a brand new internet architecture is urgently needed to be created to meet the demand of economic and social development on the future internet.
The traditional network continuously and passively adjusts the network architecture and configuration, cannot match the rapid development of services, and can lead the network deployment to be more and more complex and difficult to maintain; the application is expected to provide the requirement, the display path is calculated according to the service requirement, and the network is dynamically adjusted in real time to quickly meet the service change requirement. The network architecture needs to be evolved from "network adaptation services" to "service driven networks".
Software-Defined Networking (SDN) is an emerging network architecture, which separates the control plane of existing highly integrated network devices from complex underlying devices, so that a network manager can configure, manage and control the whole network skillfully and efficiently, and modify the network in a programming manner to meet the continuously expanding network scale and the rapidly increasing traffic demand.
Currently, the existing research schemes based on SDN routing mainly include: (1) collecting networking connection information data files by using an SDN controller, and updating network nodes and a network adjacency list according to information data read from the information data files; performing route calculation and route selection by adopting a balanced global load balancing algorithm according to the obtained network node and the adjacency list; and storing the obtained optimal path and writing the optimal path into a file. The method can improve the stability of the whole system and the optimization of path selection, and improve the utilization rate of the whole link; (2) the method comprises the steps of dividing a network into a plurality of sub-networks with smaller scale, electing a flow sink node in each sub-network, forwarding communication among common nodes in each sub-network through the flow sink node, and forwarding communication among the common nodes across the sub-networks through the flow sink nodes of the sub-networks. Compared with the prior art, the positive effect is: by splitting a large network into a plurality of subnets and applying different route calculation and control methods in the subnets and among the subnets, a route entry aggregation means based on an OpenFlow protocol is provided, so that the calculation complexity of calculating the large-scale network route is effectively reduced, the utilization rate of the network on high-bandwidth, low-delay and low-jitter links is improved, the flow table item resource requirement of the system is reduced, and the performance and adaptability of the SDN technology in a large-scale networking environment are enhanced; (3) the method comprises the steps that an entry Provider Edge (PE) encapsulates information sent by a first Customer Edge (CE) into a data packet containing label information according to a label of a second CE and a label of a target PE; and the ingress PE sends the encapsulated data packet to a core layer device P, the core layer device establishes a forwarding path according to a label of a target PE in the data packet, routes the data packet to the target PE, and the target PE routes information sent by a first CE in the data packet to a second CE according to a label of the second CE. According to the method, the device and the system, the SDN controller in a centralized deployment mode is used for issuing VPN (virtual private Network) routing information for forwarding, the operation and maintenance workload is reduced, and the service operation efficiency of an operator is improved.
In the method (1), the network node and the adjacency list are adopted, an SDN network route calculation method for balancing global load balance is adopted, port state and link quality information are not considered, meanwhile, the path selection cannot be carried out aiming at specific services, and the architecture evolution requirement of a service-driven network cannot be met. Among the above methods (2), the SDN technology based on OpenFlow is the most widely known and is one of the most influential protocols in the SDN framework at present. However, the concept of a multi-stage flow table is proposed in openflowvv 1.1, and the number of stages is not limited, so that the flow table items of the control plane are very huge, the requirements on hardware performance are higher and higher, and meanwhile, the speed of matching and table lookup is influenced to a certain extent, so that the method is suitable for deployment in a small range and is difficult to adapt to a large network. The OpenFlow controller needs to configure all switches of the data plane, including flow table issuing and issuing of relevant matching rules, so that the load of the controller is greatly increased. In the method (3), in order to solve the defect that the flow table of the OpenFlow large-scale network application is too large, the large-scale network is divided into a plurality of subnets with small scales, one flow aggregation node is elected in each subnet, communication among the common nodes in each subnet is forwarded through the flow aggregation node, communication among the common nodes across the subnets is forwarded by the flow aggregation node of the subnet, but different routing calculation and control methods need to be applied in the subnet and among the subnets, all switches of a data plane need to be configured, including flow table issuing and issuing of relevant matching rules, and the load of a controller is greatly increased.
Disclosure of Invention
Embodiments of the present invention provide a method and an apparatus for routing a network based on a segment routing, which overcome the above problems or at least partially solve the above problems.
In a first aspect, an embodiment of the present invention provides a network routing method based on a segment routing, including:
acquiring Mesh weight calculation parameters representing grid state information based on packet loss rate, round-trip delay and jitter from each port of a router to an adjacent router in the segmented routing; acquiring port weight calculation parameters representing port state information based on link residual bandwidth and Cyclic Redundancy Check (CRC) error packet number;
and acquiring a PCE path calculation metric value of a path calculation unit based on the Mesh weight calculation parameter and the port weight calculation parameter, and acquiring the shortest path from a source point to a destination node based on the PCE path calculation metric value.
Preferably, before acquiring the Mesh weight calculation parameter representing the Mesh state information, the method further includes:
and performing TraceRoute test and ping test based on different city edge router node probes to obtain the packet loss rate, round-trip delay and jitter among the direct link ports.
Preferably, the obtaining of the Mesh weight calculation parameter representing the Mesh state information specifically includes:
mesh weight calculation parameter theta representing grid state information is obtained based on packet loss rate, round-trip delay and jitter from M ports of router x to adjacent routers respectivelyMesh(pcc(m)x) Comprises the following steps:
in the above formula, Ld(pcc(m)x)、Dd(pcc(m)x) And Jd(pcc(m)x) Respectively representing packet loss rate, round trip delay and Euclidean distance of jitter to the average value of M ports of a port M of a router x; sigmaL、σDAnd σJThe packet loss rate, round trip delay and standard deviation of jitter to the average value of the M ports are respectively measured at the port M.
Preferably, before obtaining the port weight calculation parameter representing the port state information based on the link residual bandwidth and the number of CRC error packets, the method further includes:
based on the simple network management protocol SNMP and the NetStream deployed on the existing network equipment, the residual bandwidth of the link and the number of CRC error packets received by the set time port are collected.
Preferably, the port weight calculation parameter θPort(pcc(m)x) Comprises the following steps:
in the above formula, RBWd(pcc(m)x)、CRCd(pcc(m)x) Respectively representing the Euclidean distance, σ, of port M of router x in the residual bandwidth and the CRC error packet number for the average value of M portsRBW、σCRCThe standard deviation of the residual bandwidth and the CRC error packet number of the port M to the average value of the M ports respectively.
Preferably, obtaining a path computation metric value of a path computation element PCE based on the Mesh weight computation parameter and the port weight computation parameter includes:
mesh weight calculation parameter theta of x port m of routerMesh(pcc(m)x) And port weight calculation parameter θPort(pcc(m)x) And thetaMesh(pcc(m)x) α and θPort(pcc(m)x) The weight β, a weighting function of the PCE path calculation metric value of the mth port of the router x is constructed;
and acquiring values of the weight α and the weight β based on the service traffic type to obtain a weighting coefficient of the PCE path computation metric value, and obtaining the PCE path computation metric value based on the weighting coefficient.
Preferably, the obtaining the shortest path from the source node to the destination node based on the PCE path computation metric includes:
and based on the obtained PCE path calculation metric value, the PCE calculates the shortest path from the source point to the destination node according to the Dijkstra algorithm.
In a second aspect, an embodiment of the present invention provides a network routing device based on a segment route, including:
the first module is used for acquiring Mesh weight calculation parameters representing grid state information based on the packet loss rate, round-trip delay and jitter from each port of a router in the segmented routing to an adjacent router; acquiring port weight calculation parameters representing port state information based on link residual bandwidth and Cyclic Redundancy Check (CRC) error packet number;
and the second module is used for obtaining a PCE path calculation metric value of the path calculation unit based on the Mesh weight calculation parameter and the port weight calculation parameter, and obtaining the shortest path from a source node to a destination node based on the PCE path calculation metric value.
In a third aspect, an embodiment of the present invention provides an electronic device, which includes a memory, a processor, and a computer program stored in the memory and executable on the processor, and the processor implements the steps of the method provided in the first aspect when executing the program.
In a fourth aspect, an embodiment of the present invention provides a non-transitory computer readable storage medium, on which a computer program is stored, which when executed by a processor, implements the steps of the method as provided in the first aspect.
The embodiment of the invention provides a network routing method and a device based on segmented routing, wherein an SDN deployment architecture constructed based on different large-flow service scene data flows comprehensively considers grid information constructed based on test data between access routers and port state information acquired from the routers as a metric value to calculate an optimal path method, and aiming at the SDN deployment architecture, the method adapts to adjustment of different large-flow service routes by using existing network equipment as much as possible; based on grid information constructed by test data among access routers and port state information collected from the routers, metric values of differentiation adjustment are carried out according to the requirements of service flow, and PCE (path computation optimization) is carried out based on the metric values.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, and it is obvious that the drawings in the following description are some embodiments of the present invention, and those skilled in the art can also obtain other drawings according to the drawings without creative efforts.
FIG. 1 is a schematic diagram of a network routing method based on segment routing according to an embodiment of the present invention;
FIG. 2 is a schematic diagram of Segment Routing using PCE architecture according to an embodiment of the present invention;
fig. 3 is a schematic diagram of a meshomping test architecture according to an embodiment of the present invention;
FIG. 4 is a schematic diagram of a network routing device based on segmented routing according to an embodiment of the present invention;
fig. 5 is a schematic physical structure diagram of an electronic device according to an embodiment of the invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, but not all, embodiments of the present invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
In the prior art, a network node and an adjacency list are adopted, an SDN network routing calculation method for balancing global load balance is adopted, port state and link quality information are not considered, and meanwhile, a path can not be selected for a specific service, so that the requirement of architecture evolution of a service-driven network can not be met; in order to solve the defect that the flow table of the OpenFlow large-scale network application is overlarge, a large-scale network is divided into a plurality of subnets with smaller scales, one flow aggregation node is elected in each subnet, communication among common nodes in the subnets is forwarded through the flow aggregation node, communication among the common nodes across the subnets is forwarded by the flow aggregation node of the subnet, but different routing calculation and control methods are required to be applied in the subnet and among the subnets, all switches of a data plane are required to be configured, including flow table issuing and issuing of relevant matching rules, and the load of a controller is greatly increased; the method and the device select the route aiming at different services, reduce the operation and maintenance workload and improve the operation efficiency of the operator without the service, but the scheme does not consider the link quality and the port information in the process of establishing the Segment Routing and the MPLS tunnel.
Therefore, in each embodiment of the present invention, how to adjust to different large-flow service routes by using the existing network devices as much as possible, a metric value for performing differentiation adjustment according to the demand of service flow is comprehensively considered based on the grid information constructed based on the test data between the access routers and the port state information acquired from the routers, and the optimal path computation is performed based on the PCE metric value. The following description and description will proceed with reference being made to various embodiments.
Fig. 1 is a network routing method based on segment routing according to an embodiment of the present invention, including:
s1, acquiring Mesh weight calculation parameters representing grid state information based on packet loss rate, round-trip delay and jitter from each port of a router in the segmented routing to an adjacent router; acquiring port weight calculation parameters representing port state information based on link residual bandwidth and Cyclic Redundancy Check (CRC) error packet number;
s2, obtaining PCE path computation measurement value of the path computation element based on the Mesh weight computation parameter and the port weight computation parameter, and obtaining the shortest path from the source node to the destination node based on the PCE path computation measurement value.
In this embodiment, the OpenFlow controller needs to configure all switches of the data plane, including flow table issuing and issuing of relevant matching rules, which greatly increases the load of the controller. The controller in SR (Segment Routing) only needs to issue forwarding label heap to the ingress boundary router, and does not need to configure each node, and the state of the data stream is only stored in the ingress boundary router, and the intermediate node only needs to forward according to the label heap encapsulated in the packet header, thereby greatly reducing the deployment difficulty of the network. Therefore, compared with the OpenFlow, the network forwarding delay of the SR is greatly reduced, the expandability is greatly improved, and the deployment in large networks of operators is facilitated.
In this embodiment, because it is considered to be deployed in a large-scale network of an actual operator and to utilize existing network equipment as much as possible, a scheme is adopted in which a control plane and a data plane are separated by using a source routing model through an SR, the control plane stands in the perspective of the global network, an optimal path is calculated for different large-traffic service scenes (download-type and video-type services) data streams by comprehensively considering a mesh state information constructed based on test data between access routers and port state information collected from the routers as metric values, and the path is encoded to the data plane; it is the responsibility of the data plane to forward packets from an ingress node to the correct egress node. The scheme can change the existing network equipment as little as possible aiming at large-scale network application of operator level, and can provide a differentiated routing forwarding function aiming at different large-flow services.
In this embodiment, the data plane of the SR uses a data plane of MPLS (Multi-Protocol Label Switching), the control plane is implemented by using a PCE architecture, the PCE architecture is composed of a Path Computation Element (PCE) and a Path Computation Client (PCC), and the PCE and the PCC communicate by using PCEP (Path Computation Element Communication Protocol).
As shown in fig. 2, the PCE serves as a control plane of the SR, and calculates a path of traffic engineering for an SR data plane, where the data plane of the SR uses a data plane of MPLS; the routers of the SR data plane in the figure act as PCCs.
The PCE collects the topology information of the whole network through a Traffic Engineering Database (TE-DB), a Label Switched Path Database (LSP-DB) collects the LSP State information, network resources are globally managed and uniformly distributed, LSP service paths are centrally calculated, and an SR tunnel is formed by an SR for forwarding a data plane; the PCC is a forwarding network element, when an LSP service path needs to be calculated, a path calculation request is initiated to the PCE, and an MPLS tunnel data result formed by the SR is obtained and fed back to the PCC. The PCE adopts a stateful PCE technology, follows strict synchronization between the PCE and a traffic engineering database TE-DB, keeps the state when setting an active path and using reserved resources of a network, and has the following functions: (1) network topology and resources are discovered through IGP and traffic engineering resource updating; (2) collecting real-time data information of a link, forwarding port data of the plane router, pushing the real-time data information and the port data to a link real-time big data analysis platform, and receiving analysis results of the link and the port data; (3) monitoring the network state, measuring real-time flow demand and LSP statistics, re-optimizing the path based on the information, and forming a label stack after calculation is completed; (4) and receiving a request from a data plane by using a PCEP protocol, issuing the calculated label stack to the equipment, and guiding the equipment to forward according to a path specified by the label stack.
Mesh networks, i.e., "wireless Mesh networks," are "multi-hop" (multi-hop) networks, developed from ad hoc networks, and are one of the key technologies to solve the "last mile" problem. In the process of evolving to the next generation networks, wireless is an indispensable technology. The wireless mesh may cooperatively communicate with other networks. The wireless network system is a dynamic network architecture which can be continuously expanded, and any two devices can be wirelessly interconnected.
In this embodiment, Mesh weight calculation parameters representing Mesh state information are obtained based on packet loss rates, round-trip delays and jitters from each port of a router to an adjacent router in a segment routing; acquiring port weight calculation parameters representing port state information based on link residual bandwidth and Cyclic Redundancy Check (CRC) error packet number; and taking the Mesh weight calculation parameter and the port weight calculation parameter as PCE path calculation metric values to calculate the parameters of the optimal path, performing PCE path calculation metric values of differentiated adjustment according to the requirements of service flow, and performing optimal path calculation based on the PCE path calculation metric values. The method can change the existing network equipment as little as possible aiming at large-scale network application of operator level, and can provide a differentiated routing forwarding function aiming at different large-flow services.
On the basis of the above embodiment, before obtaining the Mesh weight calculation parameter representing the grid state information, the method further includes:
and performing TraceRoute test and ping test based on different city edge router node probes to obtain the packet loss rate, round-trip delay and jitter among the direct link ports.
In this embodiment, the metric values used in the path calculation are constructed by integrating Mesh weight calculation parameters and router port information calculation parameters, specifically, as shown in fig. 2, the metric values are a schematic diagram of a Mesh Ping test architecture, and based on Mesh Ping global positioning analysis, two TraceRoute + Ping tests are performed every 12 × 24 rounds (5-minute granularity) every day and N times every round according to different geographic edge router node probes. And acquiring Packet Loss Rate (Packet Loss Rate) L, Jitter (Jitter) J and Delay (Delay) D information among the ports of the directly connected link according to the TraceRoute test and the Ping test results.
As shown in fig. 3, according to the TraceRoute test results of RT1 to RT7, the routing paths from RT1 to RT7 are RT1 → RT11 → RT12 → RT15 → RT7, and the ICMP packet return times from RT1 to router three times per hop, TRT1 → RT11(1), TRT1 → RT11(2), and TRT1 → RT11 (3).
Assuming the Ping test results of RT1 to RT7, the ICMP Packet return time Delay and Jitter information of RT1 to RT7 can be obtained, and information such as round-trip time Delay (Delay, D), Jitter (Jitter, J), and Packet Loss Rate (Packet Loss Rate, L) of each segment of direct link (TRT1 → RT11(1), …, TRT1 → RT11 (N); TRT11 → RT12(1), …, TRT11 → RT12 (N); etc.) of TraceRoute is obtained by calculation through the information collected by each router.
On the basis of the foregoing embodiments, acquiring a Mesh weight calculation parameter representing grid state information specifically includes:
mesh weight calculation parameter theta representing grid state information is obtained based on packet loss rate, round-trip delay and jitter from M ports of router x to adjacent routers respectivelyMesh(pcc(m)x) Comprises the following steps:
in the above formula (1), Ld(pcc(m)x)、Dd(pcc(m)x) And Jd(pcc(m)x) Respectively represents the packet loss rate and round trip of the port m of the router xEuclidean distance of delay and jitter to the average value of M ports; sigmaL、σDAnd σJThe packet loss rate, round trip delay and standard deviation of jitter to the average value of the M ports are respectively measured at the port M.
In this embodiment, Ld(pcc(m)x)、Jd(pcc(m)x) And Dd(pcc(m)x)，σL、σJAnd σDThe following formulas (2) and (3):
in the above formulae (2) and (3), L (pc)x)、D(pccx) And J (pc)x) Packet loss rate, round trip delay and jitter of port m of the x-th router respectively;
and
the average packet loss rate, average round trip delay and average jitter of the M ports of the xth router are respectively.
On the basis of the foregoing embodiments, before obtaining a port weight calculation parameter representing port state information based on a link residual bandwidth and a cyclic redundancy check CRC packet number, the method further includes:
based on the simple network management protocol SNMP and the NetStream deployed on the existing network equipment, the residual bandwidth of the link and the number of CRC error packets received by the set time port are collected.
In the present embodiment, the normalized port weight calculation parameter θPort(pcc(m)x) Based on the link Residual Bandwidth (RBW) acquired by deploying SNMP, NetStream and other protocols on the current network equipment and the CRC (Cyclic Redundancy Check) error packet number received by a port in a shorter periodAnd (4) obtaining data.
On the basis of the above embodiments, the port weight calculation parameter θPort(pcc(m)x) Comprises the following steps:
in the above formula, RBWd(pcc(m)x)、CRCd(pcc(m)x) Respectively representing the Euclidean distance, σ, of port M of router x in the residual bandwidth and the CRC error packet number for the average value of M portsRBW、σCRCThe standard deviation of the residual bandwidth and the CRC error packet number of the port M to the average value of the M ports respectively.
In the present embodiment, RBWd(pcc(m)x)、CRCd(pcc(m)x)、σRBWAnd σCRCThe following formulas (5) and (6) are shown below:
in the above formula, RBW (pc (m)x) And CRC (pc (m)x) Port m for router x respectively is at the remaining bandwidth and the CRC error packet number,
and
the average remaining bandwidth at M ports M and the average CRC error packet number for router x, respectively.
On the basis of the foregoing embodiments, obtaining a path computation metric value of a path computation element PCE based on the Mesh weight computation parameter and the port weight computation parameter specifically includes:
mesh weight calculation parameter theta of x port m of routerMesh(pcc(m)x) And port weight calculation parameter θPort(pcc(m)x) And thetaMesh(pcc(m)x) α and θPort(pcc(m)x) The weight β, a weighting function of the PCE path calculation metric value of the mth port of the router x is constructed;
and acquiring values of the weight α and the weight β based on the service traffic type to obtain a weighting coefficient of the PCE path computation metric value, and obtaining the PCE path computation metric value based on the weighting coefficient.
In this embodiment, the PCE path calculates the metric value based on the Mesh weightMesh(pcc(m)x) And port weight calculation parameter θPort(pcc(m)x) And the linear decision algorithm is applied, and the two parameters are mainly used as a judgment basis to calculate the metric value of the LSP. The weighting function of the metric value of the mth port of router x is shown in equation (7) below:
wherein theta isMesh(pcc(m)x) And thetaPort(pcc(m)x) Mesh weight calculation parameter and port weight calculation parameter for router x port m, respectively, α, β are θ, respectivelyMesh(pcc(m)x) And thetaPort(pcc(m)x) The metric value is calculated by adopting a minimum decision rule, in order to determine the weight value, a decision matrix is constructed in this embodiment, as shown in the following equation (8):
in the above formula (8), a12β relative to ThDegree of importance of, a21α importance relative to β12＝1/a21. Let a12When a, the weight coefficient calculation formula is expressed by the following equation (9):
when the service flow is the downloading service flow, the influence of the bandwidth and the transmission quality on the strategy judgment is relatively large, and a is12>a21I.e. a>1，α<β, when the service flow is video flow, the influence of time delay, packet loss rate and jitter on the strategy judgment is relatively large, if a12<a21I.e. 0<a<1，α>β。
Based on the current traffic type, a value can be obtained, and a PCE path computation metric value is obtained as shown in the following formula (10):
based on the above embodiments, and based on the PCE path computation metric, obtaining the shortest path from the source node to the destination node specifically includes:
and based on the obtained PCE path calculation metric value, the PCE calculates the shortest path from the source point to the destination node according to the Dijkstra algorithm.
In this embodiment, based on the grid information constructed by the test data between the access routers and the port state information collected from the routers, the metric value of the differentiation adjustment is performed according to the demand of the traffic flow, and the optimal path calculation is performed based on the metric value PCE.
The embodiment of the present invention further provides a network routing device based on the segmented routing, and the network routing method based on the segmented routing according to the above embodiments, as shown in fig. 4, includes a first module 30 and a second module 40, where:
the first module 30 obtains Mesh weight calculation parameters representing Mesh state information based on packet loss rate, round-trip delay and jitter from each port of a router in the segment routing to an adjacent router; acquiring port weight calculation parameters representing port state information based on link residual bandwidth and Cyclic Redundancy Check (CRC) error packet number;
the second module 40 obtains a PCE path computation metric value of the path computation element based on the Mesh weight computation parameter and the port weight computation parameter, and obtains a shortest path from a source node to a destination node based on the PCE path computation metric value.
Fig. 5 is a schematic entity structure diagram of an electronic device according to an embodiment of the present invention, and as shown in fig. 5, the electronic device may include: a processor (processor)810, a communication Interface 820, a memory 830 and a communication bus 840, wherein the processor 810, the communication Interface 820 and the memory 830 communicate with each other via the communication bus 840. The processor 810 may invoke a computer program stored in the memory 830 and operable on the processor 810 to perform the segment routing based network routing methods provided by the embodiments described above, including, for example:
acquiring Mesh weight calculation parameters representing grid state information based on packet loss rate, round-trip delay and jitter from each port of a router to an adjacent router in the segmented routing; acquiring port weight calculation parameters representing port state information based on link residual bandwidth and Cyclic Redundancy Check (CRC) error packet number;
and acquiring a PCE path calculation metric value of a path calculation unit based on the Mesh weight calculation parameter and the port weight calculation parameter, and acquiring the shortest path from a source point to a destination node based on the PCE path calculation metric value.
In addition, the logic instructions in the memory 830 may be implemented in software functional units and stored in a computer readable storage medium when the logic instructions are sold or used as independent products. Based on such understanding, the technical solutions of the embodiments of the present invention may be essentially implemented or make a contribution to the prior art, or may be implemented in the form of a software product stored in a storage medium and including instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the methods described in the embodiments of the present invention. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and other various media capable of storing program codes.
An embodiment of the present invention further provides a non-transitory computer-readable storage medium, on which a computer program is stored, where the computer program is implemented to perform the method for routing a network based on a segment route provided in the foregoing embodiments when executed by a processor, and the method includes:
acquiring Mesh weight calculation parameters representing grid state information based on packet loss rate, round-trip delay and jitter from each port of a router to an adjacent router in the segmented routing; acquiring port weight calculation parameters representing port state information based on link residual bandwidth and Cyclic Redundancy Check (CRC) error packet number;
and acquiring a PCE path calculation metric value of a path calculation unit based on the Mesh weight calculation parameter and the port weight calculation parameter, and acquiring the shortest path from a source point to a destination node based on the PCE path calculation metric value.
An embodiment of the present invention further provides a computer program product, where the computer program product includes a computer program stored on a non-transitory computer readable storage medium, the computer program includes program instructions, and when the program instructions are executed by a computer, the computer can execute the network routing method based on segment routing as described above, for example, the method includes:
acquiring Mesh weight calculation parameters representing grid state information based on packet loss rate, round-trip delay and jitter from each port of a router to an adjacent router in the segmented routing; acquiring port weight calculation parameters representing port state information based on link residual bandwidth and Cyclic Redundancy Check (CRC) error packet number;
and acquiring a PCE path calculation metric value of a path calculation unit based on the Mesh weight calculation parameter and the port weight calculation parameter, and acquiring the shortest path from a source point to a destination node based on the PCE path calculation metric value.
In summary, the network routing method and device based on the segmented routing provided by the embodiments of the present invention are based on an SDN deployment architecture constructed based on different large-traffic service scene data flows, and a method for calculating an optimal path by taking grid information constructed based on test data between access routers and port state information acquired from the routers as metric values into comprehensive consideration, and aiming at the SDN deployment architecture, how to adjust to adapt to different large-traffic service routes by using existing network devices as much as possible is performed; based on grid information constructed by test data among access routers and port state information collected from the routers, metric values of differentiation adjustment are carried out according to the requirements of service flow, and PCE (path computation optimization) is carried out based on the metric values.
The above-described embodiments of the apparatus are merely illustrative, and the units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of the present embodiment. One of ordinary skill in the art can understand and implement it without inventive effort.
Through the above description of the embodiments, those skilled in the art will clearly understand that each embodiment can be implemented by software plus a necessary general hardware platform, and certainly can also be implemented by hardware. With this understanding in mind, the above-described technical solutions may be embodied in the form of a software product, which can be stored in a computer-readable storage medium such as ROM/RAM, magnetic disk, optical disk, etc., and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to execute the methods described in the embodiments or some parts of the embodiments.
Finally, it should be noted that: the above examples are only intended to illustrate the technical solution of the present invention, but not to limit it; although the present invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; and such modifications or substitutions do not depart from the spirit and scope of the corresponding technical solutions of the embodiments of the present invention.
Claims (10)
1. A network routing method based on segmented routing is characterized by comprising the following steps:
acquiring Mesh weight calculation parameters representing grid state information based on packet loss rate, round-trip delay and jitter from each port of a router to an adjacent router in the segmented routing; acquiring port weight calculation parameters representing port state information based on link residual bandwidth and Cyclic Redundancy Check (CRC) error packet number;
and acquiring a PCE path calculation metric value of a path calculation unit based on the Mesh weight calculation parameter and the port weight calculation parameter, and acquiring the shortest path from a source point to a destination node based on the PCE path calculation metric value.
2. The method of claim 1, wherein before obtaining the Mesh weight calculation parameter characterizing the Mesh state information, the method further comprises:
and performing TraceRoute test and ping test based on different city edge router node probes to obtain the packet loss rate, round-trip delay and jitter among the direct link ports.
3. The method according to claim 1, wherein obtaining the Mesh weight calculation parameter representing the Mesh state information specifically comprises:
mesh weight calculation parameter theta representing grid state information is obtained based on packet loss rate, round-trip delay and jitter from M ports of router x to adjacent routers respectivelyMesh(pcc(m)x) Comprises the following steps:
in the above formula, Ld(pcc(m)x)、Dd(pcc(m)x) And Jd(pcc(m)x) Are respectively provided withRepresenting the packet loss rate, round trip delay and Euclidean distance of jitter to the average value of M ports of the port M of the router x; sigmaL、σDAnd σJThe packet loss rate, round trip delay and standard deviation of jitter to the average value of the M ports are respectively measured at the port M.
4. The method of claim 1, wherein before obtaining port weight calculation parameters characterizing port status information based on link residual bandwidth and Cyclic Redundancy Check (CRC) number of error packets, the method further comprises:
based on the simple network management protocol SNMP and the NetStream deployed on the existing network equipment, the residual bandwidth of the link and the number of CRC error packets received by the set time port are collected.
5. A method for routing a network based on segmented routing according to claim 3, characterized in that the port weight calculation parameter θPort(pcc(m)x) Comprises the following steps:
in the above formula, RBWd(pcc(m)x)、CRCd(pcc(m)x) Respectively representing the Euclidean distance, σ, of port M of router x in the residual bandwidth and the CRC error packet number for the average value of M portsRBW、σCRCThe standard deviation of the residual bandwidth and the CRC error packet number of the port M to the average value of the M ports respectively.
6. The method for selecting a route based on a segment routing according to claim 5, wherein obtaining a path computation metric of a Path Computation Element (PCE) based on the Mesh weight computation parameter and the port weight computation parameter specifically comprises:
mesh weight calculation parameter theta of x port m of routerMesh(pcc(m)x) And port weight calculation parameter θPort(pcc(m)x) And thetaMesh(pcc(m)x) Right of (1)Values α and θPort(pcc(m)x) The weight β, a weighting function of the PCE path calculation metric value of the mth port of the router x is constructed;
and acquiring values of the weight α and the weight β based on the service traffic type to obtain a weighting coefficient of the PCE path computation metric value, and obtaining the PCE path computation metric value based on the weighting coefficient.
7. The method according to claim 1, wherein the obtaining the shortest path from the source node to the destination node based on the PCE path computation metric value comprises:
and based on the obtained PCE path calculation metric value, the PCE calculates the shortest path from the source point to the destination node according to the Dijkstra algorithm.
8. A network routing device based on segment routing, comprising:
the first module is used for acquiring Mesh weight calculation parameters representing grid state information based on the packet loss rate, round-trip delay and jitter from each port of a router in the segmented routing to an adjacent router; acquiring port weight calculation parameters representing port state information based on link residual bandwidth and Cyclic Redundancy Check (CRC) error packet number;
and the second module is used for obtaining a PCE path calculation metric value of the path calculation unit based on the Mesh weight calculation parameter and the port weight calculation parameter, and obtaining the shortest path from a source node to a destination node based on the PCE path calculation metric value.
9. An electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, characterized in that the steps of the method according to any of claims 1 to 7 are implemented when the processor executes the program.
10. A non-transitory computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out the steps of the method according to any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811533483.6A CN111327525B (en) | 2018-12-14 | 2018-12-14 | Network routing method and device based on segmented routing |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811533483.6A CN111327525B (en) | 2018-12-14 | 2018-12-14 | Network routing method and device based on segmented routing |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111327525A true CN111327525A (en) | 2020-06-23 |
| CN111327525B CN111327525B (en) | 2021-11-30 |
Family
ID=71164846
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811533483.6A Active CN111327525B (en) | 2018-12-14 | 2018-12-14 | Network routing method and device based on segmented routing |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111327525B (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113472659A (en) * | 2021-07-02 | 2021-10-01 | 中国电信股份有限公司 | Method and device for determining forwarding path and SDN controller |
| CN113873548A (en) * | 2021-09-03 | 2021-12-31 | 中盈优创资讯科技有限公司 | One-key opening method and device for white box equipment |
| CN114363249A (en) * | 2020-09-30 | 2022-04-15 | 瞻博网络公司 | Bandwidth constraints for multi-path segment routing |
| CN114363250A (en) * | 2020-09-30 | 2022-04-15 | 瞻博网络公司 | Re-computation of multipaths in a network supporting segment routing |
| CN114531393A (en) * | 2021-12-30 | 2022-05-24 | 百果园技术(新加坡)有限公司 | Method, device, equipment, medium and program product for issuing segmented routing strategy |
| WO2022110948A1 (en) * | 2020-11-25 | 2022-06-02 | 华为技术有限公司 | Path weight allocation method and device |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20110222506A1 (en) * | 2008-10-14 | 2011-09-15 | Szymanksi Tadeusz H | Delay and jitter wireless mesh network scheduling |
| US8116197B2 (en) * | 2006-11-02 | 2012-02-14 | Eci Telecom Ltd. | Method for finding protected path in mesh networks |
| CN107770065A (en) * | 2017-10-10 | 2018-03-06 | 山东大学 | A kind of streaming media path selecting system based on software defined network SDN |
| CN108282707A (en) * | 2017-12-22 | 2018-07-13 | 西安电子科技大学 | Network on mating plate path calculation method under optical circuit give-and-take conditions |
-
2018
- 2018-12-14 CN CN201811533483.6A patent/CN111327525B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8116197B2 (en) * | 2006-11-02 | 2012-02-14 | Eci Telecom Ltd. | Method for finding protected path in mesh networks |
| US20110222506A1 (en) * | 2008-10-14 | 2011-09-15 | Szymanksi Tadeusz H | Delay and jitter wireless mesh network scheduling |
| CN107770065A (en) * | 2017-10-10 | 2018-03-06 | 山东大学 | A kind of streaming media path selecting system based on software defined network SDN |
| CN108282707A (en) * | 2017-12-22 | 2018-07-13 | 西安电子科技大学 | Network on mating plate path calculation method under optical circuit give-and-take conditions |
Non-Patent Citations (2)
| Title |
|---|
| 杭彦希等: "一种片上网络拥堵感知的自适应容错路由算法", 《小型微型计算机系统》 * |
| 王勇智等: "基于时延调节的移动自组网多路径路由策略", 《电子技术》 * |
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114363249A (en) * | 2020-09-30 | 2022-04-15 | 瞻博网络公司 | Bandwidth constraints for multi-path segment routing |
| CN114363250A (en) * | 2020-09-30 | 2022-04-15 | 瞻博网络公司 | Re-computation of multipaths in a network supporting segment routing |
| CN114363249B (en) * | 2020-09-30 | 2023-09-12 | 瞻博网络公司 | Bandwidth constraint for multi-path segment routing |
| US11818032B2 (en) | 2020-09-30 | 2023-11-14 | Juniper Networks, Inc. | Bandwidth constraint for multipath segment routing |
| WO2022110948A1 (en) * | 2020-11-25 | 2022-06-02 | 华为技术有限公司 | Path weight allocation method and device |
| CN113472659A (en) * | 2021-07-02 | 2021-10-01 | 中国电信股份有限公司 | Method and device for determining forwarding path and SDN controller |
| CN113472659B (en) * | 2021-07-02 | 2023-04-18 | 中国电信股份有限公司 | Method and device for determining forwarding path and SDN controller |
| CN113873548A (en) * | 2021-09-03 | 2021-12-31 | 中盈优创资讯科技有限公司 | One-key opening method and device for white box equipment |
| CN114531393A (en) * | 2021-12-30 | 2022-05-24 | 百果园技术(新加坡)有限公司 | Method, device, equipment, medium and program product for issuing segmented routing strategy |
| CN114531393B (en) * | 2021-12-30 | 2023-11-28 | 百果园技术(新加坡)有限公司 | Method, device, equipment and medium for issuing segment routing strategy |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111327525B (en) | 2021-11-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111327525B (en) | Network routing method and device based on segmented routing | |
| US10742556B2 (en) | Tactical traffic engineering based on segment routing policies | |
| US10642739B2 (en) | Distributed coordination of caching and processing by networking devices | |
| Mendiola et al. | A survey on the contributions of software-defined networking to traffic engineering | |
| US9800507B2 (en) | Application-based path computation | |
| EP3222005B1 (en) | Passive performance measurement for inline service chaining | |
| US9369387B2 (en) | Segment routing based wide area network orchestration in a network environment | |
| CN108234312B (en) | Flow scheduling method, PCE (path computation element) and SDN (software defined network) system | |
| US20160149788A1 (en) | Passive Performance Measurement for Inline Service Chaining | |
| CN108809857A (en) | A method of the traffic monitoring based on SDN and service quality securing strategy | |
| EP2843875A1 (en) | Determination and use of link performance measures | |
| WO2015153225A1 (en) | Peer-based handoff performance measurement | |
| CN107135158A (en) | Optimal route selection method in a kind of multi-path transmission | |
| WO2018233580A1 (en) | Method, controller and system for establishing forwarding path in network | |
| Michael et al. | Optimal link-state hop-by-hop routing | |
| CN104283807B (en) | A kind of traffic engineering tunnel method for building up and device | |
| CN102195892B (en) | System and method for control quality of network flow | |
| WO2023082815A1 (en) | Method and apparatus for constructing deterministic routing, and storage medium | |
| Vdovin et al. | Network utilization optimizer for SD-WAN | |
| Casellas et al. | Experimental validation of the ACTN architecture for flexi-grid optical networks using active stateful hierarchical PCEs | |
| Tripathi et al. | Ensuring reliability in cloud computing and comparison on IPv6 encouraged with protocols | |
| Rohitaksha et al. | Routing in hybrid software defined networking using hop-count approach | |
| Yalda et al. | Design and Implementation of an Intra-domain routing module for an SDN controller for Traffic Engineering in SDN environment | |
| US11683260B2 (en) | Estimating a traffic matrix of a communication network using network topology features | |
| CN107070792A (en) | A kind of route selection method based on SDN |
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 |