Juniper Networks, Inc.

Jean Marc Frailong

Avanindra Godbole

Nhon Toai Quach

Ramesh Padmanabhan

David Talaski

Fanyun Kong

Pradeep S Sindhu

Kireeti Kompella

Eric M Verwillow

A system may include receiving a packet, of a packet stream, including control tags in a header portion of the packet and classifying each of the control tags into a category selected from a set of possible categories. The set of possible categories may include an unambiguous interposable (UI) category that is assigned to a control tag that corresponds to an unambiguous parsing interpretation and that is interposable within a sequence of the control tags, and an ambiguous interposable (AI) category that is assigned to a control tag in which the control tag has an ambiguous parsing interpretation and in which the control tag is interposable within the sequence of the control tags. The method may further include determining parsing operations to perform for the packet based on the classified categories of the control tags and based on the packet stream of the packet.

Packet parsing and control packet classification

A network device may receive a packet including control tags in a header portion of the packet and may extract candidate tags from the control tags in the header portion of the packet. The network device may compress, using a first lookup table, the candidate tags to obtain keys corresponding to the candidate tags, where each of the keys is represented in a compressed format relative to the corresponding candidate tags. The network device may further determine a final key based on the first keys and determine a priority class for the packet based on a lookup operation of the final key into a second lookup table. The network device may further write the packet, or a reference to the packet, to a selected priority queue, of a number of priority queues, where the priority queue is selected based on the determined priority class.

Fixed latency priority classifier for network data

A network device includes an interface (), a TCP/IP protocol fast processing path (), and a TCP/IP protocol slow processing path (). The interface () receives a packet and parses the packets to determine a characteristic of the packet. The TCP/IP protocol fast processing path () processes the packet if the characteristic of the packet includes a first characteristic. The TCP/IP protocol slow processing path () processes the packet if the characteristic of the packet includes a second characteristic.

Systems and methods for accelerating TCP/IP data stream processing

Principles of the invention are directed to techniques for allowing a router forwarding packets within a computer network to perform two or more forwarding tree decisions per memory access. The router may implement forwarding information in the form of a radix tree having a number of nodes, and received packets may contain keys identifying a packet destination. The router may traverse the tree by testing two or more path control bits within the key per each of the traversed nodes. The values of the path control bits in the key determine the path traversed along the tree. The router also stores intermediate bit patterns at each node and tests intermediate bits in the key to determine whether a particular node is the best match to the routing prefix contained in the key, thereby eliminating a need to backtrack up the tree.

Growing community of inventors

Los Altos Hills, CA, United States of America

Jean Marc Frailong