Telefonaktiebolaget Lm Ericsson (publ)

Mina Sedaghat

Joacim Halén

Wolfgang John

Vinay Yadhav

Chunyan Fu

Pontus Sköldström

Xuejun Cai

Daniel Turull

Amardeep Mehta

A method by a user plane breakout function in a mobile core network for providing dynamic distributed local breakout. The method includes receiving, from one or more neighboring user plane breakout functions, service instance information of one or more instances of a service, processing capacity information of one or more edge clouds, and link quality information of one or more links between other user plane breakout functions. The method further includes, calculating, for each of the one or more instances of the service, a service instance access score for that instance of the service based on the service instance information, the processing capacity information, and the link quality information.

Dynamic distributed local breakout determination

The present disclosure relates to a method performed by a process control node () configured to allocate resources shared by a plurality of tenant applications, wherein each tenant application comprises a selection of non real-time processes and real-time processes, the method comprising receiving a first resource request, from a tenant application, indicative of resources requested to be allocated, by the process control node, for one or more real-time processes of the tenant application, evaluating a scheduling test to determine if the set of processing resources can be allocated from the shared resources by determining if resources requested by the first resource request can be allocated, and if it is determined that the requested resources can be allocated from the shared resources, the method further comprises performing the steps starting the one or more real-time processes of the tenant application within a resource partition of the tenant application, calculating updated resource quotas and priorities for non real-time processes comprised by the tenant application, transmitting a first resource response to the tenant application.

Multi-tenant real-time process controller for edge cloud environments

The present disclosure relates to a method of a device of communicating data states of a Conflict-free Replicated Data Type (CRDT) structure over a plurality of other devices in a network of devices.

Synchronizing conflict-free replicated data types

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.

Adaptive application assignment to distributed cloud resources

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.

Process placement in a cloud environment based on automatically optimized placement policies and process execution profiles

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.

Growing community of inventors

Solna, Sweden

Mina Sedaghat