Ad Collision Reduction via Mediator Cache

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

The existing bid request system in ad datacenters often results in ad collisions, where multiple ads for the same campaign appear simultaneously on a web page, leading to inefficiency and reduced impact due to users seeing similar advertisements, as different machines within the datacenter independently bid on ad spaces without coordinated management.

Innovation Solution

An ad collision machine is introduced, which receives collision queries with user IDs and campaign IDs, hashes the user ID to select a node, and uses a data cache to evaluate and manage bids, ensuring that only unique ad campaigns are displayed by writing user ID-campaign ID pairs to the cache and returning them as available for bidding, thereby preventing collisions.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Productivity

If multiple machines within ad datacenter independently evaluate and respond to bid requests, then the system can efficiently handle large volume of bid requests, but ad collisions occur where multiple ads for the same campaign appear simultaneously on web pages

Engineering Contradiction:
Improvebid request handling efficiencyVSAvoidad placement uniqueness
Core Design Contradiction:
ProductivityVSReliability

Solution Approach 1:

An ad collision machine is introduced as an intermediary component between the bid request evaluation machines and the ad placement system. This mediator receives bid requests, evaluates potential ad collisions by checking against stored user-campaign pairs, and returns modified bid requests that prevent multiple ads for the same campaign from being placed on the same web page, thus resolving the contradiction between handling volume and ensuring uniqueness

Inventive Principle:
Principle #24Intermediary (Mediator)

Solution Approach 2:

The system performs preliminary evaluation of ad collision potential before final ad placement occurs. By checking whether a user-campaign pair already exists in the data cache before allowing bid placement, the system prevents ad collisions in advance rather than detecting and correcting them after they occur, maintaining both efficiency and uniqueness

Inventive Principle:
Principle #10Preliminary action

2Reliability

If ad collisions are prevented by coordinating bid evaluations, then ad impact is improved by showing unique campaigns, but system complexity increases due to additional coordination mechanisms

Engineering Contradiction:
Improvead impact effectivenessVSAvoidbid evaluation system structure
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The bid evaluation system is segmented into separate functional components: regular bid evaluation machines that handle the bidding process and a dedicated ad collision machine that handles collision prevention. This segmentation allows each component to focus on its specific function, making the overall system more manageable despite the added complexity of coordination

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The ad collision machine serves as a specialized intermediary that handles only the collision detection and prevention logic. By isolating this functionality into a separate machine with a data cache for user-campaign pairs, the system manages complexity through functional decomposition rather than embedding collision prevention throughout the entire bid evaluation process

Inventive Principle:
Principle #24Intermediary (Mediator)

Data Source

PatentUS11798041B2Ad collision reduction
Publication Date: 2023.10.24 ZETA GLOBAL CORP
  • US11798041B2 patent drawing
  • US11798041B2 patent drawing
  • US11798041B2 patent drawing

AI summary

An ad collision machine can be configured to evaluate collision queries for possible ad collisions and is associated with an ad datacenter configured to evaluate and respond to bid requests on behalf of a plurality of advertisers. The ad collision machine can comprise a plurality of nodes and a data cache containing a plurality of user ID—campaign ID keys representing recently submitted bids in response to bid requests. Once a selected node receives a collision query, a user ID—campaign ID key is retrieved from the collision query. If the first key is not found in the data cache, it is written to the data cache by the node and the ad collision machine returns that user ID—campaign ID pair as available to be bid on.