VRF Table Segregation for Network Traffic Scalability

Resolve Bottlenecks,
Find Innovative SolutionsGenerate Solutions

Solution Overview

Problem

As networks grow in size and complexity, existing mechanisms for routing and forwarding traffic become resource-intensive, limiting the ability to scale effectively.

Innovation Solution

Implementing virtual routing and forwarding (VRF) tables specific to application domains within network elements, allowing for efficient segregation and management of traffic by determining the application domain of packets and processing them accordingly.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Productivity

If traditional routing and forwarding mechanisms are used in growing networks, then traffic management is achieved, but network resources are consumed excessively and scalability is limited

Engineering Contradiction:

Improvetraffic management efficiencyVSAvoidnetwork resource consumption

Core Design Contradiction:

ProductivityVSDevice complexity

Solution Approach 1:

The patent segments network traffic management by creating multiple virtual routing and forwarding (VRF) tables, each dedicated to specific application domains. This segmentation allows traffic to be routed through appropriate VRF tables based on application type, improving management efficiency while reducing overall system complexity through modular organization of routing resources.

Inventive Principle:

Principle #1Segmentation

Solution Approach 2:

The patent introduces a new dimension to traditional routing by adding application-domain awareness to the routing decision process. Instead of only considering source and destination addresses, the system incorporates application domain identification as an additional dimension, enabling more efficient traffic segregation and resource utilization without increasing fundamental network complexity.

Inventive Principle:

Principle #17Another dimension (Dimensionality change)

2Adaptability or versatility

If application domain-specific VRF tables are implemented, then traffic segregation and scalability are improved, but packet processing complexity increases

Engineering Contradiction:

Improvetraffic segregation capabilityVSAvoidpacket processing complexity

Core Design Contradiction:

Adaptability or versatilityVSDevice complexity

Solution Approach 1:

The patent applies preliminary action by pre-establishing multiple VRF tables with predefined routing policies for different application domains before traffic arrives. When packets are received, the system quickly identifies the application domain and routes to the corresponding pre-configured VRF table, avoiding complex real-time routing decisions and reducing per-packet processing complexity.

Inventive Principle:

Principle #10Preliminary action

Solution Approach 2:

The patent introduces an intermediary mechanism (application domain identifier) that sits between the packet and the VRF table selection process. This intermediary enables efficient matching of packets to appropriate VRF tables through simple identifier comparison, reducing the complexity of direct packet analysis while maintaining sophisticated traffic segregation capabilities.

Inventive Principle:

Principle #24Intermediary (Mediator)

Data Source

PatentUS11627081B2Method and system segregating application traffic in a wide area network

Publication Date: 2023.04.11 ARISTA NETWORKS INC

AI summary

A system and method for managing network traffic is disclosed. The method includes determining an application domain, network elements associated with the application domain, and roles the network elements in the application domain. A virtual routing and forwarding (VRF) policy is generated for each of the network elements in the application domain based on the application domain and the role of each of the network elements in the application domain.