Alcatel Lucent

Alcatel-Lucent USA Inc.

Lucent Technologies Inc.

Nokia Solutions and Networks Oy

Nokia of America Corporation

Other

Cisco Technology, Inc.

Teltier Technologies, Inc.

Randeep Singh Bhatia

Fang Hao

Tirunell V Lakshman

Mansoor Ali Khan Alicherry

T V Lakshman

Bhawna Gupta

Jorge Lobo

Sampath Rangarajan

Harish Viswanathan

Girija J Narlikar

Guda Venkatesh

Murali Kodialam

Elisha Yehuda Rosensweig

Steven Benno

Alan Quayle

Muralidharan Sampath Kodialam

Li Erran Li

Colin Leon Kahn

Yigal Bejerano

Rakesh H Chandwani

Ivica Rimac

Jairo Orlando Esteban

Pramod V N Koppol

Chung-Min Chen

Tv Lakshman

Girija Narlikar

Rakesh Kumar Sinha

Arupjyoti Bhuyan

Steven A Benno

Hans Johansson

Sharad Sharma

Olivier Bernard Henri Clarisse

Yu Mi

Naeem Asghar

Colin Corcoran, Jr

Joseph Karwisch

Michael P Siesta

Stephen M Zlatos

Yung-Chun Wan

A segment routing (SR) network has a plurality of interconnected SR gateways, where each of a plurality of local networks is connectable to an SR gateway at an edge router of the local network. An SR network control plane maintains a locator database that maps (i) a global IP (GIP) address for user equipment (UE) to (ii) an IP address of a downstream node associated with the UE along a path from the SR network to the UE. An SR gateway (i) receives a message for the UE and (ii) addresses the message to the IP address of the downstream node. The SR network control plane updates the locator database to map (i) the GIP address for the UE to (ii) a different IP address of a downstream node upon the SR network control plane determining that the association of the UE has changed to the different IP address.

In-network solution for low-latency communications using segment routing

Leaf nodes of a tree structure, also having a root node and intermediate nodes, communicate with endpoints via access networks and store mappings from permanent virtual IP (VIP) addresses for the endpoints to physical IP (PIP) addresses for the endpoints on the access networks. The root node and intermediate nodes store pointers for the endpoints' leaf nodes and associated access networks. When a connection setup request (CSR) for a destination endpoint is received from a corresponding node, the receiving leaf node passes the CSR up through the tree structure to a lowest common ancestor (LCA) node for the receiving leaf node and one or more destination leaf nodes associated with the destination endpoint. The LCA node uses its pointers to pass the CSR down towards the one or more destination leaf nodes, which use the corresponding VIP-to-PIP mappings to forward the CSR to the destination endpoint.

Locator lookup-based, low-latency, multi-access IP mobility

Network-based, unsupervised classifiers are provided. The classifiers identify both known and unknown attacks aimed at industrial networks without the need to have a priori knowledge of known malicious attack patterns.

Systems and methods for securing industrial networks

Various example embodiments for supporting scheduling of deterministic flows in time synchronized networks are presented. Various example embodiments for supporting scheduling of deterministic flows in a time synchronized network may be configured to support scheduling of deterministic flows in the time synchronized network based on assignment of transmission start times to data flows of communication devices such that the communication devices may transmit data of the data flows at the transmission start times in a manner tending to reduce or eliminate collisions in the time synchronized network.

Scheduling deterministic flows in time synchronized networks

The present disclosure generally discloses a data plane configured for processing function scalability. The processing functions for which scalability is supported may include charging functions, monitoring functions, security functions, or the like.

Data plane for processing function scalability

This disclosure generally discloses an anchor mobility mechanism. The anchor mobility mechanism is configured to support migration of flows between mobility anchors within a wireless communication system. The anchor mobility mechanism may be configured to support migration of flows between mobility anchors within a wireless communication system in a highly seamless manner. The anchor mobility mechanism may be configured to support migration of a flow of a wireless device between mobility anchors within a wireless communication system using functions performed by a control element (CE) and one or more forwarding elements (FEs) within the data plane of the flow of the wireless device. The functions may include identifying a time at which to initiate migration of the flow, initiating migration of the flow based on identification of the time at which to initiate migration of the flow, or the like, as well as various combinations thereof.

Anchor mobility in wireless networks

In a data processing system, a received data stream comprises a plurality of tuples having respective key values. The received data stream is separated into portions that are delivered to respective ones of a first set of servers in a manner that permits different tuples having the same key value to be processed by different servers of the first set. For each distinct key value, each of at least a subset of the servers of the first set maintains a corresponding partial key result based on one or more of the tuples having that key value that are received by that server. The partial key results are periodically delivered from the servers of the first set to servers of a second set of servers in a manner that ensures that different partial key results having the same key value are processed by the same server of the second set.

Data stream load balancing utilizing multiple sets of servers

Various embodiments provide a method and apparatus for allocating resources to applications (e.g., application processes) using pre-provisioned resource configurations (e.g., VMs or containers) that are based on clustered historical resource usage data. In particular, the set of pre-provisioned resources required to support elasticity in a set of applications is reduced by determining a subset of pre-provisioned resource configurations that are able to be reused across multiple applications. A pre-provisioned resource configuration being based on a determined dominant center for the resource cluster associated with the pre-provisioned resource configuration.

Method and apparatus for provisioning resources using clustering

Various exemplary embodiments relate to a method of offline traffic matrix aware segment routing. The method may include receiving a traffic matrix based upon all the traffic between nodes i and j that is routed in the network; and determining the amount of traffic between nodes i and j will be routed through node k, based on minimizing a maximum link utilization for the traffic matrix by determining that the total amount of flow on a link e in the network is less than the link's capacity.

Offline optimization for traffic engineering with segment routing

A method and apparatus for substantially minimizing overhead over-provisioning costs in machine configurations is disclosed. The method involves the steps of: clustering a plurality of given machine configurations into a quantity of clusters less than or equal to a pre-specified amount; determining a respective dominant provisioning machine configuration for each cluster of the quantity of clusters; and determining an overall over-provisioning resource cost associated with the respective quantity of clusters and associated respective dominant provisioning machine configurations; and assigning to a mapping function the respective associated dominant provisioning machine configuration of each respective cluster of the quantity of clusters as the target for the given machine configurations of each respective cluster of the quantity of clusters. The method for substantially minimizing overhead over-provisioning costs in machine configurations provides advantages over systems known in the art by allowing minimization of average overhead due to over-provisioning costs as well as minimizing the maximum overhead due to over-provisioning costs.

Minimizing overhead over-provisioning costs in machine configurations

In one embodiment, a method comprises monitoring network data associated with a cell of a communication network for one or more channel conditions, estimating total cell capacities for respective channel conditions based on the monitored network data, and estimating an available cell capacity based at least in part on the total cell capacity estimates and a portion of the monitored network data. The method may also include sending information derived from at least a portion of the network data to a server and receiving from the server total cell capacities for respective channel conditions, where the total cell capacities received from the server are used to estimate the available cell capacity. The method may further include sending the available cell capacity estimate to the server and receiving from the server an available cell capacity.

Estimating available cell capacity based on monitored network data

Method and apparatus for uploading content from a user terminal in response to a request triggered at the user terminal to upload content is provided. An exemplary method includes initiating a test call at the user terminal to a wireless network in response to an indication to upload content from the user terminal, obtaining user-channel information for the test call and network-level state information for the user terminal during the test call, determining whether a user-channel condition and a network-level condition are satisfied based on the user-channel information and network-level state information respectively, and uploading the content to the wireless network in response to the user-channel condition and the network-level condition being satisfied. The user terminal obtains at the user terminal user-level state information and triggers the indication to upload content from the user terminal if the user-level condition is determined to be satisfied.

Method and apparatus for uploading content over wireless networks

The invention includes a method and apparatus for providing interactive services using unicast wireless networks and broadcast wireless networks. A method includes receiving content interaction information indicative of interactions by a user with content presented at a wireless user terminal, obtaining at least one service parameter, and providing a service using the content interaction information and the at least one service parameter, wherein the service is provided using one of the unicast wireless network or the broadcast wireless network. The content for which content interaction information is received is provided to the wireless user terminal using a broadcast wireless network and the content interaction information is received over a unicast wireless network. The service that is provided may include providing modified content over the broadcast wireless network, providing personalized content over the unicast wireless network, operating a proxy for a network-based service, and the like.

Method and apparatus for providing interactive services to users using unicast and broadcast wireless networks

Line system design techniques are provided for use in performing routing and coloring operations associated with one or more demands. In one aspect of the invention, a technique for designing a line system comprises the following steps/operations. A set of one or more demands is obtained for use in computing the line system design. The line system design is then represented as a graph in accordance with a graph coloring operation wherein colors represent bandwidths such that bandwidths are assigned and the one or more demands are routed so as to attempt to achieve a minimum total design cost. The line system being designed may be an optical line system.

Methods and apparatus for line system design

Growing community of inventors

Somerset, NJ, United States of America

Randeep Singh Bhatia