Boolean Constrained Multipath Routing for Network Congestion
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The existing Internet routing architecture is limited by its single-path model, leading to inefficiencies in resource utilization and congestion, as it only supports a single path to each destination, which is not adequate for demanding applications and results in over-provisioning to meet quality-of-service requirements.
Innovation Solution
Implementing Boolean Constrained Multipath Routing (BCMR) that computes multiple paths between a source and destination, using Boolean variables and expressions to define policy constraints, allowing for load balancing and selecting paths that satisfy specific flow requirements, thereby addressing congestion and policy control in communication networks.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Device complexity
If destination-based forwarding is used to simplify routing decisions, then routing complexity is reduced, but network resource utilization becomes inefficient due to traffic concentration on single paths
Solution Approach 1:
The patent segments the single routing path into multiple alternative paths by introducing Boolean variables that represent different routing options. Each Boolean variable corresponds to a specific path segment or routing choice, allowing the system to divide traffic across multiple segments rather than forcing all traffic through a single destination-based path.
Solution Approach 2:
The patent makes routing paths dynamic by allowing Boolean variables to change state based on network conditions. The system can dynamically select among multiple paths by evaluating Boolean expressions that reflect current network state, enabling adaptive routing that responds to changing conditions rather than being static and destination-based.
2Productivity
If multiple paths are computed to improve network resource utilization, then traffic distribution improves, but routing computation complexity increases
Solution Approach 1:
The patent changes the parameter representation from traditional metric-based routing to Boolean variable-based routing. Instead of computing multiple paths based on complex metrics and making decisions based on continuous values, the system uses Boolean variables that simplify the computation to discrete true/false evaluations, reducing computational complexity while maintaining multiple path capabilities.
Solution Approach 2:
The patent extracts the essential routing decision elements into separate Boolean variables, isolating the key path selection factors from the overall routing computation. By taking out specific routing choices as independent Boolean variables, the system simplifies the computation process while still enabling multiple path evaluation.
3Ease of operation
If single-path routing is used to simplify forwarding rules, then forwarding simplicity is maintained, but congestion occurs on popular destinations
Solution Approach 1:
The patent creates a composite forwarding mechanism by combining multiple simple forwarding rules into a unified system. Each Boolean variable represents a simple forwarding decision, and their combination through Boolean expressions creates a composite forwarding rule set that maintains simplicity at each decision point while achieving complex traffic distribution across multiple paths.
4Reliability
If over-provisioning is implemented to meet quality-of-service requirements, then service reliability is improved, but network cost increases
Solution Approach 1:
The patent makes network paths universal by enabling the same physical infrastructure to serve multiple routing functions simultaneously. The Boolean variable system allows a single network link to be part of multiple different paths depending on the evaluation of Boolean expressions, making the network more versatile and reducing the need for dedicated over-provisioned capacity for each possible routing scenario.
Data Source
AI summary
Systems, methods, and computer-readable media for providing remote control of Boolean variables defining expressions determining resource utilization of a communication network are provided.