Just-in-Time Ad Placement Scaling via Dynamic Request Scheduling
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional ad placement systems are overwhelmed by bursts of ad decisions in scenarios with tens of thousands of unique digital streams, leading to processing and I/O resource overruns, necessitating a solution to scale just-in-time ad placement effectively.
Innovation Solution
The system dynamically adjusts ad selection request times based on the cumulative effect of other requests, distributing them to avoid overload by predicting ad placement timelines and selecting request times that do not exceed the performance limits of ad selection servers, allowing for efficient handling of multiple streams and interactive user behavior.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Quantity of substance
If conventional ad placement systems are used to handle increased numbers of unique streams, then the system can support more streams, but processing and I/O resources become overloaded during bursts of ad decisions
Solution Approach 1:
The system performs preliminary actions by predicting ad placement times and proactively scheduling ad selection requests before actual ad decisions are needed. This allows the system to smooth out request timing and avoid bursts that would overload processing resources during high-stream scenarios
Solution Approach 2:
The system dynamically adjusts the timing of ad selection requests based on predicted ad placement timelines and cumulative request effects. This dynamic scheduling allows the system to adapt request timing to current system conditions and stream volume, preventing resource overload while supporting increased numbers of unique streams
2Reliability
If ad selection requests are made close to ad placement time for just-in-time placement, then ad effectiveness increases, but processing bursts occur that overrun server capacity
Solution Approach 1:
The system performs preliminary scheduling of ad selection requests based on predicted ad placement times. By calculating and scheduling requests in advance while maintaining proximity to actual placement times, the system preserves just-in-time effectiveness while preventing processing bursts that would exceed server capacity
Solution Approach 2:
The system implements periodic scheduling of ad selection requests based on predicted ad placement timelines. This distributes requests periodically over time rather than allowing bursts, maintaining the timing proximity needed for effective just-in-time placement while keeping processing loads within server capacity
3Productivity
If ad selection requests are distributed earlier to avoid overload, then server capacity is preserved, but ad placement timing precision decreases
Solution Approach 1:
The system performs preliminary scheduling calculations that determine the optimal balance between request timing and placement precision. By scheduling requests in advance with calculated timing offsets, the system preserves server capacity while minimizing the time loss from early scheduling through intelligent offset calculation
Data Source
AI summary
In one embodiment, a method comprises determining ad placement times for each of a plurality of associated streams. The method also comprises determining an ad selection request time for each of a plurality of ad selection requests based on a cumulative effect of any other ad selection requests occurring at substantially the same time as the determined ad selection time. Each of the plurality of ad selection requests corresponds to one of the plurality of ad placement times.


