International Business Machines Corporation

Ibrahim Abdel-Rahman Ouda

John David Irish

Jason Andrew Thompson

James A Steenburgh

Kerry Christopher Imming

Ryan Abel Heckendorf

A method and circuit for implementing lane shuffle for fault-tolerant communication links, and a design structure on which the subject circuit resides are provided. Shuffle hardware logic steers a set of virtual data lanes onto a set of physical optical lanes, steering around all lanes that are detected as bad during link initialization training. A mask status register is loaded with a mask of lane fail information during link training, which flags the bad lanes, if any. The shuffle hardware logic uses a shift template, where each position in the starting template is a value representing the corresponding lane position. The shift template is cascaded through a set of shifters controlled by the fail mask.

Implementing lane shuffle for fault-tolerant communication links

A method and apparatus are provided for implementing frame alteration commands in a communications network processor. A set of frame alteration instruction templates is defined. A frame alteration instruction template is identified based upon the packet type recognition result of a received packet. A frame alteration instruction stream is generated utilizing the frame alteration instruction template. Each of the frame alteration instruction templates includes different frame alteration commands to be performed on a packet. Pointers to indirect data bytes to be inserted in a packet are stored in the frame alteration instruction templates. The generated frame alteration instruction stream is used by hardware to provide frame alterations.

Method and hardware apparatus for implementing frame alteration commands

In a first aspect, a first method is provided that includes the steps of (1) providing a pointer that includes a first keytype field and a second keytype field; and (2) assigning a value to the second keytype field of the pointer based on a tabletype field of an updated table. The updated table is an updated version of a first table written in a memory, and the first keytype field of the pointer has a value assigned based on a tabletype field of the first table. The first method further includes the step of employing the second keytype field of the pointer to point to the updated table. Numerous other aspects are provided.

Methods and apparatus for routing packets

A method and apparatus are provided for implementing predefined actions based upon packet classification and lookup results in a communications network processor. A plurality of sets of rules is defined. Each rule set includes at least one rule and each rule has a set of masked compares for comparing results of hits and misses of table lookups. Each masked compare set has an associated field for selecting an action. The action defines a set of one or more commands and each command defines a processing operation. One rule set is identified based upon the packet classification result for a received packet. When one of the rules is identified having a match of the masked compares, then the action of associated with the identified rule is selected. Otherwise a default action is provided responsive to no rule of the identified rule set having a match of the masked compares.

Growing community of inventors

Rochester, MN, United States of America

Ibrahim Abdel-Rahman Ouda