WAN Optimization Proxy Routing via Peer Tables
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing WAN optimization proxies face challenges in deriving routing information transparently without manual configuration, as they rely on peer-routing information that lacks a view beyond the next hop, making them inefficient in routing packets across Wide Area Networks.
Innovation Solution
Implementing WAN optimization modules that maintain peer routing tables (PRTs) to determine peers for destinations, where peers advertise reachable networks, enabling dynamic population of PRT entries and tunnel establishment for efficient packet routing.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If manual configuration is used to set up proxy routing, then routing information can be accurately obtained, but system complexity and configuration effort increase significantly
Solution Approach 1:
The proxy peer automatically discovers routing information by listening to L3 routing updates and deriving peer-to-peer routing entries from router routing tables. This self-service mechanism eliminates manual configuration while maintaining accurate routing information, as the system autonomously populates its own routing database from available network information.
Solution Approach 2:
The system implements a feedback loop where the proxy peer continuously monitors L3 routing updates, derives routing information, and adjusts its peer routing database dynamically. This feedback mechanism ensures routing information remains accurate and up-to-date without requiring manual intervention or complex configuration management.
2Extent of automation
If L3 routing table is used to derive routing information, then automatic routing derivation is achieved, but routing view is limited to next hop only
Solution Approach 1:
The invention transitions from the L3 routing dimension (which only provides next-hop information) to the application layer dimension, where proxy peers can see end-to-end routing paths. By operating at the application layer and listening to L3 routing updates, the system gains visibility into complete routing paths while maintaining automated derivation from available network information.
Solution Approach 2:
The proxy peer performs preliminary actions by continuously monitoring and caching L3 routing updates before they are needed for proxy routing decisions. This advance preparation ensures that when routing decisions are required, complete routing information is already available in the peer routing database, eliminating the next-hop limitation.
3Ease of operation
If proxy peer network overlay is created, then transparent proxy operation is enabled, but separate peer-routing information base is required
Solution Approach 1:
The invention merges the proxy routing function with the underlying L3 routing infrastructure by having the proxy peer listen to L3 routing updates and derive routing information from the same source that routers use. This consolidation eliminates the need for separate, complex routing configuration systems while maintaining transparent operation, as the proxy peer uses the same routing information that already exists in the network infrastructure.
Data Source
AI summary
In an example embodiment disclosed herein, Wide Area Network optimization modules coupled to peers are configured to maintain peer routing tables. The peer routing table (PRT) is used by the Wide Area Network optimization module to determine the peer for a given destination, such as an Internet Protocol “IP” destination. Each peer is responsible for advertising to other peers which networks the peer is able to reach. This information is advertised when a tunnel is first created and subsequently whenever necessary. Initially, a peer sends out a list of entries corresponding to its directly connected networks, with the exception of the network connected to the interface on which the peer is advertising (e.g. the network used for the tunnel). This enables other peers on the network to populate their PRT entries.