公开(公告)号：US20190387071A1

公开(公告)日：2019-12-19

申请号：US16554028

申请日：2019-08-28

Applicant: Home Box Office, Inc.

Inventor： Sata Busayarat ,  Jonathan David Lutz ,  Allen Arthur Gay ,  Mei Qi

IPC: H04L29/08 ,  G06F12/0811 ,  G06F12/0868 ,  G06F12/0871 ,  G06F16/245

Abstract: The described technology is directed towards a cache framework that accesses a tier of ordered caches, in tier order, to satisfy requests for data. The cache framework may be implemented at a front-end service level server, and/or a back end service level server, or both. The cache framework handles read-through and write-through operations, including handling batch requests for multiple data items. The cache framework also facilitates dynamically changing the tier structure, e.g., for adding, removing, replacing and/or reordering caches in the tier, e.g., by re-declaring a data structure such as an array that identifies the tiered cache configuration.

公开(公告)号：US10404823B2

公开(公告)日：2019-09-03

申请号：US15167321

申请日：2016-05-27

Applicant: Home Box Office, Inc.

Inventor： Sata Busayarat ,  Jonathan David Lutz ,  Allen Arthur Gay ,  Mei Qi

IPC: H04L29/08 ,  G06F16/245 ,  G06F12/0811 ,  G06F12/0868 ,  G06F12/0871

Abstract: The described technology is directed towards a cache framework that accesses a tier of ordered caches, in tier order, to satisfy requests for data. The cache framework may be implemented at a front-end service level server, and/or a back end service level server, or both. The cache framework handles read-through and write-through operations, including handling batch requests for multiple data items. The cache framework also facilitates dynamically changing the tier structure, e.g., for adding, removing, replacing and/or reordering caches in the tier, e.g., by re-declaring a data structure such as an array that identifies the tiered cache configuration.

公开(公告)号：US20170353577A1

公开(公告)日：2017-12-07

申请号：US15170668

申请日：2016-06-01

Applicant: Home Box Office, Inc.

Inventor： Jonathan David Lutz ,  Sata Busayarat ,  Mei Qi

IPC: H04L29/08 ,  H04L12/26 ,  H04L29/06

Abstract: The described technology is directed towards maintaining a cache of data items, with cached data items having current value subsets and next value subsets. The cache is accessed for data item requests, to return a cache miss if a requested data item is not cached, to return data from the current value subset if not expired, to return data from the next value subset if the current value subset is expired and the next value subset is not expired, or to return a cache miss (or expired data) if both subsets are expired. Cached data items are refreshed, (e.g., periodically), when a data item's current value subset is expired by replacing the data item's current value subset with the next value subset and caching a new next value subset, or caching a new next value subset when the next value subset will expire within a threshold time.

公开(公告)号：US11907165B2

公开(公告)日：2024-02-20

申请号：US17935766

申请日：2022-09-27

Applicant: Home Box Office, Inc.

Inventor： Jonathan David Lutz ,  Allen Arthur Gay ,  Dylan Carney

IPC: G06F16/172 ,  G06F16/17 ,  H04N21/431 ,  G06F16/901

CPC classification number: G06F16/172 ,  G06F16/1734 ,  G06F16/9024 ,  H04N21/4312

Abstract: The described technology is generally directed towards coordinating the generation, validation and enabling of content selection graphs in an in-memory content selection graph data store. When a set of content selection graphs is requested, a coordinator starts the generation of the relevant graphs. Upon successful generation, the coordinator starts a validation of the generated graphs against rules for the nodes/response data in the graphs. If the generated graphs pass validation, the coordinator enables the graph set for use in an in-memory cache, whereby when a request to return content selection data is received, an active graph that corresponds to the request and the current time is accessed to obtain and return the response data as the requested content selection data.

公开(公告)号：US20230023208A1

公开(公告)日：2023-01-26

申请号：US17936666

申请日：2022-09-29

Applicant: Home Box Office, Inc.

Inventor： Jonathan David Lutz ,  Allen Arthur Gay ,  Dylan Carney

IPC: G06F16/957 ,  G06F16/901 ,  G06F16/23

Abstract: The described technology is generally directed towards validating content selection graphs for use in an in-memory content selection graph data store. When a content selection graph data is generated, the graph nodes can correspond to prebuilt response data. The response data for any of the nodes can be verified against rules based on the type of a node, for example, as well as based on client-specific information for types of clients. The overall validation process can validate the content selection graph for subsequent use, can result in errors or warnings being logged (which may or may not render the graph unusable, e.g., depending on severity), or can fail the content selection graph. If validated, the content selection graph can be used to rapidly return response data when content from the graph is requested.

公开(公告)号：US11474974B2

公开(公告)日：2022-10-18

申请号：US16720834

申请日：2019-12-19

Applicant: Home Box Office, Inc.

Inventor： Jonathan David Lutz ,  Allen Arthur Gay ,  Dylan Carney

IPC: G06F16/172 ,  G06F16/17 ,  H04N21/431 ,  G06F16/901

Abstract: The described technology is generally directed towards coordinating the generation, validation and enabling of content selection graphs in an in-memory content selection graph data store. When a set of content selection graphs is requested, a coordinator starts the generation of the relevant graphs. Upon successful generation, the coordinator starts a validation of the generated graphs against rules for the nodes/response data in the graphs. If the generated graphs pass validation, the coordinator enables the graph set for use in an in-memory cache, whereby when a request to return content selection data is received, an active graph that corresponds to the request and the current time is accessed to obtain and return the response data as the requested content selection data.

公开(公告)号：US11360826B2

公开(公告)日：2022-06-14

申请号：US16889129

申请日：2020-06-01

Applicant: Home Box Office, Inc.

Inventor： Sata Busayarat ,  Jack Song ,  Brandon C. Furtwangler ,  Jonathan David Lutz ,  Allen Arthur Gay ,  Steven N. Furtwangler

IPC: G06F16/00 ,  G06F9/50 ,  G06F16/51 ,  G06F16/28 ,  G06F16/2457 ,  G06F16/80

Abstract: The described technology is directed towards returning less data than is available for a data item in response to a request to a data service. A virtual graph node is returned in response to client requests, in which the virtual node comprises a relatively lightweight set of information relative to the full set of information for the data item, e.g., maintained in a main (graph) node. A requesting client indicates that a virtual node is desired, and receives a response comprising the virtual node, generally processed from the main node's data into a reduced subset of the main node. The main node may be cached at the data service, and returned if and when requested.

公开(公告)号：US11200251B2

公开(公告)日：2021-12-14

申请号：US16709089

申请日：2019-12-10

Applicant: Home Box Office, Inc.

Inventor： Sata Busayarat ,  Brandon C. Furtwangler ,  Allen Arthur Gay ,  Jonathan David Lutz ,  Steven N. Furtwangler

IPC: G06F16/25 ,  G06F16/16 ,  G06F16/901 ,  H04L29/06 ,  G06F16/738

Abstract: The described technology is directed towards a data transformation pipeline architecture of a data service that processes generalized datasets into datasets (e.g., video data or graph nodes) customized for a particular client device. Described herein is maintaining a set of data transformation models at a data service, and upon receiving a client request for data, selecting a relevant subset of the transformation models and arranging the subset into a data transformation pipeline. In general, the pipeline of transformation models transforms the generalized data into the format and shape that each client device expects. The subset may be selected based upon device type, device class and/or software version information (and possibly state data) sent with each data request. The transformation models may be maintained in a hierarchical data store such as files in a file system to facilitate retrieval by searching the hierarchy for appropriate transformation models.

公开(公告)号：US11146654B2

公开(公告)日：2021-10-12

申请号：US16554028

申请日：2019-08-28

Applicant: Home Box Office, Inc.

Inventor： Sata Busayarat ,  Jonathan David Lutz ,  Allen Arthur Gay ,  Mei Qi

IPC: H04L29/08 ,  G06F16/245 ,  G06F12/0871 ,  G06F12/0868 ,  G06F12/0811

Abstract: The described technology is directed towards a cache framework that accesses a tier of ordered caches, in tier order, to satisfy requests for data. The cache framework may be implemented at a front-end service level server, and/or a back end service level server, or both. The cache framework handles read-through and write-through operations, including handling batch requests for multiple data items. The cache framework also facilitates dynamically changing the tier structure, e.g., for adding, removing, replacing and/or reordering caches in the tier, e.g., by re-declaring a data structure such as an array that identifies the tiered cache configuration.

公开(公告)号：US11019173B2

公开(公告)日：2021-05-25

申请号：US16658363

申请日：2019-10-21

Applicant: Home Box Office, Inc.

Inventor： Jonathan David Lutz ,  Sata Busayarat ,  Mei Qi

IPC: H04L29/08 ,  G06F16/957 ,  G06F12/123 ,  H04L12/26 ,  H04L29/06

Abstract: The described technology is directed towards maintaining a cache of data items, with cached data items having current value subsets and next value subsets. The cache is accessed for data item requests, to return a cache miss if a requested data item is not cached, to return data from the current value subset if not expired, to return data from the next value subset if the current value subset is expired and the next value subset is not expired, or to return a cache miss (or expired data) if both subsets are expired. Cached data items are refreshed, (e.g., periodically), when a data item's current value subset is expired by replacing the data item's current value subset with the next value subset and caching a new next value subset, or caching a new next value subset when the next value subset will expire within a threshold time.