Method and Apparatus For Caching Broadcasting Information

• US 20080005163A1
• Filed: 06/13/2007
• Published: 01/03/2008
• Est. Priority Date: 06/30/2006
• Status: Active Grant

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Porta, Michel, Collet, Jean-Luc, Marmigere, Gerard, Bauchot, Frederic
• Granted Patent: US 8,407,260 B2
• Time in Patent Office: Days
• US Class Current: 707/103Y
• CPC Class Codes: G06F 16/9574 of access to content, e.g. by 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

Abstract

A method of controlling the storage of web objects in a storage media, the web objects forming a closed web site and being adapted for delivery to a user, the web objects being stored on the basis of predictive determinations of which web object has the highest probability of being selected from the closed web site by the user.

Claims

1. A method of controlling the storage of web objects in a storage media, the web objects forming a closed web site and being adapted for delivery to a user, the web objects being stored on the basis of predictive determinations of which web object has a highest probability of being selected from the closed web site by the user, the method comprising the steps of:

a) identifying a plurality of web objects which form the closed web site;

b) determining a web tree of the closed web site;

c) identifying at least one parameter associated with each web object in the web tree;

d) determining from the at least one parameter of each web object a probability of the web object being selected so as to generate a list of likely web objects;

e) ordering the likely web objects in accordance with their probability;

f) storing the web object from the set of likely objects in order of their relative probability such that those with the highest probability are stored first; and

g) continuing the storing step for as long as there is available capacity in the storage media.

2. The method of claim 1, wherein the step of determining the probability of each web object being selected comprises the step of determining a numbers of steps from a root web object to each web object in the closed web site, such that those with a lower number of steps have a higher probability of being selected than those with a higher number of steps.

3. The method of claim 2, wherein the step of determining the probability of each web object being selected comprises determining the size of each web object such that those of a smaller size have a higher probability than those with a bigger size.

4. The method of claim 3, wherein the step of determining the probability of each web object being selected comprises determining the number of neighboring web objects for each web object.

5. The method of claim 4, wherein the step of determining the probability of each web object being selected comprises determining the number of links to other web objects in each web object.

6. The method of claim 1, wherein the step of determining the probability of each web object being selected comprises determining the number of links to other web objects in the or each web object.

7. The method of claim 1, wherein the step of determining the probability of each web object being selected comprises determining the number of neighboring web objects for each web object.

8. The method of claim 1, wherein the step of determining the probability of each web object being selected comprises determining the size of each web object such that those of a smaller size have a higher probability than those with a bigger size.

9. The method of claim 1, further comprising the step of updating the determination of parameters if the user selects a web object, such that a new set of parameters are determined and used to determine the probability of the subsequent selection of the user.

10. The method of claim 9, further comprising the step of removing web objects from the storage media based on the probabilities for the subsequent selection, such that the web object with the lowest priority of being subsequently selected is removed first.

11. The method of claim 10, further comprising the step of removing the web objects from the storage media until there is sufficient space in the storage medium for new high probability web objects.

12. The method of claim 9, further comprising the step of repeating the updating step each time the user makes a selection.

13. The method of claim 9, further comprising the step of forming a table of the parameters for each web object so that the probability can be determined from the table of parameters.

14. A method of viewing a web object at a remote mobile device having a memory, wherein the web object is transmitted to the remote mobile device over a broadcast standard channel, the method of viewing comprising the steps of:

a) receiving a plurality of web objects forming at least part of a closed web site, wherein each web object includes at least one parameter which determine a probability of a user selecting that object;

b) storing the web objects in the memory in accordance with the probability, such that those with the highest probability are stored first;

c) selecting a web object to view, thereby causing an update to the at least one parameter and a new probability for each web object being subsequently selected;

d) updating the web objects stored in memory based on the new probability such that those with the highest new probability are stored first; and

e) repeating the selecting and updating steps as required.

15. A computer program stored on a computer readable medium, comprising:

a) means for identifying a plurality of web objects which form the closed web site;

b) means for determining a web tree of the closed web site;

c) means for identifying at least one parameter associated with each web object in the web tree;

d) means for determining from the at least one parameter of each web object a probability of the web object being selected so as to generate a list of likely web objects;

e) means for ordering the likely web objects in accordance with their probability;

f) means for storing the web object from the set of likely objects in order of their relative probability such that those with the highest probability are stored first; and

g) means for continuing the storing step for as long as there is available capacity in the storage media.

16. The computer program of claim 15, further comprising means for updating the determination of parameters if the user selects a web object, such that a new set of parameters are determined and used to determine the probability of the subsequent selection of the user.

17. The method of claim 16, further comprising means for removing web objects from the storage media based on the probabilities for the subsequent selection, such that the web object with the lowest probability of being subsequently selected is removed first.

18. The method of claim 16, further comprising means for repeating the updating each time the user makes a selection.

19. The method of claim 16, further comprising means for forming a table of the parameters for each web object so that the probability can be determined from the table of parameters.

20. A computer program stored on a computer readable medium for viewing a web object at a remote mobile device having a memory, wherein the web object is transmitted to the remote mobile device over a broadcast standard channel, comprising:

a) means for receiving a plurality of web objects forming at least part of a closed web site, wherein the web object includes at least one parameter which determine a probability of a user selecting that object;

b) means for storing the web objects in the memory in accordance with the probability, such that those with the highest probability are stored first;

c) means for selecting a web object to view, thereby causing an update to the at least one parameter and a new probability for each web object being subsequently selected;

d) means for updating the web objects stored in memory based on the new probability such that those with the highest new probability are stored first; and

e) means for repeating the selecting and updating steps as required.