Lucent Technologies Inc.

Riverstone Networks, Inc.

Ram Krishnan

Apurva Mehta

Michael R MacFaden

Sandeep Lodha

Scott Rich

Robert Pfile

Performing atomic lookup rule set transitions. A method involves performing lookups using a first set of rules, flagging a subset of the first set of rules as old rules, adding a second set of rules while continuing to perform lookups using the first set of rules, and atomically transitioning to perform lookups using the first set of rules plus the second set of rules minus the old rules. A system implementing the method includes a lookup table and a lookup table management module that is configured to make atomic lookup rule set transitions in the lookup table.

Atomic lookup rule set transition

A method and system for forwarding traffic from a plurality of logical networks using a single forwarding table. Traffic is received in the form of packets with a key and a logical traffic identifier. The routing table is traversed to a forwarding table entry having a longest prefixed search value that matches the key and having a logical network identification array in which the logical traffic identifier may be represented. If the logical traffic identifier is represented in the logical network identification array, then the packet is forwarded in accordance with forwarding information associated with the forwarding table entry.

Forwarding traffic in a network using a single forwarding table that includes forwarding information related to a plurality of logical networks

Performing selective update of a content addressable memory (CAM) following restart of an access control module (ACM) at a network node involves maintaining a restart CAM entry database in shared memory. When the ACM restarts, instead of reentering all CAM entries into the CAM or reading the contents of the CAM, the ACM only updates the CAM with the entries that were modified while the ACM was offline, prior to restart.

Hitless restart of access control module

Managing a position-dependent data set that is stored in a content addressable memory (CAM) array involves identifying an instance of a base position-dependent data set that exists in software, identifying an instance of an edited position-dependent data set that exists in software, determining differences between the instance of the base position-dependent data set that exists in software and the instance of the edited position-dependent data set that exists in software, and incorporating the differences between the instance of the base position-dependent data set that exists in software and the instance of the edited position-dependent data set that exists in software into an instance of said base position-dependent data set that exists in a CAM array.

Growing community of inventors

Santa Clara, CA, United States of America

Ram Krishnan