Cisco Technology, Inc.

International Business Machines Corporation

Kenneth Harvey Potter, Jr

Kara J Adams

David A Carroll

Brian Mitchell Bass

Jeffrey Haskell Derby

Marc Adam Kaplan

John E Drake, Jr

John G Dudley

Marcia Lambert Peters

Israel Cidon

Roch A Guerin

David Richard Barach

Gerald Arnold Marin

Jeffery B Scott

John Mitten

Scott Nellenbach

Kent H Hoult

Jeffrey Wayne Kidd

John K Fitzgerald

Hong-Man Wu

Robert W Downes

George Michel Abdelnour

Robert William Bartoldus

Arthur Latimer Bond

Frederick K Yu

Carson Stuart

Christopher G Riedle

Gary William Kramling

Michael Steven Siegel

Robert C Olsen

Norman Clark Strole

John Joseph Williams, Jr

Praveen Jain

Michael L Wright

John Andrew Fingerhut

Mark Andrew Gustlin

Edward Joel Rovner

Kenneth Michael Key

Guy Fedorkow

Edward Hau-chun Ku

Christopher J Kappler

Inder Sarat Gopal

Shay Kutten

James P Janniello

Douglas Ray Henderson

Robert E Jeter, Jr

Claude Alan Cartee

Randall Graham Campbell

Elizabeth A Hervatic

Jack S Chorpenning

David William Davenport

Theodore E Tedijanto

William Craig Troop

Timothy Droz

Edward D Paradise

Richard M Doney

Francis R Koperda

Sidney Brower Schrum, Jr

Kevin R Lingle

Eric Decker

Mark Savoldi

Wayne Garavaglia

Sequences of items may be maintained using ordered locks. These items may correspond to anything, but using ordered locks to maintain sequences of packets may be particularly useful. One implementation uses a locking request, acceptance, and release protocol. One implementation associates instructions with locking requests such that when a lock is acquired, the locking mechanism executes or causes to be executed the associated instructions as an acceptance request of the lock is implied by the association of instructions (or may be explicitly requested). In some applications, the ordering of the entire sequence of packets is not required to be preserved, but rather only among certain sub-sequences of the entire sequence of items, which can be accomplished by converting an initial root ordered lock (maintaining the sequence of the entire stream of items) to various other locks (each maintaining a sequence of different sub-streams of items).

Using ordered locking mechanisms to maintain sequences of items such as packets

Presently disclosed is an apparatus and method for returning control of bandwidth allocation and packet scheduling to the routing engine in a network communications device containing an ATM interface. Virtual circuit (VC) flow control is augmented by the addition of a second flow control feedback signal from each virtual path (VP). VP flow control is used to suspend scheduling of all VCs on a given VP when traffic has accumulated on enough VCs to keep the VP busy. A new packet segmenter is employed to segment traffic while preserving the first in, first out (FIFO) order in which packet traffic was received. Embodiments of the invention may be implemented using a two-level (per-VC and per-VP) scheduling hierarchy or may use as many levels of flow control feedback-derived scheduling as may be necessitated by multilevel scheduling hierarchies.

Hierarchical flow control for router ATM interfaces

A technique non-disruptively recovers from a processor failure in a multi-processor flow device, such as an intermediate network node of a computer network. Data relating to a particular data flow of a processor within the node is tagged with specific information used to detect and recover from a failure of the processor without affecting data from other processors of the node. A data path management device tags the data with the specific information reflecting the processor issuing the data and a state of the processor. When the tagged data subsequently passes through the data path management device, the specific information is compared with current information for the issuing processor. If the comparison indicates that the specific information is valid, the data path management device forwards the related data flow through the node. If the comparison indicates that the specific information is invalid, the data and its related data flow are discarded and 'cleanly' purged from the node.

Technique for nondisruptively recovering from a processor failure in a multi-processor flow device

In one embodiment a set of threads are assigned in a particular order to an order group. The first assigned thread is treated as being, at least initially, at a head-of-line (HOL) for the order group. Each thread of the set is assigned a separate sequence number, each sequence number indicating the order in which the respective thread was assigned to the order group. A given thread is prevented from performing at least some of the given thread's instruction sequence until the given thread reaches the HOL of the order group as indicated by a modifiable HOL sequence value.

System and method for dynamic ordering in a network processor

A dynamic addressing technique mirrors data across multiple banks of a memory resource. Information stored in the memory banks is organized into separately addressable blocks, and memory addresses include a mirror flag. To write information mirrored across two memory banks, a processor issues a single write transaction with the mirror flag asserted. A memory controller detects that the mirror flag is asserted and, in response, waits for both memory banks to become available. At that point, the memory controller causes the write to be performed at both banks. To read data that has been mirrored across two memory banks, the processor issues a read with the mirror flag asserted. The memory controller checks the availability of both banks having the desired information. If either bank is available, the read request is accepted and the desired data is retrieved from the available bank and returned to the processor.

System and method for dynamic mirror-bank addressing

A data path protocol eliminates most of the conventional read transactions required to transfer data between devices interconnected by a split transaction bus, such as a HyperTransport (HPT) bus. To that end, each device is configured to manage its own set of buffer descriptors, unlike previous data path protocols in which only one device managed all the buffer descriptors. As such, neither device has to perform a read transaction to retrieve a 'free' buffer descriptor from the other device. As a result, only write transactions are performed for transferring descriptors across the HPT bus, thereby decreasing the amount of traffic over the bus and eliminating conventional latencies associated with read transactions. In addition, because descriptors are separately managed in each device, the data path protocol also conserves processing bandwidth that is traditionally consumed by managing ownership of the buffer descriptors within a single device.

Hypertransport data path protocol

A buffer-management technique efficiently manages a set of data buffers accessible to first and second devices interconnected by a split transaction bus, such as a Hyper-Transport (HPT) bus. To that end, a buffer manager controls access to a set of 'free' buffer descriptors, each free buffer descriptor referencing a corresponding buffer in the set of data buffers. Advantageously, the buffer manager ensures that the first and second devices are allocated a sufficient number of free buffer descriptors for use in a HPT data path protocol in which the first and second devices have access to respective sets of free buffer descriptors. Because buffer management over the HPT bus is optimized by the buffer manager, the amount of processing bandwidth traditionally consumed managing descriptors can be reduced.

Buffer management technique for a hypertransport data path protocol

The present invention comprises a scheduling assist function (scheduling assist) that enables a processor to schedule events and be notified when these events expire. In addition, the present invention includes features that enable a processor to associate these events with output channels and enable the processor to quickly locate output channels (links) that are available and ready to be serviced. The invention takes advantage of the fact that the scheduling assist can be dedicated exclusively to scanning tables in its own dedicated memories looking for events that have expired and/or output channels that are available and not involve the processor in the search for output channels that are available and ready to be serviced.

Scheduling assist for data networking packet dequeuing in a parallel 1-D systolic array system

A system and method maintains order among a plurality of threads in a multi-threaded processing system. The processing system, which may be disposed at an intermediate network device, has a plurality of processors each supporting a plurality of threads. The ordering system includes a dispatcher that assigns work, such as the processing of received packets to free threads, an order manager that keeps track of the relative order of the threads, and a thread client associated with each thread for enforcing the determined order. Packets to be processed by the processing system are assigned to an initial order group by the order manager based on a selected attribute, and those packets sharing the same attribute value are assigned to the same order group. During processing, a thread may request reassignment to other order groups in response to other attributes of the packets. The order manager preferably manages the switching of threads among order groups and ensures that the threads within each order group process their packets in order.

Message processing in network forwarding engine by tracking order of assigned thread in order group

A technique efficiently transports token ring (TR) frames over trunks interconnecting switches of a distributed TR bridge. The TR bridge is characterized by a logical switch fabric that is distributed among the interconnected switches by the trunks, which are preferably interswitch link (ISL) trunks. Each switch includes a Bridge Relay Function (BRF) coupled to a plurality of Concentrator Relay Functions (CRFs) having a plurality of ports for receiving TR frames over TR segments. The BRF and CRF of the distributed TR bridge operate according to a 2-tier switching model wherein each CRF and BRF is assigned an individual virtual local area network identifier. The technique encapsulates the TR frames in a TR-ISL protocol format that accomodates differences in formats of various TR frames and that comports with the 2-tier switching model of the distributed TR bridge.

Switched token ring over ISL (TR-ISL) network

A Distributed Ring Protocol (DRiP) arrangement includes a database and protocol for maintaining and distributing information within a distributed token ring (TR) bridge having a logical switch fabric that is distributed over a TR switching network of switches interconnected by trunk links, such as Inters witch Link (ISL) trunks. The DRiP information is used by switches within the ISL switched fabric to determine the status (configured and/or activated) and association (within a switch) of ports of the distributed bridge.

Distributed ring protocol and database

A backup CRF VLAN arrangement provides an alternate, redundant path for traffic between undistributed Concentrator Relay Functions (CRFs) located on separate switches interconnected by trunk links of a distributed token ring bridge. The backup CRF virtual local area network (VLAN) arrangement defines a backup network path which may be utilized if a primary active path is not a valid path to a backup network. Notably, the backup network comprises a special type of CRF that is distributed among the switches, but that has only one port active at any given time.

Backup CRF VLAN

A distributed token ring (TR) bridge has a logical switch fabric that is distributed over a TR switching network of switches interconnected by trunk links. The distributed TR bridge includes a plurality of TR switches, each having a Bridge Relay Function (BRF) logically coupled to at least one Concentrator Relay Function (CRF). Distribution of the switch fabric essentially comprises logically distributing the BRF function among the network of switches.

Token ring bridge distributed in a switched fabric

A LAN interconnect device includes a plurality of Frame Processing Units (FPUs) for coupling each port of the device to a switch fabric. Each one of the Frame Processing Units includes an input section with input logic which prepares LS Headers and appends each one to a block of the frame as the block is forwarded to the switch fabric. The FPU, also, includes an output section with copy logic for copying and assembling frames to be forwarded to devices connected to the port. The copy decision is based upon the LS Header and configuration information in the port.

LAN frame copy decision for LAN switches

A multi-port switching device architecture decouples decode logic circuitry of each port of a network switch from its respective state machine logic circuitry and organizes the state machine logic as pools of transmit/receive engine resources that are shared by each of the decode logic circuits. Intermediate priority logic of the switching device cooperates with the decode logic and pooled resources to allocate frames among available resources in accordance with predetermined ordering and fairness policies. These policies prevent misordering of frames from a single source while ensuring that all ports in the device are serviced fairly.

Pooled receive and transmit queues to access a shared bus in a multi-port switch asic

Growing community of inventors

Raleigh, NC, United States of America

Kenneth Harvey Potter, Jr