Adaptive caching in broadcast networks

• US 7,996,483 B2
• Filed: 06/20/2007
• Issued: 08/09/2011
• Est. Priority Date: 06/20/2007
• Status: Active Grant

• Current Assignee: Microsoft Technology Licensing LLC (Microsoft Corporation)
• Original Assignee: Microsoft Corporation
• Inventors: Dhodapkar, Amit A.
• Primary Examiner(s): Kim; Hong
• Application Number:
  US11/820,885
• Publication Number:
  US 20080320222A1
• Time in Patent Office: 1,511 Days
• Field of Search: 711/113, 711/118, 711/144, 711/145, 711/167, 709/217, 709/218, 709/219, 709/213
• US Class Current: 709/213
• CPC Class Codes: G06F 12/0813 with a network or matrix configuration
• CPC Class Codes: G06F 12/121 using replacement algorithms
• CPC Class Codes: G06F 16/9574 of access to content, e.g. by caching
• CPC Class Codes: H04L 67/56 Provisioning of proxy services store-and-forward switching systems in data switching networks H04L12/54
• CPC Class Codes: H04L 67/5682 Policies or rules for updating, deleting or replacing the stored data
• CPC Class Codes: 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
• CPC Class Codes: H04N 21/2393 involving handling client requests scheduling or organising the servicing of application requests H04L67/60
• CPC Class Codes: H04N 21/26208 the scheduling operation being performed under constraints
• CPC Class Codes: H04N 7/17318 Direct or substantially direct transmission and handling of requests

Abstract

Adaptive caching techniques are described. In an implementation, a head end defines a plurality of cache periods having associated criteria. Request data for content is obtained and utilized to associate the content with the defined cache periods based on a comparison of the request data with the associated criteria. Then, the content is cached at the head end for the associated cache period.

Claims

1. A distribution server comprising:

a processor; and

memory configured to cache content requested by one or more clients from one or more content providers and maintain one or more modules that are executable on the processor to;

obtain request data describing intervals of time between a plurality of requests by one or more clients for the content, in which the request data also describes each said request for the content by the one or more clients occurs when the content is not cached at the distribution server;

insert an identifier into the content designating a cache period for the content based on the request data; and

cache the content in the memory according to the designated cache period.

2. A distribution server as described in claim 1, wherein the one or more modules are further executable to:

define a plurality of said cache periods, each having associated criteria; and

compare the obtained request data to one or more of the associated criteria to determine the designated cache period.

3. A distribution server as described in claim 2, wherein the associated criteria specify a request time interval or a total number of requests.

4. A distribution server as described in claim 1, wherein:

a plurality of said cache periods each have associated criteria that define a time interval;

the request data further comprises an average time interval between the plurality of requests by the one or more clients for the content; and

the one or more modules insert the identifier into the content designating the cache period for the content based on the request data by comparing the average time interval to one or more said time intervals of the plurality of said cache periods.

5. A distribution server as described in claim 1, wherein the content includes broadcast content that includes television programming and web content.

6. A distribution server as described in claim 1, further comprising an internet gateway to provide the content when configured as web content.

7. A method comprising:

determining a time interval value for content based at least in part on intervals of time that occur between a plurality of requests for the content received by a distribution server from one or more clients;

wherein each said request for the content is determined when the content is not cached at the distribution server;

inserting into the content one of a plurality of identifiers based on the determined time interval value, wherein each said identifier designates a length of time; and

storing the content in a cache according to the designated length of time of the inserted identifier.

8. A method as described in claim 7, further comprising:

removing the content from the cache when the designated length of time expires;

detecting a next said request for the content;

determining a new said time interval value for the content based on the next said request; and

inserting into the content one of the plurality of identifiers based on the new said time interval value.

9. A method as described in claim 7 further comprising:

assigning a priority to the content based upon a total number of the plurality requests; and

removing the content from the cache before the designated length of time expires based upon the priority.

10. A method as described in claim 7, wherein the time interval value defines an amount of time between when the content is removed from the cache and when another said request for the content is received.

11. A method as described in claim 7, wherein at least one of the plurality of identifiers includes a threshold value that defines an amount of said content into which the at least one identifier is inserted, which when exceeded causes the at least one identifier to be divided into two or more identifiers, at least one of which having a new designated length of time.

12. A method as described in claim 7, further comprising determining a total number of the plurality of requests;

and wherein the inserting into the content the one of the plurality of identifiers is based on the total number of plurality of requests and the determined time interval value.

13. A method as described in claim 7, wherein each of the plurality of identifiers includes one or more criteria which define an interval of time for each said identifier that is usable to perform the inserting the identifiers into content.

14. One or more computer-readable storage media comprising instructions that are executable to:

define a plurality of cache periods each associated with criteria that defines a total number of requests and a request interval;

determine request intervals for content based at least in part on intervals of time between a plurality of requests for the content, wherein each said request for the content is determined when the content is not cached;

insert an identifier into the content designating the respective cache period when the content meets the criteria associated with one of the plurality of cache periods.

15. One or more computer-readable storage media as described in claim 14, wherein:

the request interval defines an average time between the requests; and

the total number of requests defines a minimum total number of requests.

16. One or more computer-readable storage media as described in claim 14, wherein the instructions further insert an identifier into the content designating a default cache period for the content when the content does not meet the criteria.

17. One or more computer-readable storage media as described in claim 14, wherein the content includes broadcast content and web content.