Directed Cost Protocol for Mesh Network Path Management
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional network communication systems face inefficiencies due to the lack of effective methods for managing multiple paths between switches, leading to increased bandwidth usage and resource consumption, particularly in mesh networks where redundant paths are necessary for reliability but result in excessive administrative traffic and resource utilization.
Innovation Solution
Implementing a directed cost protocol that calculates and recalcules costs for multiple paths between switches in a mesh network, using path tagging to identify and manage multiple paths, and recalculating costs efficiently without frequent flooding, thereby reducing administrative traffic and resource usage.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If multiple paths are maintained between switches in a mesh network, then network reliability and load balancing are improved, but administrative traffic and resource consumption increase
Solution Approach 1:
The patent pre-calculates and stores cost values for multiple paths between switch pairs before actual data transmission occurs. This preliminary action allows the network to quickly select optimal paths without performing real-time calculations, thereby maintaining high reliability through multiple pre-evaluated paths while avoiding continuous resource consumption from repeated path computations.
Solution Approach 2:
The cost calculation and path selection process is performed periodically rather than continuously. Switches exchange cost information at intervals and update their path selections based on these periodic updates. This approach maintains network reliability by ensuring paths are regularly re-evaluated while significantly reducing administrative traffic and resource consumption compared to continuous monitoring and recalculation.
2Productivity
If cost calculations are performed frequently to maintain optimal paths, then load balancing and network efficiency are improved, but administrative traffic and processing overhead increase
Solution Approach 1:
Cost values for multiple paths are pre-calculated and stored in switches before actual data transmission needs occur. This preliminary computation allows the network to maintain efficiency by quickly selecting from pre-evaluated paths without performing complex real-time calculations, thereby reducing processing overhead while preserving network efficiency.
Solution Approach 2:
The patent implements a dynamic approach where cost calculations are performed on-demand or periodically rather than continuously. The system adapts its calculation frequency based on network conditions, performing detailed cost analysis only when necessary to maintain optimal paths, thus balancing network efficiency with reduced processing overhead.
3Measurement precision
If path cost information is frequently updated and propagated throughout the network, then path optimality is maintained, but bandwidth usage for administrative traffic increases
Solution Approach 1:
Cost information is propagated throughout the network periodically rather than continuously. Switches exchange cost data at scheduled intervals and update their routing tables based on these periodic updates. This maintains adequate path cost accuracy for effective load balancing while dramatically reducing the bandwidth consumed by administrative traffic compared to continuous cost propagation.
Solution Approach 2:
The patent allows different parts of the network to update and propagate cost information at different frequencies based on local conditions. High-traffic or critical paths may be updated more frequently, while less critical paths use lower update frequencies. This localized approach maintains necessary path cost accuracy where needed while reducing overall administrative bandwidth usage.
Data Source
AI summary
One embodiment disclosed relates to a method of cost determination for paths between switches in a mesh. A set of paths between each pair of the mesh switches is defined, and start-up costs for the paths are calculated. The costs for the previously defined paths are subsequently recalculated using a directed cost protocol. The directed cost protocol may include generating at a first switch a cost packet with path information associated with a specific path, and unlasting the cost packet via the specific path to a second switch.