Alcatel Lucent

Rockley Photonics Limited

Chiang Yeh

Bhaskar Chowdhuri

Nathan Farrington

Dennis Lee Weaver

Guy Regev

Harpal Mann

Thomas Pierre Schrans

Vincent Magret

Sindhu K Mohandas

Gregory G Page

Abhishek Sinha

Cyriel Johan Agnes Minkenberg

Jeremy W Touve

Lawrence Helmerich

Bryan J Dietz

Andrew Ferreira

Peter Paul Ott

Prashant R Rao

Daniel Brunina

German Rodriguez Herrera

Cyriel Minkenberg

Kevin R Bailey

James Hitzelberger

R Leon Sangroniz

A routing protocol, the routing protocol includes the steps of: receiving a packet at an ingress node of a distributed router, the ingress node having an ingress node address, and the packet having a packet header containing a global destination address; converting the global destination address into a local destination address, the local destination address identifying a location on the distributed router; and routing the packet to the local destination address. A distributed router includes a plurality of internal network nodes, the plurality of internal network nodes including an ingress node configured to receive a packet, the ingress node having an ingress node address, and the packet having a packet header containing a global destination address for that packet; means for converting the global destination address into a local destination address, the local destination address identifying a location on the distributed router; and a routing engine configured to route the packet to the local destination address.

Routing protocol and distributed router

A system and method for classifying packets according to packet header field values. Each of a set of subkey tables is searched for a respective packet header field value; each such search results in a value for a subkey. The subkeys are combined to form a decision key. A decision table is then searched for the decision key. The search of the decision table results in an action code and a reason code, one or both of which may be used to determine how to further process the packet.

Multi-field classifier

A system and method for selecting a resource from among a plurality of resources. A total range of numbers is divided into a plurality of sub-ranges, each associated with a respective one of the resources. An indexing number, e.g., a random number, is generated and, when it falls within the total range of numbers, the resource associated with the sub-range into which the indexing number falls is selected. When the indexing number falls outside of the total range, a resource associated with the difference between the indexing number and the greatest number in the total range is selected.

Hardware efficient system and method for load balancing using a random number

A system and method for routing. A packet includes a stack of one or more headers, such as a stack of Multiprotocol Label Switching headers, that determines the path that the packet will take, through a sequence of switches, from its source to its destination. Each header in the stack contains an output port identifier that identifies an output port of a corresponding switch in the path. Each switch, upon receiving the packet, removes the first header to form a shortened packet, and routes the shortened packet to the output port identified by the output port identifier.

System and method for routing

A system and method for measuring propagation delays and other delays in an optical switching system. A transmitter is connected, through a circuit switch, to a receiver. To measure the propagation delay between the transmitter and the receiver, the transmitter sends one or more time-tagged ranging messages and the receiver calculates a propagation delay from the difference between the time of receipt and the time of transmission. In another embodiment, a time delay between message transmission and transition of a CDR of the receiver to a fast acquisition mode is adjusted, by trial and error, to find a range of such time delays for which transmission is successful. A time delay between the transmitter and the switch is measured by establishing or breaking the connection and determining, for various tentative time delay values, whether transmission succeeds.

Synchronization and ranging in a switching system

A method of securely routing data traffic between communication networks. In an integrated security device, a host router supports a virtual router that peers with VRF (virtual routing and forwarding) instances associated with participating networks on the host router. Each VRF instance preferably runs its own dynamic routing protocol and determines when received data traffic may be directly forwarded from one network to another and when it must be forwarded to an OE (offload engine) for enforcement of security policies or NAT (network address translation) processing.

Method and apparatus for network security

Embodiments of the invention provide a method for building a classification tree based on a plurality of rules. Each rule includes multiple fields having different priority levels. The classification tree is built to provide for single pass classification of a received packet according to the multiple rules. The classification tree is built level-by-level, where each level represents one of the priority levels. Building a single level of the classification tree includes: creating, for each of the logical decision paths received from a next higher priority level, a respective sub-tree. The sub-tree includes only nodes and related logical decision paths that are necessary to satisfy rules associated with a respective next higher priority level node. Building of the single level further includes: creating, for each non-lowest priority level, logical decision paths from nodes within the current priority level to a next lower priority level.

Method and system for classifying data packets

A data communications switch for dynamically distributing packet processing operations between an ingress and egress processor for load balancing is disclosed. The invention in the preferred embodiment features a switching device including a plurality of switching modules, each of the switching modules including a packet classifier for identifying one or more packet processing operations to be applied to an ingress packet and a controller adapted to allocate each of the identified one or more packet processing operations between a first set of packet processing operations and a second set of packet processing operations, execute the first set of packet processing operations at the ingress processor at which the packet was received, and transmit instructions to the egress processor to execute the second set of packet processing operations. The egress processor then executes the second set of packet processing operations, after which the packet may be transmitted toward its destination node.

Internal load balancing in a data switch using distributed network processing

A device is described herein that performs a digital-to-analog conversion on a digital multimedia signal in a manner that enhances the human perceptual quality of the resulting analog multimedia signal (e.g., musical passage). In one embodiment, the device operates as follows: (1) divides the bitstream of a digital multimedia signal into several distinct multimedia bitstreams; (2) applies the most effective signal processing (filtering and noise shaping) to each distinct multimedia bitstream; (3) performs the most appropriate digital-to-analog conversion (using a multi-bit DAC, a bitstream DAC, a over-sampled bitstream DAC, or a hybrid of these DACs) to each distinct multimedia bitstream; and (4) combines all of the analog multimedia signals which are outputted by the DACs into a single analog multimedia signal.

Device and method for enhancing the human perceptual quality of a multimedia signal

A method and apparatus for provisioning bandwidth among a plurality of queues in a switching device are disclosed. The bandwidth provisioning employs a QoS label with a timestamp to determine the queue delay associated with the transmission of the packet from an ingress switching device, e.g. ingress blade, to an egress switching device, e.g. egress blade. The QoS label is applied on the ingress blade and removed and read on the egress blade. Using the timestamp, the switch can identify congested priority queues at the ingress blade and selectively enable fragmentation for purposes of preventing particular packets and or particular flows from consuming disproportionately large system resources including bandwidth necessary to communicate packets through the switch fabric. Some QoS labels may further include instruction sets and a fragmentation identifiers used by the egress blade to reassemble the packet fragments. The QoS label, in cooperation with computational and management resources, provide a feedback mechanism to perform real-time bandwidth provisioning within a switch.

Real-time bandwidth provisioning in a switching device

Disclosed is a method and system adapted to receive an input signal from a far end transmission, to take in a near end return signal, and to inject into the return signal, prior to sending the return to the far end, a corrective signal whereby, for example, echoes in the return signal may be reduced or cancelled. A first exemplary embodiment includes one or more adaptive infinite impulse response (IIR) filters and one or more adaptive finite-impulse response filters (FIR) filters running in parallel each having an output that may be selected as the corrective signal based on filter performance determinations. A second exemplary embodiment includes an adaptive FIR filter outputting the corrective signal where the adaptive FIR filter has selected for it, based on filter performance determinations, an output of one or more adaptive IIR filters or a conditioned return signal selected as a reference.

Echo cancellation using adaptive IIR and FIR filters

A method and apparatus for performing multi-stage classification of a plurality of strings extracted from a packet, for example, is disclosed. The method causes a plurality of hierarchical tables to be searched, each table having criteria derived from the policies with which the packet is classified. One of the plurality of the strings is searched at each of the plurality of tables. Each match identified in one table is used to retrieve a pointer to a subsequent table. Each of the matches in each of the hierarchical tables is scored in order to generate a cumulative score for each policy, a score may be used to select from a plurality of applicable policies. In a first embodiment, a plurality of policies, as embodied in the hierarchical tables, are searched and the best policy selected. In a second embodiment, recursive searching is employed.

Packet classification using relevance scoring

An apparatus and method for performing congestion management in a switch or router is disclosed. The apparatus acquires and or generates performance metrics for a plurality of switching module coupled via a switching fabric, generates a performance index based on the attributes from the switching modules, and allocates switching fabric bandwidth based on a weighted combination of the performance metrics. The performance metrics may include past and presents values of some attributes as well as predicted values.

Growing community of inventors

Sierra Madre, CA, United States of America

Chiang Yeh