The present disclosure relates to cloud computing and, more particularly, to methodologies by which capabilities or attributes of multiple cloud resource devices that are available to users of the cloud can be aggregated or summarized at, e.g., a next higher level within a network hierarchy of the cloud.
“Cloud computing” can be defined as Internet-based computing in which shared resources, software and information are provided to client or user computers or other devices on-demand from a pool of resources that are communicatively available via the Internet, or other electronic network. Cloud computing is envisioned as a way to democratize access to resources and services, letting users efficiently purchase as many resources as they need and/or can afford.
In some possible implementations, cloud computing comprises linking backend resources (e.g., memory, processors, etc.) to provide web-based services, applications, and data storage. This approach has the potential effect of providing services at lower cost than current options, and with less complexity, greater scalability, and wider reach. However, linking the capabilities of such backend systems to each other and to client or user devices can be daunting, especially in view of the fact that there may be many thousands of such backend systems, clients and users, each having different capabilities, attributes and needs.
In one embodiment a method includes, at first a network device, identifying an attribute of the first network device, selecting a function that defines how the attribute is to be summarized together with a same attribute of a second network device, generating a message that comprises a set of information comprising an identification of the attribute and the function, and sending the message to a next higher node in a network hierarchy of which the network device is a part. Multiple such messages may be received at an aggregation node that then summarizes the attributes according to respective functions, and sends or publishes a summarized version of the attributes to yet another node in the network.
Each Data Center 131, 132 (and using Data Center 131 as an example) may comprise DC Edge routers 133, 134 (as mentioned), a firewall 138, and a load balancer 139. These elements operate together to enable “pods” 151(1)-151(n), 152(1), etc., which respectively include multiple cloud resource devices 190(1)-190(3), 190(4)-190(7), 190(8)-190(11), to communicate effectively through the network topology 100 and provide computing and storage services to, e.g., clients 110, which may be other Data Centers or even stand alone computers. In a publish-subscriber system, which is one way to implement such a cloud computing environment, clients 110 are subscribers to requested resources and the cloud resource devices 190(1)-190(3), 190(4)-190(7), 190(8)-190(11) (which publish their services, capabilities, etc.) are the ultimate providers of those resources, although the clients themselves may have no knowledge of which specific cloud resource devices actually provide the desired service (e.g., compute, storage, etc.).
Still referring to
Cloud resource devices 190 themselves may be web or application servers, storage devices such as disk drives, or any other computing resource that might be of use or interest to an end user, such as client 110.
Processors 210/310 may be programmable processors (microprocessors or microcontrollers) or fixed-logic processors. In the case of a programmable processor, any associated memory (e.g., 220, 320) may be of any type of tangible processor readable memory (e.g., random access, read-only, etc.) that is encoded with or stores instructions that can implement the Attribute Summarization Logic 230, 330. Alternatively, processors 210, 310 may be comprised of a fixed-logic processing device, such as an application specific integrated circuit (ASIC) or digital signal processor that is configured with firmware comprised of instructions or logic that cause the processor to perform the functions described herein. Thus, Attribute Summarization Logic 230, 330 may be encoded in one or more tangible media for execution, such as with fixed logic or programmable logic (e.g., software/computer instructions executed by a processor) and any processor may be a programmable processor, programmable digital logic (e.g., field programmable gate array) or an ASIC that comprises fixed digital logic, or a combination thereof. In general, any process logic may be embodied in a processor or computer readable medium that is encoded with instructions for execution by a processor that, when executed by the processor, are operable to cause the processor to perform the functions described herein.
As noted, there can be many different types of cloud resource devices 190 in a given network including, but not limited to, compute devices, network devices, storage devices, service devices, etc. Each of these devices can have a different set of capabilities or attributes and these capabilities or attributes may change over time. For example, a larger capacity disk drive might be installed in a given storage device, or an upgraded set of parallel processors may be installed in a given compute device. Furthermore, how a cloud, particularly one that operates consistent with a publish-subscribe model, might view or present/advertise these capabilities or attributes in aggregate to potential subscribers may vary from one capability or attribute type to another.
More specifically, in one possible implementation of a cloud computing infrastructure like that shown in
In one embodiment, the capabilities or attributes published by devices (e.g., cloud resource devices 190) in a domain at the lowest layer of the network hierarchy (e.g., within pod 151) are summarized/aggregated into a common set of capabilities associated with the entire domain. Thus, referring again to
In an embodiment, each device can advertise (publish) its capabilities or attributes on a common control plane. Such a control plane could be implemented using a presence protocol such as XMPP (eXtensible Markup Presence Protocol), among other possible protocols or mechanisms that enable devices to communicate with each other.
Significantly, and in an effort to maintain a certain level of automation in the attribute summarization process, not only is a given attribute published or advertised, but an extensible aggregation function is provided along with that given attribute that enables the device that is publishing the attributes to specify the manner in which the attribute should be treated/aggregated or summarized at a next higher level in the network hierarchy. Extensibility in this context is desirable as different attributes may need to be summarized differently. For example, depending on the type of attribute, the attribute may be summarized with other like attributes of other devices via primitives such as concatenation, addition, selection of a lesser of values, etc. In one implementation, the Attribute Summarization Logic 230/330 may provide and/or support a comprehensive list of primitive aggregation functions (e.g., SUM, MULTIPLY, DIFFERENCE, AVERAGE, STANDARD DEVIATION, CONCATENATION, LENGTH, LESSER_OF, GREATER_OF, MAX, MIN, UNION, INTERSECTION, etc.), and the devices can then specify which one of (or combination of) the primitive functions to use when the attributes of a given device are to be summarized. The selection of a primitive aggregation function could be performed automatically, or may be performed manually by an administrator.
Still with reference to
In light of the foregoing, those skilled in the art will appreciate that the Attribute Summarization Logic 230 enables each device to independently determine the attributes that it would like to advertise or publish. The Attribute Summarization Logic 230 also enables the device to provide metadata about those attributes. This approach allows for attributes, which are not a priori known or understood by a next higher node carrying out the summarization function, to still be intelligently summarized/aggregated and then published at a still next layer up in the hierarchy. In one possible implementation, cloud resource devices 190 could provide customers with the ability to configure their own attributes that are not understood by the devices themselves, but are intelligently summarized/aggregated and published up the hierarchy, then referenced in customer policies for hierarchical rendering and provisioning of services.
The following is another example of how the Attribute Summarization Logic 230 may operate. Consider an example of advertising “compute” power through the network hierarchy. Each cloud resource device can advertise the number of cores it has available along with the operating frequency of each core. For example, Device A advertises 4C@1.2 Ghz, Device B advertises 4C@1.2 Ghz, and Device C advertises 4C@2.0 Ghz. Each of these cloud resource devices will publish this information to a first logical hop, e.g., aggregation node 160. At that node Attribute Summarization Logic 330 might aggregate or summarize the received information into one advertisement of “8C@1.2 Ghz, 4C@2.0 Ghz.” In contrast, a traditional publish-subscribe system might have simply sent or forwarded the three originally received individual advertisements. Note that, in this case, the summarization is not a simple summing operation, but is instead a function. Such a function can make use of one or more operations, including but not limited to SUM, MULTIPLY, DIFFERENCE, AVERAGE, STANDARD DEVIATION, CONCATENATION, LENGTH, LESSER_OF, GREATER_OF, MAX, MIN, UNION, INTERSECTION, among others.
In this particular example, the function underlying summarization is: compare the frequency, and if they are equal then add the number of cores.
More specifically, consider that the elements are arranged in a <key, value> array, where key is the operating frequency and the value is the number of cores. That is, and referring again to
That is, for each core having a given operating frequency, add that core to a running total. In this way, a next higher node in the network hierarchy can efficiently summarize attributes, or even combinations of attributes of nodes from a next lower level in the network hierarchy.
Those skilled in the art will appreciate that more complex operations might be implemented. For instance, it might be desirable to consider multiple dimensions including, e.g., memory, storage, processor type (PPC, X86, ARM, 32 bit, 64 bit etc.), connectivity, bandwidth, etc. All such attributes can be summarized consistent with instructions or functions delivered in the metadata (which might even include an explicit equation) that is provided along with the attributes in a message like that shown in
Another example of a summarization function is “intersection,” as noted above. For example, it may be desirable to determine the intersection of routing protocols supported in a routing domain across different routers. Consider the following:
Router 1 supports: BGP (Border Gateway Protocol), OSPF (Open Shortest Path First), RIP (Routing Information Protocol), ISIS (Intermediate System to Intermediate System); summarization operator (function)=intersection.
Router 2 supports: BGP, RIP, ISIS; summarization operator (function)=intersection.
Summarized information according to intersection would be: BGP, RIP, ISIS.
Intersection may be a useful function in that all routers in a given routing domain should communicate via the same protocol.
It is apparent that any attempt to aggregate multiple resources from within a given domain into one set of resource values to be advertised to the next higher domain can result in loss of information. There is an inherent tradeoff whenever summarization is introduced: scale is improved, but accuracy is decreased due to loss of detailed information. “Resource groups” are one tool that can help improve the accuracy in representing resources to higher layers in the hierarchy, at the expense of increased amounts of information.
For example, it is not possible to accurately aggregate the following capabilities into only one processing capacity value and one value for available bandwidth:
A conservative approach would advertise 2 GHz processing capacity with 500 Mbps available bandwidth. Requests to a Data Center control point for more than 2 GHz processing capacity that only require 500 Mbps available bandwidth would not be directed, however, to a pod having the above published summarization.
On the other hand, an aggressive approach might result in advertising 10 GHz processing capacity with 2 Gbps available bandwidth. Requests for more than 2 GHz processing capacity along with more than 500 Mbps available bandwidth may still be directed towards the pod, even though such a combination cannot be supported. The pod control point would have to reject this request, leaving the Data Center control point to select a different pod.
In order to advertise such combinations more accurately, the notion of a resource group can be introduced. The combination of capabilities above can be accurately represented by advertising two resource groups for the same network element. One resource group can reflect the combination of 2 GHz processing capacity and 2 Gbps available bandwidth. The other resource group can reflect the combination of 10 GHz processing capacity and 500 Mbps available bandwidth.
Thus, a resource group can be considered a collection of disparate resources collected together into one container for the purposes of accounting and consumption. A particular resource may be merged into one or more resource groups and the composition (which resource types/attributes are aggregated) of a given resource group may change at run-time. New resource groups can be created while the system is in operation.
The publishers of the information may not be aware of resource groups at all or of which resource group they will be a part, as any association into resource groups is performed as the resource advertisements are received and analyzed at next higher levels within the network hierarchy or, more generally, at different nodes not necessarily arranged in a hierarchy.
As an example, suppose the following Resource Group Templates are defined by an administrator:
Now consider cloud resource devices with the following published advertisements:
When the advertisements arrive at a next higher level node the node can export three resource groups, namely:
Then, at step, 620, a function that defines how the attribute is to be summarized together with a same attribute of a second network device is selected. The function could, for example, be any one of count, sum, multiply, divide, difference, average, standard deviation or concatenate and even include a more elaborate equation or program. At step 630, a message is generated that comprises a tuple (or set of information) comprising an identification of the attribute and the function, and then at step 640, the message is sent to a next higher node in a network hierarchy of which the network device is a part. In an embodiment, the message is sent using a presence protocol such as XMPP. Although not required, the first and the second network device may be at a same level within the network hierarchy such that a next higher node in the network hierarchy can receive a plurality of such messages and summarize the attributes of lower level entities. The messages may also be publish or advertisement messages within a publish-subscribe system.
As shown, at step 710, at, e.g., an aggregation node of a data center comprising a plurality of network devices, a first publish message from a first network device is received, and the first publish message from the first network device includes a first tuple (or set of information) having a form (attribute1, metadata1), wherein a given attribute describes a capability of the first network device. At step 720, at, e.g., the same aggregation node of the data center, a second publish message from a second network device is received, and the second publish message from the second server includes a second tuple (or set of information) having the form (attribute2, metadata2). At step 730, a third tuple (or set of information) is generated by combining information in the first tuple and the second tuple consistent with functions defined by the metadata, and at step 740, a third publish message is sent to a next higher aggregation node in a hierarchical structure of which the aggregation node is a member, the third publish message comprising the third tuple.
As explained, the summarizing node can also generate resource groups that combine and summarize attributes from multiple network devices in different ways. Thus, the first publish message and the second publish message may each comprise a plurality of attributes and respective metadata, and the overall methodology may further generate a plurality of groupings (resource groups) that summarize and combine the attributes in different ways to satisfy, perhaps, predetermined templates.
Although the system and method are illustrated and described herein as embodied in one or more specific examples, it is nevertheless not intended to be limited to the details shown, since various modifications and structural changes may be made therein without departing from the scope of the apparatus, system, and method and within the scope and range of equivalents of the claims. Accordingly, it is appropriate that the appended claims be construed broadly and in a manner consistent with the scope of the apparatus, system, and method, as set forth in the following.
Number | Name | Date | Kind |
---|---|---|---|
6259705 | Takahashi et al. | Jul 2001 | B1 |
7200589 | Graupner | Apr 2007 | B1 |
7457835 | Toebes et al. | Nov 2008 | B2 |
7543020 | Walker et al. | Jun 2009 | B2 |
7634566 | Turner et al. | Dec 2009 | B2 |
7747720 | Toebes et al. | Jun 2010 | B2 |
7752311 | Walker et al. | Jul 2010 | B2 |
7870420 | Lloyd et al. | Jan 2011 | B2 |
8255529 | Ferris et al. | Aug 2012 | B2 |
8271653 | DeHaan | Sep 2012 | B2 |
20050022202 | Sannapa Reddy et al. | Jan 2005 | A1 |
20050033843 | Shahi et al. | Feb 2005 | A1 |
20050215265 | Sharma et al. | Sep 2005 | A1 |
20050223026 | Chaudhuri et al. | Oct 2005 | A1 |
20050283645 | Turner et al. | Dec 2005 | A1 |
20060072582 | Bronnimann et al. | Apr 2006 | A1 |
20060179106 | Turner et al. | Aug 2006 | A1 |
20060212532 | Burckart et al. | Sep 2006 | A1 |
20060242300 | Yumoto et al. | Oct 2006 | A1 |
20070121490 | Iwakawa et al. | May 2007 | A1 |
20080086567 | Langen et al. | Apr 2008 | A1 |
20080238919 | Pack | Oct 2008 | A1 |
20080256549 | Liu et al. | Oct 2008 | A1 |
20090245113 | Kamiya | Oct 2009 | A1 |
20090287825 | Walker et al. | Nov 2009 | A1 |
20100223378 | Wei | Sep 2010 | A1 |
20100223382 | Rayes et al. | Sep 2010 | A1 |
20100228819 | Wei | Sep 2010 | A1 |
20100250668 | Toebes et al. | Sep 2010 | A1 |
20100251329 | Wei | Sep 2010 | A1 |
20100287280 | Sivan | Nov 2010 | A1 |
20100332588 | Schwimer | Dec 2010 | A1 |
20100333116 | Prahlad et al. | Dec 2010 | A1 |
20110022642 | deMilo et al. | Jan 2011 | A1 |
20110066728 | Gauthier et al. | Mar 2011 | A1 |
20110126197 | Larsen et al. | May 2011 | A1 |
20110137805 | Brookbanks et al. | Jun 2011 | A1 |
20110138050 | Dawson et al. | Jun 2011 | A1 |
20110145439 | Chaturvedi et al. | Jun 2011 | A1 |
20110173324 | Wang et al. | Jul 2011 | A1 |
20110179132 | Mayo et al. | Jul 2011 | A1 |
20110179162 | Mayo et al. | Jul 2011 | A1 |
20110289162 | Furlong et al. | Nov 2011 | A1 |
20110295998 | Ferris et al. | Dec 2011 | A1 |
20110320605 | Kramer et al. | Dec 2011 | A1 |
20120030343 | Ryder | Feb 2012 | A1 |
20120054332 | Sahu et al. | Mar 2012 | A1 |
20120054345 | Sahu et al. | Mar 2012 | A1 |
20120054626 | Odenheimer | Mar 2012 | A1 |
20120060165 | Clarke | Mar 2012 | A1 |
20120179802 | Narasimhan et al. | Jul 2012 | A1 |
20120224486 | Battestilli et al. | Sep 2012 | A1 |
20120226789 | Ganesan et al. | Sep 2012 | A1 |
20120226790 | Singh | Sep 2012 | A1 |
20120226797 | Ghosh et al. | Sep 2012 | A1 |
20120226799 | Kapur et al. | Sep 2012 | A1 |
20120311144 | Akelbein et al. | Dec 2012 | A1 |
20130044741 | Lappetelainen et al. | Feb 2013 | A1 |
20130080517 | T'Syen et al. | Mar 2013 | A1 |
Number | Date | Country |
---|---|---|
2004110023 | Dec 2004 | WO |
WO 2004110023 | Dec 2004 | WO |
Entry |
---|
Java Message Service API Tutorial, by Kim Haase (2002), Sun Microsystems, Inc. (278 pages). |
XMPP XEP-0051: Connection Transfer, Klaus Wolf et al., (1999), XMPP Standards Foundation, (5 pages). |
Rich Miller, “Can Amazon be a Player in Disaster Recovery?,” Data Center Knowledge, Mar. 12, 2009, pp. 1-8. |
Rich Miller, “How Google Routes Around Outages,” Data Center Knowledge, Mar. 25, 2009, pp. 1-12. |
Detecting Anomalies by Data Aggregation in the Power Grid, Nguyen, Hoang et al.,University of Illinois, Computer Science Research and Tech Reports, Jul. 2006. |
International Search Report and Written Opinion in International Application No. PCT/US2012/027069, mailed Jul. 3, 2012. |
Number | Date | Country | |
---|---|---|---|
20120226790 A1 | Sep 2012 | US |