Optimizing callout in unified ad markets

Aman Gupta, Shanmugavelayutham Muthukrishnan, Smita Wadhwa

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Abstract

    In the past, online ad networks owned their supply of impressions for ads with publishers and matched it to their own demand (advertisers). However, in the past few years, with programmatic ad selling becoming common place, these ad networks are now appealing to demand from multitude of demand side platforms (DSPs). The general approach is to partition the demand into pools (based on type of ads or the demand party). An inevitable challenge is the impedance mismatch between the marketplace and the demand pools. Thus, a central problem is to figure out how to handle each supply request and selectively send requests to demand pool so as to optimize the performance of entire supply. This is the Callout Problem. We present a large scale data analysis and control system that (a) continually learns changing traffic patterns, capacities, bids, revenue etc, and (b) picks the best slice of traffic to send to each demand pool, subject to their capacity constraints. The optimization is based on a greedy solution to the underlying knapsack problem which easily adapts as capacities change over time. We have implemented and deployed this solution for the callout problem in one of the largest mobile ad marketplaces(InMobi) and has been operational for several months. In this paper, we will describe the scale of the problem, our solution and our observations from operational experience with it. We believe a well-engineered solution to the Callout problem is essential for many ad networks in the online ad world.

    Original languageEnglish (US)
    Title of host publicationProceedings - 2016 IEEE International Conference on Big Data, Big Data 2016
    EditorsRonay Ak, George Karypis, Yinglong Xia, Xiaohua Tony Hu, Philip S. Yu, James Joshi, Lyle Ungar, Ling Liu, Aki-Hiro Sato, Toyotaro Suzumura, Sudarsan Rachuri, Rama Govindaraju, Weijia Xu
    PublisherInstitute of Electrical and Electronics Engineers Inc.
    Pages1315-1321
    Number of pages7
    ISBN (Electronic)9781467390040
    DOIs
    StatePublished - Jan 1 2016
    Event4th IEEE International Conference on Big Data, Big Data 2016 - Washington, United States
    Duration: Dec 5 2016Dec 8 2016

    Publication series

    NameProceedings - 2016 IEEE International Conference on Big Data, Big Data 2016

    Other

    Other4th IEEE International Conference on Big Data, Big Data 2016
    CountryUnited States
    CityWashington
    Period12/5/1612/8/16

    Fingerprint

    Sales
    Control systems

    ASJC Scopus subject areas

    • Computer Networks and Communications
    • Information Systems
    • Hardware and Architecture

    Cite this

    Gupta, A., Muthukrishnan, S., & Wadhwa, S. (2016). Optimizing callout in unified ad markets. In R. Ak, G. Karypis, Y. Xia, X. T. Hu, P. S. Yu, J. Joshi, L. Ungar, L. Liu, A-H. Sato, T. Suzumura, S. Rachuri, R. Govindaraju, ... W. Xu (Eds.), Proceedings - 2016 IEEE International Conference on Big Data, Big Data 2016 (pp. 1315-1321). [7840736] (Proceedings - 2016 IEEE International Conference on Big Data, Big Data 2016). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/BigData.2016.7840736

    Optimizing callout in unified ad markets. / Gupta, Aman; Muthukrishnan, Shanmugavelayutham; Wadhwa, Smita.

    Proceedings - 2016 IEEE International Conference on Big Data, Big Data 2016. ed. / Ronay Ak; George Karypis; Yinglong Xia; Xiaohua Tony Hu; Philip S. Yu; James Joshi; Lyle Ungar; Ling Liu; Aki-Hiro Sato; Toyotaro Suzumura; Sudarsan Rachuri; Rama Govindaraju; Weijia Xu. Institute of Electrical and Electronics Engineers Inc., 2016. p. 1315-1321 7840736 (Proceedings - 2016 IEEE International Conference on Big Data, Big Data 2016).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Gupta, A, Muthukrishnan, S & Wadhwa, S 2016, Optimizing callout in unified ad markets. in R Ak, G Karypis, Y Xia, XT Hu, PS Yu, J Joshi, L Ungar, L Liu, A-H Sato, T Suzumura, S Rachuri, R Govindaraju & W Xu (eds), Proceedings - 2016 IEEE International Conference on Big Data, Big Data 2016., 7840736, Proceedings - 2016 IEEE International Conference on Big Data, Big Data 2016, Institute of Electrical and Electronics Engineers Inc., pp. 1315-1321, 4th IEEE International Conference on Big Data, Big Data 2016, Washington, United States, 12/5/16. https://doi.org/10.1109/BigData.2016.7840736
    Gupta A, Muthukrishnan S, Wadhwa S. Optimizing callout in unified ad markets. In Ak R, Karypis G, Xia Y, Hu XT, Yu PS, Joshi J, Ungar L, Liu L, Sato A-H, Suzumura T, Rachuri S, Govindaraju R, Xu W, editors, Proceedings - 2016 IEEE International Conference on Big Data, Big Data 2016. Institute of Electrical and Electronics Engineers Inc. 2016. p. 1315-1321. 7840736. (Proceedings - 2016 IEEE International Conference on Big Data, Big Data 2016). https://doi.org/10.1109/BigData.2016.7840736
    Gupta, Aman ; Muthukrishnan, Shanmugavelayutham ; Wadhwa, Smita. / Optimizing callout in unified ad markets. Proceedings - 2016 IEEE International Conference on Big Data, Big Data 2016. editor / Ronay Ak ; George Karypis ; Yinglong Xia ; Xiaohua Tony Hu ; Philip S. Yu ; James Joshi ; Lyle Ungar ; Ling Liu ; Aki-Hiro Sato ; Toyotaro Suzumura ; Sudarsan Rachuri ; Rama Govindaraju ; Weijia Xu. Institute of Electrical and Electronics Engineers Inc., 2016. pp. 1315-1321 (Proceedings - 2016 IEEE International Conference on Big Data, Big Data 2016).
    @inproceedings{5d57de1a8f4d4cb8bdda94e31a876860,
    title = "Optimizing callout in unified ad markets",
    abstract = "In the past, online ad networks owned their supply of impressions for ads with publishers and matched it to their own demand (advertisers). However, in the past few years, with programmatic ad selling becoming common place, these ad networks are now appealing to demand from multitude of demand side platforms (DSPs). The general approach is to partition the demand into pools (based on type of ads or the demand party). An inevitable challenge is the impedance mismatch between the marketplace and the demand pools. Thus, a central problem is to figure out how to handle each supply request and selectively send requests to demand pool so as to optimize the performance of entire supply. This is the Callout Problem. We present a large scale data analysis and control system that (a) continually learns changing traffic patterns, capacities, bids, revenue etc, and (b) picks the best slice of traffic to send to each demand pool, subject to their capacity constraints. The optimization is based on a greedy solution to the underlying knapsack problem which easily adapts as capacities change over time. We have implemented and deployed this solution for the callout problem in one of the largest mobile ad marketplaces(InMobi) and has been operational for several months. In this paper, we will describe the scale of the problem, our solution and our observations from operational experience with it. We believe a well-engineered solution to the Callout problem is essential for many ad networks in the online ad world.",
    author = "Aman Gupta and Shanmugavelayutham Muthukrishnan and Smita Wadhwa",
    year = "2016",
    month = "1",
    day = "1",
    doi = "10.1109/BigData.2016.7840736",
    language = "English (US)",
    series = "Proceedings - 2016 IEEE International Conference on Big Data, Big Data 2016",
    publisher = "Institute of Electrical and Electronics Engineers Inc.",
    pages = "1315--1321",
    editor = "Ronay Ak and George Karypis and Yinglong Xia and Hu, {Xiaohua Tony} and Yu, {Philip S.} and James Joshi and Lyle Ungar and Ling Liu and Aki-Hiro Sato and Toyotaro Suzumura and Sudarsan Rachuri and Rama Govindaraju and Weijia Xu",
    booktitle = "Proceedings - 2016 IEEE International Conference on Big Data, Big Data 2016",

    }

    TY - GEN

    T1 - Optimizing callout in unified ad markets

    AU - Gupta, Aman

    AU - Muthukrishnan, Shanmugavelayutham

    AU - Wadhwa, Smita

    PY - 2016/1/1

    Y1 - 2016/1/1

    N2 - In the past, online ad networks owned their supply of impressions for ads with publishers and matched it to their own demand (advertisers). However, in the past few years, with programmatic ad selling becoming common place, these ad networks are now appealing to demand from multitude of demand side platforms (DSPs). The general approach is to partition the demand into pools (based on type of ads or the demand party). An inevitable challenge is the impedance mismatch between the marketplace and the demand pools. Thus, a central problem is to figure out how to handle each supply request and selectively send requests to demand pool so as to optimize the performance of entire supply. This is the Callout Problem. We present a large scale data analysis and control system that (a) continually learns changing traffic patterns, capacities, bids, revenue etc, and (b) picks the best slice of traffic to send to each demand pool, subject to their capacity constraints. The optimization is based on a greedy solution to the underlying knapsack problem which easily adapts as capacities change over time. We have implemented and deployed this solution for the callout problem in one of the largest mobile ad marketplaces(InMobi) and has been operational for several months. In this paper, we will describe the scale of the problem, our solution and our observations from operational experience with it. We believe a well-engineered solution to the Callout problem is essential for many ad networks in the online ad world.

    AB - In the past, online ad networks owned their supply of impressions for ads with publishers and matched it to their own demand (advertisers). However, in the past few years, with programmatic ad selling becoming common place, these ad networks are now appealing to demand from multitude of demand side platforms (DSPs). The general approach is to partition the demand into pools (based on type of ads or the demand party). An inevitable challenge is the impedance mismatch between the marketplace and the demand pools. Thus, a central problem is to figure out how to handle each supply request and selectively send requests to demand pool so as to optimize the performance of entire supply. This is the Callout Problem. We present a large scale data analysis and control system that (a) continually learns changing traffic patterns, capacities, bids, revenue etc, and (b) picks the best slice of traffic to send to each demand pool, subject to their capacity constraints. The optimization is based on a greedy solution to the underlying knapsack problem which easily adapts as capacities change over time. We have implemented and deployed this solution for the callout problem in one of the largest mobile ad marketplaces(InMobi) and has been operational for several months. In this paper, we will describe the scale of the problem, our solution and our observations from operational experience with it. We believe a well-engineered solution to the Callout problem is essential for many ad networks in the online ad world.

    UR - http://www.scopus.com/inward/record.url?scp=85015246082&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=85015246082&partnerID=8YFLogxK

    U2 - 10.1109/BigData.2016.7840736

    DO - 10.1109/BigData.2016.7840736

    M3 - Conference contribution

    AN - SCOPUS:85015246082

    T3 - Proceedings - 2016 IEEE International Conference on Big Data, Big Data 2016

    SP - 1315

    EP - 1321

    BT - Proceedings - 2016 IEEE International Conference on Big Data, Big Data 2016

    A2 - Ak, Ronay

    A2 - Karypis, George

    A2 - Xia, Yinglong

    A2 - Hu, Xiaohua Tony

    A2 - Yu, Philip S.

    A2 - Joshi, James

    A2 - Ungar, Lyle

    A2 - Liu, Ling

    A2 - Sato, Aki-Hiro

    A2 - Suzumura, Toyotaro

    A2 - Rachuri, Sudarsan

    A2 - Govindaraju, Rama

    A2 - Xu, Weijia

    PB - Institute of Electrical and Electronics Engineers Inc.

    ER -