Alcatel Lucent

Alcatel-lucent USA Inc.

Nokia Solutions and Networks Oy

Nokia of America Corporation

Lucent Technologies Inc.

Nokia Technologies Oy

Alcatel-lucent Canada Inc.

Fang Hao

Tirunell V Lakshman

Muralidharan Sampath Kodialam

Sarit Mukherjee

Haoyu Song

Murali Kodialam

T V Lakshman

Randeep Singh Bhatia

Tirunellai V Lakshman

Krishna P Puttaswamy Naga

Mostafa Uddin

Harish Viswanathan

Hyunseok Chang

Hui Joyce Zhang

Scott Corey Miller

Girish P Chandranmenon

Pramod V N Koppol

Tejas Naik

Ehsan Rezaaifar

Muralidharam S Kodialam

Colin Leon Kahn

Martin Zirngibl

Rakesh H Chandwani

Yang Guo

Antony Martin

Tv Lakshman

Limin Wang

Huanle Zhang

Sanjay D Kamat

Stephen M Zlatos

Yu Mi

Steven Benno

An Wang

Martin Zimgibl

Naeem Asghar

Colin Corcoran, Jr

Joseph Karwisch

Michael P Siesta

TV Lakshman

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

Packet-processing circuitry including one or more flow caches whose contents are managed using a cache-entry replacement policy that is implemented based on one or more updatable counters maintained for each of the cache entries. In an example embodiment, the implemented policy enables the flow cache to effectively catch and keep elephant flows by giving to the caught elephant flows appropriate preference in terms of the cache dwell time, which can beneficially improve the overall cache-hit ratio and/or packet-processing throughput. Some embodiments can be used to implement an Open Virtual Switch (OVS). Some embodiments are advantageously capable of implementing the cache-entry replacement policy with very limited additional memory allocation.

Flow cache management

A plurality of agents is instantiated on a corresponding plurality of servers that are running concurrent instances of a control plane application. A first agent is selected from the plurality of agents to mediate communication between a client and the concurrent instances of the control plane application running on the plurality of servers. The first agent replicates uplink packets received from the client for transmission to the plurality of agents. A first connection is used to convey the uplink packets. The first agent transmits a single copy of redundant downlink packets received from the plurality of agents to the client via the first connection. In some cases, the first connection is a stateful transmission control protocol (TCP) connection and the first agent replicates the uplink packets received in a single TCP stream. The first agent merges the redundant downlink packets into the single TCP stream.

Splicing concurrent connections into a high availability session

A packet splicer receives, from a first server of a plurality of servers, a first request for retransmission of an uplink packet that was received from a client and replicated to the plurality of servers. The plurality of servers is running concurrent instances of a control plane application configured to process information in the uplink packet. The packet splicer transmits the first request for retransmission of the uplink packet to the client. The packet splicer bypasses transmission of a second request for retransmission of the uplink packet received from a second server of the plurality of servers. In some cases, the packet splicer receives, from the client, a request for retransmission of a downlink packet that was redundantly transmitted by the plurality of servers. The packet splicer replicates the request for retransmission of the downlink packet to the plurality of servers.

Acknowledgment and packet retransmission for spliced streams

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

Internet-of-Things messages can be transported, encoded and decoded using inventive source and destination attribute labels.

Systems and methods for encoding and decoding IoT messages

A method, apparatus, and computer program product are disclosed for determining, by a mobile wireless device, a likelihood that a first device ID of a target wireless device corresponds to a physical location of the first wireless device at a first measurement location, based on comparing a measured received signal strength of the target wireless device at the first and a second measurement locations and comparing the measured received signal strength of one or more other wireless devices at the first and second measurement locations. The mobile wireless device registers the first device ID of the target wireless device and associates the registered first device ID with the determined corresponding physical location of the target wireless device.

Augmented onboarding of internet-of-things devices

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

A method of determining a maximum flow on a network path using segment routing, the method including establishing a segment graph, establishing underlying dual weights on the segment graph, computing the dual weights from the segment graph, finding a minimum dual weight path not having more than a predetermined number of hops, augmenting a flow on the dual weight path, and updating the dual weights on the underlying segment graph.

Hop constrained maximum flow with segment routing

Various embodiments relate to a non-transitory computer readable medium and method thereof for finding a minimum hop path in a segment graph traversing the least number of links in a physical topology, the method including receiving a connection request for a connection between a source node and a destination node, computing the segment graph, the segment graph having a plurality of links, computing a bandwidth for each of the plurality of links in the segment graph, computing the number of links for a shortest path ('N(q)') for each of the plurality of links, eliminating each of the plurality of link with a bandwidth less than the minimum bandwidth and selecting the shortest path in the physical topology between the plurality of links.

Method and apparatus for minimum label bandwidth guaranteed path for segment routing

Various embodiments relate to a method and apparatus for computing a minimum segment labeling of a given path on a segment cover graph, the method including receiving a connection request for a connection between a source node and a destination node, generating a Shortest Path Directed Acyclic Graph ('SPDAG') from the source node to the destination node by running a shortest path algorithm from the source node, determining an end node, between the source node and the destination node, at which the SPDAG deviates from the given path, determining whether the end node is the end of an Equal Cost Multipath ('ECMP') and terminating the shortest path algorithm at a predecessor node to the end node if the end node is the end of an ECMP and making the predecessor node to the end node the source node.

Method and apparatus for instantiating a path with the minimum number of segments

Various embodiments provide a method and apparatus for providing adaptive self-tuned routing within a network. In particular, one or more path selection values are adaptable to the changing network utilization and are configured to balance the influence of a first objective and a second objective on the path selection. Advantageously, balancing the influence of the first and second objectives on path selection provides improved efficiency and improved revenue generating capacity when compared to conventional routing methods.

Method and apparatus for self-tuned adaptive routing

The invention is directed to providing cloud-based services using dynamic network virtualization. Embodiments of the invention provide a cloud-based service over a system that has a dynamic network virtualization architecture. The architecture includes a set of distributed forwarding elements with centralized control, and at least one virtual machine that is bound to one of the forwarding elements. These features enable the virtual machine to be migrated across a wide area network while maintaining its original IP address and service continuity.

Providing cloud-based services using dynamic network virtualization

Various exemplary embodiments relate to a method for processing data packets by a first-hop switch in a data network, including: receiving a first data packet associated with a flow; determining whether the flow associated with the first data packet is found in a flow table in the first-hop switch; modifying the first data packet by replacing a packet header field with flow definition information; and transmitting the modified first data packet based upon the flow definition information.

Low-cost flow matching in software defined networks without TCAMS

Growing community of inventors

Morganville, NJ, United States of America

Fang Hao