Telefonaktiebolaget Lm Ericsson (publ)

Joacim Halén

Karl Norrman

Jan-Erik Mångs

Benoit Tremblay

Sylvain Monette

Stefan Hellkvist

Wolfgang John

Mina Sedaghat

Yagiz Onat Yazir

Zahra Abbasi

Ayodele Damola

Attila Takács

Balázs Peter Gerö

Johan Kölhi

Martin Julien

Luis Barriga

Victor Souza

Chunyan Fu

Tom Rindborg

Vinay Yadhav

Xuejun Cai

Mathieu Giguere

Andreas Fasbender

Patrizia Testa

Ignacio Más Ivars

Ulf Henrik Larsson

Amardeep Mehta

Ingmar Tönnby

Eric Hjelmestam

Egbert-Jan Sol

Benoit C Tremblay

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.

Methods and apparatuses for providing a function as a service platform

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.

Method and first node for managing transmission of probe messages

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.

Method and cloud management node for enabling a virtual machine

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.

Systems and methods for decentralized service placement in a resource pool

Methods and nodes () in a data distribution network, for distributing content to multiple consuming nodes (C, C, C, . . . ). A first node () detects () multiple data flows () of a first content from the first node to a second node () 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 () the second node to operate as delivering node of the first content for the consuming nodes and redirects () the consuming nodes to use the second node as delivering node of the first content. The first node further reduces () 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.

Methods and nodes for distribution of content to consumers

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.

Method nodes and computer program for enabling of data traffic separation

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.

Methods, nodes and computer program for enabling of resource component allocation

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.

Systems and methods for distributed network-aware service placement

The present invention relates to a method for retransmission of lost data, a receiving device operating according to the invented method and a retransmission server. In the absence of a unique identifier per data packet or data frame, there is obviously a problem to directly identify a specific data packet, data block or data frame in the stream and retransmission can't take place with current technologies. The object of the present invention is to offer a retransmission method and means for making said retransmission of missing data packets possible in the absence of a unique identifier.

Method for retransmission using checksums for identifying lost data packets

The present invention relates to a server and a method for achieving a fast channel change in e.g. an IPTV system. This is achieved by selecting a source for retrieving the requested channel based on the current load of the FCC server. The source may be the streaming server providing the regular multicast stream or a buffer providing a buffered version of the requested channel. According to one embodiment requests for fast channel change (relating to the same channel) are grouped and served and served as a bundle over multicast. By doing that one can alleviate the load on the FCC server and the network since multiple clients can share the same stream.

Methods and arrangements for system providing media via multicast distribution

A method and arrangement for switching between a common media stream and a selective media stream of a media session received in a media player including a media buffer entity. Media frames of either a common media stream or a selective media stream are received and buffered in the media buffer entity. A switch at the media buffer entity is then controlled so that the output of the media buffer entity is changed from delivering common media frames to delivering selective media frames, or vice versa, upon detecting a stream switching trigger frame in the received media frames.

Method and apparatus in a media player

The present invention relates to a communication system (SYS), a gateway apparatus (HiGA) and a method for allowing services of a first type provided by a communication server (IMS-S) to be provided to terminal devices (T, T, . . . Tn . . . TN) of a home network (CPN) independent of whether the terminal devices are of a first type or a second type (IMS-based or non-IMS-based). The gateway apparatus (HiGA) comprises one or more service-specific mapping applications (AS) for adapting the control plane (SIP) used between the second type terminal devices (T) to the control plane (HTTP) used between the gateway apparatus (HiGA) and the communication server (IMS-S).

Growing community of inventors

Sollentuna, Sweden

Joacim Halén