Temporal LSP Resource Reservation for Elastic Time Intervals
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing MPLS technologies do not consider time when reserving network resources for paths, leading to inefficient usage of network resources and inability to schedule tunnel services in advance.
Innovation Solution
Configuring network elements to compute and reserve resources for temporal label switched paths (LSPs) within specific time intervals, including elastic time ranges, to ensure network constraints are met, allowing for advanced resource reservation and efficient usage.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If network resources are reserved without considering time, then resource allocation is simple, but resource usage efficiency deteriorates and advance scheduling becomes impossible
Solution Approach 1:
The patent implements advance resource reservation by computing paths and reserving network resources before the actual traffic transmission time. The system calculates the shortest path in advance and reserves bandwidth on links ahead of time, enabling scheduled tunnel services to start exactly when needed without last-minute resource acquisition delays.
Solution Approach 2:
The patent introduces time as a dynamic dimension to resource reservation. Instead of static resource allocation, the system now reserves resources for specific time intervals (start time to end time). The resource reservation becomes time-aware, allowing the same physical link to be allocated to different services at different times, thereby improving efficiency while managing complexity through temporal organization.
2Adaptability or versatility
If time-based resource reservation is implemented, then advance scheduling capability is improved, but computational complexity increases
Solution Approach 1:
The system performs path computation and resource reservation in advance based on scheduled time intervals. By pre-calculating paths and reserving resources before the actual service start time, the system enables advance scheduling while distributing the computational workload over time rather than concentrating it at service initiation.
Solution Approach 2:
The patent modifies the resource reservation parameters to include time interval constraints (start time and end time). This transforms the reservation from a static bandwidth allocation to a time-aware allocation, allowing the system to schedule services for specific periods. The constraint parameters are adjusted to reflect temporal requirements, enabling versatile scheduling while managing computation through structured constraint handling.
3Productivity
If network resources are reserved in advance, then service scheduling is improved, but resource allocation flexibility deteriorates
Solution Approach 1:
The system reserves network resources in advance for scheduled time intervals, enabling services to be scheduled efficiently. By performing reservation before the actual service start time, the system improves scheduling efficiency while the time-bound nature of the reservation maintains flexibility for future adjustments.
Solution Approach 2:
The patent implements resource reservation based on periodic time intervals. Instead of continuous or permanent reservations, the system creates time-limited reservations that activate for specific periods. This periodic reservation approach allows efficient scheduling while maintaining flexibility, as resources can be reallocated after the time interval expires or adjusted for subsequent periods.
Data Source
AI summary
An ingress node configured to receive a first request for a temporal label switched path (LSP) in the network. The first request indicates the ingress node, egress node, network constraint, and scheduled time interval having a predetermined start time and a predetermined end time for the temporal LSP to carry traffic. The ingress node computes a shortest path in the network for the temporal LSP that satisfies the network constraint in a shifted time interval when the request indicates that the time interval is elastic, and reserves a network resource for use during the shifted time interval for the temporal LSP in advance of the predetermined start time on a link extending from the ingress node to a next hop node on the path. The ingress node sends a path message to the next hop node to set up the temporal LSP in the shifted time interval.