Multi-Topology Path Computation Element for Dynamic Network Resource Scheduling
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Large-scale distributed applications face challenges in managing massive data transfer over wide area networks, where existing technologies struggle to dynamically allocate network resources efficiently and prioritize traffic flow effectively across multi-layer, multi-topology networks.
Innovation Solution
A multi-topology path computation element (PCE) dynamically schedules and establishes paths across a multi-layer, multi-topology network by reconciling requests from multiple client applications, identifying underutilized network segments, and preempting paths to optimize bandwidth utilization, using enhanced network visibility to steer traffic and allocate dedicated bandwidth channels.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If dedicated bandwidth channels are configured over the network to support massive data transfer operations, then the data transfer capacity is improved, but the network resource allocation becomes static and inefficient
Solution Approach 1:
The patent implements dynamic path computation and bandwidth allocation by introducing a path computation element (PCE) that continuously analyzes network topology and traffic demands across multiple layers (base network and overlay networks). The system dynamically computes optimal paths and adjusts bandwidth allocation in real-time, transforming the static dedicated channel configuration into a dynamic resource allocation mechanism that adapts to changing network conditions while maintaining high data transfer capacity.
2Adaptability or versatility
If multiple client applications request temporarily dedicated paths simultaneously, then the network serves more applications, but path conflicts arise and resource allocation becomes difficult
Solution Approach 1:
The patent introduces a bandwidth calendaring application (BCA) as an intermediary component that mediates between multiple client applications and the network resources. The BCA receives path requests from multiple applications, analyzes their requirements, and coordinates resource allocation across the multi-layer network topology. This intermediary reconciles conflicting requests by finding compatible paths and time slots, enabling the network to serve multiple applications simultaneously without resource conflicts.
3Ease of operation
If a label edge router is used for path identification, then the routing function is simplified, but the network visibility is limited and underutilized paths cannot be identified
Solution Approach 1:
The patent extends network visibility by introducing a multi-dimensional view of the network topology, incorporating both the base network layer and multiple overlay network layers. The PCE accesses topology information from all layers, creating a comprehensive multi-dimensional representation of network state. This additional dimensional perspective enables the system to identify underutilized paths and resources that are invisible to traditional single-layer routing devices like label edge routers, while maintaining routing function simplicity through centralized path computation.
4Device complexity
If first-in-time, first-in-right access to network resources is used, then resource allocation is simple, but application requests cannot be prioritized according to importance
Solution Approach 1:
The patent changes the allocation parameter from temporal priority (first-in-time) to application-based priority by introducing explicit prioritization mechanisms in the BCA. The system evaluates application requests based on configurable priority parameters, service level agreements, and network conditions, allowing important applications to obtain network resources regardless of request timing. This parameter change enables flexible resource allocation that adapts to application importance while maintaining manageable complexity through centralized control.
Data Source
AI summary
In general, techniques are described for dynamically scheduling and establishing paths in a multi-layer, multi-topology network to provide dynamic network resource allocation and support packet flow steering along paths prescribed at any layer or combination of layers of the network. In one example, a multi-topology path computation element (PCE) accepts requests from client applications for dedicated paths. The PCE receives topology information from network devices and attempts to identify paths through a layer or combination of layers of the network that can be established at the requested time in view of the specifications requested for the dedicated paths and the anticipated bandwidth/capacity available in the network. The PCE schedules the identified paths through the one or more layers of the network to carry traffic for the requested paths. At the scheduled times, the PCE programs path forwarding information into network nodes to establish the scheduled paths.