SYSTEM AND METHOD FOR DYNAMICALLY SCHEDULING NETWORK SCANNING TASKS

• US 20150172140A1
• Filed: 12/18/2013
• Published: 06/18/2015
• Est. Priority Date: 12/18/2013
• Status: Abandoned Application

• Current Assignee: Camelot UK Bidco Limited (Clarivate Plc)
• Original Assignee: Thomson Reuters Global Resources
• Inventors: Habdank, Jozef, Loekkegaard, Kristian
• Application Number:
  US14/132,968
• Publication Number:
  US 20150172140A1
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: H04L 2463/103 applying security measure for protecting copy right protecting software against unauthorised usage in a vending or licensing environment, e.g. protection the software providers copyright G06F21/10; data processing systems or methods, specially adapted for payment schemes, architectures or protocols G06Q20/00; secrecy systems or subscription systems H04N7/16
• CPC Class Codes: H04L 43/00 Arrangements for monitoring or testing data switching networks
• CPC Class Codes: H04L 67/104 Peer-to-peer [P2P] networks

Abstract

In embodiments, a task scheduler schedules a network scanning task associated with the electronic item to be repeatedly executed according to an execution frequency. The execution frequency corresponds to a length of a time interval between each execution. The task scheduler receives a first set of scan results generated by a first execution, at a first execution time, of the scanning task and a second set of scan results generated by a second execution, at a second execution time, of the scanning task. The first and second sets of scan results may include information associated with first and second sets of observed activities associated with the electronic item, respectively. The first and second sets of scan results are analyzed and the execution frequency is modified based on the analysis.

Claims

1. A computer-implemented method for dynamically scheduling network scanning tasks, the method comprising:

receiving an identification of a scanning task associated with an electronic item that is accessible via a network;

scheduling, using a processor, the scanning task to be repeatedly executed according to an execution frequency, wherein the execution frequency corresponds to a time interval between each execution of the scanning task;

receiving a first set of scan results generated by a first execution, at a first execution time, of the scanning task, the first set of scan results comprising information associated with a first set of detected activities associated with the electronic item;

receiving a second set of scan results generated by a second execution, at a second execution time, of the scanning task, the second set of scan results comprising information associated with a second set of detected activities associated with the electronic item;

analyzing the first and second sets of scan results, including comparing the first and second sets of scan results, wherein the information associated with the first and second sets of detected activities associated with the electronic item comprises a first set of network identifiers and a second set of network identifiers, respectively; and

modifying the execution frequency based on the analyzing of the first and second sets.

2. The method of claim 1, further comprising facilitating an anti-piracy service based on at least the first set of scan results.

3. The method of claim 1, wherein the first set of detected activities associated with the electronic item comprises instances of unauthorized access of the electronic item via the network.

4. The method of claim 1, wherein the network comprises a peer-to-peer network.

5. The method of claim 4, wherein the scanning task comprises instructions that cause one or more scanning servers to capture IP addresses that are accessing a content hash corresponding to the electronic item.

6. The method of claim 1, wherein the network comprises the Internet.

7. The method of claim 6, wherein the scanning task comprises instructions that cause one or more scanning servers to search for infringing links to the electronic item.

8. The method of claim 1, wherein the first and second sets of network identifiers comprise a first and second set of Internet Protocol (IP) addresses, respectively.

9. The method of claim 1, wherein analyzing the first and second sets of scan results comprises:

accessing a list, M_n, of previously captured network identifiers, wherein the list includes at least the first set of network identifiers;

determining a number, K(C_n), of captured network identifiers in the second set of network identifiers;

determining a number, R_n, of recaptured network identifiers based on a comparison of the network identifiers in the second set of network identifiers and the list, M_n, of previously captured network identifiers; and

modifying the execution frequency based on R_n and K(C_n).

10. The method of claim 9, wherein the time interval initially comprises a maximum length, T_max, and wherein modifying the execution frequency comprises:

determining R_n/K(C_n); and

calculating a modified length, T_n, for the time interval based on R_n/K(C_n), wherein T_n is less than T_max if R_n/K(C_n) is less than one, and T_n is equal to T_max if R_n/K(C_n) is equal to one.

11. The method of claim 10, wherein R_n/K(C_n) is less than one, the method further comprising:

scheduling, using a processor, a third execution of the scanning task for a third execution time, wherein the length of the time interval between the third execution time and the second execution time is T_max; and

wherein modifying the execution frequency comprises rescheduling, using the processor, the third execution of the scanning task for a fourth execution time, wherein the length of the time interval between the second execution time and the fourth execution time is T_n.

12. The method of claim 11, wherein determining the second length further comprises applying a nonlinear filter to the length, T_n, to determine a filtered length, T_n′

.

13. The method of claim 9, wherein analyzing the first and second sets of scan results further comprises:

determining a number, K(M_n), of device identifiers included in the list of previously captured network identifiers; and

determining an estimated swarm size, N_n, based on K(M_n), R_n, and K(C_n).

14. The method of claim 13, further comprising modifying the execution frequency based on K(M_n) and N_n.

15. The method of claim 13, wherein determining the estimated swarm size comprises performing a statistical analysis based on a Poisson distribution.

16. A computer-implemented method for dynamically scheduling network scanning tasks, the method comprising:

receiving an identification of a scanning task associated with an electronic item;

scheduling, using a processor, a first execution of the scanning task for a first execution time;

performing the first execution of the scanning task at the first execution time;

scheduling, using the processor, a second execution of the scanning task for a second execution time, wherein a length of a time interval between the first execution time and the second execution time is based on an execution frequency;

receiving a first set of scan results generated by the first execution of the scanning task, the first set of scan results comprising a first set of network identifiers associated with a first set of detected activities associated with the electronic item;

performing the second execution of the scanning task at the second execution time;

scheduling, using the processor, a third execution of the scanning task for a third execution time, wherein a length of a time interval between the second execution time and the third execution time is based on the execution frequency;

receiving a second set of scan results generated by the second execution of the scanning task, the second set of scan results comprising a second set of network identifiers associated with a second set of detected activities associated with the electronic item;

determining, using the processor, a number, K(C_n), of captured network identifiers in the second set of scan results;

determining a number, R_n, of recaptured network identifiers based on a comparison of the second set of network identifiers with a list, M_n, of previously captured network identifiers, wherein M_n includes at least the first set of network identifiers;

determining a modified execution frequency based on R_n and K(C_n); and

rescheduling the third execution of the scanning task for a fourth execution time based on the modified execution frequency.

17. The method of claim 16, wherein the first set of device identifiers further comprises IP addresses captured in each of a plurality of executions of the scanning task performed within a 24-hour period.

18. A system for monitoring network activities, the system comprising:

a scanning server configured to execute a network scanning task associated with an electronic item that is accessible via a network; and

a management server configured to manage the network scanning task associated with the electronic item, wherein the management server is configured to receive, from the scanning server, a set of scan results generated by a first execution, at a first time, of the network scanning task, wherein the set of scan results comprises a set of network identifiers, the management server comprising a processor that instantiates a plurality of software components stored in a memory, the plurality of software components comprising;

a task scheduler configured to;

(a) schedule a second execution of the network scanning task for a second time, wherein the second execution is scheduled based on an execution frequency, (b) analyze the set of scan results generated by the first execution, wherein the task scheduler is configured to compare the set of network identifiers with a list of previously captured network identifiers, and (c) modify the execution frequency based at least on the comparison; and

a services component configured to facilitate a network activity-monitoring service based on the network scanning task.

19. The system of claim 18, wherein the management server is further configured to determine an estimated swarm size based at least on the set of device identifiers and the list of previously identified device identifiers.

20. The method of claim 18, wherein the scanning task comprises instructions that causes the scanning server to search for infringing links to the electronic item.