Abstract: A method for allocating resources to applications in a distributed datacenter based on generated contact lists is described. The method includes, receiving, by a first resource manager, a placement request, which identifies resources needed for execution of an application; determining a policy associated with the application; generating a first contact list for the first resource manager based on the determined policy for the application; and searching resources in the distributed datacenter, based on the first contact list, to attempt to meet the identified resources of the placement request.

Abstract: Embodiments described herein provide methods and apparatuses for enabling use of functions in a function as a service platform by third party developers. A method comprises storing in a function catalogue one or more function descriptions associated with one or more respective functions available for use by third party developers, wherein each function description comprises an intent and a function name of the respective function; receiving a function call from a first function developer comprising an indication of a first intent; and selecting a first function description from the function catalog that matches the first intent.

Abstract: A method for placement of processes in a distributed datacenter is described. The method includes receiving, by a first placement node, a placement request corresponding to a process; determining a load estimation for resources managed by the first placement node and a demand estimation for the process based on a process execution profile for the process; determining whether the placement request can be fulfilled with the resources managed by the first placement node based on the demand estimation of the process and the load estimation of the resources managed by the first placement node; executing the process with the resources managed by the first placement node in response to determining that the placement request can be fulfilled with the resources managed by the first placement node; generating an intermediate score based on the execution; and updating a performance score of the process execution profile based on the intermediate score.

Abstract: A method and a first node for managing transmission of at least one probe message for detection of failure of a second node are disclosed. A network comprises the first and second nodes. The first node receives a message about an event related to the second node. The message comprises an identifier of the second node and an event type of the event. The first node retrieves at least one policy for failure detection based on the event type. The first node modifies a probe list based on said at least one policy with respect to the second node. The probe list indicates an order in which nodes, neighbouring to the first node, are to be probed by transmission of the probe messages thereto. The second node is one of the nodes neighbouring to the first node. The first node transmits the probe messages according to the probe list.

Abstract: A method and a first node for managing transmission of at least one probe message for detection of failure of a second node are disclosed. A network comprises the first and second nodes. The first node receives a message about an event related to the second node. The message comprises an identifier of the second node and an event type of the event. The first node retrieves at least one policy for failure detection based on the event type. The first node modifies a probe list based on said at least one policy with respect to the second node. The probe list indicates an order in which nodes, neighbouring to the first node, are to be probed by transmission of the probe messages thereto. The second node is one of the nodes neighbouring to the first node. The first node transmits the probe messages according to the probe list.

Abstract: A method and a system for managing transmission of probe messages for detection of failure in at least one of a first node, a second node and a third node are disclosed. Said each node generates a respective probe list according to a procedure taking said each node and the member list as input, thereby configuring said each node for transmission of a respective probe message in a set of time intervals for transmission of the probe messages, wherein a set of probe lists comprises the respective probe list for said each node. Said each node transmits the respective probe message to a respective node of the nodes according to the respective probe list generated by the procedure. The procedure ensures that the set of probe lists causes said each node to be probed in each time interval of the set of time intervals and by only one other node of the nodes in said each time interval. A corresponding computer program and a computer program carrier are also disclosed.

Abstract: A method for placement of processes in a distributed datacenter is described. The method includes receiving, by a first placement node, a placement request corresponding to a process; determining a load estimation for resources managed by the first placement node and a demand estimation for the process based on a process execution profile for the process; determining whether the placement request can be fulfilled with the resources managed by the first placement node based on the demand estimation of the process and the load estimation of the resources managed by the first placement node; executing the process with the resources managed by the first placement node in response to determining that the placement request can be fulfilled with the resources managed by the first placement node; generating an intermediate score based on the execution; and updating a performance score of the process execution profile based on the intermediate score.

Abstract: A method for allocating resources to applications in a distributed datacenter based on generated contact lists is described. The method includes, receiving, by a first resource manager, a placement request, which identifies resources needed for execution of an application; determining a policy associated with the application; generating a first contact list for the first resource manager based on the determined policy for the application; and searching resources in the distributed datacenter, based on the first contact list, to attempt to meet the identified resources of the placement request.

Abstract: A first function manager and a method performed therein for handling a call of a second function from a first function. According to the method the first function manager obtains information associated with one or more locations of the second function. The first function manager also determines an availability of the second function at the one or more locations, based on the obtained information and selects one of the one or more locations for forwarding the call of the second function from the first function. I further step, the first function manager forwards the call of the second function from the first function.

Abstract: A method and a cloud management node for enabling usage of a virtual machine in a distributed cloud of resources for processing and storing of data. When receiving a VM image from a client with a set of files of an operating system for running the virtual machine, the cloud management node distributes the VM image to a plurality of local data centers forming the distributed cloud. In return, the cloud management node receives local identifications of the VM image from the local data centers, and creates a mapping between the received local identifications and a global identification of the VM image. The global identification is then returned to the client, thereby enabling the client to change the VM image in the local data centers by referring to the global identification in communication with the cloud management node.

Abstract: Exemplary techniques for policy-controlled analytic data collection in large-scale systems are described. A policy engine receives predicate/action pairs and an alerts policy, each predicate identifying an operating condition at a reporting module that can be evaluated as true or false, and a corresponding action identifying what the reporting module is to do upon the corresponding predicate being evaluated as true. The policy engine provides the predicate/action pairs to reporting modules to be installed as rules, which generate analytic data vectors and apply those vectors against the rules. The actions may cause the reporting modules to send the analytic data vectors as analytic report data to an analytics engine, which has been configured with the alerts policy received by the policy engine. The analytics engine applies received analytic report data against the alerts policy to determine whether to send alert event data to the policy engine or to perform a responsive action.

Abstract: A tenant management system and method operative in a cloud-based database environment. A distributed blockchain ledger is provided for holding tenant records embodied in smart contracts, the consistency of which is maintained by a consensus protocol between multiple chain servers processing requests from leaf servers for tenant authorization and charging. The tenant records contain the bytecode for the tenant management contracts, the tenant's credit, and other state associated with the contract such as the services the tenant is authorized to access.

Abstract: Exemplary methods for distributed multi-component service placement in a resource pool include utilizing a hierarchy of agents associated with computing resources of a cloud architecture. A root agent in the hierarchy can receive service requests specifying resource requirements and optionally location or affinity constraints, transform these into service request descriptions, and pass the service request descriptions down through the hierarchy to arrive at leaf nodes. The leaf nodes can each, perhaps in parallel, generate solution encodings indicating possible placements of some or all of the components of the service request that one or more computing devices associated with each agent can locally provide while still satisfying the resource requirements. The generated solution encodings can be passed back up and be consolidated as they flow through the hierarchy, allowing the root agent to quickly and accurately determine whether the service request may be fulfilled, and optionally place the service.

Abstract: Methods and nodes (200, 202) in a data distribution network, for distributing content to multiple consuming nodes (C1, C2, C3, . . . ). A first node (200) detects (2:2) multiple data flows (2:1b) of a first content from the first node to a second node (202) in the distribution network, when the first node operates as delivering node of the first content for the consuming nodes. The first node then instructs (2:4) the second node to operate as delivering node of the first content for the consuming nodes and redirects (2:5) the consuming nodes to use the second node as delivering node of the first content. The first node further reduces (2:6) the multiple data flows to a common data flow of the first content to the second node. Thereby, efficiency can be improved in the data distribution network by reducing the number of data flows between the first and second nodes.

Abstract: Exemplary methods for distributed multi-component service placement in a resource pool include utilizing a hierarchy of agents associated with computing resources of a cloud architecture. A root agent in the hierarchy can receive service requests specifying resource requirements and optionally location or affinity constraints, transform these into service request descriptions, and pass the service request descriptions down through the hierarchy to arrive at leaf nodes. The leaf nodes can each, perhaps in parallel, generate solution encodings indicating possible placements of some or all of the components of the service request that one or more computing devices associated with each agent can locally provide while still satisfying the resource requirements. The generated solution encodings can be passed back up and be consolidated as they flow through the hierarchy, allowing the root agent to quickly and accurately determine whether the service request may be fulfilled, and optionally place the service.

Abstract: A method, unit and computer program performed by a packet separation unit in a communications network for enabling of data traffic separation comprising: obtaining a traffic rule set from a rule manager, determining a complementary rule related to the traffic rule set, arranging the rules in an hierarchical order such that a received data packet will be evaluated with the rule with the most likeliness to comply with a received data packet, receiving the data packet, directing the data packet to a local shared environment.

Abstract: A method, resource manager, and computer program performed by a resource manager in a communications network connected to at least two hosts for enabling of resource component allocation related to the hosts, comprising determining a metric of a resource component for performance monitoring of an application at the hosts, transmitting an instruction to measure the metric to respective host, receiving a respective resource frame of the application from respective host, determining resource allocation for the application based on the received resource frames.

Abstract: Exemplary methods for distributed multi-component service placement in a resource pool include utilizing a hierarchy of agents associated with computing resources of a cloud architecture. A root agent in the hierarchy can receive service requests specifying resource requirements and optionally location or affinity constraints, transform these into service request descriptions, and pass the service request descriptions down through the hierarchy to arrive at leaf nodes. The leaf nodes can each, perhaps in parallel, generate solution encodings indicating possible placements of some or all of the components of the service request that one or more computing devices associated with each agent can locally provide while still satisfying the resource requirements. The generated solution encodings can be passed back up and be consolidated as they flow through the hierarchy, allowing the root agent to quickly and accurately determine whether the service request may be fulfilled, and optionally place the service.

Abstract: Exemplary methods for distributed multi-component network-aware service placement in a resource pool include utilizing a hierarchy of agents associated with computing resources of a cloud architecture. An agent in the hierarchy can merge solution encodings to find cover sets indicating feasible placement solutions that can cover an entire application placement request. The agent can partition the components across its children nodes such that global network traffic is minimized. An application graph is generated with components as vertices and edges indicating connections between the components and having associated weights indicating a data transfer rate between the components. The edges can be sorted, and each cover set can be processed by repeatedly assigning unassigned pairs of components having higher data transfer rates to a common assignment set. If multiple placement solutions are found, determined placement costs for each can be used to identify the preferred placement.

Abstract: Exemplary methods for distributed multi-component network-aware service placement in a resource pool include utilizing a hierarchy of agents associated with computing resources of a cloud architecture. An agent in the hierarchy can merge solution encodings to find cover sets indicating feasible placement solutions that can cover an entire application placement request. The agent can partition the components across its children nodes such that global network traffic is minimized. An application graph is generated with components as vertices and edges indicating connections between the components and having associated weights indicating a data transfer rate between the components. The edges can be sorted, and each cover set can be processed by repeatedly assigning unassigned pairs of components having higher data transfer rates to a common assignment set. If multiple placement solutions are found, determined placement costs for each can be used to identify the preferred placement.