Smart Ethernet Edge Network Path Selection System
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing Ethernet and IP/MPLS networks face inefficiencies due to high bandwidth wastage, operational complexity, and difficulty in ensuring quality of service (QoS) due to the need for extensive processing and complex protocols, which leads to bottlenecks and increased operational costs, especially in metropolitan and access networks where bandwidth is restricted.
Innovation Solution
A system that identifies multiple constraints for connection paths in a telecommunications network, iteratively adding links to potential paths while ensuring all constraints are satisfied, and optimizes resource utilization by switching to more efficient paths if available, using an offline provisioning system that maintains real-time network information and business policies.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If MPLS path determination is performed at each switching element, then QoS and bandwidth resources can be managed, but processing power and software complexity increase significantly
Solution Approach 1:
The patent extracts the complex path computation function from individual switching elements and relocates it to a centralized offline system. The offline system pre-computes paths satisfying multiple constraints (bandwidth, delay, jitter) and stores them in a database, while network elements only perform simple path lookup and forwarding, dramatically reducing their processing requirements while maintaining QoS management capability
Solution Approach 2:
The patent implements preliminary action by pre-computing all possible paths that satisfy multiple QoS constraints offline before actual traffic flows. The offline system analyzes network topology and constraints in advance, generating and storing optimal paths in a database, so that online switching elements can simply retrieve pre-computed paths without performing complex real-time calculations
2Ease of operation
If control protocols are used to establish and update forwarding tables, then paths can be set up, but bandwidth is wasted due to control messaging overhead
Solution Approach 1:
The patent eliminates the need for real-time control protocols by pre-computing and storing all valid paths offline. Instead of using RSVP-TE or other signaling protocols that consume bandwidth for path setup and updates, the system pre-analyzes network topology and constraints, generates optimal paths, and stores them in a database for direct lookup during forwarding
Solution Approach 2:
The patent extracts the path computation function from the real-time control plane and relocates it to an offline provisioning system. This separation removes the need for bandwidth-consuming control messaging protocols, as path information is pre-determined and stored, leaving only simple forwarding operations for network elements
3Ease of operation
If spanning tree protocol is used in Ethernet networks, then paths can be selected, but bandwidth is consumed for broadcast messages and tree links are wasted
Solution Approach 1:
The patent replaces the distributed spanning tree protocol with a centralized offline path computation system. Instead of using STP broadcast messages to dynamically determine paths, the offline system pre-computes optimal paths based on network topology and QoS constraints, storing them in a database for direct retrieval, eliminating the need for spanning tree maintenance and associated bandwidth consumption
Solution Approach 2:
The patent implements preliminary action by pre-determining all valid paths offline before actual traffic needs them. The offline system analyzes network topology and constraints in advance, generating optimal paths that satisfy multiple QoS parameters, so that no real-time path selection or spanning tree maintenance is needed during actual operation
4Reliability
If multiple constraints are enforced for path selection, then QoS is guaranteed, but the problem becomes NP-complete and computationally expensive
Solution Approach 1:
The patent resolves the computational complexity issue by performing the NP-complete multi-constraint path computation offline in advance. The offline system has unlimited time and resources to execute exhaustive searches and complex algorithms to find all paths satisfying multiple QoS constraints (bandwidth, delay, jitter), storing results in a database. Online elements only perform simple database lookups, avoiding real-time computational burden while guaranteeing QoS
Data Source
AI summary
A system is provided for selecting connection paths in a telecommunications network having a multiplicity of nodes interconnected by a multiplicity of links. The system identifies multiple constraints for connection paths through the network between source and destination nodes, and identifies paths that satisfy all of the constraints for a connection path between a selected source node and a selected destination node. A system is also provided for optimizing utilization of the resources of such a telecommunications network by establishing connection paths through the network between selected source and destination nodes, the established connection paths satisfying the constraints; for each established connection path, determining whether other connection paths exist between the selected source and destination nodes, and that satisfy the constraints; and if at least one such other connection path exists, determining whether any such other connection path is more efficient than the established connection path and, if the answer is affirmative, switching the connection from the established connection path to the most efficient other connection path.