Telefonaktiebolaget Lm Ericsson (publ)

Jon Maloy

Per Andersson

Bengt Johansson

Sten Pettersson

Tarik Hammam

Anders Franzen

Tord K Nilsson

Richard Tremblay

Abdallah Chatila

Jonathan Lynam

Suresh Krishnan

Makan Pourzandi

Catherine Truchan

Geoffrey Lefebvre

Eric Dyke

Anders FRANZÈN

A network of N nodes performs a monitoring method, where the method is performed by each node. The N nodes are partitioned into domains according to a sorted order. The domains include a local domain in which the node is located and one or more remote domains. Each remote domain has a domain head designated to monitor member nodes in the remote domain. The node sends probes at a given frequency to actively monitored nodes that include all other member nodes in the local domain and domain heads in the remote domains. The node then determines whether each of the actively monitored nodes is up based on replies received from the actively monitored nodes in response to the probes.

Neighbor monitoring in a hyperscaled environment

A method for packet classification. In some embodiments, the method includes instantiating a first machine; allocating a first SC to the first machine, the first SC being configured to classify a packet based on information contained in a field of a header included in the packet; instantiating a second machine; allocating a second SC to the second machine, the second SC being configured to classify a packet based on information contained in a field of a header included in the packet; monitoring the first machine to detect if the first machine is in an overload state; and in response to detecting that the first machine is in an overload state, instantiating a third machine and allocating a third SC to the third machine, the third SC being configured to classify a packet based on information contained in a field of a header included in the packet.

Systems and methods for packet classification

Systems, methods, and computer program products for a software build and load process using a compilation and deployment service. A method for a software build and load process using a compilation and deployment service includes receiving, at the service, new software. The method further includes comparing, at the service, the received new software with data in a database, wherein the data comprises active software. The method further includes merging, at the service said new software and active software into one or more load modules based on the comparison. The method further includes deploying the one or more load modules to one or more target processing units.

Systems, methods, and computer program products for a software build and load process using a compilation and deployment service

A method of reserving lookup keys in a computer communication system including a hierarchy of key manager nodes includes receiving a first reservation request at a first key manager node at a first level of the hierarchy of key manager nodes. The first reservation request requests reservation of a lookup key. The methods include determining whether or not the first key manager node has authority to grant the reservation request, and, in response to determining that the first key manager node does not have authority to grant the reservation request, sending a second reservation request requesting reservation of the lookup key to a second key manager node that is at a second level of the hierarchy of key manager nodes.

Hierarchical delegation and reservation of lookup keys

A load balancer in a communication network tracks active network flows using a Bloom filter and takes a snapshot of the Bloom filter at the time of a scaling event. The load balancer uses the Bloom filter snapshot to differentiate packets belonging to pre-existing network flows from packets belonging to new network flows. Packets belonging to pre-existing network flows continue to be distributed according to a mapping function in use prior to the scaling event. Packets belonging to new network flows are distributed according to a new mapping function.

Load balancing for stateful scale-out network services

Systems/methods of looking up an address of a target server include receiving a first lookup request at a first lookup server that manages a first database that contains data relating to a first plurality of servers. First metadata relating to the target server is retrieved from the first database, and a second lookup request including the first metadata is sent to a second lookup server that manages a second database that contains data relating to a second plurality of servers. The second plurality of servers is a subset of the first plurality of servers and includes the target server. Second metadata relating to the target server is retrieved from the second database, and a response based on the first and second metadata is transmitted to the client. Corresponding systems/methods of binding a server address to a lookup key are also disclosed.

Hierarchical binding and lookup of addresses in inter-process communications systems

Devices, systems, methods and software are described which provide identity assignment and redistribution capabilities for software components of a distributed application. Identity value ranges can be fixed or variable. Identity assignment schemes according to exemplary embodiments facilitate the continuation of traffic between the components and clients during redistribution of the identities.

Growing community of inventors

Montreal, Canada

Jon Maloy