VNF Elementary Graphs for Stateless Packet Routing
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current Network Function Virtualization (NFV) technologies face challenges in efficient data communication between Virtual Network Functions (VNFs) due to delays caused by Forwarders, which require significant processing and hardware support for packet routing based on state information.
Innovation Solution
The method involves splitting the Forwarding Graph into elementary graphs for each VNF instance, where routing decisions are made based on packet class identifiers, eliminating the need for state information and reducing dependency on Forwarders, allowing packets to be routed solely by class, thereby simplifying infrastructure requirements.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If Forwarders are used to process packet traffic and steer packets to specific VNFs based on packet content, then packet routing flexibility is improved, but packet transmission time increases and communication delays occur
Solution Approach 1:
The patent segments the Forwarding Graph into multiple Elementary Graphs, each representing a specific packet class. Instead of using a single Forwarder to process all packets, the system divides packet routing into multiple specialized paths, where each Elementary Graph handles a specific class of packets. This segmentation eliminates the need for complex packet inspection by Forwarders and reduces transmission delays.
Solution Approach 2:
The patent performs preliminary classification of packets into different classes before routing. Packet class identifiers are assigned in advance based on packet properties, allowing the network to route packets along pre-determined paths without requiring real-time inspection by Forwarders. This preliminary action eliminates the time-consuming packet inspection process.
2Measurement precision
If Forwarders inspect packet content to steer packets to specific VNFs, then routing precision is improved, but device complexity increases
Solution Approach 1:
The patent extracts the packet inspection function from the Forwarder and replaces it with a simpler classification mechanism. Instead of requiring Forwarders to inspect packet content to determine routing, the system uses pre-assigned packet class identifiers that directly map to specific Elementary Graphs. This extraction eliminates the complex inspection logic from Forwarders while maintaining routing precision.
Solution Approach 2:
The patent creates multiple copies of routing information in the form of Elementary Graphs, each corresponding to a packet class. Instead of requiring a single complex Forwarder to handle all routing decisions, the system distributes routing information across multiple simplified Elementary Graphs, reducing the complexity burden on any single device.
3Measurement precision
If state information is maintained for packet routing decisions, then routing accuracy is improved, but loss of time increases due to state updating
Solution Approach 1:
The patent changes the routing parameter from dynamic state information to static packet class identifiers. Instead of maintaining and updating state information about packet flows, the system uses immutable packet class identifiers that are assigned once and used for routing throughout the packet's journey. This parameter change eliminates the need for continuous state updating while maintaining routing accuracy.
4Reliability
If Forwarders are deployed per compute node to handle VNF communication, then communication reliability is improved, but device complexity and hardware requirements increase
Solution Approach 1:
The patent makes Elementary Graphs universal by designing them to handle multiple packet classes and VNF configurations. Each Elementary Graph can serve multiple purposes and adapt to different routing scenarios without requiring dedicated Forwarders for each compute node. This universality reduces hardware requirements while maintaining communication reliability through standardized routing paths.
Data Source
AI summary
Instantiating a Network Service described by a Forwarding Graph comprising Virtual Network Functions, VNF instances, which are interconnected via communication links. This includes splitting the Forwarding Graph into n VNF Elementary Graphs, VNF EGs. Each of the VNF EGs for a VNF Instance includes routing information for forwarding, by that VNF instance and to another VNF instance, packets output by that VNF instance based on a packet class identifier included in the packet. Each of the VNF EGs is transmitted to the corresponding VNF instance for that VNF EG. Each of the VNF instances, when outputting a packet handled by it, then transmits the packet to a next VNF instance based on the packet class identifier included in the packet.