Dynamic Algorithm Selection for Request Response Optimization

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

In distributed computer environments, determining optimal algorithms for request responses is challenging when data is imbalanced, as existing methods struggle to provide fast, accurate, and cost-effective responses, especially when results are non-deterministic and require estimation.

Innovation Solution

A method and system that utilize a response determination server to select between statistical and machine learning algorithms based on historical data and attributes associated with requests, switching logic enables seamless access to appropriate algorithms for real-time data processing, optimizing response computations by choosing between statistical models for limited data and machine learning models for sufficient data.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Productivity

If a single optimal algorithm is selected for request responses, then computational efficiency is improved, but accuracy deteriorates when data is imbalanced or non-deterministic

Engineering Contradiction:
Improvecomputational efficiencyVSAvoidresponse accuracy
Core Design Contradiction:
ProductivityVSMeasurement precision

Solution Approach 1:

The system dynamically selects algorithms based on real-time data characteristics and request attributes. Instead of using a static single algorithm, the system evaluates data balance, determinism, and other factors to choose the most appropriate algorithm for each specific request, thereby maintaining both efficiency and accuracy across varying conditions.

Inventive Principle:
Principle #15Dynamics

Solution Approach 2:

The system changes the algorithm selection based on parameters such as data balance ratio, determinism level, and request attributes. By monitoring these parameters and adjusting algorithm choice accordingly, the system optimizes both computational efficiency and response accuracy for different data scenarios.

Inventive Principle:
Principle #35Parameter changes

2Measurement precision

If multiple algorithms are maintained for different data conditions, then response accuracy is improved, but system complexity increases

Engineering Contradiction:
Improveresponse accuracyVSAvoidsystem complexity
Core Design Contradiction:
Measurement precisionVSDevice complexity

Solution Approach 1:

The system introduces an algorithm selection mechanism that acts as an intermediary between the request and multiple algorithms. This selector evaluates data characteristics and automatically chooses the appropriate algorithm, managing complexity internally while presenting a unified interface to users and maintaining high accuracy across different scenarios.

Inventive Principle:
Principle #24Intermediary (Mediator)

Solution Approach 2:

The system segments the algorithm selection process into distinct evaluation stages: assessing data balance, determining determinism, evaluating request attributes, and selecting the appropriate algorithm. This segmentation manages complexity by breaking down the decision-making process into manageable, independent evaluation steps.

Inventive Principle:
Principle #1Segmentation

3Loss of time

If caching is used to optimize request responses, then response time is reduced, but applicability is limited to deterministic results only

Engineering Contradiction:
Improveresponse timeVSAvoidapplicability range
Core Design Contradiction:
Loss of timeVSAdaptability or versatility

Solution Approach 1:

The system creates a universal response determination mechanism that handles both deterministic and non-deterministic requests. By incorporating multiple algorithms and a selection mechanism, the system extends the applicability beyond simple caching to include estimation algorithms for non-deterministic scenarios, while still maintaining fast response times through intelligent algorithm selection.

Inventive Principle:
Principle #6Universality (Multi-functionality)

Data Source

PatentEP4383073A1Dynamic selection of algorithms
Publication Date: 2024.06.12 AMADEUS SAS
  • EP4383073A1 patent drawingFigure 1
  • EP4383073A1 patent drawingFigure 2A
  • EP4383073A1 patent drawingFigure 2B

AI summary

Methods, systems, and computer program products for implementing an optimization the provision request responses are presented. A request is received. One or more attributes associated with the request are obtained. Historical data associated with one or more attributes is obtained. An algorithm is selected from a plurality of algorithms based on the historical data. Request results are determined using the selected algorithm and provided to the client device.