CHOREOGRAPHED CACHING

• US 20160088113A1
• Filed: 09/22/2014
• Published: 03/24/2016
• Est. Priority Date: 09/22/2014
• Status: Active Grant

• Current Assignee: Belkin International Incorporated (Hon Hai Precision Industry Co., Ltd.)
• Original Assignee: Belkin International Incorporated (Hon Hai Precision Industry Co., Ltd.)
• Inventors: Kim, Ryan Yong
• Granted Patent: US 9,936,039 B2
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: H04L 12/2834 Switching of information between an external network and a home network access arrangements H04L12/2856
• CPC Class Codes: H04L 45/742 Route cache; Operation thereof
• CPC Class Codes: H04L 49/252 Store and forward routing
• CPC Class Codes: H04L 63/0428 wherein the data content is protected, e.g. by encrypting or encapsulating the payload
• CPC Class Codes: H04L 63/0464 using hop-by-hop encryption, i.e. wherein an intermediate entity decrypts the information and re-encrypts it before forwarding it
• CPC Class Codes: H04L 63/0471 applying encryption by an intermediary, e.g. receiving clear information at the intermediary and encrypting the received information at the intermediary before forwarding
• CPC Class Codes: H04L 63/168 above the transport layer
• CPC Class Codes: H04L 67/1097 for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
• CPC Class Codes: H04L 67/2885 Hierarchically arranged intermediate devices, e.g. for hierarchical caching
• CPC Class Codes: H04L 67/568 Storing data temporarily at an intermediate stage, e.g. caching
• CPC Class Codes: H04L 67/5681 Pre-fetching or pre-delivering data based on network characteristics
• CPC Class Codes: H04L 67/5682 Policies or rules for updating, deleting or replacing the stored data
• CPC Class Codes: H04L 67/60 Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources admission control or resource allocation H04L47/70

Abstract

A routing device capable of performing application layer data caching is described. Application data caching at a routing device can alleviate the bottleneck that an application data host may experience during high demands for application data. Requests for the application data can also be fulfilled faster by eliminating the network delays for communicating with the application data host. The techniques described can also be used to perform analysis of the underlying application data in the network traffic transiting though a routing device.

Claims

1. A computer implemented method comprising:

monitoring, by a computing device, requests received on a plurality of routing devices for application data corresponding to a network resource identifier;

aggregating the requests over a caching time window to derive an aggregated number of requests received on the plurality of routing devices;

determining that the aggregated number of requests received within the caching time window is above a caching threshold; and

in response to determining the aggregated number of requests is above the caching threshold, notifying one or more of the plurality of routing devices to cache the application data.

2. The method of claim 1, further comprising:

after notifying the one or more of the plurality of routing devices to cache the application data, monitoring subsequent requests received on the plurality of routing devices for the application data

aggregating the subsequent requests over a de-caching time window to derive an aggregated number of subsequent requests received on the plurality of routing devices;

determining that the aggregated number of subsequent requests received within the de-caching time window is below a de-caching threshold; and

in response to determining the aggregated number of subsequent requests is below the de-caching threshold, notifying the one or more of the plurality of routing devices to de-cache the application data.

3. The method of claim 2, wherein a duration of the caching time window is different than a duration of the de-caching time window.

4. The method of claim 2, wherein the caching threshold is different than the de-caching threshold.

5. The method of claim 1, further comprising:

notifying one or more additional routing devices that have not received a request for the application data to cache the application data.

6. The method of claim 5, further comprising:

instructing one or more of the plurality of routing devices to push the application data to the one or more additional routing devices.

7. The method of claim 1, wherein notifying the one or more of the plurality of routing devices to cache the application data includes notifying each of the one or more of the plurality of routing devices to cache a different portion of the application data.

8. A system, comprising:

one or more data processors; and

a non-transitory computer readable storage medium containing instructions which when executed on the one or more data processors, cause the one or more processors to perform operations including;

monitoring requests received on a plurality of routing devices for application data corresponding to a network resource identifier;

aggregating the requests over a caching time window to derive an aggregated number of requests received on the plurality of routing devices;

determining that the aggregated number of requests received within the caching time window is above a caching threshold; and

in response to determining the aggregated number of requests is above the caching threshold, notifying one or more of the plurality of routing devices to cache the application data.

9. The system of claim 8, wherein the operations further include:

after notifying the one or more of the plurality of routing devices to cache the application data, monitoring subsequent requests received on the plurality of routing devices for the application data

aggregating the subsequent requests over a de-caching time window to derive an aggregated number of subsequent requests received on the plurality of routing devices;

determining that the aggregated number of subsequent requests received within the de-caching time window is below a de-caching threshold; and

in response to determining the aggregated number of subsequent requests is below the de-caching threshold, notifying the one or more of the plurality of routing devices to de-cache the application data.

10. The system of claim 9, wherein a duration of the caching time window is different than a duration of the de-caching time window.

11. The system of claim 9, wherein the caching threshold is different than the de-caching threshold.

12. The system of claim 8, wherein the operations further include:

notifying one or more additional routing devices that have not received a request for the application data to cache the application data.

13. The system of claim 12, wherein the operations further include:

instructing one or more of the plurality of routing devices to push the application data to the additional routing devices.

14. The system of claim 8, wherein notifying the one or more of the plurality of routing devices to cache the application data includes notifying each of the one or more of the plurality of routing devices to cache a different portion of the application data.

15. A computer-program product tangibly embodied in a non-transitory machine-readable storage medium, including instructions configured to cause a data processing apparatus to perform operations comprising:

monitoring requests received on a plurality of routing devices for application data corresponding to a network resource identifier;

aggregating the requests over a caching time window to derive an aggregated number of requests received on the plurality of routing devices;

determining that the aggregated number of requests received within the caching time window is above a caching threshold; and

in response to determining the aggregated number of requests is above the caching threshold, notifying one or more of the plurality of routing devices to cache the application data.

16. The computer-program product of claim 15, wherein the operations further include:

after notifying the one or more of the plurality of routing devices to cache the application data, monitoring subsequent requests received on the plurality of routing devices for the application data

aggregating the subsequent requests over a de-caching time window to derive an aggregated number of subsequent requests received on the plurality of routing devices;

determining that the aggregated number of subsequent requests received within the de-caching time window is below a de-caching threshold; and

in response to determining the aggregated number of subsequent requests is below the de-caching threshold, notifying the one or more of the plurality of routing devices to de-cache the application data.

17. The computer-program product of claim 16, wherein a duration of the caching time window is different than a duration of the de-caching time window.

18. The computer-program product of claim 16, wherein the caching threshold is different than the de-caching threshold.

19. The computer-program product of claim 15, wherein the operations further include:

notifying one or more addition al routing devices that have not received a request for the application data to cache the application data.

20. The computer-program product of claim 19, wherein the operations further include:

instructing one or more of the plurality of routing devices to push the application data to the additional routing devices.

21. The computer-program product of claim 15, wherein notifying the one or more of the plurality of routing devices to cache the application data includes notifying each of the one or more of the plurality of routing devices to cache a different portion of the application data.