Search

CN-122027552-A - Lightweight traffic forwarding path planning method and system

CN122027552ACN 122027552 ACN122027552 ACN 122027552ACN-122027552-A

Abstract

The invention discloses a lightweight flow forwarding path planning method and system, and belongs to the technical field of wired communication. The method comprises the steps of designating one device in a network as a path planner, taking charge of path planning, configuration issuing and state maintenance, and only executing forwarding rules by other forwarding nodes, manually designating a flow forwarding path through a browser network topology interface, or dynamically generating the forwarding path according to real-time bandwidth occupation by using path planning software. On the premise of not upgrading the existing network hardware equipment, the invention realizes the accurate control of the flow forwarding path by dividing the roles of a path planner and a common forwarding switch, customizing the priority of the path, designing a special control message, establishing a path maintenance and switching mechanism and combining two modes of manual configuration and software automatic planning, thereby solving the problems of neglecting bandwidth, coarseness of QoS scheduling and high SDN reconstruction cost of the traditional routing protocol.

Inventors

  • MENG YONGZHI
  • Mi Cunzhao

Assignees

  • 北京特立信电子技术股份有限公司

Dates

Publication Date
20260512
Application Date
20260415

Claims (11)

  1. 1. The lightweight traffic forwarding path planning method is characterized by comprising the following steps of: step 1, dividing roles, namely designating one device in a network as a path planner and taking charge of path planning, configuration issuing and state maintenance; Step 2, planning a path, namely manually designating a flow forwarding path through a browser network topology interface, or generating the forwarding path based on a multi-dimensional decision factor comprehensive path scoring and differential planning mechanism by utilizing path planning software, wherein the method specifically comprises the following steps of: (1) Acquiring a multi-dimensional decision factor and establishing a comprehensive path scoring model; (2) Based on the path scoring model, differential path planning is realized, specifically: identifying a service type and distributing a weight coefficient based on the service type; Sensing a network state through a network monitoring module; calculating a candidate path set by utilizing a shortest path algorithm based on network topology; substituting the comprehensive path scoring model for each path in the candidate path set to calculate a comprehensive score; Selecting a path with the highest comprehensive score as an optimal flow forwarding path, and providing the optimal flow forwarding path for a path planner; step 3, maintaining a forwarding path, namely periodically sending an reachability status message to a path planner by a forwarding node; If a node appears that the next hop is not reachable, the path planner issues a message of a discard mark or a destroy mark, and triggers the invalidation or deletion of a forwarding rule; And 4, switching the forwarding paths, namely enabling a standby path carrying an effective mark by a path planner when the main path fails, deleting the main path when the standby path does not exist, and switching the traffic to the autonomous routing forwarding.
  2. 2. The lightweight traffic forwarding path planning method of claim 1 wherein the planning path further comprises: (1) The path planner creates path planning configuration, forwards the path message to the forwarding nodes along the way in an IP unicast mode, and does not carry an effective mark; (2) The along-road forwarding node judges the accessibility of the direct connection next hop and feeds back the accessibility state to the path planner; (3) The path planner collects the next hop reachable responses of all forwarding nodes, and when the next hop reachable responses are confirmed to be reachable, the path planner issues a rule control message carrying a validation mark to the forwarding nodes along the path; (4) After each forwarding node receives the rule control message, the forwarding rule is loaded to the switching chip, so that the flow forwarding path is effective.
  3. 3. The lightweight traffic forwarding path planning method of claim 1, further comprising: the route planned route and the autonomous route learned by the routing protocol coexist, and the forwarding priority relation is that the planned main route is higher than the planned standby route, the standby route is higher than the autonomous route, and when the route planned route is not reachable, the automatic route is automatically switched to autonomous route forwarding.
  4. 4. The lightweight traffic forwarding path planning method of claim 1, wherein, Each node along the forwarding path periodically sends reachability status messages to the path planner to maintain the validity of the traffic forwarding path.
  5. 5. The lightweight traffic forwarding path planning method of claim 1, wherein, The forwarding path planner finds out the fault of the main forwarding path and the standby forwarding path exists, the effective mark position of the standby path is 1, and the standby forwarding path is started; If the standby forwarding path does not exist, only the main forwarding path is deleted, and the data message is forwarded according to the autonomous route.
  6. 6. The lightweight traffic forwarding path planning method of claim 1, wherein, The forwarding path message comprises data flow matching information, MD5 abstract, path planner IP, forwarding node equipment ID and next hop IP address, wherein the data flow matching information comprises source IP, source IP mask, destination IP mask, protocol type and port range.
  7. 7. A lightweight traffic forwarding path planning method according to claim 1 or 3, characterized in that, The reachability status message adopts Digest, nexthop, flags field combination to describe rule status, the Flags field contains reachability identification, subnet configuration error identification, next-hop address error identification and rule enabling status identification, and the Digest represents MD5 abstract of data stream matching content.
  8. 8. The lightweight traffic forwarding path planning method of claim 2, wherein, The RULE control message realizes the starting, discarding and destroying of forwarding RULEs through different identification bits of the Flags field, and specifically comprises three identification bits of stream_run_ctrl_ ACTIVATE, STREAM _run_ctrl_dis_ ACTIVATE, STREAM _run_ctrl_destroy.
  9. 9. The lightweight traffic forwarding path planning method of claim 1, wherein, And the forwarding node issues forwarding table items of the flow forwarding paths through a policy routing module of the switching chip.
  10. 10. A lightweight traffic forwarding path planning system comprising a path planner and forwarding nodes, the system comprising: The path planner is used for being responsible for path planning, configuration issuing and state maintenance, and the path planner manually appoints a flow forwarding path through a browser network topology interface or generates the forwarding path based on a multi-dimensional decision factor comprehensive path scoring and differential planning mechanism by utilizing path planning software, and specifically comprises the following steps: (1) Acquiring a multi-dimensional decision factor and establishing a comprehensive path scoring model; (2) Based on the path scoring model, differential path planning is realized, specifically: identifying a service type and distributing a weight coefficient based on the service type; Sensing a network state through a network monitoring module; calculating a candidate path set by utilizing a shortest path algorithm based on network topology; substituting the comprehensive path scoring model for each path in the candidate path set to calculate a comprehensive score; Selecting a path with the highest comprehensive score as an optimal flow forwarding path, and providing the optimal flow forwarding path for a path planner; The forwarding node only executes forwarding rules, judges the reachability of the direct connection next hop, and feeds back the reachability state to the path planner; and after receiving the rule control message, loading the forwarding rule to the exchange chip to enable the flow forwarding path to be effective.
  11. 11. A computer readable storage medium, characterized in that the computer readable storage medium stores a computer program which, when executed by a processor, implements the method of any of claims 1-9.

Description

Lightweight traffic forwarding path planning method and system Technical Field The invention relates to the technical field of wired communication, in particular to a lightweight flow forwarding path planning method and system. Background In the field of wired communication networks, the requirements of scenes such as enterprise campus networks, medium-sized local area networks and the like on the stability and reliability of traffic transmission are increasingly improved. The planning effect of the flow forwarding path directly determines the resource utilization rate of the network and the transmission quality of the high-priority service. The current mainstream flow forwarding path planning scheme has the following technical defects: The conventional routing protocol does not consider the unicast routing protocols in the wired network with path bandwidth and traffic congestion conditions, such as OSPF and RIP, and takes the shortest path algorithm as the basis of core routing computation. The protocol only focuses on the hop count among nodes, and completely ignores key factors such as the actual bandwidth of a path, the real-time traffic load and the like. This design defect can cause a large amount of traffic to flow into the same shortest path in a concentrated manner, which causes problems of path congestion, increased transmission delay and increased packet loss rate. Meanwhile, bandwidth resources of other non-shortest paths in the network are idle for a long time, and the utilization rate of the whole network resources is at a lower level. The pure QoS priority scheduling strategy is too extensive to ensure the transmission quality of high priority traffic, and part of the network can adopt a QoS priority queue scheduling mechanism. The mechanism prioritizes the different flows so that the high priority flows take precedence to network resources. The essence of this approach is preemptive scheduling, but the transmission guarantee of high priority traffic is at the expense of transmission opportunities for low priority traffic. The low priority traffic is frequently discarded and the transmission is interrupted in the scenario of continuous transmission of the high priority traffic, and the solution is too extensive. The SDN technology adopts a framework with a control plane and a data plane separated, supports the self-defined forwarding path according to the real-time bandwidth and the flow characteristics, and can theoretically solve the dual problems of flow congestion and priority guarantee. However, the standard of the SDN technology requires the comprehensive upgrade and update of hardware devices such as switches and routers in the existing network, and the purchase of special devices supporting the SDN feature. This can result in high hardware procurement costs and deployment costs. Meanwhile, compatibility barriers exist between the SDN network and the traditional non-SDN network, seamless docking is difficult, and for the scene of completing traditional network deployment, the transformation cost is too high and the implementation difficulty is high. Therefore, a technical solution is needed that can realize the fine control of the traffic forwarding path in the traditional network architecture without upgrading the existing network hardware. Disclosure of Invention Based on the problems in the prior art, the invention designs a lightweight flow path planning method, and the improvement of network transmission quality is realized through small improvement of application software under the condition of not upgrading the existing network hardware equipment. The invention adopts the following technical scheme: in one aspect of the present invention, a lightweight traffic forwarding path planning method is protected, including the following steps: Step 1, role division, namely designating one device in a network as a path planner and taking charge of path planning, configuration issuing and state maintenance; Step 2, path planning, namely manually designating a flow forwarding path through a browser network topology interface or generating the forwarding path based on a multi-dimensional decision factor comprehensive path scoring and differential planning mechanism by utilizing path planning software, wherein the method specifically comprises the following steps: (1) Acquiring a multi-dimensional decision factor and establishing a comprehensive path scoring model; (2) Based on the path scoring model, differential path planning is realized, specifically: Identifying the service type and mapping with the priority; Sensing a network state through a network monitoring module; calculating a candidate path set by utilizing a shortest path algorithm based on network topology; Substituting a scoring model for each path in the candidate set to calculate a comprehensive score; Selecting a path with the highest comprehensive score as an optimal forwarding path, and providing the optimal forwarding pat