Online and distributed optimization framework for wireless analytics

• US 9,949,149 B2
• Filed: 01/17/2017
• Issued: 04/17/2018
• Est. Priority Date: 12/31/2011
• Status: Active Grant

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Garg, Vikas K., Kalyanaraman, Shivkumar, Narang, Ankur
• Primary Examiner(s): Magloire, Vladimir
• Assistant Examiner(s): ORANGE, DAVID BENJAMIN
• Application Number:
  US15/407,581
• Publication Number:
  US 20170127300A1
• Time in Patent Office: 455 Days
• CPC Class Codes: G06F 17/11 for solving equations , e.g. nonlinear equations, general mathematical optimization problems optimization specially adapted for a specific administrative, business or logistic context G06Q10/04
• CPC Class Codes: H04L 43/028 by filtering
• CPC Class Codes: H04W 24/02 Arrangements for optimising operational condition
• CPC Class Codes: H04W 24/08 Testing, supervising or monitoring using real traffic
• CPC Class Codes: H04W 28/16 Central resource management; Negotiation of resources or communication parameters, e.g. negotiating bandwidth or QoS [Quality of Service]

Abstract

A method, computer program product, and computer system directed to an online and distributed optimization framework for wireless analytics. A radio network controller determines a ranking for each of a plurality of received objects using a plurality of similarity graphs. The radio network controller extracts a common structure by collaborative filtering data associated with a plurality of user devices and the plurality of received objects. The common structure is analyzed to infer usage patterns within a time slot. The radio network controller stores a subset of the ranked objects of the plurality of received objects in response to the analysis.

Claims

1. A computer-implemented method comprising:

determining, by a radio network controller, a ranking for each of a plurality of received objects using a plurality of similarity graphs for a plurality of base stations, wherein the plurality of received objects include data files received from at least one of the plurality of base stations, the ranking calculated by

2. The computer-implemented method of claim 1 wherein the plurality of similarity graphs include an object-object similarity graph, a base station-base station similarity graph, and a user-user similarity graph.

3. The computer-implemented method of claim 1 wherein the ranking for each of the plurality of received objects is based upon, at least in part, a demand at each of a plurality of base stations, a weighting factor for premium and non-premium demands, and a bandwidth associated with each object of the plurality of received objects.

4. The computer-implemented method of claim 1 further comprising generating demand predictions across time slots for a plurality of base stations.

5. The computer-implemented method of claim 1 further comprising identifying which of the plurality of user devices and the plurality of received objects appear together in the plurality of similarity graphs.

6. The computer-implemented method of claim 1 further comprising generating an online update of the ranking for each of the plurality of received objects and the plurality of users.

7. The computer-implemented method of claim 1 wherein the collaborative filtering is based upon, at least in part, co-clustering.

8. A computer program product residing on a non-transitory computer readable medium having a plurality of instructions stored thereon which, when executed by a processor, cause the processor to perform operations comprising:

determining a ranking for each of a plurality of received objects using a plurality of similarity graphs for a plurality of base stations, wherein the plurality of received objects include data files received from at least one of the plurality of base stations, the ranking calculated by

9. The computer program product of claim 8 wherein the plurality of similarity graphs include an object-object similarity graph, a base station-base station similarity graph, and a user-user similarity graph.

10. The computer program product of claim 8 wherein the ranking for each of the plurality of received objects is based upon, at least in part, a demand at each of a plurality of base stations, a weighting factor for premium and non-premium demands, and a bandwidth associated with each object of the plurality of received objects.

11. The computer program product of claim 8 further comprising generating demand predictions across time slots for a plurality of base stations.

12. The computer program product of claim 8 further comprising identifying which of the plurality of user devices and the plurality of received objects appear together in the plurality of similarity graphs.

13. The computer program product of claim 8 further comprising generating an online update of the ranking for each of the plurality of received objects and the plurality of users.

14. The computer program product of claim 8 wherein the collaborative filtering is based upon, at least in part, co-clustering.

15. A computing system including a processor and memory configured to perform operations comprising:

determining a ranking for each of a plurality of received objects using a plurality of similarity graphs for a plurality of base stations, wherein the plurality of received objects include data files received from at least one of the plurality of base stations, the ranking calculated by

16. The computing system of claim 15 wherein the plurality of similarity graphs include an object-object similarity graph, a base station-base station similarity graph, and a user-user similarity graph.

17. The computing system of claim 15 wherein the ranking for each of the plurality of received objects is based upon, at least in part, a demand at each of a plurality of base stations, a weighting factor for premium and non-premium demands, and a bandwidth associated with each object of the plurality of received objects.

18. The computing system of claim 15 further comprising generating demand predictions across time slots for a plurality of base stations.

19. The computing system of claim 15 further comprising identifying which of the plurality of user devices and the plurality of received objects appear together in the plurality of similarity graphs.

20. The computing system of claim 15 further comprising generating an online update of the ranking for each of the plurality of received objects and the plurality of users.

21. The computing system of claim 15 wherein the collaborative filtering is based upon, at least in part, co-clustering.