Deterministic Routing via Binding Tables and Weighted Load-Balancing
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In communication networks, existing technologies face challenges in maintaining deterministic routing and load-balancing across endpoints with varying availability, leading to inefficiencies and disruptions when failures occur, especially in scenarios with diverse communication technologies and high signaling overhead.
Innovation Solution
The implementation of an ITP signaling gateway with an ASP module that uses binding tables and weighted load-balancing to map flows deterministically across available IP endpoints, ensuring consistent routing and minimal disruption by maintaining local and remote ASP state and employing protocols like SGMP for real-time synchronization.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If traditional routing methods are used in network environments with diverse communication technologies, then routing flexibility is improved, but routing determinism and reliability deteriorate when failures occur
Solution Approach 1:
The patent segments the routing decision process into two independent parts: (1) flow-to-endpoint mapping using deterministic algorithms based on flow identifiers and endpoint weights, and (2) endpoint availability management using separate availability bits and state synchronization. This segmentation allows routing flexibility to be maintained through weight adjustments while ensuring routing determinism through algorithmic consistency across network elements.
Solution Approach 2:
The patent implements preliminary action by pre-establishing flow-to-endpoint mappings using deterministic algorithms before failures occur. The binding tables are pre-configured with mapping rules that ensure consistent routing decisions across all network elements. When failures occur, the pre-established mappings and availability bits enable rapid failover without requiring complex real-time routing recalculations, thus maintaining both flexibility and determinism.
2Productivity
If load-balancing is implemented across multiple endpoints, then network efficiency is improved, but routing consistency and failure recovery deteriorate
Solution Approach 1:
The patent implements dynamics by making the load-balancing system adaptive to endpoint availability changes. The binding table entries dynamically adjust which endpoints are active based on availability bits, and the deterministic algorithms automatically recalculate mappings when endpoint states change. This allows the system to maintain routing consistency for active endpoints while efficiently utilizing available capacity, achieving both network efficiency and routing stability.
Solution Approach 2:
The patent uses feedback mechanisms where network elements continuously monitor endpoint availability and exchange state information through synchronization protocols. When an endpoint's availability changes, this feedback triggers automatic remapping of affected flows using the deterministic algorithms. This feedback loop ensures that load-balancing decisions are always based on current endpoint states, maintaining both efficiency and consistency.
3Reliability
If signaling overhead is increased to manage network failures, then failure recovery capability is improved, but network performance and simplicity deteriorate
Solution Approach 1:
The patent extracts the failure management functionality from complex signaling protocols and embeds it directly into the routing decision process. The availability bits and deterministic algorithms are integrated into the existing binding table structure, allowing failure detection and recovery to be handled as part of normal routing operations rather than requiring separate signaling exchanges. This reduces signaling overhead while maintaining robust failure recovery capability.
Solution Approach 2:
The patent implements self-service by enabling network elements to autonomously detect endpoint failures and remap flows using local binding table information and deterministic algorithms. Each network element maintains availability bits for endpoints and can independently make remapping decisions without requiring centralized coordination or extensive signaling. This self-service approach minimizes signaling overhead while ensuring reliable failure recovery.
Data Source
AI summary
A method is provided in one example embodiment and includes receiving at a network element having a binding table a packet that is part of a flow, the binding table having an entry corresponding to the flow, the entry mapping the flow to a first one of a plurality of endpoints and recognizing that a state of the first one of the plurality of endpoints at the first network element is not active. The method further includes, determining that the state of the first one of the plurality of endpoints at a second network element mated with the first network element and having a binding table similar to the binding table of the first network element is active. The method still further includes, directing the flow to the first one of the plurality of endpoints via the second network element.