Application-Aware BGP Forwarding for Low-Latency Path Selection
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional network routing systems fail to consider application-specific performance metrics such as packet loss, latency, and congestion when selecting BGP paths, leading to suboptimal experiences for cloud-based applications.
Innovation Solution
Implementing an application-aware routing structure that dynamically recomputes BGP paths based on application criteria, using application-specific forwarding tables and BGP community values to prioritize paths that enhance application performance.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If conventional BGP path selection is used, then network routing is simple and standardized, but application-specific performance metrics such as packet loss, latency, and congestion are not considered
Solution Approach 1:
The patent segments the forwarding table into application-specific forwarding tables, where each table is dedicated to a specific application or application type. This segmentation allows the system to maintain multiple specialized forwarding tables that can be selectively applied based on application requirements, thereby improving application-specific performance while keeping each individual table manageable in size and complexity.
Solution Approach 2:
The patent implements dynamic path selection by allowing the routing system to switch between different application-specific forwarding tables based on real-time application requirements and network conditions. The system dynamically computes best paths using application-specific metrics and updates forwarding tables accordingly, enabling adaptive response to changing application performance needs without requiring complete reconfiguration of the routing infrastructure.
2Productivity
If application-specific forwarding tables are implemented, then packet loss, latency, and congestion are reduced, but the routing system becomes more complex
Solution Approach 1:
The patent creates a universal framework that supports multiple application-specific forwarding tables within a single routing system. The system maintains a collection of forwarding tables that can serve different application types (e.g., real-time communication, file transfer, streaming) and selects the appropriate table based on application requirements. This multi-functional approach allows the system to handle diverse application needs without requiring separate routing infrastructures for each application type.
Solution Approach 2:
The patent introduces an intermediary mechanism that mediates between application requirements and network routing decisions. The application-specific forwarding tables act as intermediaries that translate application performance requirements into network routing parameters. This intermediary layer simplifies the complexity by providing a structured interface between application needs and network infrastructure, making the system more manageable despite the increased number of forwarding tables.
3Reliability
If dynamic path recomputation is performed, then application performance is optimized, but processing time and computational resources increase
Solution Approach 1:
The patent performs preliminary actions by pre-computing and storing multiple application-specific forwarding tables with pre-calculated best paths for different application types and network conditions. When an application requires path selection, the system can quickly retrieve and apply the appropriate pre-computed table rather than performing full path computation in real-time. This preliminary preparation significantly reduces the time required for path computation while maintaining optimized application performance.
Solution Approach 2:
The patent implements periodic updates of application-specific forwarding tables based on changing network conditions and application requirements. Instead of continuous recomputation, the system periodically refreshes the forwarding tables at intervals or triggered by significant network events. This periodic action maintains up-to-date path information while minimizing the computational overhead and time loss associated with frequent full recomputations.
Data Source
AI summary
A routing structure is defined for provider edge (PE) routers that will create the ability to recompute best paths based on application criteria. The routing structure may include the use of a network controller which is connected with the internet to receive requests from applications to trigger path re-computation. The controller will peer with PEs to send re-computation information used by the PE to construct an application-aware BGP table and forwarding instance. The PE also defines a new BGP and packet filter to replicate specific BGP paths into the application-aware table. The application-aware BGP and forwarding instance is unique to the requesting application. Thus, each request with a different source/destination combination obtains a discrete table providing separation. When a packet enters the PE from customer edge (CE) or core interface the packet traverses a packet filter that when matched against source/destination is redirected to the appropriate application-aware forwarding table. Once in the application-aware table the packet is then forwarded along the application-aware path achieving the objective. The instantiation of the application-aware BGP and forwarding table is be done based on BGP updates learned from the controller.