Latency-Aware Virtual Network Embedding in Optical Substrate
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current optical communication networks face challenges in efficiently embedding virtual networks onto substrate optical networks while meeting stringent latency requirements, particularly for applications requiring ultra-low latency, due to limitations in flexible spectrum allocation and resource management.
Innovation Solution
A method for latency-aware embedding of virtual networks onto substrate optical networks is proposed, which involves receiving virtual network topologies and constraints, computing end-to-end latency across substrate paths, and using integer linear programming and heuristic approaches to optimize virtual link embedding, ensuring that end-to-end latency meets maximum allowable limits while minimizing resource consumption.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If virtual network embedding is performed without latency awareness, then resource allocation is simplified, but latency requirements cannot be met
Solution Approach 1:
The patent pre-computes end-to-end latency values for all possible substrate paths between node pairs and stores them in a lookup table before the actual embedding process. This preliminary computation allows the embedding algorithm to quickly query and select paths that satisfy latency constraints without performing complex latency calculations during the embedding process, thus resolving the contradiction between ensuring latency requirements and maintaining process simplicity.
Solution Approach 2:
The patent introduces an intermediary latency lookup table that mediates between the embedding algorithm and the substrate network topology. Instead of directly computing latency during embedding, the algorithm queries pre-computed latency values from this intermediary structure, simplifying the embedding process while ensuring latency constraints are met. This intermediary layer decouples the complexity of latency calculation from the embedding algorithm.
2Productivity
If flexible spectrum allocation is implemented, then bandwidth efficiency is improved, but latency control becomes more difficult
Solution Approach 1:
The patent pre-calculates and stores end-to-end latency values for all possible substrate paths in a lookup table before the embedding process begins. This allows the system to leverage flexible spectrum allocation for bandwidth efficiency while using the pre-computed latency data to easily select paths that meet latency constraints, thereby resolving the contradiction between bandwidth efficiency and latency control.
Solution Approach 2:
The patent segments the path selection process into two independent stages: first, identifying candidate paths based on latency constraints using pre-computed lookup data; second, allocating spectrum resources flexibly among selected paths. This segmentation allows flexible spectrum allocation to improve bandwidth efficiency while latency control is handled separately through the lookup table, preventing complexity in latency management.
3Reliability
If multiple substrate paths are considered for embedding, then latency constraints can be satisfied, but computational time increases
Solution Approach 1:
The patent performs preliminary computation of end-to-end latency values for all possible substrate paths and stores them in a lookup table before the embedding process. During embedding, the algorithm simply queries this pre-computed data to identify valid paths, rather than performing complex latency calculations in real-time. This dramatically reduces computational time while still considering multiple paths to satisfy latency constraints.
Solution Approach 2:
The patent pre-computes and stores latency information for all possible substrate paths in a lookup table before the embedding process begins. This preliminary action transforms the embedding process from a computationally intensive real-time calculation to a quick query-based selection, reducing computation time while maintaining the ability to satisfy latency constraints by considering multiple paths.
Data Source
AI summary
The disclosed s, structures, and methods are directed to a method and a system for embedding a virtual network onto the substrate optical network comprising embedding the plurality of virtual nodes onto the plurality of substrate nodes in accordance with the plurality of location constraints, computing end-to-end latency associated with a plurality of substrate paths connecting a source substrate node and a destination substrate node, wherein the plurality of substrate paths contain the plurality of substrate links and the plurality of substrate nodes, and embedding a virtual link connecting a source virtual node and a destination virtual node onto the one of the plurality of substrate paths connecting the source substrate node and the destination substrate node, wherein the end-to-end latency associated with the one of the plurality of substrate paths is less than or equal to a maximum allowable latency for the virtual link.