Network Routing Controller for Congestion Avoidance
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing network systems face challenges in effectively designing forwarding tables for nodes to prevent congestion and enhance network reliability, as current methods lack efficient route planning methods that consider data rates and support rates of connection ports.
Innovation Solution
A routing method that utilizes a controller to collect data rates and support rates of nodes, calculates link costs, and selects the path with the smallest sum of link costs as the packet transmitting path, dynamically updating forwarding rules to balance data rate load and prevent congestion.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If manual forwarding table configuration is used, then network setup is simple, but network congestion cannot be effectively prevented and reliability is reduced
Solution Approach 1:
A centralized controller is introduced as an intermediary between network nodes and forwarding table configuration. The controller collects link status information from nodes, calculates optimal routes using cost algorithms, and distributes forwarding tables to nodes. This mediator handles the complexity of route planning centrally, allowing individual nodes to operate with simpler local forwarding tables while achieving reliable congestion avoidance through centralized intelligence.
2Adaptability or versatility
If static forwarding tables are used, then configuration is easy, but network cannot adapt to changing conditions and congestion occurs
Solution Approach 1:
The system implements dynamic route planning where the controller continuously monitors link status information (bandwidth usage, latency, packet loss) and updates forwarding tables in real-time. Routes are dynamically adjusted based on current network conditions, with the controller recalculating optimal paths when link status changes. This dynamic approach allows the network to adapt to varying traffic patterns and prevent congestion while maintaining manageable complexity through automated control.
Solution Approach 2:
The system establishes a feedback loop where nodes continuously report link status information to the controller, which uses this feedback to recalculate route costs and update forwarding tables. The controller monitors bandwidth usage, latency, and packet loss metrics, and adjusts routes based on this feedback. This closed-loop control enables the network to respond to changing conditions automatically, improving adaptability while the controller manages the computational complexity of continuous route optimization.
3Reliability
If centralized route planning is implemented, then network reliability improves, but control system complexity increases
Solution Approach 1:
The centralized controller segments the route planning function into discrete, manageable components: link status information collection from nodes, cost calculation for each link based on multiple metrics, candidate path generation using graph algorithms, and forwarding table distribution. This segmentation of the control function allows the system to achieve reliable centralized route planning while keeping the controller's operational complexity manageable through modular processing of routing decisions.
Data Source
AI summary
The routing method includes: receiving identification information of nodes to construct a network topology diagram and receiving support rates of connection ports through a controller; monitoring data rates of the connection ports through the controller; receiving a route planning request through the controller; separately calculating costs of links according to the data rates of the connection ports and the support rates of the connection ports after receiving the route planning request through the controller; searching a plurality of candidate paths between a source-destination pair according to the route planning request and the network topology diagram through the controller; summing the costs of links passed by each candidate path to acquire a sum of link-cost of each candidate path through the controller; and, selecting one of the candidate paths with the smallest sum of link-cost as a packet transmitting path between the source-destination pair through the controller.