Dynamic URI Rerouting Across Syntaxes for Adaptive Server Selection
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing systems for routing requests based on uniform resource identifiers (URIs) are inflexible and inefficient, particularly when dealing with non-standard formats and failing to utilize dynamic parameters for optimal redirection, leading to increased load on computing systems and suboptimal response times.
Innovation Solution
A dynamic rerouting system that utilizes a rerouting engine to analyze incoming URIs, apply routing directives, and construct target URIs based on dynamic variables such as date, geolocation, and language, enabling flexible redirection to the most suitable computing system for content delivery, including parsing non-standard formats.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If a computing system uses existing static routing systems for URIs, then the system structure is simple, but the system lacks flexibility and cannot optimize for dynamic conditions such as load balancing and geolocation
Solution Approach 1:
The patent implements dynamic routing by introducing a rerouting engine that evaluates multiple routing policy entries with different weights based on real-time conditions. The system dynamically selects the best routing policy by considering factors such as server load, geolocation, and URI syntax, allowing the routing decision to change adaptively rather than being static.
Solution Approach 2:
The system changes routing parameters by assigning different weights to various routing policy entries and adjusting the selection criteria based on current system state. The rerouting engine modifies routing decisions by considering temporal parameters (time of day), spatial parameters (geolocation), and load parameters to dynamically reconfigure URI routing.
2Productivity
If the system routes all requests to a single computing system, then the routing mechanism is simple, but the system cannot balance load or respond to geographic location
Solution Approach 1:
The patent segments the routing mechanism into distinct components: a rerouting engine that processes incoming URIs, multiple routing policy entries that define different routing rules, and a selection mechanism that chooses the best policy. This segmentation allows each component to perform its specific function efficiently while working together to optimize response time.
Solution Approach 2:
The rerouting engine acts as an intermediary between the incoming URI request and the final target computing system. It analyzes the URI against multiple routing policies, evaluates weights based on current conditions, and determines the optimal destination, thereby mediating the routing decision to improve response time without direct complexity at the client level.
3Adaptability or versatility
If the system uses standard URI parsing only, then the parsing mechanism is simple, but it cannot handle non-standard URI formats and loses potential routing opportunities
Solution Approach 1:
The routing policy entries are designed to be universal, with each entry containing a URI parser that can handle multiple URI syntaxes. The system achieves multi-functionality by allowing a single routing infrastructure to accommodate various URI formats (standard URIs, non-standard URIs, different encodings) through configurable parsers in each routing policy entry.
Solution Approach 2:
The system applies partial parsing actions by attempting to parse URIs using standard methods first, and only if that fails does it try alternative parsing approaches defined in the routing policies. This excessive action approach ensures comprehensive URI handling while maintaining efficiency by not attempting all parsing methods for every request.
4Reliability
If the system redirects requests frequently to balance load or optimize location, then resource utilization improves, but the networking load and processing overhead increase
Solution Approach 1:
The system performs preliminary action by pre-defining multiple routing policy entries with different weights and criteria before actual requests arrive. The rerouting engine evaluates these pre-configured policies in advance and makes routing decisions based on current conditions, reducing the need for frequent redirects and minimizing real-time processing overhead.
Data Source
AI summary
Methods, systems, and apparatus, including medium-encoded computer program products, for dynamic rerouting of uniform resource identifiers having different syntaxes. A method includes a server receiving from a computing device a request that includes an initial uniform resource identifier (URI) that includes a product identifier. The request can be generated by the user scanning a product tag. Based on the identifier, the server finds two or more routing policy entries associated with the product. Each policy entry can include a regular expression that specifies syntax for parsing the initial URI and at least one variable. The server eliminates any routing policy having a context specification that does not match the request's context information and any routing policy entries having a regular expression that does not match the initial URI. The server composes a target URI based on a remaining routing policy entry and redirects the computing device to the target URI.