METHOD AND APPARATUS FOR LOAD BALANCING IN MULTI-LEVEL DISTRIBUTED COMPUTATIONS

• US 20120166645A1
• Filed: 12/27/2010
• Published: 06/28/2012
• Est. Priority Date: 12/27/2010
• Status: Active Grant

• Current Assignee: Nokia Technologies Oy (Nokia Corporation)
• Original Assignee: Nokia Corporation
• Inventors: Boldyrev, Sergey, Laine, Hannu Ensio, Kaaja, Jari-Jukka Harald, Honkola, Jukka, Luukkala, Vesa-Veikko, Oliver, Ian Justin
• Granted Patent: US 8,874,747 B2
• Time in Patent Office: Days
• US Class Current: 709/226
• CPC Class Codes: G06F 9/5083 Techniques for rebalancing the load in a distributed system

Abstract

An approach is provided for providing load balancing in multi-level distributed computations. A distributed computation control platform determines closure capability data associated with respective levels of a computational architecture, wherein the respective levels include, at least in part, a device level, an infrastructure level, and a cloud computing level. The distributed computation control platform also determines functional flow information of the respective levels, one or more nodes of the respective levels, or a combination thereof with respect to at least one set of one or more computation closures. The distributed computation control platform further determines to cause, at least in part, processing at least the closure capability data, the functional flow information, or a combination thereof to determine: (a) a distribution of the one or more computation closures among the respective levels, (b) the one or more nodes, or (c) a combination thereof.

Claims

1. A method comprising facilitating a processing of and/or processing (1) data and/or (2) information and/or (3) at least one signal, the (1) data and/or (2) information and/or (3) at least one signal based, at least in part, on the following:

closure capability data associated with respective levels of a computational architecture, wherein the respective levels include, at least in part, a device level, an infrastructure level, and a cloud computing level;

functional flow information of the respective levels, one or more nodes of the respective levels, or a combination thereof with respect to at least one set of one or more computation closures; and

a processing of at least the closure capability data, the functional flow information, or a combination thereof to determine;

(a) a distribution of the one or more computation closures among the respective levels, (b) the one or more nodes, or (c) a combination thereof.

2. A method of claim 1, wherein the (1) data and/or (2) information and/or (3) at least one signal are further based, at least in part, on the following:

at least one cost function, at least one computation migration rule, or a combination thereof,

wherein the processing of at least the closure capability data, the functional flow information, or a combination is further based, at least in part, on;

(a) the at least one cost function, (b) the at least one computation migration rule, or (c) a combination thereof.

3. A method of claim 2, wherein the (1) data and/or (2) information and/or (3) at least one signal are further based, at least in part, on the following:

a processing of the at least one cost function, the at least one computation migration rule, or a combination thereof to determine a cost value associated with at least a portion of the distribution; and

a determination of whether to initiate the at least a portion of the distribution based, at least in part, on a comparison of the cost value against a threshold value.

4. A method of claim 1, wherein the (1) data and/or (2) information and/or (3) at least one signal are further based, at least in part, on the following:

update information associated with the closure capability data, the one or more computation closures, one or more executable states of the one or more computation closures, the functional flow, or a combination thereof; and

a processing of at least the update information to determine a redistribution of the one or more computation closures among the respective levels, the one or more nodes, or a combination thereof.

5. A method of claim 4, wherein the redistribution includes, a least in part, a pause, an interruption, a resumption, an interaction, a termination, a rollback, or a combination thereof of at least a portion of the one or more computation closures.

6. A method of claim 1, wherein the (1) data and/or (2) information and/or (3) at least one signal are further based, at least in part, on the following:

a determination to cause, at least in part, retrieval of respective results of the one or more computation closures based, at least in part, on the distribution; and

a processing the respective results to generate an aggregated result.

7. A method of claim 1, wherein the (1) data and/or (2) information and/or (3) at least one signal are further based, at least in part, on the following:

service class information associated with at least one user of the at least one set of the one or more computation closures,

wherein the distribution, the closure capability data, the functional flow information, an availability of at least a portion of the one or more computation closures at the respective levels, or a combination thereof are based, at least in part, on the service class information.

8. A method of claim 1, wherein the closure capability data includes, at least in part, data related to one or more computational branches, one or more computational elements, one or more resources, or a combination thereof associated with the respective levels, the one or more nodes, or a combination thereof.

9. A method of claim 1, wherein the processing of at least the closure capability data, the functional flow information, or a combination thereof is performed, at least in part, on traversal of at least one of the one or more computation closures from a first level of the respective levels to at least a second level of the respective levels, from a first node of the one or more nodes to at least a second node of the one or more nodes, or a combination thereof.

10. A method of claim 1, wherein the one or more computation closures include one or more static computation closures, one or more dynamic computation closures, or a combination thereof.

11. An apparatus comprising:

at least one processor; and

at least one memory including computer program code for one or more programs,

the at least one memory and the computer program code configured to, with the at least one processor, cause the apparatus to perform at least the following,

process and/or facilitate a processing of closure capability data associated with respective levels of a computational architecture, wherein the respective levels include, at least in part, a device level, an infrastructure level, and a cloud computing level;

process and/or facilitate a processing of functional flow information of the respective levels, one or more nodes of the respective levels, or a combination thereof with respect to at least one set of one or more computation closures; and

process and/or facilitate a processing of at least the closure capability data, the functional flow information, or a combination thereof to determine;

(a) a distribution of the one or more computation closures among the respective levels, (b) the one or more nodes, or (c) a combination thereof.

12. An apparatus of claim 11, wherein the apparatus is further caused to:

process and/or facilitate a processing of at least one cost function, at least one computation migration rule, or a combination thereof,

wherein the processing of at least the closure capability data, the functional flow information, or a combination is further based, at least in part, on;

(a) the at least one cost function, (b) the at least one computation migration rule, or (c) a combination thereof.

13. An apparatus of claim 12, wherein the apparatus is further caused to:

process and/or facilitate a processing of the at least one cost function, the at least one computation migration rule, or a combination thereof to determine a cost value associated with at least a portion of the distribution; and

determine whether to initiate the at least a portion of the distribution based, at least in part, on a comparison of the cost value against a threshold value.

14. An apparatus of claim 11, wherein the apparatus is further caused to:

process and/or facilitate a processing to update information associated with the closure capability data, the one or more computation closures, one or more executable states of the one or more computation closures, the functional flow, or a combination thereof; and

process and/or facilitate a processing of at least the update information to determine a redistribution of the one or more computation closures among the respective levels, the one or more nodes, or a combination thereof.

15. An apparatus of claim 14, wherein the redistribution includes, a least in part, a pause, an interruption, a resumption, an interaction, a termination, a rollback, or a combination thereof of at least a portion of the one or more computation closures.

16. An apparatus of claim 11, wherein the apparatus is further caused to:

determine to cause, at least in part, retrieval of respective results of the one or more computation closures based, at least in part, on the distribution; and

process and/or facilitate a processing of the respective results to generate an aggregated result.

17. An apparatus of claim 11, wherein the apparatus is further caused to:

process and/or facilitate a processing of service class information associated with at least one user of the at least one set of the one or more computation closures,

wherein the distribution, the closure capability data, the functional flow information, an availability of at least a portion of the one or more computation closures at the respective levels, or a combination thereof are based, at least in part, on the service class information.

18. An apparatus of claim 11, wherein the closure capability data includes, at least in part, data related to one or more computational branches, one or more computational elements, one or more resources, or a combination thereof associated with the respective levels, the one or more nodes, or a combination thereof.

19. An apparatus of claim 11, wherein the processing of at least the closure capability data, the functional flow information, or a combination thereof is performed, at least in part, on traversal of at least one of the one or more computation closures from a first level of the respective levels to at least a second level of the respective levels, from a first node of the one or more nodes to at least a second node of the one or more nodes, or a combination thereof.

20. An apparatus of claim 11, wherein the apparatus is a mobile phone further comprising:

user interface circuitry and user interface software configured to facilitate user control of at least some functions of the mobile phone through use of a display and configured to respond to user input; and

a display and display circuitry configured to display at least a portion of a user interface of the mobile phone, the display and display circuitry configured to facilitate user control of at least some functions of the mobile phone.

21-49. -49. (canceled)