Telefonaktiebolaget Lm Ericsson (publ)

Zoltán Turányi

Johan Rune

Gunnar Mildh

Szilveszter Nádas

Erik A Eriksson

Gabor Fodor

Dinand Roeland

András Zahemszky

Conny Larsson

Balázs Pinczel

Rashmi Purushothama

György Miklós

Lasse Olsson

Gergely Pongrácz

Dániel Géhberger

Sandor Laki

Gergö Gombos

Joachim Sachs

Niclas Wiberg

Sándor Rácz

János Farkas

Hans Oskar Eriksson

Balázs Varga

Maria Belen Pancorbo Marcos

Geza Szabo

Heikki Mahkonen

James Kempf

Balázs Peter Gerö

János Harmatos

Catalin Meirosu

Göran Hall

András Kern

Gabor Nemeth

Gabor Sandor Enyedi

Péter Mátray

Djamel Sadok

Christian Vogt

Andras Valkó

Johan Nielsen

András Valkó

There is provided a method for handling execution of a function in a function-as-a-service (FaaS) system. According to the method, in response () to a trigger on a first node of the FaaS system for execution of a function, execution of the function is initiated () on the first node of the FaaS system if data to be accessed for the execution is stored on the first node of the FaaS system and/or execution of the function is initiated () on a second node of the FaaS system if the data to be accessed for the execution is stored on the second node of the FaaS system.

Handling execution of a function

A FaaS system comprises a plurality of execution nodes. A software package is received in the system, the software package comprising a function that is to be executed in the FaaS system. Data location information related to data that the function is going to access during execution is obtained. Based on the data location information, a determination is then made of an execution node in which the function is to be executed. The function is loaded into the determined execution node and executing in the determined execution node.

Performance of function as a service

Embodiments of a method of operation of a service requestor to request a service from a chain controller in a cellular communications network in which a user plane function is decomposed into a plurality of micro user plane functions are disclosed. In some embodiments, the method comprises sending, to the chain controller, a service description or a request to update a service description. The service description comprises one or more service template instances having respective service template definitions. Each service template definition of the respective service template definitions being data that defines a set of micro user plane functions that realize a service or a part of a service. Each service template instance of the one or more service template instances comprises data that defines a reference to the respective service template definition. The method further comprises receiving a reply from the chain controller.

Requesting flexible user-plane services in a service-based architecture

Methods and systems for implementing a distributed blockchain transaction processing element in a data center are described. A call to a function is received. The call for the function is dispatched to a first runtime environment of a first server. Code is fetched from the blockchain database. The code is executed in the first runtime environment resulting in a blockchain transaction. A copy of the blockchain transaction is written in a storage medium that is locally accessible by the first server. The blockchain transaction is added to a first block. A consensus mechanism is used to determine whether the first block is to be added to the blockchain database; and responsive to determining that the first block is to be added to the blockchain database, the first block is caused to be stored in a persistent storage as part of the blockchain database.

Method and apparatus for implementing a distributed blockchain transaction processing element in a datacenter

There is provided a method of operating a message processing node in a message processing system. Upon receipt of a message for a transaction referring to an object for which a record is stored in a database (), a request is sent to the database to lock the record for the object (). Where the record is unlocked, a message is received from the database indicating that the request to lock the record is successful () and the received message for the transaction is processed (). Where the record has been locked previously by another message processing node, a message is received from the database indicating that the request to lock the record is unsuccessful and identifying the message processing node to which the record is locked () and the received message for the transaction referring to the object is forwarded to the identified message processing node ().

Message processing node and database in a message processing system and methods of operating the same

At an Edge Node, a method of handling data packets in order to mark the packets with respective packet values indicative of a level of importance. The method comprises implementing a variable rate token bucket to determine an estimated arrival rate of a flow of packets. The method comprises receiving a data packet, updating the estimated arrival rate to an updated arrival rate based on a token level of the token bucket and generating a random or pseudo-random number within a range with a limit determined by the updated arrival rate. The method further comprises identifying an operator policy which determines a level of service associated with the flow of packets, and a Throughput Value Function (TVF) associated with said policy, and then applying the TVF to the random number to calculate a packet value. The packet value is included in a header of the packet.

Probabilistic packet marking with fast adaptation mechanisms

The present disclosure relates to forwarding of network traffic. In one of its aspects, the technology presented herein concerns a method for forwarding network traffic from multiple sources to multiple destinations on maximally disjoint paths by maximally redundant trees, MRTs. The method is implemented in a network element implementing multipoint-to-multipoint functionalities in a path computation element, PCE, of a network, wherein the network includes a plurality of network elements. According to the method, an almost directed acyclic graph, ADAG, is computed for the network. Next hops along MRTs are computed by using the ADAG. One or more valid path pair(s) of the computed MRTs that is/are disjoint is/are determined and then, the network traffic is forwarded by using the valid path pair(s) of the MRT(s).

Method and apparatus for forwarding network traffic on maximally disjoint paths

A method, in a first node, for handling one or more jobs, wherein said first node receives a job over an incoming link, which job comprises a job value, wherein said method comprises the steps of determining, by said first node, a deviation of a queuing delay of the first communication node from a target queuing delay value, and using, by said first node, said deviation as an error value to determine a dropping probability which is used to determine a threshold value, wherein said threshold value corresponds to or is associated with a congestion level of a queue of the job, comparing, by said first node, the job value with the threshold value and establishing that said job value is below said threshold value, dropping, by said first node, said job based on said comparison.

First communication node, method performed thereby, computer program and computer-readable storage medium for handling packets in a communications network

The embodiments herein relate to a method performed by a control plane node () for handling a UE () which roams into a visited network (). At least the network in which the control plane node () is comprised is a MSC network. The control plane node () transmits a create chain request message to a service chain controller (). The create chain request message is a request to create a chain of UPF nodes () that user plane packets to or from the UE () should traverse. The control plane node () receives a create chain response message from the service chain controller (). The create chain response message indicates that the requested chain has been created.

Method and nodes for handling a UE which roams into a visited network

The invention relates to a method for enabling relocation of a function for processing data packets of a flow associated with a device. The method is performed in an arrangement of a communication system, which is allocated as a proxy for control messages exchanged between an instance of the function for processing the data packets of the flow and a control instance controlling how the function processes the data packets of the flow. The method comprises obtaining () information indicating that the function for processing the data packets is relocated from a first instance to a second instance. The method further comprises forwarding () control messages received from the control instance to the second instance of the function for processing the data packets and vice versa, in response to the obtained information.

Method and apparatus for relocating packet processing functions

Embodiments herein relate to a method in a receiving node () for handling packets for a wireless device () in a radio communications network (). The receiving node () receives a packet from a transmitting node (). The packet is marked with a value, wherein the value is corresponding to a level of importance of the packet along a linear scale. The receiving node () handles the packet based on the value and an expected amount of resources needed to serve the packet.

Transmitting node, receiving node and methods therein

The invention relates to methods and network nodes of controlling a communication mode of a mobile terminal in a mobile service chaining network, and managing a registered Internet Protocol (IP) address for a mobile terminal. In a first aspect of the invention, a method performed by at least one control plane node of controlling a communication mode of a mobile terminal in a mobile service chaining network is provided. The method comprises setting the mobile terminal in idle mode and submitting an instruction to at least one Internet Protocol Advertisement Point (IAP) serving the mobile terminal to invalidate context for the mobile terminal held by the at least one IAP, wherein the at least one IAP invalidates at least a registered Internet Protocol (IP) address used for the mobile terminal.

Controlling communication mode of a mobile terminal

The invention relates to a method for relocating a first function for processing data packets of a flow associated with a device, from a source to a target instance. The method is triggered by an initiated relocation of a second function for processing data packets of the flow. The method comprises initiating () a first phase of a relocation method for relocating the first function, before the relocation of the second function is finalized. The method also comprises determining () whether to initiate a second phase of the relocation method based on information related to a progress of the relocation of the second function. When it is determined () to initiate the second phase, the method further comprises initiating () the second phase of the relocation method comprising the resumption of the processing of the data packets of the flow at the target instance of the first function.

Methods and apparatus for relocating packet processing functions

A radio communication system and a method for assigning a short-lived Cell Radio Network Temporary Identifier, 'CRNTI', to a first user equipment performing random access to a radio network node are provided. The radio communication system registers the first user equipment as connected to the radio network node. A message for synchronizing the radio network node and the first user equipment with respect to the first time period is transferred. After the first time period has elapsed, the radio communication system maintains the first user equipment connected to the radio network node, and allows the short-lived CRNTI to be assigned to a second user equipment.

Growing community of inventors

Szentendre, Hungary

Zoltán Turányi