Telefonaktiebolaget Lm Ericsson (publ)

Kaloom Inc

Laurent Marchand

Suresh Krishnan

Benoit Tremblay

Per Andersson

Martin Julien

Robert Frank Brunner

Panagiotis Saltsidis

János Farkas

David Ian Allan

Yves Lemieux

Omar Cherkaoui

Omar Mounaouar

Petko Valtchev

Li Jun Zhang

Saltsidis Panagiotis

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

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 of supporting service chaining at a network device of a data network is disclosed. The data network offers a set of services associated with a set of network devices, where subscribers of the data network are served by chains of one or more services. The method starts upon receiving a frame, and the network device selects a chain of one or more services for the frame to be processed by the data network. The network device encapsulates the frame with a reflected frame message (RFM) header, the RFM header containing source information associated with the network device, destination information associated with an immediate next service for the frame to be processed, an operation code indicating the frame being an RFM frame. Then the network device sends the encapsulated frame out of the network device according to the destination information of the encapsulated frame.

Method and system of supporting service chaining in a data network

Presented is a system and method for distributing a network application across a plurality of geographically dispersed network sites. The system comprises a plurality of network sites connected by a shared network and interconnected by a dedicated non-blocking communication network. The system can use different interconnecting network topologies based on the number of sites to be interconnected. The method balances the network application load and resources across the interconnected network sites based on a distribution policy implemented without burdening the shared network. The method provides redundancy capabilities by detecting the loss of a network site and redistributing the network application load to the remaining network sites.

Method and system for distributing a network application among a plurality of network sites on a shared network

A lattice of interconnected concepts is constructed from flow entries. Each concept describes a subset of flows and a subset of the flow attributes. Based on user queries, the lattice is used to build disjoint sets of flows referred to as flowsets. Each user query specifies one or more of the flow attributes to be measured. Each flowset includes one or more of the flows to thereby enable sharing of the hardware counters among the flows. One hardware counter is then assigned to each flowset.

Lattice based traffic measurement at a switch in a communication network

A method and a router having a plurality of blades comprising at least a first blade and a second blade. The router comprises an interconnect providing a plurality of channels, each of which being used between two of the blades. The first blade receives a packet addressed to exit the router via the second blade, segments the packets into at least two fragments and forwards each fragment to at least two different blades, each via one of the interconnect's channels. The interconnect may be an optical interconnect by which a single wavelength from one blade defines one of the plurality of channels and wherein each blade supports a plurality of wavelengths. The at least two different blades may comprise each blade of the router, except the first blade. Each of the plurality of channels may also be a dedicated channel between two of the blades.

Forwarding a packet within a router using fragments over an interconnect

A method and nodes are provided for localizing traffic between communication nodes receiving service from a same network. A local mobility anchor informs media access gateways providing access to two communication nodes of each other's addresses. Traffic exchanged between the two communication nodes connected to the same network via these media access gateways are routed directly between the gateways, bypassing the local mobility anchor.

Traffic localization with proxy mobility

Reduction of overhead normally caused by the addition of a second IP header in case of tunneling between a home agent and a mobile node located in a foreign network is achieved by replacing an encapsulated first IP header by a tunnel identifier. The home agent and the mobile node agree on a tunnel identifier value at the time of binding update and acknowledgement. The tunnel identifier may be used independently at the home agent and at the mobile node to reconstruct the first IP header, which identifies a correspondent node. Because the encapsulated first IP header is not terminated at either of the home agent or mobile node, overhead reduction is not impacted by eventual transmission error or loss between these two nodes.

Tunnel overhead reduction

A system, a method and a Mobile Node (MN) for enabling a handover of the MN from a current serving access router (PAR) to a next serving access router (NAR) in a data communications network. At least one tunnel is present between the PAR and the NAR to enable data exchange therebetween. The MN has a first address valid under the PAR and is capable of forming a second address valid under the NAR prior to completion of the handover. The MN sends a handover request to the PAR and proceeds with a connection to the NAR without discarding its first address. The MN then completes the handover towards the NAR and receives traffic sent on the first address from the NAR.

Handover enabler

A method and packet switched cellular telecommunication system wherein data flows from a terminal are aggregated into one or more Multi Protocol Label Switching (MPLS) Label Switched Path (LSP) based on at least one criterion. In a first embodiment, the data flows are aggregated into LSP(s) based on a Quality of Service (QoS) class of each such data flows, by a Network Node, such as a Radio network Controller (RNC) or a Serving GPRS Support Node (SGSN). In a second embodiment, the data flows or LSPs are aggregated into another LSP(s) based on the destination routing area. The LSP aggregation is performed by an Edge Node of the routing area, such as a Gateway GPRS Support Node (GGSN). In a first variant of the 2embodiment, the aggregation is used for macro-mobility, while in yet another variant the same aggregation is used for defining a virtual private network.

Method and system for multi-protocol label switching (MPLS) based data flow aggregation in a third generation (3G) cellular telecommunication system

A Radio Network Server (RNS) is modified to function as a policy server providing radio network resource allocation rules in an integrated third generation wireless IP network. The RNS determines a level of availability of radio network resources, and determines whether the level is sufficient to satisfy requests for resources in accordance with policy rules. The RNS informs a Bandwidth Broker (BB) whether the radio network resources are available. The BB functions as a Policy Decision Point (PDP) for its domain, and either allows or denies requests from users for network resources based on the input from the RNS. A plurality of edge routers in each domain interface with the BB utilizing the Common Open Policy Service (COPS) protocol interface. The edge routers function as Policy Enforcement Points (PEPs) for their domain to enforce policy decisions made by the BB. The BB may interface with BBs in other domains for calls that span multiple domains.

Growing community of inventors

Montreal, Canada

Laurent Marchand