Telefonaktiebolaget Lm Ericsson (publ)

Kaloom Inc

Per Andersson

Suresh Krishnan

Benoit Tremblay

Laurent Marchand

Jon Maloy

Anders Franzen

Bengt Johansson

Sten Pettersson

Tarik Hammam

Tord K Nilsson

Richard Tremblay

Abdallah Chatila

Mahmoud Mohamed Bahnasy

Jonathan Lynam

Martin Julien

Lars Hennert

Andr&eacute; B&eacute;liveau

Anders FRANZÈN

Computing devices and method for performing a secure neighbor discovery. A local computing device transmits an encrypted local node identifier and an encrypted local challenge to a remote computing device. The remote computing device generates a local challenge response based on the local challenge; and transmits an encrypted remote node identifier and an encrypted local challenge response to the local computing device. The local computing device determines that the received local challenge response corresponds to an expected local challenge response generated based on the local challenge. The remote computing device further transmits an encrypted remote challenge. The local computing device generates a remote challenge response based on the remote challenge; and transmits an encrypted remote challenge response to the remote computing device. The remote computing device determines that the received remote challenge response corresponds to an expected remote challenge response generated based on the remote challenge.

Computing device and method for performing a secure neighbor discovery

Method and computing devices for enforcing packet order based on packet marking. Upon occurrence of a link failure, a first device reallocates traffic initially forwarded through the failed link to an alternative link and marks the reallocated traffic with a first flag. Upon recovery of the failed link, the reallocated traffic is forwarded again through the recovered link and marked with a second flag different from the first flag. A second device calculates a reference inter-packet time for received traffic marked with the first flag. For received traffic marked with the second flag, the second device calculates a current inter-packet time. The current inter-packet time is compared with the reference inter-packet time, to determine if the traffic marked with the second flag shall be forwarded immediately or if the forwarding shall be delayed.

Method and computing devices for enforcing packet order based on packet marking

Computing devices and methods for transmitting and receiving optimized tunneling IP packets. At the entry point of a tunnel, an IP packet comprising at least one header is received. If data comprised in one of the at least one header of the received IP packet are redundant with data comprised in one or more tunneling header of a tunneling IP packet, then the redundant header is removed from the received IP packet. The tunneling IP packet encapsulating the received IP packet (with its redundant header removed) is transmitted. A header removal field is positioned in the tunneling IP packet to indicate the positive determination of redundancy. At the exit point of the tunnel, the tunneling IP packet is received. The header removal field and the one or more tunneling header of the tunneling IP packet are used for identifying the previous determination of redundancy and recreating the removed header.

Computing device and method for optimizing the tunneling of IP packets

Computing device and method for generating a fabric-wide IPv6 address in a data center comprising a plurality of fabrics. A configuration file is stored in a memory of a computing device. The configuration file comprises an Internet Protocol version 6 (IPv6) base prefix and a fabric identifier. A processing unit of the computing device determines a host identifier. The processing unit generates an IPv6 prefix, by combining the IPv6 base prefix stored in the configuration file and the fabric identifier stored in the configuration file. The processing unit generates an IPv6 address, by combining the IPv6 prefix and the host identifier. The processing unit further advertises the generated IPv6 address.

Computing device and method for generating a fabric-wide IPV6 address

Computing device (located in a fabric of a data center) and method for generating a link IPv6 address. The computing device determines a local node identifier and a local link identifier for a communication interface of the computing device. The computing device receives from a remote computing device a remote node identifier and a remote link identifier for a remote communication interface of the remote computing device. Based on a comparison of the local and remote node identifiers, the link IPv6 address is generated by using an IPv6 base prefix, the local node identifier, the remote node identifier, the local link identifier, the remote link identifier, and an indicator that the local node identifier is greater or lower than the remote node identifier. A network configuration of the computing device is performed by generating a fabric-wide IPv6 address and one or more link IPv6 address.

Computing device and method for generating a link IPV6 address

Method and computing device performing a fabric deployment in a data center. The computing device stores a configuration file comprising first and second IPv6 base prefixes, and a fabric identifier. The computing device generates a host identifier, a fabric-wide IPv6 prefix by combining the first IPv6 base prefix and the fabric identifier, and a fabric-wide IPv6 address by combining the fabric-wide IPv6 prefix and the host identifier. The computing device determines a local node identifier and a local link identifier for a communication interface of the computing device. The computing device performs a (secure) neighbor discovery procedure for determining a remote node identifier and a remote link identifier for a communication interface of a remote computing device. The computing device generates a link IPv6 address based on the second IPv6 base prefix and at least some of: the local node and link identifiers, and the remote node and link identifiers.

Computing device and method for performing a fabric deployment in a data center

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

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.

Identity assignment for software components

Problems caused by Internet Protocol datagram fragmentation are solved by creating a session context for the datagram fragments without actually reassembling the datagram from its fragments. The session context enables treatment of the datagram without actually reassembling it. Processing fragments can be followed by forwarding the processed fragments to another node that can further fragment the IP datagram.

Growing community of inventors

Montreal, Canada

Per Andersson