# US 2025/0097487 A1 · Mitigating costs of presentation and delivery of digital media assets based on geographically distributed cache memory contents

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2025/0097487 A1
- Document ID: US20250097487A1
- Status: Published application
- Kind: A1
- Application number: 18/967,560
- Filed: 2024-12-03
- Published: 2025-03-20
- Earliest claimed: 2019-02-25
- Assignees: Iris.Tv, Inc.
- Applicants: Iris.Tv, Inc.
- Inventors: Richard James HYDEN; Joel SPITALNIK; Thomas J. SULLIVAN
- Web page: https://patentgrep.com/patent/US20250097487A1

## CPC

- H04L 67/568: Storing data temporarily at an intermediate stage, e.g. caching
- H04N 21/23106: {involving caching operations (prefetching while addressing of a memory level in which the access to the desired data or data block requires associative addressing means within memory systems or architectures G06F12/0862; caching at an intermediate stage in a data network H04L67/568)}
- H04N 21/23103: {using load balancing strategies, e.g. by placing or distributing content on different disks, different memories or different servers (storage management G06F3/0604; allocation of resources considering the load in multiprogramming arrangements G06F9/505; techniques for rebalancing the load in a distributed system G06F9/5083; access to distributed or replicated servers, e.g. load balancing, in data networks H04L67/1001)}
- H04N 21/23113: {involving housekeeping operations for stored content, e.g. prioritizing content for deletion because of storage space restrictions (storage management, e.g. defragmentation G06F3/0604; snloading stored programs G06F9/445; housekeeping operations in file systems, e.g. deletion policies G06F16/10; buffering arrangements in a network node or in an end terminal in packet networks H04L49/90)}
- H04N 21/23116: {involving data replication, e.g. over plural servers (synchronization of replicated data G06F11/1658; error detection or correction by means of data replication G06F11/2053; replication in distributed file systems G06F16/10; replication in distributed file systems G06F16/27; replication or mirroring of data in data networks H04L67/1095)}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- H04N: PICTORIAL COMMUNICATION, e.g. TELEVISION

## Abstract

An anchor asset is selected among a plurality of assets based on a caching gain calculation for the anchor asset. A variety of assets are selected from the plurality of assets based on a relationship with the anchor asset, the variety of assets including any combination of: audio, video, text, image, etc. The anchor asset and the variety of assets are cached on one or more geographically diverse servers among a plurality of servers for delivery to client devices.

## Claims

### Claim 1

A method, comprising:
creating a plurality of ordered sets of digital assets, each ordered set of digital assets comprised of an anchor asset and a plurality of assets related to the anchor asset;
wherein each anchor asset in the plurality of ordered sets of digital assets is assigned a caching gain value, the caching gain value includes an expected likelihood that the anchor asset will be consumed factor;
caching each ordered set of digital assets in the plurality of ordered sets of digital assets on two or more edge servers among a plurality of edge servers, the two or more edges servers selected for the ordered set of digital assets based on the caching gain value of the anchor asset in the ordered set of digital assets and a geographic calculation for the anchor asset, the ordered set of digital assets are available for delivery to client devices from the two or more edge servers, the two or more edge servers are geographically diverse.

### Claim 2 (depends on 1)

The method of claim 1, wherein the two or more edge servers are further selected from the plurality of servers based on a delivery cost calculation.

### Claim 3 (depends on 1)

The method of claim 1, wherein the caching gain value includes a calculation of a burden of not caching the anchor asset on a server with an overall caching gain when the anchor asset is cached on a server.

### Claim 4 (depends on 1)

The method of claim 1, wherein the two or more servers are further selected from the plurality of servers based on a memory cost calculation.

### Claim 5 (depends on 1)

The method of claim 1, wherein the two or more servers are further selected from the plurality of servers based on a lower latency to an expected set of client devices.

### Claim 6 (depends on 1)

The method of claim 1, wherein a first ordered set of digital assets is removed from one or more servers when a second ordered set of digital assets is calculated to have a better caching gain value than the first ordered set of digital assets.

### Claim 7

One or more non-transitory computer-readable storage media, storing one or more sequences of instructions, which when executed by one or more processors cause performance of:
creating a plurality of ordered sets of digital assets, each ordered set of digital assets comprised of an anchor asset and a plurality of assets related to the anchor asset;
wherein each anchor asset in the plurality of ordered sets of digital assets is assigned a caching gain value, the caching gain value includes an expected likelihood that the anchor asset will be consumed factor;
caching each ordered set of digital assets in the plurality of ordered sets of digital assets on two or more edge servers among a plurality of edge servers, the two or more edges servers selected for the ordered set of digital assets based on the caching gain value of the anchor asset in the ordered set of digital assets and a geographic calculation for the anchor asset, the ordered set of digital assets are available for delivery to client devices from the two or more edge servers, the two or more edge servers are geographically diverse.

### Claim 8 (depends on 7)

The one or more non-transitory computer-readable storage media of claim 7, wherein the two or more edge servers are further selected from the plurality of servers based on a delivery cost calculation.

### Claim 9 (depends on 7)

The one or more non-transitory computer-readable storage media of claim 7, wherein the caching gain value includes a calculation of a burden of not caching the anchor asset on a server with an overall caching gain when the anchor asset is cached on a server.

### Claim 10 (depends on 7)

The one or more non-transitory computer-readable storage media of claim 7, wherein the two or more servers are further selected from the plurality of servers based on a memory cost calculation.

### Claim 11 (depends on 7)

The one or more non-transitory computer-readable storage media of claim 7, wherein the two or more servers are further selected from the plurality of servers based on a lower latency to an expected set of client devices.

### Claim 12 (depends on 7)

The one or more non-transitory computer-readable storage media of claim 7, wherein a first ordered set of digital assets is removed from one or more servers when a second ordered set of digital assets is calculated to have a better caching gain value than the first ordered set of digital assets.

### Claim 13

An apparatus, comprising:
one or more processors; and
a memory storing instructions, which when executed by the one or more processors, causes the one or more processors to:
creating a plurality of ordered sets of digital assets, each ordered set of digital assets comprised of an anchor asset and a plurality of assets related to the anchor asset;
wherein each anchor asset in the plurality of ordered sets of digital assets is assigned a caching gain value, the caching gain value includes an expected likelihood that the anchor asset will be consumed factor;
caching each ordered set of digital assets in the plurality of ordered sets of digital assets on two or more edge servers among a plurality of edge servers, the two or more edges servers selected for the ordered set of digital assets based on the caching gain value of the anchor asset in the ordered set of digital assets and a geographic calculation for the anchor asset, the ordered set of digital assets are available for delivery to client devices from the two or more edge servers, the two or more edge servers are geographically diverse.

### Claim 14 (depends on 13)

The apparatus of claim 13, wherein the two or more edge servers are further selected from the plurality of servers based on a delivery cost calculation.

### Claim 15 (depends on 13)

The apparatus of claim 13, wherein the caching gain value includes a calculation of a burden of not caching the anchor asset on a server with an overall caching gain when the anchor asset is cached on a server.

### Claim 16 (depends on 13)

The apparatus of claim 13, wherein the two or more servers are further selected from the plurality of servers based on a memory cost calculation.

### Claim 17 (depends on 13)

The apparatus of claim 13, wherein the two or more servers are further selected from the plurality of servers based on a lower latency to an expected set of client devices.

### Claim 18 (depends on 13)

The apparatus of claim 13, wherein a first ordered set of digital assets is removed from one or more servers when a second ordered set of digital assets is calculated to have a better caching gain value than the first ordered set of digital assets.
