Virtual service switch

• US 8,566,447 B2
• Filed: 04/09/2007
• Issued: 10/22/2013
• Est. Priority Date: 04/10/2006
• Status: Active Grant

• Current Assignee: Bank of America Corp.
• Original Assignee: Bank of America Corp.
• Inventors: Cohen, David, Younan, James
• Primary Examiner(s): TAYLOR, NICHOLAS R
• Application Number:
  US11/784,832
• Publication Number:
  US 20070260723A1
• Time in Patent Office: 2,388 Days
• Field of Search: 709/226, 709/224, 709/227, 705/37
• US Class Current: 709/226
• CPC Class Codes: G06F 2209/5015 Service provider selection
• CPC Class Codes: G06F 9/5027 the resource being a machine, e.g. CPUs, Servers, Terminals
• CPC Class Codes: G06Q 10/00 Administration; Management
• CPC Class Codes: H04L 12/00 Data switching networks interconnection of, or transfer of information or other signals between, memories, input/output devices or central processing units G06F13/00
• CPC Class Codes: H04L 12/4625 Single bridge functionality, e.g. connection of two networks over a single bridge

Abstract

Virtual service switching includes contracting to provide a requestor with a unit of computing capacity to a service within a specific time period, creating one or more plans based at least in part on the contracting, scheduling execution of the one or more plans using the computing capacity, and if a bid for at least part of the unit of computing capacity is received prior to the end of the specific time period, allocating at least part of the computing capacity based at least in part on the bid. Each of the one or more plans comprises software code and associated data.

Claims

1. A method comprising:

creating a futures contract with a first requestor, the futures contract providing the first requestor with a unit of computing capacity to a service for a specific future time period and for a first price, the first price comprising an amount the first requestor is willing to pay to buy the unit of computing capacity;

receiving from the first requestor software code and associated data, the reception of the software code and associated data from the first requestor being an indication that the futures contract has been fixed;

creating, by one or more computing systems, one or more plans based at least in part on the contracting, each plan comprising;

an indication of resources required to provide the unit of computing capacity; and

one or more policies for exception handling;

scheduling, by the one or more computing systems, execution of the one or more plans using the computing capacity, the scheduling comprising metering demand for an individual application in terms of connection requests over time, load in terms of temperature, load flow, and volume, and capacity in terms of plan;

providing the first requestor with an option to buy additional units of computing capacity at a specified future date;

receiving from a second requestor after the futures contract has been fixed a bid for at least part of the unit of computing capacity previously contracted to the first requestor, the bid indicating a second price, the second price comprising an amount the second requestor is willing to pay to buy at least part of the unit of computing capacity previously contracted to the first requestor;

determining, by the one or more computing systems, that the second price indicated in the bid from the second requestor is higher than the first price; and

in response to the determination, allocating by the one or more computing systems to the second requestor the at least part of the computing capacity previously contracted to the first requestor.

2. The method of claim 1 wherein the scheduling is based at least in part on one or more dynamic capacity requests from one or more service agents.

3. The method of claim 1 wherein a schedule created by the scheduling defines how computing resources are to be allocated to particular tasks over time.

4. The method of claim 1 wherein a request from the first requestor comprises a description of a service.

5. The method of claim 1 wherein a request from the first requestor comprises a description of a quantity of requested computing resources.

6. The method of claim 1 wherein a request from the first requestor comprises a description of a time at which demand for computing resources is expected to materialize.

7. The method of claim 1 wherein a request from the first requestor comprises a description of a duration of expected use of computing resources.

8. The method of claim 1 wherein a request from the first requestor comprises a description of one or more geographic constraints.

9. The method of claim 1, further comprising metering demand for computing capacity by mediating incoming connection requests on target end-points capable of satisfying requests.

10. The method of claim 1, further comprising:

assigning each of one or more computing resources a cookie, the cookie representing the life of a computing resource; and

augmenting the cookie associated with a particular computing resource to indicate;

computing resource load as a function of application connectivity over a time interval; and

power consumed by the computing resource during the time interval.

11. A method comprising:

receiving from a first requestor, a request for computing resources to meet a demand for a service for a specific future time period and for a first price, the first price comprising an amount the first requestor is willing to pay to lease the computing resources, the service configured to provide a functionality;

creating a futures contract with the first requestor, the futures contract granting to the first requestor a lease of a unit of computing capacity based at least in part on the request;

receiving from the first requestor software code and associated data, the reception of the software code and associated data from the first requestor being an indication that the futures contract has been fixed;

creating, by one or more computing systems, a capacity plan comprising;

one or more parameters of the request;

an indication of resources required to provide the unit of computing capacity; and

one or more policies for exception handling;

creating, by the one or more computing systems, a schedule based on the capacity plan and information regarding one or more of available computing resources, reservations for computing resources, and system configurations, the schedule comprising metered demand for an individual application in terms of connection requests over time, load in terms of temperature, load flow, and volume, and capacity in terms of plan;

providing, by the one or more computing systems, the first requestor with an option to buy additional computing resources at a specified future date;

receiving from a second requestor after the futures contract has been fixed a bid for at least part of the unit of computing capacity previously granted to the first requestor, the bid indicating a second price, the second price comprising an amount the second requestor is willing to pay to lease at least part of the unit of computing capacity previously granted to the first requestor;

determining, by the one or more computing systems, that the second price indicated in the bid from the second requestor is higher than the first price; and

in response to the determination, allocating by the one or more computing systems to the second requestor the at least part of the unit of computing capacity previously granted to the first requestor.

12. The method of claim 11 wherein the schedule is based at least in part on one or more dynamic capacity requests from one or more service agents.

13. The method of claim 11 wherein the schedule defines how the computing resources are to be allocated to particular tasks over time.

14. The method of claim 11 wherein the one or more parameters comprise a description of a service.

15. The method of claim 11 wherein the one or more parameters comprise a description of a quantity of the computing resources.

16. The method of claim 11 wherein the one or more parameters comprise a description of a time at which demand for the computing resources is expected to materialize.

17. The method of claim 11 wherein the one or more parameters comprise a description of a duration of expected use of the computing resources.

18. The method of claim 11 wherein the one or more parameters comprise a description of one or more geographic constraints.

19. The method of claim 11, further comprising metering demand for computing capacity by mediating incoming connection requests on target end-points capable of satisfying the requests.

20. The method of claim 11, further comprising:

assigning each of the computing resources a cookie, the cookie representing the life of a computing resource; and

augmenting the cookie associated with a particular computing resource to indicate;

computing resource load as a function of application connectivity over a time interval; and

power consumed by the computing resource during the time interval.

21. An apparatus comprising:

one or more computing resources configured to load software and data in advance of producing a specific computation; and

a virtual service switch coupled to the one or more computing resources and configured to;

create a futures contract with a first requestor, the futures contract providing the first requestor with a unit of computing capacity to a service for a specific future time period and for a first price, the first price comprising an amount the first requestor is willing to pay to buy the unit of computing capacity;

receive from the first requestor software code and associated data, the reception of the software code and associated data from the first requestor being an indication that the futures contract has been fixed;

create one or more plans based at least in part on the contracting, each plan comprising;

an indication of resources required to provide the unit of computing capacity; and

one or more policies for exception handling;

schedule execution of the one or more plans using the computing capacity, the scheduling comprising metering demand for an individual application in terms of connection requests over time, load in terms of temperature, load flow, and volume, and capacity in terms of plan;

provide the first requestor with an option to buy additional units of computing capacity at a specified future date;

receive from a second requestor after the futures contract has been fixed a bid for at least part of the unit of computing capacity previously contracted to the first requestor, the bid indicating a second price, the second price comprising an amount the second requestor is willing to pay to buy at least part of the unit of computing capacity previously contracted to the first requestor;

determine that the second price indicated in the bid from the second requestor is higher than the first price; and

in response to the determination, allocate to the second requestor the at least part of the computing capacity previously contracted to the first requestor.

22. The apparatus of claim 21 wherein the virtual service switch is further configured to schedule execution of the one or more plans based at least in part on one or more dynamic capacity requests from one or more service agents.

23. The apparatus of claim 21 wherein the virtual service switch is further configured to define how computing resources are to be allocated to particular tasks over time.

24. The apparatus of claim 21 wherein a request from the first requestor comprises a description of a service.

25. The apparatus of claim 21 wherein a request from the first requestor comprises a description of a quantity of requested computing resources.

26. The apparatus of claim 21 wherein a request from the first requestor comprises a description of a time at which demand for computing resources is expected to materialize.

27. The apparatus of claim 21 wherein a request from the first requestor comprises a description of a duration of expected use of computing resources.

28. The apparatus of claim 21 wherein a request from the first requestor comprises a description of one or more geographic constraints.

29. The apparatus of claim 21 wherein the apparatus is further configured to meter demand for computing capacity by mediating incoming connection requests on target end-points capable of satisfying the requests.

30. The apparatus of claim 21 wherein the apparatus is further configured to:

assign each of one or more computing resources a cookie, the cookie representing the life of a computing resource; and

augment the cookie associated with a particular computing resource to indicate;

computing resource load as a function of application connectivity over a time interval; and

power consumed by the computing resource during the time interval.

31. The apparatus of claim 21, further comprising a monitoring agent configured to collect information about the apparatus, filter the information to create filtered information, and forward the filtered information.

32. The apparatus of claim 21 wherein the one or more computing resources are logically organized as a Beowulf-style cluster of resources.

33. The apparatus of claim 21 wherein the one or more computing resources comprise one or more blade enclosures.

34. The apparatus of claim 33 wherein the one or more blade enclosures comprise one or more diskless blades.

35. An apparatus comprising:

one or more computing resources configured to load software and data in advance of producing a specific computation; and

a virtual service switch coupled to the one or more computing resources and configured to;

receive from a first requestor, a request for computing resources to meet a demand for a service for a specific future time period and for a first price, the first price comprising an amount the first requestor is willing to pay to lease the computing resources, the service configured to provide a functionality;

create a futures contract with the first requestor, the futures contract granting to the first requestor a lease of a unit of computing capacity based at least in part on the request;

receive from the first requestor software code and associated data, the reception of the software code and associated data from the first requestor being an indication that the futures contract has been fixed;

create a capacity plan comprising;

one or more parameters of the request;

an indication of resources required to provide the unit of computing capacity; and

one or more policies for exception handling;

create a schedule based on the capacity plan and information regarding one or more of available computing resources, reservations for computing resources, and system configurations, the schedule comprising metered demand for an individual application in terms of connection requests over time, load in terms of temperature, load flow, and volume, and capacity in terms of plan;

provide the first requestor with an option to buy additional computing resources at a specified future date;

receive from a second requestor after the futures contract has been fixed a bid for at least part of the unit of computing capacity previously granted to the first requestor, the bid indicating a second price, the second price comprising an amount the second requestor is willing to pay to lease at least part of the unit of computing capacity previously granted to the first requestor;

determine that the second price indicated in the bid from the second requestor is higher than the first price; and

in response to the determination, allocate to the second requestor the at least part of the unit of computing capacity previously granted to the first requestor.

36. The apparatus of claim 35 wherein the schedule is based at least in part on one or more dynamic capacity requests from one or more service agents.

37. The apparatus of claim 35 wherein the schedule defines how the computing resources are to be allocated to particular tasks over time.

38. The apparatus of claim 35 wherein the one or more parameters comprise a description of a service.

39. The apparatus of claim 35 wherein the one or more parameters comprise a description of a quantity of the computing resources.

40. The apparatus of claim 35 wherein the one or more parameters comprise a description of a time at which demand for the computing resources is expected to materialize.

41. The apparatus of claim 35 wherein the one or more parameters comprise a description of a duration of expected use of the computing resources.

42. The apparatus of claim 35 wherein the one or more parameters comprise a description of one or more geographic constraints.

43. The apparatus of claim 35 wherein the apparatus is further configured to meter:

demand for an individual application in terms of connection requests over time;

computational load as indicated by one or more of temperature, load pressure/flow, and volume; and

capacity in terms of the capacity plan.

44. The apparatus of claim 35 wherein the apparatus is further configured to meter demand for computing capacity by mediating incoming connection requests on target end-points capable of satisfying the requests.

45. The apparatus of claim 35 wherein the apparatus is further configured to:

assign each of the computing resources a cookie, the cookie representing the life of a computing resource; and

augment the cookie associated with a particular computing resource to indicate;

computing resource load as a function of application connectivity over a time interval; and

power consumed by the computing resource during the time interval.

46. The apparatus of claim 35, further comprising a monitoring agent configured to collect information about the apparatus, filter the information to create filtered information, and forward the filtered information.

47. The apparatus of claim 35 wherein the one or more computing resources are logically organized as a Beowulf-style cluster of resources.

48. The apparatus of claim 35 wherein the one or more computing resources comprise one or more blade enclosures.

49. The apparatus of claim 48 wherein the one or more blade enclosures comprise one or more diskless blades.

50. An apparatus comprising:

means for creating a futures contract with a first requestor, the futures contract providing the first requestor with a unit of computing capacity to a service for a specific future time period and for a first price, the first price comprising an amount the first requestor is willing to pay to buy the unit of computing capacity;

means for receiving from the first requestor software code and associated data, the reception of the software code and associated data from the first requestor being an indication that the futures contract has been fixed;

means for creating one or more plans based at least in part on the contracting, each plan comprising;

an indication of resources required to provide the unit of computing capacity; and

one or more policies for exception handling;

means for scheduling execution of the one or more plans using the computing capacity, the scheduling comprising metering demand for an individual application in terms of connection requests over time, load in terms of temperature, load flow, and volume, and capacity in terms of plan;

means for providing the first requestor with an option to buy additional units of computing capacity at a specified future date;

means for receiving from a second requestor after the futures contract has been fixed a bid for at least part of the unit of computing capacity previously contracted to the first requestor, the bid indicating a second price, the second price comprising an amount the second requestor is willing to pay to buy at least part of the unit of computing capacity previously contracted to the first requestor;

means for determining that the second price indicated in the bid from the second requestor is higher than the first price; and

means for, in response to the determining, allocating to the second requestor the at least part of the computing capacity previously contracted to the first requestor.

51. The apparatus of claim 50 wherein the scheduling is based at least in part on one or more dynamic capacity requests from one or more service agents.

52. The apparatus of claim 50 wherein a schedule created by the means for scheduling defines how computing resources are to be allocated to particular tasks over time.

53. The apparatus of claim 50 wherein a request from the first requestor comprises a description of a service.

54. The apparatus of claim 50 wherein a request from the first requestor comprises a description of a quantity of requested computing resources.

55. The apparatus of claim 50 wherein a request from the first requestor comprises a description of a time at which demand for computing resources is expected to materialize.

56. The apparatus of claim 50 wherein a request from the first requestor comprises a description of a duration of expected use of computing resources.

57. The apparatus of claim 50 wherein a request from the first requestor comprises a description of one or more geographic constraints.

58. The apparatus of claim 50, further comprising means for metering demand for computing capacity by mediating incoming connection requests on target end-points capable of satisfying requests.

59. The apparatus of claim 50, further comprising:

means for assigning each of one or more computing resources a cookie, the cookie representing the life of a computing resource; and

means for augmenting the cookie associated with a particular computing resource to indicate;

computing resource load as a function of application connectivity over a time interval; and

power consumed by the computing resource during the time interval.

60. An apparatus comprising:

means for receiving from a first requestor, a request for computing resources to meet a demand for a service for a specific future time period and for a first price, the first price comprising an amount the first requestor is willing to pay to lease the computing resources, the service configured to provide a functionality;

means for creating a futures contract with the first requestor, the futures contract granting to the first requestor a lease of a unit of computing capacity based at least in part on the request;

means for receiving from the first requestor software code and associated data, the reception of the software code and associated data from the first requestor being an indication that the futures contract has been fixed;

means for creating a capacity plan comprising;

one or more parameters of the request;

an indication of resources required to provide the unit of computing capacity; and

one or more policies for exception handling;

means for creating a schedule based on the capacity plan and information regarding one or more of available computing resources, reservations for computing resources, and system configurations, the schedule comprising metered demand for an individual application in terms of connection requests over time, load in terms of temperature, load flow, and volume, and capacity in terms of plan;

means for providing the first requestor with an option to buy additional computing resources at a specified future date;

means for receiving from a second requestor after the futures contract has been fixed a bid for at least part of the unit of computing capacity previously granted to the first requestor, the bid indicating a second price, the second price comprising an amount the second requestor is willing to pay to lease at least part of the unit of computing capacity previously granted to the first requestor;

means for determining that the second price indicated in the bid from the second requestor is higher than the first price; and

means for, in response to the determining, allocating to the second requestor the at least part of the unit of computing capacity previously granted to the first requestor.

61. The apparatus of claim 60 wherein the schedule is based at least in part on one or more dynamic capacity requests from one or more service agents.

62. The apparatus of claim 60 wherein the schedule defines how the computing resources are to be allocated to particular tasks over time.

63. The apparatus of claim 60 wherein the one or more parameters comprise a description of a service.

64. The apparatus of claim 60 wherein the one or more parameters comprise a description of a quantity of the computing resources.

65. The apparatus of claim 60 wherein the one or more parameters comprise a description of a time at which demand for the computing resources is expected to materialize.

66. The apparatus of claim 60 wherein the one or more parameters comprise a description of a duration of expected use of the computing resources.

67. The apparatus of claim 60 wherein the one or more parameters comprise a description of one or more geographic constraints.

68. The apparatus of claim 60, further comprising means for metering demand for computing capacity by mediating incoming connection requests on target endpoints capable of satisfying the requests.

69. The apparatus of claim 60, further comprising:

means for assigning each of the computing resources a cookie, the cookie representing the life of a computing resource; and

means for augmenting the cookie associated with a particular computing resource to indicate;

computing resource load as a function of application connectivity over a time interval; and

power consumed by the computing resource during the time interval.

70. A program storage device readable by a machine, embodying a program of instructions executable by the machine to perform a method, the method comprising:

creating a futures contract with a first requestor, the futures contract providing the first requestor with a unit of computing capacity to a service for a specific future time period and for a first price, the first price comprising an amount the first requestor is willing to pay to buy the unit of computing capacity;

receiving from the first requestor software code and associated data, the reception of the software code and associated data from the first requestor being an indication that the futures contract has been fixed;

creating one or more plans based at least in part on the contracting, each plan comprising;

an indication of resources required to provide the unit of computing capacity; and

one or more policies for exception handling;

scheduling execution of the one or more plans using the computing capacity, the scheduling comprising metering demand for an individual application in terms of connection requests over time, load in terms of temperature, load flow, and volume, and capacity in terms of plan;

providing the first requestor with an option to buy additional units of computing capacity at a specified future date;

receiving from a second requestor after the futures contract has been fixed a bid for at least part of the unit of computing capacity previously contracted to the first requestor, the bid indicating a second price, the second price comprising an amount the second requestor is willing to pay to buy at least part of the unit of computing capacity previously contracted to the first requestor;

determining that the second price indicated in the bid from the second requestor is higher than the first price; and

in response to the determination, allocating to the second requestor the at least part of the computing capacity previously contracted to the first requestor.

71. The program storage device of claim 70 wherein the scheduling is based at least in part on one or more dynamic capacity requests from one or more service agents.

72. The program storage device of claim 70 wherein a schedule created by the scheduling defines how computing resources are to be allocated to particular tasks over time.

73. The program storage device of claim 70 wherein a request from the first requestor comprises a description of a service.

74. The program storage device of claim 70 wherein a request from the first requestor comprises a description of a quantity of requested computing resources.

75. The program storage device of claim 70 wherein a request from the first requestor comprises a description of a time at which demand for computing resources is expected to materialize.

76. The program storage device of claim 70 wherein a request from the first requestor comprises a description of a duration of expected use of computing resources.

77. The program storage device of claim 70 wherein a request from the first requestor comprises a description of one or more geographic constraints.

78. The program storage device of claim 70, the method further comprising metering demand for computing capacity by mediating incoming connection requests on target end-points capable of satisfying requests.

79. The program storage device of claim 70, the method further comprising:

assigning each of one or more computing resources a cookie, the cookie representing the life of a computing resource; and

augmenting the cookie associated with a particular computing resource to indicate;

computing resource load as a function of application connectivity over a time interval; and

power consumed by the computing resource during the time interval.

80. A program storage device readable by a machine, embodying a program of instructions executable by the machine to perform a method, the method comprising:

receiving from a first requestor, a request for computing resources to meet a demand for a service for a specific future time period and for a first price, the first price comprising an amount the first requestor is willing to pay to lease the computing resources, the service configured to provide a functionality;

creating a futures contract with the first requestor, the futures contract granting to the first requestor a lease of a unit of computing capacity based at least in part on the request;

receiving from the first requestor software code and associated data, the reception of the software code and associated data from the first requestor being an indication that the futures contract has been fixed;

creating a capacity plan comprising;

one or more parameters of the request;

an indication of resources required to provide the unit of computing capacity; and

one or more policies for exception handling;

creating a schedule based on the capacity plan and information regarding one or more of available computing resources, reservations for computing resources, and system configurations, the schedule comprising metered demand for an individual application in terms of connection requests over time, load in terms of temperature, load flow, and volume, and capacity in terms of plan;

providing the first requestor with an option to buy additional computing resources at a specified future date;

receiving from a second requestor after the futures contract has been fixed a bid for at least part of the unit of computing capacity previously granted to the first requestor, the bid indicating a second price, the second price comprising an amount the second requestor is willing to pay to lease at least part of the unit of computing capacity previously granted to the first requestor;

determining that the second price indicated in the bid from the second requestor is higher than the first price; and

in response to the determination, allocating to the second requestor the at least part of the unit of computing capacity previously granted to the first requestor.

81. The program storage device of claim 80 wherein the schedule is based at least in part on one or more dynamic capacity requests from one or more service agents.

82. The program storage device of claim 80 wherein the schedule defines how the computing resources are to be allocated to particular tasks over time.

83. The program storage device of claim 80 wherein the one or more parameters comprise a description of a service.

84. The program storage device of claim 80 wherein the one or more parameters comprise a description of a quantity of the computing resources.

85. The program storage device of claim 80 wherein the one or more parameters comprise a description of a time at which demand for the computing resources is expected to materialize.

86. The program storage device of claim 80 wherein the one or more parameters comprise a description of a duration of expected use of the computing resources.

87. The program storage device of claim 80 wherein the one or more parameters comprise a description of one or more geographic constraints.

88. The program storage device of claim 80, the method further comprising metering demand for computing capacity by mediating incoming connection requests on target end-points capable of satisfying the requests.

89. The program storage device of claim 80, the method further comprising:

assigning each of the computing resources a cookie, the cookie representing the life of a computing resource; and

augmenting the cookie associated with a particular computing resource to indicate;

computing resource load as a function of application connectivity over a time interval; and

power consumed by the computing resource during the time interval.