E-Commerce Available-to-Promise Routing for Hot Cache Partitions

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing inventory availability services are not resilient to sudden traffic spikes, leading to unresponsive websites and inaccurate inventory information due to high-latency communications and computation demands, resulting in lost sales or overpromising inventory availability.

Innovation Solution

A system and method for routing inventory availability requests using dynamic histogram-based determinations of hot partitions in a distributed cache, implementing dynamic routing and moving items between local caches to optimize resources, and using different cache expiry periods based on inventory levels.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Productivity

If existing inventory availability services process sudden traffic spikes, then computation demands increase, but system responsiveness deteriorates and accuracy decreases

Engineering Contradiction:
Improveprocessing capacityVSAvoidsystem responsiveness
Core Design Contradiction:
ProductivityVSReliability

Solution Approach 1:

The system segments inventory items into different partitions based on their demand characteristics. Hot partitions contain frequently accessed items while cold partitions contain less frequently accessed items. This segmentation allows the system to handle traffic spikes for popular items without affecting the entire system's responsiveness, as each partition can be managed independently with appropriate caching strategies.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent implements local quality by applying different caching strategies to different partitions based on their specific access patterns. Hot partitions receive aggressive caching with longer expiry periods and higher cache retention, while cold partitions use standard caching. This localized optimization ensures that resources are concentrated on high-demand items during traffic spikes, maintaining system responsiveness for critical inventory checks.

Inventive Principle:
Principle #3Local quality

2Productivity

If inventory availability services handle high computation demands, then more items can be checked, but response time increases and accuracy decreases

Engineering Contradiction:
Improveinventory check coverageVSAvoidresponse latency
Core Design Contradiction:
ProductivityVSLoss of time

Solution Approach 1:

The system performs preliminary actions by pre-computing and caching inventory availability information in distributed caches before traffic spikes occur. The caching mechanism stores pre-calculated availability data with dynamically determined expiry periods based on item popularity and inventory turnover rates. When traffic spikes occur, the system serves requests from cached data rather than performing real-time computation, dramatically reducing response latency while maintaining accurate inventory information.

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The patent introduces distributed caches as intermediary layers between the inventory database and the ATP inquiry system. These caches act as mediators that absorb computation demands during traffic spikes, preventing direct database overload. The caches store frequently accessed inventory data and serve requests without requiring real-time database queries, thus reducing response time while maintaining comprehensive inventory check coverage.

Inventive Principle:
Principle #24Intermediary (Mediator)

3Ease of manufacture

If standard caching is used for all items, then implementation is simple, but resource optimization is poor during traffic spikes

Engineering Contradiction:
Improvecaching implementation complexityVSAvoidresource utilization efficiency
Core Design Contradiction:
Ease of manufactureVSProductivity

Solution Approach 1:

The patent implements dynamic caching strategies where cache expiry periods and retention policies are adjusted based on real-time demand characteristics. The system dynamically determines cache parameters for each partition based on access frequency, inventory turnover rates, and current traffic patterns. This dynamic approach automatically optimizes resource utilization during traffic spikes by extending cache life for hot items while maintaining standard caching for cold items, achieving high resource efficiency without complex manual configuration.

Inventive Principle:
Principle #15Dynamics

Solution Approach 2:

The system changes caching parameters dynamically based on item characteristics and demand patterns. Cache expiry periods, cache size allocations, and retention policies are adjusted as parameters according to each partition's access frequency and inventory volatility. This parameter adaptation allows the system to optimize resource utilization for each partition independently, achieving excellent resource efficiency during traffic spikes while maintaining implementation simplicity through automated parameter adjustment rather than complex structural changes.

Inventive Principle:
Principle #35Parameter changes

Data Source

PatentUS20250285078A1System and Method of Partition Overload Handling for E-Commerce Available to Promise Inquiries
Publication Date: 2025.09.11 BLUE YONDER GROUP INC
  • US20250285078A1 patent drawing
  • US20250285078A1 patent drawing
  • US20250285078A1 patent drawing

AI summary

A system and method are disclosed for handling an available to promise inquiry. The method comprises requesting statistics for partitions of a distributed cache, determining whether a threshold for the partitions has been reached, in response to a determination that the threshold for the partitions has been reached, fetching inventory data for the available to promise inquiry from a local cache, and in response to a determination that the threshold for the partitions has not been reached, fetching inventory data for the available to promise inquiry from the distributed cache. The method further comprises setting an expiry time before the local cache is purged, and storing a status of the partitions based at least in part on the determining that the threshold for the partitions has been reached, the status indicating the partitions as being overloaded.