EP1380127A2 - Commutateur de reseau a haute performance - Google Patents

Commutateur de reseau a haute performance

Info

Publication number
EP1380127A2
EP1380127A2 EP01996937A EP01996937A EP1380127A2 EP 1380127 A2 EP1380127 A2 EP 1380127A2 EP 01996937 A EP01996937 A EP 01996937A EP 01996937 A EP01996937 A EP 01996937A EP 1380127 A2 EP1380127 A2 EP 1380127A2
Authority
EP
European Patent Office
Prior art keywords
data
cell
cells
wide
packet
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Withdrawn
Application number
EP01996937A
Other languages
German (de)
English (en)
Inventor
Andrew Chang
Ronak Patel
Ming G. Wong
Yu-Mei Lin
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Foundry Networks LLC
Original Assignee
Foundry Networks LLC
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Priority claimed from US09/855,038 external-priority patent/US7236490B2/en
Priority claimed from US09/855,031 external-priority patent/US6697368B2/en
Priority claimed from US09/855,015 external-priority patent/US7356030B2/en
Priority claimed from US09/855,025 external-priority patent/US20020091884A1/en
Priority claimed from US09/855,024 external-priority patent/US6735218B2/en
Application filed by Foundry Networks LLC filed Critical Foundry Networks LLC
Publication of EP1380127A2 publication Critical patent/EP1380127A2/fr
Withdrawn legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00—Packet switching elements
    • H04L49/55—Prevention, detection or correction of errors
    • H04L49/552—Prevention, detection or correction of errors by ensuring the integrity of packets received through redundant connections
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00—Packet switching elements
    • H04L49/15—Interconnection of switching modules
    • H04L49/1515—Non-blocking multistage, e.g. Clos
    • H04L49/153—ATM switching fabrics having parallel switch planes
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00—Packet switching elements
    • H04L49/15—Interconnection of switching modules
    • H04L49/1515—Non-blocking multistage, e.g. Clos
    • H04L49/153—ATM switching fabrics having parallel switch planes
    • H04L49/1538—Cell slicing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00—Packet switching elements
    • H04L49/30—Peripheral units, e.g. input or output ports
    • H04L49/3063—Pipelined operation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00—Packet switching elements
    • H04L49/30—Peripheral units, e.g. input or output ports
    • H04L49/3072—Packet splitting
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00—Packet switching elements
    • H04L49/25—Routing or path finding in a switch fabric
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00—Packet switching elements
    • H04L49/35—Switches specially adapted for specific applications
    • H04L49/351—Switches specially adapted for specific applications for local area network [LAN], e.g. Ethernet switches
    • H04L49/352—Gigabit ethernet switching [GBPS]

Definitions

  • the invention relates generally to network switches.
  • a network switch is a device that provides a switching function (i.e., it determines a physical path) in a data communications network. Switching involves transferring information, such as digital data packets or frames, among entities of the network.
  • a switch is a computer having a plurality of circuit cards coupled to a backplane.
  • the circuit cards are typically called “blades.”
  • the blades are interconnected by a "switch fabric.”
  • Each blade includes a number of physical ports that couple the switch to the other network entities over various types of media, such as Ethernet, FDDI (Fiber Distributed Data Interface), or token ring connections.
  • a network entity includes any device that transmits and/or receives data packets over such media.
  • the switching function provided by the switch typically includes receiving data at a source port from a network entity and transferring the data to a destination port.
  • the source and destination ports may be located on the same or different blades. In the case of "local" switching, the source and destination ports are on the same blade. Otherwise, the source and destination ports are on different blades and switching requires that the data be transferred through the switch fabric from the source blade to the destination blade. In some case, the data may be provided to a plurality of destination ports of the switch. This is known as a multicast data transfer.
  • Switches operate by examining the header information that accompanies data in the data frame.
  • the header information includes the international standards organization (ISO) 7-layer OSI (open-systems interconnection model).
  • ISO international standards organization
  • switches generally route data frames based on the lower level protocols such as Layer 2 or Layer 3.
  • routers generally route based on the higher level protocols and by determining the physical path of a data frame based on table look-ups or other configured forwarding or management routines to determine the physical path (i.e., route).
  • Ethernet is a widely used lower-layer network protocol that uses broadcast technology.
  • the Ethernet frame has six fields. These fields include a preamble, a destination address, source address, type, data and a frame check sequence.
  • the digital switch will determine the physical path of the frame based on the source and destination addresses.
  • Standard Ethernet operates at a 10 Mbps data rate.
  • Another implementation of Ethernet known as "Fast Ethernet” (FE) has a data rate of 100 Mbps.
  • FE operates at 10 Gbps.
  • a digital switch will typically have physical ports that are configured to communicate using different protocols at different data rates.
  • a blade within a switch may have certain ports that are 10 Mbps, or 100 Mbps ports. It may have other ports that conform to optical standards such as SONET and are capable of such data rates as 10 Gbps.
  • a performance of a digital switch is often assessed based on metrics such as the number of physical ports that are present, and the total bandwidth or number of bits per second that can be switched without blocking or slowing the data traffic.
  • a limiting factor in the bit carrying capacity of many switches is the switch fabric. For example, one conventional switch fabric was limited to 8 gigabits per second per blade. In an eight blade example, this equates to 64 gigabits per second of traffic. It is possible to increase the data rate of a particular blade to greater than 8 gigabits per second. However, the switch fabric would be unable to handle the increased traffic.
  • the present invention provides a high-performance network switch.
  • Serial link technology is used in a switching fabric.
  • Serial data streams rather than parallel data streams, are switched in a switching fabric.
  • Blades output serial data streams in serial pipes.
  • a serial pipe can be a number of serial links coupling a blade to the switching fabric.
  • the serial data streams represent an aggregation of input serial data streams provided through physical ports to a respective blade.
  • Each blade outputs serial data streams with in-band control information in multiple stripes to the switching fabric.
  • the serial data streams carry packets of data in wide striped cells across multiple stripes.
  • Wide striped cells are encoded.
  • In- band control information is carried in one or more blocks of a wide cell.
  • the initial block of a wide cell includes control information and state information.
  • the control information and state information is carried in each stripe.
  • the control information and state information is carried in each sub-block of the initial block of a wide cell.
  • the control information and state information is available in-band in the serial data streams (also called stripes).
  • Control information is provided in-band to indicate traffic flow conditions, such as, a start of cell, an end of packet, abort, or other error conditions.
  • a wide cell has one or more blocks. Each block extends across five stripes. Each block has a size of twenty bytes made up of five sub-blocks each having a size of four bytes. In one example, a wide cell has a maximum size of eight blocks (160 bytes) which can carry 148 bytes of payload data and 12 bytes of in-band control information. Packets of data for full-duplex traffic can be carried in the wide cells at a 50 Gbps rate in each direction through one ' slot of the digital switch. According to one feature, the choice of maximum wide cell block size of 160 bytes as determined by the inventors allows a 4 x 10 Gbps Ethernet (also called 4 X 10 GE) line rate to be maintained through the backplane interface adapter. This line rate is maintained for Ethernet packets having a range of sizes accepted in the Ethernet standard including, but not limited to, packet sizes between 84 and 254 bytes.
  • 4 x 10 Gbps Ethernet also called 4 X 10 GE
  • a digital switch has a plurality of blades coupled to a switching fabric via serial pipes.
  • the switching fabric can be provided on a backplane and/or one or more blades. Each blade outputs serial data streams with in-band control information in multiple stripes to the switching fabric.
  • the switching fabric includes a plurality of cross points corresponding to the multiple stripes. Each cross point has a plurality of port slices coupled to the plurality of blades. In one embodiment five stripes and five cross points are used.
  • Each blade has five serial links coupled to each of the five cross points respectively.
  • the serial pipe coupling a blade to switching fabric is a 50Gbps serial pipe made up of five lOGbps serial links. Each of the lOGbps serial links is coupled to a respective cross point and carries a serial data stream.
  • the serial data stream includes a data slice of a wide cell that corresponds to one stripe.
  • each blade has a backplane interface adapter (BIA).
  • the BIA has three traffic processing flow paths.
  • the first traffic processing flow path extends in traffic flow direction from local packet processors toward a switching fabric.
  • the second traffic processing flow path extends in traffic flow direction from the switching fabric toward local packet processors.
  • a third traffic processing flow path carried local traffic from the first traffic processing flow path. This local traffic is sorted and routed locally at the BIA without having to go through the switching fabric.
  • the BIA includes one or more receivers, wide cell generators, and transmitters along the first path.
  • the receivers receive narrow input cells carrying packets of data. These narrow input cells are output from packet processor(s) and/or from integrated bus translators (IBTs) coupled to packet processors.
  • IBTs integrated bus translators
  • the BIA includes one or more wide cell generators.
  • the wide cell generators generate wide striped cells carrying the packets of data received by the BIA in the narrow input cells.
  • the transmitters transmit the generated wide striped cells in multiple stripes to the switching fabric.
  • the wide cells extend across multiple stripes and include in-band control information in each stripe.
  • each wide cell generator parses each narrow input cell, checks for control information indicating a start of packet, encodes one or more new wide striped cells until data from all narrow input cells of the packet is distributed into the one or more new wide striped cells, and writes the one or more new wide striped cells into a plurality of send queues.
  • the BIA has four deserializer receivers, 56 wide cell generators, and five serializer transmitters.
  • the four deserializer receivers receive narrow input cells output from up to eight originating sources (that is, up to two IBTs or packet processors per deserializer receiver).
  • the 56 wide cell generators receive groups of the received narrow input cells sorted based on destination slot identifier and originating source.
  • the five serializer transmitters transmit the data slices of the wide cell that corresponds to the stripes.
  • a BIA can also include a traffic sorter which sorts received narrow input cells based on a destination slot identifier.
  • the traffic sorter comprises both a global/traffic sorter and a backplane sorter.
  • the global/traffic sorter sorts received narrow input cells having a destination slot identifier that identifies a local destination slot from received narrow input cells having destination slot identifier that identifies global destination slots across the switching fabric.
  • the backplane sorter further sorts received narrow input cells having destination slot identifiers that identify global destination slots into groups based on the destination slot identifier.
  • the BIA also includes a plurality of stripe send queues and a switching fabric transmit arbitrator.
  • the switching fabric transmit arbitrator arbitrates the order in which data stored in the stripe send queues is sent by the transmitters to the switching fabric. In one example, the arbitration proceeds in a round-robin fashion.
  • Each stripe send queue stores a respective group of wide striped cells corresponding a respective originating source packet processor and a destination slot identifier.
  • Each wide striped cell has one or more blocks across multiple stripes.
  • the switching fabric transmit arbitrator selects a stripe send queue and pushes the next available cell (or even one or more blocks of a cell at time) to the transmitters. Each stripe of a wide cell is pushed to the respective transmitter for that stripe.
  • the BIA includes one or more receivers, wide/narrow cell translators, and transmitters along the second path.
  • the receivers receive wide striped cells in multiple stripes from the switching fabric.
  • the wide striped cells carry packets of data.
  • the translators translate the received wide striped cells to narrow input cells carrying the packets of data.
  • the transmitters then transmit the narrow input cells to corresponding destination packet processors or IBTs.
  • the five deserializer receivers receive five sub-blocks of wide striped cells in multiple stripes.
  • the wide striped cells carrying packets of data across the multiple stripes and including destination slot identifier information.
  • the BIA further includes stripe interfaces and stripe receive synchronization queues.
  • Each stripe interface sorts received sub- blocks in each stripe based on originating slot identifier information and stores the sorted received sub-blocks in the stripe receive synchronization queues.
  • the BIA further includes along the second traffic flow processing path an arbitrator, a striped-based wide cell assembler, and the narrow/wide cell translator.
  • the arbitrator arbitrates an order in which data stored in the stripe receive synchronization queues is sent to the striped-based wide cell assembler.
  • the striped-based wide cell assembler assembles wide striped cells based on the received sub-blocks of data.
  • a narrow/wide cell translator then translates the arbitrated received wide striped cells to narrow input cells carrying the packets of data.
  • a second level of arbitration is also provided according to an embodiment of the present invention.
  • the BIA further includes destination queues and a local destination transmit arbitrator in the second path.
  • the destination queues store narrow cells sent by a local traffic sorter (from the first path) and the narrow cells translated by the translator (from the second path.
  • the local destination transmit arbitrator arbitrates an order in which narrow input cells stored in the destination queues is sent to serializer transmitters.
  • serializer transmitters then that transmits the narrow input cells to corresponding IBTs and/or source packet processors (and ultimately out of a blade through physical ports).
  • system and method for encoding wide striped cells is provided.
  • the wide cells extend across multiple stripes and include in-band control information in each stripe. State information, reserved information, and payload data may also be included in each stripe.
  • a wide cell generator encodes one or more new wide striped cells.
  • the wide cell generator encodes an initial block of a start wide striped cell with initial cell encoding information.
  • the initial cell encoding information includes control information (such as, a special K0 character) and state information provided in each sub-block of an initial block of a wide cell.
  • the wide cell generator further distributes initial bytes of packet data into available space in the initial block. Remaining bytes of packet data are distributed across one or more blocks in of the first wide striped cell (and subsequent wide cells) until an end of packet condition is reached or a maximum cell size is reached.
  • the wide cell generator further encodes an end wide striped cell with end of packet information that varies depending upon the degree to which data has filled a wide striped cell. In one encoding scheme, the end of packet information varies depending upon a set of end of packet conditions including whether the end of packet occurs at the end of an initial block, within a subsequent block after the initial block, at a block boundary, or at a cell boundary.
  • a method for interfacing serial pipes carrying packets of data in narrow input cells and a serial pipe carrying packets of data in wide striped cells includes receiving narrow input cells, generating wide striped cells, and transmitting blocks of the wide striped cells across multiple stripes.
  • the method can also include sorting the received narrow input cells based on a destination slot identifier, storing the generated wide striped cells in corresponding stripe send queues based on a destination slot identifier and an originating source packet processor, and arbitrating the order in which the stored wide striped cells are selected for transmission.
  • the generating step includes parsing each narrow input cell, checking for control information that indicates a start of packet, encoding one or more new wide striped cells until data from all narrow input cells carrying the packet is distributed into the one or more new wide striped cells, and writing the one or more new wide striped cells into a plurality of send queues.
  • the encoding step includes encoding an initial block of a start wide striped cell with initial cell encoding information, such as, control information and state information.
  • Encoding can further include distributing initial bytes of packet data into available space in an initial block of a first wide striped cell, adding reserve information to available bytes at the end of the initial block of the first wide striped cell, distributing remaining bytes of packet data across one or more blocks in the first wide striped cell until an end of packet condition is reached or a maximum cell size is reached, and encoding an end wide striped cell with end of packet information.
  • the end of packet information varies depending upon a set of end of packet conditions including whether the end of packet occurs at the end of an initial block, in any block after the initial block, at a block boundary, or at a cell boundary.
  • the method also includes receiving wide striped cells carrying packets of data in multiple stripes from a switching fabric, translating the received wide striped cells to narrow input cells carrying the packets of data, and transmitting the narrow input cells to corresponding source packet processors.
  • the method further includes sorting the received sub-blocks in each stripe based on originating slot identifier information, storing the sorted received sub-blocks in stripe receive synchronization queues, and arbitrating an order in which data stored in the stripe receive synchronization queues is assembled.
  • Additional steps are assembling wide striped cells in the order of the arbitrating step based on the received sub-blocks of data, translating the arbitrated received wide striped cells to narrow input cells carrying the packets of data, and storing narrow cells in a plurality of destination queues.
  • further arbitration is performed including arbitrating an order in which data stored in the destination queues is to be transmitted and transmitting the narrow input cells in the order of the further arbitrating step to corresponding source packet processors and/or IBTs.
  • the present invention further provides error detection and recovery.
  • an administrative module includes a level monitor, stripe synchronization error detector, a flow controller, and a control character presence tracker.
  • the level monitor monitors data received at a receiving blade.
  • the stripe synchronization error detector detects a stripe synchronization error based on the amount of data monitored by the level monitor.
  • Example stripe synchronization errors include an incoming link error, a cross-point failure, and an outgoing link error.
  • the data received at a receiving blade is sorted, based on stripe and source information and stored in a set of data structures (e.g., FIFOs).
  • the level monitor monitors the levels of data stored in each data structure.
  • the stripe synchronization error detector detects at least one of an overflow and underflow condition in the amount of data received on a respective stripe from a particular source.
  • the flow controller initiates a recovery routine to re-synchronize data across the stripes in response to detection of a stripe synchronization error.
  • the control character presence tracker identifies the presence of a K2 character during the recovery routine.
  • the present invention further includes a method for detecting stripe synchronization error in a network switch, including the steps of: sorting data received at a receiving slot based on stripe and source information; storing the sorted data in a set of data structures; monitoring the levels of data stored in each data structure; and detecting at least one of an overflow and underflow condition in the amount of data received on a respective stripe from a particular source.
  • the source information can identify a slot that sent the data across a switching fabric of the network switch, or can identify a source packet processor that sent the data from a slot across a switching fabric of the network switch.
  • the present invention further includes a method for maintaining synchronization of striped cell traffic, comprising the steps of: sending a common character in striped cells in all lanes for a predetermined number of cycles; evaluating the common control characters received at stripe receive synchronization queues; and detecting when an in-synch condition is present that indicates the stripe receive synchronization queues have been cleared.
  • the present invention further includes a method for managing out-of- synchronization traffic flow through a cross-point switch in a switching fabric, comprising: monitoring the level of stripe-receive-synchronization queues; determining whether an out-of-synchronization condition exists; and initiating a re-synchronization routine when said out-of-synchronization condition exists.
  • the re-synchronization routine can include the steps of: sending a common character in striped cells in all lanes for a predetermined number of cycles; evaluating the common control characters received at stripe receive synchronization queues; and detecting when an in-synch condition is present that indicates the stripe receive synchronization queues have been cleared.
  • a redundant switching system is provided.
  • the redundant switching syste includes two switching blades and at least one ingress/egress blade (or slave blade). Each switching blade has a plurality of cross points corresponding to respective stripes of serial data streams. Each ingress/egress blade is coupled to each switching blade through a backplane connection. Each ingress/egress blade also includes a plurality of redundant fabric transceivers (RFTs). The RFTs can switch traffic between the cross points on the two switching blades. This provides redundancy.
  • RFTs redundant fabric transceivers
  • a redundant fabric transceiver is coupled to a bus interface adapter and includes one or more first and second ports, a multiplexer, a downlink transceiver, and an uplink transceiver.
  • the multiplexer selects communication data from similar data for transmission.
  • the downlink transceiver receives, conditions, and transmits the communication data.
  • the uplink transceiver also receives, conditions, and transmits communication data.
  • a register module can be used that includes condition information that indicates operations for at least one of the downlink transceiver and the uplink transceiver, wherein the condition information includes configuration and parameter settings for received and transmitted data.
  • FIG. 1 is a diagram of a high-performance network switch according to an embodiment of the present invention.
  • FIG. 2 is a diagram of a high-performance network switch showing a switching fabric having cross point switches coupled to blades according to an embodiment of the present invention.
  • FIG. 3A is a diagram of blade used in the high-performance network switch of FIG. 1 according to an embodiment of the present invention.
  • FIG. 3B shows a configuration of blade according another embodiment of the present invention.
  • FIG. 4 is a diagram of the architecture of a cross point switch with port slices according to an embodiment of the present invention.
  • FIG. 5 is a diagram of the architecture of a port slice according to an embodiment of the present invention.
  • FIG. 5 is a diagram of the architecture of a port slice according to an embodiment of the present invention.
  • FIG. 6 is a diagram of a backplane interface adapter according to an embodiment of the present invention.
  • FIG. 7 is a diagram showing a traffic processing path for local serial traffic received at a backplane interface adapter according to an embodiment of the present invention.
  • FIG. 8 is a diagram of an example switching fabric coupled to a backplane interface adapter according to an embodiment of the present invention.
  • FIG. 9 is a diagram showing a traffic processing path for backplane serial traffic received at the backplane interface adapter according to an embodiment of the present invention.
  • FIG. 10 is a flowchart of operational steps carried out along a traffic processing path for local serial traffic received at a backplane interface adapter according to an embodiment of the present invention. [0049] FIG.
  • FIG. 11 is a flowchart of operational steps carried out along a traffic processing path for backplane serial traffic received at the backplane interface adapter according to an embodiment of the present invention.
  • FIG. 12 is a flowchart of a routine for generating wide striped cells according to an embodiment of the present invention.
  • FIG. 13 is a diagram illustrating a narrow cell and state information used in the narrow cell according to an embodiment of the present invention.
  • FIG. 14 is a flowchart of a routine for encoding wide striped cells according to an embodiment of the present invention.
  • FIG. 15A is a diagram illustrating encoding in a wide striped cell according to an embodiment of the present invention.
  • FIG. 15A is a diagram illustrating encoding in a wide striped cell according to an embodiment of the present invention.
  • FIG. 15B is a diagram illustrating state information used in a wide striped cell according to an embodiment of the present invention.
  • FIG. 15C is a diagram illustrating end of packet encoding information used in a wide striped cell according to an embodiment of the present invention.
  • FIG. 15D is a diagram illustrating an example of a cell boundary alignment condition during the transmission of wide striped cells in multiple stripes according to an embodiment of the present invention.
  • FIG. 16 is a diagram illustrating an example of a packet alignment condition during the transmission of wide striped cells in multiple stripes according to an embodiment of the present invention.
  • FIG. 17 illustrates a block diagram of a bus translator according to one embodiment of the present invention. [0059] FIG.
  • FIG. 18 illustrates a block diagram of the reception components according to one embodiment of the present invention.
  • FIG. 19 illustrates a block diagram of the transmission components according to one embodiment of the present invention.
  • FIG. 20 illustrates a detailed block diagram of the bus translator according to one embodiment of the present invention.
  • FIG. 21A illustrates a detailed block diagram of the bus translator according to another embodiment of the present invention.
  • FIG. 21B shows a functional block diagram of the data paths with reception components of the bus translator according to one embodiment of the present invention.
  • FIG. 21C shows a functional block diagram of the data paths with transmission components of the bus translator according to one embodiment of the present invention.
  • FIG. 21A illustrates a detailed block diagram of the bus translator according to another embodiment of the present invention.
  • FIG. 21B shows a functional block diagram of the data paths with reception components of the bus translator according to one embodiment of the present invention.
  • FIG. 21C shows a functional block diagram of the data paths with transmission components of the bus translator according to one embodiment of the present invention.
  • FIG. 2 ID shows a functional block diagram of the data paths with native mode reception components of the bus translator according to one embodiment of the present invention.
  • FIG. 21E shows a block diagram of a cell format according to one embodiment of the present invention.
  • FIG. 22 illustrates a flow diagram of the encoding process of the bus translator according to one embodiment of the present invention.
  • FIGS. 23A-B illustrates a detailed flow diagram of the encoding process of the bus translator according to one embodiment of the present invention.
  • FIG. 24 illustrates a flow diagram of the decoding process of the bus translator according to one embodiment of the present invention.
  • FIG. 25A-B illustrates a detailed flow diagram of the decoding process of the bus translator according to one embodiment of the present invention.
  • FIG. 26 illustrates a flow diagram of the administrating process of the bus translator according to one embodiment of the present invention.
  • FIGs. 27A-27E show a routine for processing data in port slice based on wide cell encoding and a flow control condition according to one embodiment of the present invention.
  • FIG. 28A shows a block diagram of an administrative module according to one embodiment of the present invention.
  • FIG. 28B shows a block diagram of the cross point architecture according to one embodiment of the present invention.
  • FIG. 29 illustrates a routine for maintaining synchronization of striped cell traffic according to one embodiment of the present invention.
  • FIG. 30 illustrates a routine for detecting out of synchronization traffic flow through a cross point switch with a backplane switching fabric according to one embodiment of the present invention.
  • FIG. 31 shows an example of how an error condition in an incoming link is evident in the levels of data present in receiving blade synch queues sorted by stripe and source according to one embodiment of the present invention.
  • FIGs. 32A-B show block diagrams of example architectures according to embodiments of the present invention.
  • FIG. 33A shows a block diagram of a redundant fabric transceiver enabled blade module according to one embodiment of the present invention.
  • FIG. 33B shows a block diagram of a redundant fabric transceiver according to one embodiment of the present invention.
  • FIG. 34A shows a table showing the cell characters across five stripes according to one embodiment of the present invention.
  • FIG. 34B illustrates a routine for a K2 (special character) synchronization sequence according to one embodiment of the present invention.
  • FIG. 35 shows a block diagram of a synchronous flow control implementation of the redundant fabric transceivers according to one embodiment of the present invention.
  • FIG. 36 shows a timing diagram of the time domain multiplexing of a synchronous flow control implementation according to one embodiment of the present invention.
  • FIG. 37 shows a block diagram of an asynchronous flow control implementation of the redundant fabric transceivers according to one embodiment of the present invention.
  • the present invention is a high-performance digital switch. Blades are coupled through serial pipes to a switching fabric. Serial link technology is used in the switching fabric. Serial data streams, rather than parallel data streams, are switched through a loosely striped switching fabric. Blades output serial data streams in the serial pipes.
  • a serial pipe can be a number of serial links coupling a blade to the switching fabric.
  • the serial data streams represent an aggregation of input serial data streams provided through physical ports to a respective blade.
  • Each blade outputs serial data streams with in- band control information in multiple stripes to the switching fabric.
  • the serial data streams carry packets of data in wide striped cells across multiple loosely-coupled stripes. Wide striped cells are encoded. In- band control information is carried in one or more blocks of a wide striped cell.
  • each blade of the switch is capable of sending and receiving 50 gigabit per second full-duplex traffic across the backplane. This is done to assure line rate, wire speed and non-blocking across all packet sizes.
  • the high-performance switch according to the present invention can be used in any switching environment, including but not limited to, the Internet, an enterprise system, Internet service provider, and any protocol layer switching (such as, Layer 2, Layer 3, or Layers 4-7 switching).
  • any protocol layer switching such as, Layer 2, Layer 3, or Layers 4-7 switching.
  • switch fabric or “switching fabric” refer to a switchable interconnection between blades.
  • the switch fabric can be located on a backplane, a blade, more than one blade, a separate unit from the blades, or on any combination thereof.
  • packet processor refers to any type of packet processor, including but not limited to, an Ethernet packet processor. A packet processor parses and determines where to send packets.
  • serial pipe refers to one or more serial links.
  • a serial pipe is a 10 Gbps serial pipe and includes four 2.5 Gbps serial links.
  • serial link refers to a data link or bus carrying digital data serially between points. A serial link at a relatively high bit rate can also be made of a combination of lower bit rate serial links.
  • stripe refers to one data slice of a wide cell. The term
  • loosely-coupled stripes refers to the data flow in stripes which is autonomous with respect to other stripes. Data flow is not limited to being fully synchronized in each of the stripes, rather, data flow proceeds independently in each of the stripes and can be skewed relative to other stripes.
  • Switch 100 includes a switch fabric 102 (also called a switching fabric or switching fabric module) and a plurality of blades 104.
  • switch 100 includes 8 blades 104a-104h.
  • Each blade 104 communicates with switch fabric 102 via serial pipe 106.
  • Each blade 104 further includes a plurality of physical ports 108 for receiving various types of digital data from one or more network connections.
  • switch 100 having 8 blades is capable of switching of 400 gigabits per second (Gbps) full-duplex traffic. As used herein, all data rates are full-duplex unless indicated otherwise.
  • Gbps gigabits per second
  • Each blade 104 communicates data at a rate of 50 Gbps over serial pipe 106.
  • Switch 100 is shown in further detail in FIG. 2.
  • switch fabric 102 comprises five cross points 202. Data sent and received between each blade and switch fabric 102 is striped across the five cross point chips 202A-202E. Each cross point 202A-202E then receives one stripe or 1/5 of the data passing through switch fabric 102.
  • each serial pipe 106 of a blade 104 is made up of five serial links 204.
  • the five serial links 204 of each blade 104 are coupled to the five corresponding cross points 202.
  • each of the serial links 204 is a 10G serial link, such as, a 10G serial link made up of 4 - 2.5 Gbps serial links. In this way, serial link technology is used to send data across the backplane 102.
  • Each cross point 202A-202E is an 8-port cross point.
  • each cross point 2202A-E receives eight 10G streams of data.
  • Each stream of data corresponds to a particular stripe.
  • the stripe has data in a wide-cell format which includes, among other things, a destination port number (also called a destination slot number) and special in-band control information.
  • the in-band control information includes special K characters, such as, a K0 character and Kl character.
  • the K0 character delimits a start of new cell within a stripe.
  • the Kl character delimits an end of a packet within the stripe.
  • FIFOs First in First out data structures.
  • the data structures store data based on the source port and the destination port. In one embodiment, for an 8-port cross point, 56 data FIFOs are used. Each data FIFO stores data associated with a respective source port and destination port. Packets coming to each source port are written to the data FIFOs which correspond to a source port and a destination port associated with the packets.
  • the source port is associated with the port (and port slice) on which the packets are received.
  • the destination port is associated with a destination port or slot number which is found in-band in data sent in a stripe to a port.
  • the switch size is defined as one cell and the cell size is defined to be either 8, 28, 48, 68, 88, 108, 128, or 148 bytes.
  • Each port (or port slice) receives and sends serial data at a rate of 10 Gbps from respective serial links.
  • 160 Gbps lOGbps * 8 ports * 2 directions full- duplex.
  • each serial pipe 106 is capable of carrying full-duplex traffic at 50 Gbps
  • each serial link 204 is capable of carrying full-duplex traffic at 10 Gbps.
  • the result of this architecture is that each of the five cross points 202 combines five 10 gigabit per second serial links to achieve a total data rate of 50 gigabits per second for each serial pipe 106.
  • the total switching capacity across backplane 102 for eight blades is 50 gigabits per second times eight times two (for duplex) or 800 gigabits per second.
  • Such switching capacities have not been possible with conventional technology using synched parallel data buses in a switching fabric.
  • An advantage of such a switch having a 50 Gbps serial pipe to backplane 102 from a blade 104 is that each blade 104 can support across a range of packet sizes four 10 Gbps Ethernet packet processors at line rate, four Optical Channel OC-192C at line rate, or support one OC-768C at line rate.
  • the invention is not limited to these examples. Other configurations and types of packet processors and can be used with the switch of the present invention as would be apparent to a person skilled in the art given this description.
  • Blade 104 comprises a backplane interface adapter (BIA) 302 (also referred to as a "super backplane interface adapter” or SBIA), a plurality of Integrated Bus Translators (IBT) 304 and a plurality of packet processors 306.
  • BIA 302 is responsible for striping the data across the five cross points 202 of backplane 102.
  • BIA 302 is implemented as an application-specific circuit (ASIC).
  • ASIC application-specific circuit
  • BIA 302 receives data from packet processors 306 through IBTs 304 (or directly from compatible packet processors).
  • BIA 302 may pass the data to backplane 102 or may perform local switching between the local ports on blade 104.
  • BIA 302 is coupled to four serial links 308. Each serial link 308 is coupled to an IBT 304.
  • Each packet processor 306 includes one or more physical ports. Each packet processor 306 receives inbound packets from the one or more physical ports, determines a destination of the inbound packet based on control information, provides local switching for local packets destined for a physical port to which the packet processor is connected, formats packets destined for a remote port to produce parallel data and switches the parallel data to an IBT 304. Each IBT 304 receives the parallel data from each packet processor 306. IBT 304 then converts the parallel data to at least one serial bit streams. IBT 304 provides the serial bit stream to BIA 302 via a pipe 308, described herein as one or more serial links. In a preferred embodiment, each pipe 308 is a 10 Gb/s XAUI interface.
  • 306D comprise 24 - ten or 100 megabit per second Ethernet ports, and two 1000 megabit per second or 1 Gbps Ethernet ports.
  • the input data packets are converted to 32-bit parallel data clock data 133 MHz to achieve a four Gbps data rate.
  • the data is placed in cells (also called “narrow cells") and each cell includes a header which merges control signals in-band with the data stream. Packets are interleaved to different destination slots every 32 by cell boundary.
  • IBT 304C is connected to packet processors 306C and 306D.
  • IBT 304A is connected to a packet processor 306A. This may be, for example, a ten gigabit per second OC-192 packet processor.
  • each IBT 304 will receive as its input a 64-bit wide data stream clocked at 156.25 MHz.
  • Each IBT 304 will then output a 10 gigabit per second serial data stream to BIA 302.
  • each cell includes a 4 byte header followed by 32 bytes of data. The 4 byte header takes one cycle on the four XAUI lanes. Each data byte is serialized onto one XAUI lane.
  • BIA 302 receives the output of IBTs 304A-304D. Thus, BIA 302 receives 4 times 10 Gbps of data. Or alternatively, 8 times 5 gigabit per second of data. BIA 302 runs at a clock speed of 156.25 MHz. With the addition of management overhead and striping, BIA 302 outputs 5 times 10 gigabit per second data streams to the five cross points 202 in backplane 102.
  • BIA 302 receives the serial bit streams from IBTs 304, determines a destination of each inbound packet based on packet header information, provides local switching between local IBTs 304, formats data destined for a remote port, aggregates the serial bit streams from IBTs 304 and produces an aggregate bit stream. The aggregated bit stream is then striped across the five cross points 202A-202E.
  • FIG. 3B shows a configuration of blade 104 according another embodiment of the present invention. In this configuration, BIA 302 receives output on serial links from a 10 Gbps packet processor 316A, IBT 304C, and an Optical Channel OC-192C packet processor 316B.
  • IBT 304 is further coupled to packet processors 306C, 306D as described above.
  • 10 Gbps packet processor 316 A outputs a serial data stream of narrow input cells carrying packets of data to BIA 302 over serial link 318A.
  • IBT 304C outputs a serial data stream of narrow input cells carrying packets of data to BIA 302 over serial link 308C.
  • Optical Channel OC-192C packet processor 316B outputs two serial data streams of narrow input cells carrying packets of data to BIA 302 over two serial links 318B, 318C.
  • FIG. 4 illustrates the architecture of a cross point 202.
  • Cross point 202 includes eight ports 401A-401H coupled to eight port slices 402A-402H.
  • each port slice 402 is connected by a wire 404 (or other connective media) to each of the other seven port slices 402.
  • Each port slice 402 is also coupled to through a port 401 a respective blade 104.
  • FIG. 4 shows connections for port 40 IF and port slice 402F (also referred to as port_slice 5).
  • port 401F is coupled via serial link 410 to blade 104F.
  • Serial link 410 can be a 10G full-duplex serial link.
  • Port slice 402F is coupled to each of the seven other port slices 402A-
  • Links 420-426 route data received in the other port slices 402A-402E and 402G-402H which has a destination port number (also called a destination slot number) associated with a port of port slice 402F (i.e. destination port number 5).
  • port slice 402F includes a link 430 that couples the port associated with port slice 402F to the other seven port slices.
  • Link 430 allows data received at the port of port slice 402F to be sent to the other seven port slices.
  • each of the links 420-426 and 430 between the port slices are buses to carry data in parallel within the cross point 202. Similar connections (not shown in the interest of clarity) are also provided for each of the other port slices 402A- 402E, 402G and 402H.
  • FIG. 5 illustrates the architecture of port 401F and port slice 402F in further detail.
  • the architecture of the other ports 401A-401E, 401G, and 40 IH and port slices 402A-402E, 402G and 402H is similai- to port 40 IF and port slice 402F. Accordingly, only port 40 IF and port slice 402F need be described in detail.
  • Port 40 IF includes one or more deserializer receiver(s) 510 and serializer transmitter(s) 580.
  • deserializer receiver(s) 510 and serializer transmitter(s) 580 are implemented as serializer/deserializer circuits (SERDES) that convert data between serial and parallel data streams.
  • SERDES serializer/deserializer circuits
  • port 401F can be part of port slice 402F on a common chip, or on separate chips, or in separate units.
  • Port slice 402F includes a receive synch FIFO module 515 coupled between deserializer receiver(s) 510 and accumulator 520.
  • Receive synch FIFO module 515 stores data output from deserializer receivers 510 corresponding to port slice 402F.
  • Accumulator 520 writes data to an appropriate data FIFO (not shown) in the other port slices 402A-402E, 402G, and 402H based on a destination slot or port number in a header of the received data.
  • Port slice 402F also receives data from other port slices 402A-402E,
  • Port slice 402F includes seven data FIFOs 530 to store data from corresponding port slices 402A-402E, 402G, and 402H. Accumulators (not shown) in the seven port slices 402A-402E, 402G, and 402H extract the destination slot number associated with port slice 402F and write corresponding data to respective ones of seven data FIFOs 530 for port slice 402F.
  • each data FIFO 530 includes a FIFO controller and FIFO random access memory (RAM).
  • the FIFO controllers are coupled to a FIFO read arbitrator 540.
  • FIFO RAMs are coupled to a multiplexer 550.
  • FIFO read arbitrator 540 is further coupled to multiplexer 550.
  • Multiplexer 550 has an output coupled to dispatcher 560.
  • Dispatch 560 has an output coupled to transmit synch FIFO module 570.
  • Transmit synch FIFO module 570 has an output coupled to serializer transmitter(s) 580.
  • the FIFO RAMs accumulate data. After a data FIFO
  • RAM has accumulated one cell of data, its corresponding FIFO controller generates a read request to FIFO read arbitrator 540.
  • FIFO read arbitrator 540 processes read requests from the different FIFO controllers in a desired order, such as a round-robin order. After one cell of data is read from one FIFO RAM, FIFO read arbitrator 540 will move on to process the next requesting FIFO controller. In this way, arbitration proceeds to serve different requesting FIFO controllers and distribute the forwarding of data received at different source ports. This helps maintain a relatively even but loosely coupled flow of data through cross points 202.
  • FIFO read arbitrator 540 switches multiplexer 550 to forward a cell of data from the data FIFO RAM associated with the read request to dispatcher 560.
  • Dispatcher 560 outputs the data to transmit synch FIFO 570.
  • Transmit synch FIFO 570 stores the data until sent in a serial data stream by serializer transmitter(s) 580 to blade 104F.
  • a port slice operates with respect to wide cell encoding and a flow control condition.
  • FIGs. 27A-27E show a routine 2700 for processing data in port slice based on wide cell encoding and a flow control condition (steps 2710-2790).
  • routine 2700 is described with respect to an example implementation of cross point 202 and an example port slice 402F.
  • the operation of the other port slices 402A-402E, 402G and 402H is similar.
  • receive synch FIFO module 515 is an 8-entry FIFO with write pointer and read pointer initialized to be 3 entries apart.
  • Receive synch FIFO module 515 writes 64-bit data from a SERDES deserialize receiver 510, reads 64-bit data from a FIFO with a clock signal and delivers data to accumulator 520, and maintains a three entry separation between read/write pointers by adjusting the read pointer when the separation becomes less than or equal to 1.
  • step 2720 accumulator 520 receives two chunks of 32-bit data are received from receive synch FIFO 515. Accumulator 520 detects a special character K0 in the first bytes of first chunk and second chunk (step 2722). Accumulator 520 then extracts a destination slot number from the state field in the header if K0 is detected (step 2724).
  • accumulator 520 further determines whether the cell header is low-aligned or high-aligned (step 2726). Accumulator 520 writes 64-bit data to the data FIFO corresponding to the destination slot if cell header is either low-aligned or high-aligned, but not both (step 2728). In step 2730, accumulator 520 writes 2 64-bit data to 2 data FIFOs corresponding to the two destination slots (or ports) if cell headers appear in the first chunk and the second chunk of data(low-aligned and high-aligned).
  • Accumulator 520 then fill the second chunk of 32-bit data with idle characters when a cell does not terminate at the 64-bit boundary and the subsequent cell is destined for a different slot (step 2732).
  • Accumulator 520 performs an early termination of a cell if an error condition is detected by inserting K0 and ABORT state information in the data (step 2734).
  • accumulator 520 detects a Kl character in the first byte of data_l(first chunk) and data_h(second chunk) (step 2736), and accumulator 520 writes subsequent 64-bit data to all destination data FIFOs (step 2738).
  • step 2740 if two 32-bit chunks of data are valid, then they are written to data FIFO RAM in one of data FIFOs 530.
  • step 2742 if only one of the 32-bit chunks is valid, it is saved in a temporary register if FIFO depth has not dropped below a predetermined level. The saved 32-bit data and the subsequent valid 32-bit data are combined and written to the FIFO RAM. If only one of the 32-bit chunks is valid and the FIFO depth has dropped below 4 entries, the valid 32-bit chunk is combined with 32-bit idle data and written to the FIFO RAM (step 2744).
  • a respective FIFO controller indicates to FIFO read arbitrator 540 if KO has been read or FIFO RAM is empty. This indication is a read request for arbitration.
  • a respective FIFO controller indicates to FIFO read arbitrator 540 whether K0 is aligned to the first 32-bit chunk or the second 32-bit chunk.
  • flow control from an output port is detected (such as when a predetermined flow control sequence of one or more characters is detected)
  • FIFO controller stops requesting the FIFO read arbitrator 540 after the current cell is completely read from the FIFO RAM (step 2750).
  • FIFO read arbitrator 540 arbitrates among 7 requests from 7 FIFO controllers and switches at a cell (K0) boundary. If end of the current cell is 64-bit aligned, then FIFO read arbitrator 540 switches to the next requestor and delivers 64-bit data from FIFO RAM of the requesting FIFO controller to the dispatcher 560 (step 2762). If end of current cell is 32-bit aligned, then FIFO read arbitrator 540 combines the lower 32-bit of the current data with the lower 32-bit of the data from the next requesting FIFO controller, and delivers the combined 64-bit data to the dispatcher 560 (step 2764). Further, in step 2766, FIFO read arbitrator 540 indicates to the dispatcher 560 when all 7 FIFO RAMs are empty.
  • dispatcher 560 delivers 64-bit data to the SERDES synch FIFO module 570 and in turn to serializer transmitter(s) 580, if non-idle data is received from the FIFO read arbitrator 540.
  • Dispatcher 560 injects a first alignment sequence to be transmitted to the SERDES synch FIFO module 570 and in turn to transmitter 580 when FIFO read arbitrator indicates that all 7 FIFO RAMs are empty (step 2772).
  • Dispatcher 560 injects a second alignment sequence to be transmitted to the SERDES synch FIFO module 570 and in turn to transmitter 580 when the programmable timer expires and the previous cell has been completely transmitted (step 2774).
  • Dispatcher 560 indicates to the FIFO read arbitrator 540 to temporarily stop serving any requestor until the current pre-scheduled alignment sequence has been completely transmitted (step 2776). Control ends (step 2790).
  • FIG. 6 is a diagram of a backplane interface adapter (BIA) 600 according to an embodiment of the present invention.
  • BIA 600 includes two traffic processing paths 603, 604.
  • FIG. 7 is a diagram showing a first traffic processing path 603 for local serial traffic received at BIA 600 according to an embodiment of the present invention.
  • FIG. 8 is a diagram showing in more detail an example switching fabric 645 according to an embodiment of the present invention.
  • FIG. 9 is a diagram showing a second traffic processing path 604 for backplane serial traffic received at BIA 600 according to an embodiment of the present invention.
  • FIG. 6 will also be described with reference to a more detailed embodiment of elements along paths 603, 604 as shown in FIGs. 7 and 9, and the example switching fabric 645 shown in FIG. 8.
  • the operation of a backplane interface adapter will be further described with respect to routines and example diagrams related to a wide striped cell encoding scheme as shown in FIGs 11-16.
  • FIG. 10 is a flowchart of a routine 1000 interfacing serial pipes carrying packets of data in narrow input cells and a serial pipe carrying packets of data in wide striped cells (steps 1010-1060).
  • Routine 1000 includes receiving narrow input cells (step 1010), sorting the received input cells based on a destination slot identified 1020), generating wide striped cells (step 1030), storing the generated wide striped cells in corresponding stripe send queues based on a destination slot identifier and an originating source packet processor (step 1040), arbitrating the order in which the stored wide striped cells are selected for transmission (step 1050) and transmitting data slices representing blocks of wide cells across multiple stripes (step 1060).
  • each of these steps is described further with respect to the operation of the first traffic processing path in BIA 600 in embodiments of FIGs. 6 and 7 below.
  • FIG. 11 is a flowchart of a routine 1100 interfacing serial pipes carrying packets of data in wide striped cells to serial pipes carrying packets of data in narrow input cells (steps 1110-1180).
  • Routine 1100 includes receiving wide striped cells carrying packets of data in multiple stripes from a switching fabric (step 1110), sorting the received sub-blocks in each stripe based on source packet processor identifier and originating slot identifier information (step 1120), storing the sorted received sub-blocks in stripe receive synchronization queues (step 1130), assembling wide striped cells in the order of the arbitrating step based on the received sub-blocks of data (step 1140), translating the received wide striped cells to narrow input cells carrying the packets of data (step 1150), storing narrow cells in a plurality of destination queues (step 1160), arbitrating an order in which data stored in the stripe receive synchronization queues is assembled (1170), and transmitting the narrow output cells to corresponding source packet processors (step 1180).
  • traffic processing flow path 603 extends in traffic flow direction from local packet processors toward a switching fabric 645.
  • Traffic processing flow path 604 extends in traffic flow direction from the switching fabric 645 toward local packet processors.
  • BIA 600 includes deserializer receiver(s) 602, traffic sorter 610, wide cell generator(s) 620, stripe send queues 625, switching fabric transmit arbitrator 630 and sterilizer transmitter(s) 640 coupled along path 603.
  • BIA 600 includes deserializer receiver(s) 650, stripe interface module(s) 660, stripe receive synchronization queues 685, controller 670 (including arbitrator 672, striped-based wide cell assemblers 674, and administrative module 676), wide/cell translator 680, destination queues 615, local destination transmit arbitrator 690, and sterilizer transmitter(s) 692 coupled along path 604.
  • Deserializer receiver(s) 602 receive narrow input cells carrying packets of data. These narrow input cells are output to deserializer receiver(s) 602 from packet processors and/or from integrated bus translators (IBTs) coupled to packet processors. In one example, four deserializer receivers 602 are coupled to four serial links (such as, links 308 A-D, 318A-C described above in FIGs. 3A-3B). As shown in the example of FIG. 7, each deserialize receiver 602 includes a deserializer receiver 702 coupled to a cross-clock domain synchronizer 703.
  • IBTs integrated bus translators
  • each deserializer receiver 702 coupled to a cross-clock domain synchronizer 703 can be in turn a set of four SERDES deserializer receivers and domain synchronizers carrying the bytes of data in the four lanes of the narrow input cells.
  • each deserializer receiver 702 can receive interleaved streams of data from two serial links coupled to two sources.
  • each deserializer receiver 702 receives a capacity of 10 Gb/s of serial data.
  • FIG. 13 shows the format of an example narrow cell 1300 used to carry packets of data in the narrow input cells.
  • a format can include, but is not limited to, a data cell format received from a XAUI interface.
  • Narrow cell 1300 includes four lanes (lanes 0-3). Each lane 0-3 carries a byte of data on a serial link. The beginning of a cell includes a header followed by payload data. The header includes one byte in lane 0 of control information, and one byte in lane 1 of state information. One byte is reserved in each of lanes 2 and 3.
  • Table 1310 shows example state information which can be used.
  • This state information can include any combination of state information including one or more of the following: a slot number, a payload state, and a source or destination packet processor identifier.
  • the slot number is an encoded number, such as, 00, 01, etc. or other identifier (e.g., alphanumeric or ASCII values) that identifies the blade (also called a slot) towards which the narrow cell is being sent.
  • the payload state can be any encoded number or other identifier that indicates a particular state of data in the cell being sent, such as, reserved (meaning a reserved cell with no data), SOP (meaning a start of packet cell), data (meaning a cell carrying payload data of a packet), and abort (meaning a packet transfer is being aborted).
  • Traffic sorter 610 sorts received narrow input cells based on a destination slot identifier. Traffic sorter 610 routes narrow cells destined for the same blade as BIA 600 (also called local traffic) to destination queues 615. Narrow cells destined for other blades in a switch across the switching fabric (also called global traffic) are routed to wide cell generators 620.
  • FIG. 7 shows a further embodiment where traffic sorter 610 includes a global/traffic sorter 712 coupled to a backplane sorter 714. Global/traffic sorter 712 sorts received narrow input cells based on the destination slot identifier. Traffic sorter 712 routes narrow cells destined for the same blade as BIA 600 to destination queues 615.
  • Narrow cells destined for other blades in a switch across the switching fabric are routed to backplane traffic sorter 714.
  • Backplane traffic sorter 714 further sorts received narrow input cells having destination slot identifiers that identify global destination slots into groups based on the destination slot identifier. In this way, narrow cells are grouped by the blade towards which they are traveling.
  • Backplane traffic sorter 714 then routes the sorted groups of narrow input cells of the backplane traffic to corresponding wide cell generators 720. Each wide cell generator 720 then processes a corresponding group of narrow input cells.
  • 56 wide cell generators 720 are coupled to the output of four backplane traffic sorters 714.
  • Wide cell generators 620 generate wide striped cells.
  • the wide striped cells carry the packets of data received by BIA 600 in the narrow input cells.
  • the wide cells extend across multiple stripes and include in-band control information in each stripe.
  • Routine 1200 however is not intended to be limited to use in wide cell generator 620, 720 and may be used in other structure and applications.
  • FIG. 12 shows a routine 1200 for generating wide striped cell generation according to the present invention (steps 1210-1240). In one embodiment, each wide cell generator(s) 620, 720 perform steps 1210-1240.
  • step 1210 wide cell generator 620, 720 parse each narrow input cell to identify a header.
  • a check is made to determine whether the control information indicates a start of packet (step 1220).
  • wide cell generator 620, 720 can read lane 0 of narrow cell 1300 to determine control information indicating a start of packet is present.
  • this start of packet control information is a special control character K0.
  • steps 1230-1240 are performed.
  • step 1230 wide cell generator 620, 720 encodes one or more new wide striped cells until data from all narrow input cells of the packet is distributed into the one or more new wide striped cells. This encoding is further described below with respect to routine 1400 and FIGs. 15A-D, and 16.
  • wide cell generator 620 then writes the one or more new wide striped cells into a plurality of send queues 625.
  • a total of 56 wide cell generators 720 are coupled to 56 stripes send queues 725.
  • the 56 wide cell generators 720 each write newly generated wide striped cells into respective ones of the 56 stripe send queues 725.
  • FIG. 14 is a flowchart of a routine 1400 for encoding wide striped cells according to an embodiment of the present invention (steps 1410- 1460).
  • wide cell generator 620, 720 encodes an initial block of a start wide striped cell with initial cell encoding information.
  • the initial cell encoding information includes control information (such as, a special K0 character) and state information provided in each sub-block of an initial block of a wide striped cell.
  • FIG. 15A shows the encoding of an initial block in a wide striped cell 1500 according to an embodiment of the present invention.
  • the initial block is labeled as cycle 1.
  • the initial block has twenty bytes that extend across five stripes 1-5.
  • Each stripe has a sub-block of four bytes.
  • the four bytes of a sub-block correspond to four one byte lanes.
  • a stripe is a data slice of a sub-block of a wide cell.
  • a lane is a data slice of one byte of the sub-block.
  • control information K0
  • State information is provided in each in each lane 1 of the stripes 1-5.
  • two bytes are reserved in lanes 2 and 3 of stripe 5.
  • FIG. 15B is a diagram illustrating state information used in a wide striped cell according to an embodiment of the present invention.
  • state information for a wide striped cell can include any combination of state information including one or more of the ollowing: a slot number, a payload state, and reserved bits.
  • the slot number is an encoded number, such as, 00, 01, etc. or other identifier (e.g., alphanumeric or ASCII values) that identifies the blade (also called a slot) towards which the wide striped cell is being sent.
  • the payload state can be any encoded number or other identifier that indicates a particular state of data in the cell being sent, such as, reserved (meaning a reserved cell with no data), SOP (meaning a start of packet cell), data (meaning a cell carrying payload data of a packet), and abort (meaning a packet transfer is being aborted). Reserved bits are also provided.
  • step 1420 wide cell generator(s) 620, 720 distribute initial bytes of packet data into available space in the initial block.
  • wide cell generator(s) 620, 720 distribute initial bytes of packet data into available space in the initial block.
  • two bytes of data DO, Dl are provided in lanes 2 and 3 of stripe 1
  • two bytes of data D2, D3 are provided in lanes 2 and 3 of stripe 2
  • two bytes of data D4, D5 are provided in lanes 2 and 3 of stripe 3
  • two bytes of data D6, D7 are provided in lanes 2 and 3 of stripe 4.
  • wide cell generator(s) 620, 720 distribute remaining bytes of packet data across one or more blocks in of the first wide striped cell (and subsequent wide cells).
  • maximum size of a wide striped cell is 160 bytes (8 blocks) which corresponds to a maximum of 148 bytes of data.
  • wide striped cell 1500 further has data bytes D8-D147 distributed in seven blocks (labeled in FIG. 15A as blocks 2-8).
  • packet data continues to be distributed until an end of packet condition is reached or a maximum cell size is reached. Accordingly, checks are made of whether a maximum cell size is reached (step 1440) and whether the end of packet is reached (step 1450). If the maximum cell size is reached in step 1440 and more packet data needs to be distributed then control returns to step 1410 to create additional wide striped cells to carry the rest of the packet data. If the maximum cell size is not reached in step 1440, then an end of packet check is made (step 1450). If an end of packet is reached then the current wide striped cell being filled with packet data is the end wide striped cell. Note for small packets less than 148 bytes, than only one wide striped cell is needed. Otherwise, more than one wide striped cells are used to carry a packet of data across multiple stripes. When an end of packet is reached in step 1450, then control proceeds to step 1460.
  • wide cell generator(s) 620, 720 further encode an end wide striped cell with end of packet information that varies depending upon the degree to which data has filled a wide striped cell.
  • the end of packet information varies depending upon a set of end of packet conditions including whether the end of packet occurs in an initial cycle or subsequent cycles, at a block boundary, or at a cell boundary.
  • FIG. 15C is a diagram illustrating end of packet encoding information used in an end wide striped cell according to an embodiment of the present invention.
  • a special character byte Kl is used to indicate end of packet.
  • a set of four end of packet conditions are shown (items 1-4). The four end of packet conditions are whether the end of packet occurs during the initial block (item 1) or during any subsequent block (items 2-4). The end of packet conditions for subsequent blocks further include whether the end of packet occurs within a block (item 2), at a block boundary (item 3), or at a cell boundary (item 4).
  • control and state information (KO, state) and reserved information are preserved as in any other initial block transmission.
  • Kl bytes are added as data in remaining data bytes.
  • Kl bytes are added as data in remaining data bytes until an end of a block is reached.
  • an end of packet is reached at data byte D33 (stripe 2, lane 1 in block of cycle 3). Kl bytes are added for each lane for remainder of block.
  • Kl bytes are added as data in an entire subsequent block.
  • item 3 an end of packet is reached at data byte D27 (end of block of block 2). Kl bytes are added for each lane for entire block (block 3).
  • one wide striped cell having an initial block with Kl bytes added as data is generated.
  • an end of packet is reached at data byte D147 (end of cell and end of block for block 8).
  • One wide striped cell consisting of only an initial block with normal control, state and reserved information and with Kl bytes added as data is generated. As shown in FIG.
  • such an initial block with Kl bytes consists of stripes 1-5 with bytes as follows: stripe 1 (K0, state, K1,K1), stripe 2 (K0,state, K1,K1), stripe3 (K0,state, K1,K1), stripe 4 (K0,state, K1,K1), stripe 5 (KO,state, reserved, reserved).
  • BIA 600 also includes switching fabric transmit arbitrator 630.
  • Switching fabric transmit arbitrator 630 arbitrates the order in which data stored in the stripe send queues 625, 725 is sent by transmitters 640, 740 to the switching fabric.
  • Each stripe send queue 625, 725 stores a respective group of wide striped cells corresponding to a respective originating source packet processor and a destination slot identifier.
  • Each wide striped cell has one or more blocks across multiple stripes.
  • the switching fabric transmit arbitrator 630 selects a stripe send queue 625, 725 and pushes the next available cell to the transmitters 640, 740. In this way one full cell is sent at a time.
  • Each stripe of a wide cell is pushed to the respective transmitter 640, 740 for that stripe.
  • a complete packet is sent to any particular slot or blade from a particular packet processor before a new packet is sent to that slot from different packet processors.
  • the packets for the different slots are sent during an arbitration cycle.
  • other blades or slots are then selected in a round- robin fashion.
  • switching fabric 645 includes a number n of cross point switches 202 corresponding to each of the stripes.
  • Each cross point switch 202 (also referred to herein as a cross point or cross point chip) handles one data slice of wide cells corresponding to one respective stripe.
  • five cross point switches 202A-202E are provided corresponding to five stripes.
  • FIG. 8 shows only two of five cross point switches corresponding to stripes 1 and 5.
  • the five cross point switches 202 are coupled between transmitters and receivers of all of the blades of a switch as described above with respect to FIG. 2.
  • FIG. 8 shows cross point switches 202 coupled between one set of transmitters 740 for stripes of one blade and another set of receivers 850 on a different blade.
  • Port slice 402F also receives data from other port slices 402A-402E,
  • Port slice 402F includes seven data FIFOs 530 to store data from corresponding port slices 402A-402E, 402G, and 402H. Accumulators (not shown) in the seven port slices 402A-402E, 402G, and 402H extract the destination slot number associated with port slice 402F and write corresponding data to respective ones of seven data FIFOs 530 for port slice 402F.
  • each data FIFO 530 includes a FIFO controller and FIFO random access memory (RAM).
  • the FIFO controllers are coupled to a FIFO read arbitrator 540.
  • FIFO RAMs are coupled to a multiplexer 550.
  • FIFO read arbitrator 540 is further coupled to multiplexer 550.
  • Multiplexer 550 has an output coupled to dispatcher 560.
  • Dispatch 560 has an output coupled to transmit synch FIFO module 570.
  • Transmit synch FIFO module 570 has an output coupled to serializer transmitter(s) 580.
  • the FIFO RAMs accumulate data. After a data FIFO
  • RAM has accumulated one cell of data, its corresponding FIFO controller generates a read request to FIFO read arbitrator 540.
  • FIFO read arbitrator 540 processes read requests from the different FIFO controllers in a desired order, such as a round-robin order. After one cell of data is read from one FIFO RAM, FIFO read arbitrator 540 will move on to process the next requesting FIFO controller. In this way, arbitration proceeds to serve different requesting FIFO controllers and distribute the forwarding of data received at different source ports. This helps maintain a relatively even but loosely coupled flow of data through cross points 202.
  • FIFO read arbitrator 540 switches multiplexer 550 to forward a cell of data from the data FIFO RAM associated with the read request to dispatcher 560.
  • Dispatcher 560 outputs the data to transmit synch FIFO 570.
  • Transmit synch FIFO 570 stores the data until sent in a serial data stream by serializer transmitter(s) 580 to blade 104F.
  • FIG. 6 also shows a traffic processing path for backplane serial traffic received at backplane interface adapter 600 according to an embodiment of the present invention.
  • FIG. 9 further shows the second traffic processing path in even more detail.
  • BIA 600 includes one or more deserialize receivers 650, wide/narrow cell translators 680, and serializer transmitters 692 along the second path.
  • Receivers 650 receive wide striped cells in multiple stripes from the switching fabric 645.
  • the wide striped cells carry packets of data.
  • five deserializer receivers 650 receive five sub-blocks of wide striped cells in multiple stripes.
  • the wide striped cells carrying packets of data across the multiple stripes and including originating slot identifier information.
  • originating slot identifier information is written in the wide striped cells as they pass through cross points in the switching fabric as described above with respect to FIG. 8.
  • Translators 680 translate the received wide striped cells to narrow input cells carrying the packets of data.
  • Serializer transmitters 692 transmit the narrow input cells to corresponding source packet processors or IBTs.
  • BIA 600 further includes stripe interfaces 660 (also called stripe interface modules), stripe receive synchronization queues (685), and controller 670 coupled between deserializer receivers 650 and a controller 670.
  • stripe interface 660 sorts received sub-blocks in each stripe based on source packet processor identifier and originating slot identifier information and stores the sorted received sub-blocks in the stripe receive synchronization queues 685.
  • Controller 670 includes an arbitrator 672, a striped-based wide cell assembler 674, and an administrative module 676.
  • Arbitrator 672 arbitrates an order in which data stored in stripe receive synchronization queues 685 is sent to striped-based wide cell assembler 674.
  • Striped-based wide cell assembler 674 assembles wide striped cells based on the received sub-blocks of data.
  • a narrow/wide cell translator 680 then translates the arbitrated received wide striped cells to narrow input cells carrying the packets of data.
  • Administrative module 676 is provided to carry out flow control, queue threshold level detection, and error detection (such as, stripe synchronization error detection), or other desired management or administrative functionality.
  • a second level of arbitration is also provided according to an embodiment of the present invention.
  • BIA 600 further includes destination queues 615 and a local destination transmit arbitrator 690 in the second path.
  • Destination queues 615 store narrow cells sent by traffic sorter 610 (from the first path) and the narrow cells translated by the translator 680 (from the second path).
  • Local destination transmit arbitrator 690 arbitrates an order in which narrow input cells stored in destination queues 690 is sent to serializer transmitters 692.
  • serializer transmitters 692 then transmit the narrow input cells to corresponding IBTs and/or source packet processors (and ultimately out of a blade through physical ports).
  • FIG. 9 further shows the second traffic processing path in even more detail.
  • BIA 600 includes five groups of components for processing data slices from five slices.
  • FIG. 9 only two groups 900 and 901 are shown for clarity, and only group 900 need be described in detail with respect to one stripe since the operations of the other groups is similar for the other four stripes.
  • deserializer receiver 950 is coupled to cross clock domain synchronizer 952.
  • Deserializer receiver 950 converts serial data slices of a stripe (e.g., sub-blocks) to parallel data.
  • Cross clock domain synchronizer 952 synchronizes the parallel data.
  • Stripe interface 960 has a decoder 962 and sorter 964 to decode and sort received sub-blocks in each stripe based on source packet processor identifier and originating slot identifier information. Sorter 964 then stores the sorted receivedsub-blocks in stripe receive synchronization queues 965. Five groups of 56 stripe receive synchronization queues 965 are provided in total. This allows one queue to be dedicated for each group of sub-blocks received from a particular source per global blade (up to 8 source packet processors per blade for seven blades not including the current blade).
  • Arbitrator 672 arbitrates an order in which data stored in stripe receive synchronization queues 685 sent to striped-based wide cell assembler 674.
  • Striped-based wide cell assembler 674 assembles wide striped cells based on the received sub-blocks of data.
  • a narrow/wide cell translator 680 then translates the arbitrated received wide striped cells to narrow input cells carrying the packets of data as described above in FIG. 6.
  • Destination queues include local destination queues 982 and backplane traffic queues 984.
  • Local destination queues 982 store narrow cells sent by local traffic sorter 716.
  • Backplane traffic queues 984 store narrow cells translated by the translator 680.
  • Local destination transmit arbitrator 690 arbitrates an order in which narrow input cells stored in destination queues 982, 984 is sent to serializer transmitters 992.
  • serializer transmitters 992 then transmit the narrow input cells to corresponding IBTs and/or source packet processors (and ultimately out of a blade through physical ports).
  • FIG. 15D is a diagram illustrating an example of a cell boundary alignment condition during the transmission of wide striped cells in multiple stripes according to an embodiment of the present invention.
  • a KO character is guaranteed by the encoding and wide striped cell generation to be present every 8 blocks for any given stripe. Cell boundaries among the stripes themselves can be out of alignment. This out of alignment however is compensated for and handled by the second traffic processing flow path in BIA 600.
  • FIG. 16 is a diagram illustrating an example of a packet alignment condition during the transmission of wide striped cells in multiple stripes according to an embodiment of the present invention.
  • Cell can vary between stripes but all stripes are essentially transmitting the same packet or nearby packets. Since each cross point arbitrates among its sources independently, not only can there be a skew in a cell boundary, but there can be as many as seven cell time units (time to transmit cells) of skew between a transmission of a packet on one serial link verus its transmission on any other link. This also means that packets may be interlaced with other packets in the transmission in multiple stripes over the switching fabric.
  • a wide cell has a maximum size of eight blocks (160 bytes) which can carry 148 bytes of payload data and 12 bytes of in-band control information. Packets of data for full-duplex traffic can be carried in the wide cells at a 50 Gbps rate through the digital switch. R. IBT and Packet Processing
  • IPC/IGC Bus Translator (IBT) 304 IPC/IGC Bus Translator 304.
  • the IBT is an ASIC that bridges one or more IPC/IC ASIC.
  • the IBT translates two 4/5 gig parallel stream into one lOGbps serial stream.
  • the parallel interface can be the backplane interface of the IPC/IGC ASICs.
  • the one lOGbps serial stream can be further processed, for example, as described herein with regard to interface adapters and striping.
  • IBT 304 can be configured to operate with other architectures as would be apparent to one skilled in the relevant art(s) based at least on the teachings herein.
  • the IBT 304 can be implemented in packet processors using 10GE and OC-192 configurations.
  • the functionality of the IBT 304 can be incorporated within existing packet processors or attached as an add-on component to a system.
  • FIG. 17 a block diagram 1700 illustrates the components of a bus translator 1702 according to one embodiment of the present invention.
  • the previously described IBT 304 can be configured as the bus translator 1702 of FIG. 17.
  • IBT 304 can be implemented to include the functionality of the bus translator 1702.
  • bus translator 1702 translates data 1704 into data
  • the data 1706 is received by transceiver(s) 1710 is forwarded to a translator 1712.
  • the translator 1712 parses and encodes the data 1706 into a desired format.
  • the translator 1712 translates the data 1706 into the format of the data 1704.
  • the translator 1712 is managed by an administration module 1718.
  • One or more memory pools 1716 store the information of the data 1706 and the data 1704.
  • One or more clocks 1714 provide the timing information to the translation operations of the translator 1712.
  • the translator 1712 finishes translating the data 1706, it forwards the newly formatted information as the data 1704 to the transceiver(s) 1708.
  • the transceiver(s) 1708 forward the data 1704.
  • bus translator 1702 can be reversed and the data 1704 received by the bus translator 1702 and the data 1706 forwarded after translation.
  • the process of translating the data 1706 into the data 1704 is herein described as receiving, reception, and the like. Additionally, for ease of illustration, but without limitation, the process of translating the data 1704 into the data 1706 is herein described as transmitting, transmission, and the like.
  • bus translator 1802 receives data in the form of packets from interface connections 1804a-n.
  • the interface connections 1804a-n couple to one or more receivers 1808 of bus translator 1802.
  • Receivers 1808 forward the received packets to one or more packet decoders 1810.
  • the receiver(s) 1808 includes one or more physical ports.
  • each of receivers 1808 includes one or more logical ports.
  • the receiver(s) 1808 consists of four logical ports.
  • the packet decoders 1810 receive the packets from the receivers 1808.
  • the packet decoders 1810 parse the information from the packets. In one embodiment, as is described below in additional detail, the packet decoders 1810 copy the payload information from each packet as well as the additional information about the packet, such as time and place of origin, from the start of packet (SOP) and the end of packet (EOP) sections of the packet. The packet decoders 1810 forward the parsed information to memory pool(s) 1812. In one embodiment, the bus translator 1802 includes more than one memory pool 1812. In an alternative embodiment, alternate memory pool(s) 1818 can be sent the information. In an additional embodiment, the packet decoder(s) 1810 can forward different types of information, such as payload, time of delivery, origin, and the like, to different memory pools of the pools 1812 and 1818.
  • Reference clock 1820 provides timing information to the packet decoder(s) 1810.
  • reference clock 1820 is coupled to the IPC/IGC components sending the packets through the connections 1804a-n.
  • the reference clock 1820 provides reference and timing information to all the parallel components of the bus translator 1802.
  • Cell encoder(s) 1814 receives the information from the memory pool(s) 1812. In an alternative embodiment, the cell encoder(s) 1814 receives the information from the alternative memory pool(s) 1818. The cell encoder(s) 1814 formats the information into cells.
  • the cell encoder(s) 1814 can be configured to format the information into one or more cell types.
  • the cell format is a fixed size. In another embodiment, the cell format is a variable size.
  • the cell encoder(s) 1814 forwards the cells to transmitter(s) 1816.
  • the transmitter(s) 1816 receive the cells and transmit the cells through interface connections 1806a-n.
  • Reference clock 1828 provides timing information to the cell encoder(s) 1814.
  • reference clock 1828 is coupled to the interface adapter components receiving the cells through the connections 1806a-n.
  • the reference clock 1828 provides reference and timing information to all the serial components of the bus translator 1802.
  • Flow controller 1822 measures and controls the incoming packets and outgoing cells by determining the status of the components of the bus translator 1802 and the status of the components connected to the bus translator 1802. Such components are previously described herein and additional detail is provided with regard to the interface adapters of the present invention. [00192] In one embodiment, the flow controller 1822 controls the traffic through the connection 1806 by asserting a ready signal and de-asserting the ready signal in the event of an overflow in the bus translator 1802 or the IPC/IGC components further connected.
  • Administration module 1824 provides control features for the bus translator 1802. In one embodiment, the administration module 1824 provides error control and power-on and reset functionality for the bus translator 1802.
  • FIG. 19 illustrates a block diagram of the transmission components according to one embodiment of the present invention.
  • bus translator 1902 receives data in the form of cells from interface connections 1904a-n.
  • the interface connections 1904a-n couple to one or more receivers 1908 of bus translator 1902.
  • the receiver(s) 1908 include one or more physical ports.
  • each of receivers 1908 includes one or more logical ports.
  • the receiver(s) 1908 consists of four logical ports.
  • Receivers 1908 forward the received cells to a synchronization module 1910.
  • the synchronization module 1910 is a FIFO used to synchronize incoming cells to the reference clock 1922.
  • the synchronization module 1910 forwards the one or more cell decoders 1912.
  • the cell decoders 1912 receive the cells from the synchronization module 1910.
  • the cell decoders 1912 parse the information from the cells.
  • the cell decoders 1912 copy the payload information from each cell as well as the additional information about the cell, such as place of origin, from the slot and state information section of the cell.
  • the cell format can be fixed. In another embodiment, the cell format can be variable. In yet another embodiment, the cells received by the bus translator 1902 can be of more than one cell format. The bus translator 1902 can be configured to decode these cell format as one skilled in the relevant art would recognize based on the teachings herein. - Further details regarding the cell formats is described below with regard to the cell encoding processes of the present invention.
  • the cell decoders 1912 forward the parsed information to memory pool(s) 1914.
  • the bus translator 1902 includes more than one memory pool 1914.
  • alternate memory pool(s) 1916 can be sent the information.
  • the cell decoder(s) 1912 can forward different types of information, such as payload, time of delivery, origin, and the like, to different memory pools of the pools 1914 and 1916.
  • Reference clock 1922 provides timing information to the cell decoder(s) 1912.
  • reference clock 1922 is coupled to the interface adapter components sending the cells through the connections 1904a- n.
  • the reference clock 1922 provides reference and timing information to all the serial components of the bus translator 1902.
  • Packet encoder(s) 1918 receive the information from the memory pool(s) 1914. In an alternative embodiment, the packet encoder(s) 1918 receive the information from the alternative memory pool(s) 1916. The packet encoder(s) 1918 format the information into packets.
  • the packet format is determined by the configuration of the IPC/IGC components and the requirements for the system.
  • the packet encoder(s) 1918 forwards the packets to transmitter(s)
  • the transmitter(s) 1920 receive the packets and transmit the packets through interface connections 1906a-n.
  • Reference clock 1928 provides timing information to the packet encoder(s) 1918.
  • reference clock 1928 is coupled to the IPC/IGC components receiving the packets through the connections 1906a-n.
  • the reference clock 1928 provides reference and timing information to all the parallel components of the bus translator 1902.
  • Flow controller 1926 measures and controls the incoming cells and outgoing packets by determining the status of the components of the bus translator 1902 and the status of the components connected to the bus translator 1902. Such components are previously described herein and additional detail is provided with regard to the interface adapters of the present invention.
  • the flow controller 1926 controls the traffic through the connection 1906 by asserting a ready signal and de-asserting the ready signal in the event of an overflow in the bus translator 1902 or the IPC/IGC components further connected.
  • Administration module 1924 provides control features for the bus translator 1902. In one embodiment, the administration module 1924 provides error control and power-on and reset functionality for the bus translator 1902.
  • Bus translator 2002 incorporates the functionality of bus translators 1802 and 1902.
  • packets are received by the bus translator 2002 by receivers 2012.
  • the packets are processed into cells and forwarded to a serializer/deserializer (SERDES) 2026.
  • SERDES 2026 acts as a transceiver for the cells being processed by the bus translator 2002.
  • the SERDES 2026 transmits the cells via interface connection 2006.
  • the cells are processed into packets and forwarded to transmitters 2036.
  • the transmitters 2036 forward the packets to the IPC/IGC components through interface connections 2010a-n.
  • the reference clocks 2040 and 2048 are similar to those previously described in FIGS. 18 and 19.
  • the reference clock 2040 provides timing information to the serial components of the bus translator 2002.
  • the reference clock 2040 provides timing information to the cell encoder(s) 2020, cell decoder(s) 2030, and the SERDES 2026.
  • the reference clock 2048 provides timing information to the parallel components of bus translator 2002.
  • the reference clock 2048 provides timing information to the packet decoder(s) 2016 and packet encoder(s) 2034.
  • the line rates of the ports 2014a-n have a shared utilization limited only by the line rate of output 2006. Similarly for ports 2038a-n and input 2008.
  • FIG. 21A a detailed block diagram of the bus translator, according to another embodiment of the present invention, is shown.
  • the receivers and transmitters of FIGS. 18, 19, and 20 are replaced with CMOS I/Os 2112 capable of providing the same functionality as previously described.
  • the CMOS I/Os 2112 can be configured to accommodate various numbers of physical and logical ports for the reception and transmission of data.
  • Administration module 2140 operates as previously described. As shown, the administration module 2140 includes an administration control element and an administration register.
  • the administration control element monitors the operation of the bus translator 2102 and provides the reset and power-on functionality as previously described with regard to FIGS. 18, 19, and 20.
  • the administration register caches operating parameters such that the state of the bus translator 2102 can be determined based on a comparison or look-up against the cached parameters.
  • the reference clocks 2134 and 2136 are similar to those previously described in FIGS. 18, 19, and 20.
  • the reference clock 2136 provides timing information to the serial components of the bus translator 2102. As shown, the reference clock 2136 provides timing information to the cell encoder(s) 2118, cell decoder(s) 2128, and the SERDES 2124.
  • the reference clock 2134 provides timing information to the parallel components of bus translator 2102. As shown, the reference clock 2134 provides timing information to the packet decoder(s) 2114 and packet encoder(s) 2132.
  • memory pool 2116 includes two pairs of
  • FIFOs Each FIFO pair with a header queue.
  • the memory pool 2116 performs as previously described memory pools in FIGS. 18 and 20.
  • payload or information portions of decoded packets is stored in one or more FIFOs and the timing, place of origin, destination, and similar information is stored in the corresponding header queue.
  • memory pool 2130 includes two pairs of FIFOs.
  • the memory pool 2130 performs as previously described memory pools in FIGS. 19 and 20.
  • decoded cell information is stored in one or more FIFOs along with corresponding timing, place of origin, destination, and similar information.
  • Interface connections 2106 and 2108 connect previously described interface adapters to the bus translator 2102 through the SERDES 2124.
  • the connections 2106 and 2108 are serial links.
  • the serial links are divided four lanes.
  • the bus translator 2102 is an IBT 304 that translates one or more 4 Gbps parallel IPC/IGC components into four 3.125 Gbps serial XAUI interface links or lanes.
  • the back planes are the IPC/IGC interface connections.
  • the bus translator 2102 formats incoming data into one or more cell formats.
  • the cell format can be a four byte header and a 32 byte data payload.
  • each cell is separated by a special K character into the header.
  • the last cell of a packet is indicated by one or more special Kl characters.
  • the cell formats can include both fixed length cells and variable length cells.
  • the 36 bytes (4 byte header plus 32 byte payload) encoding is an example of a fixed length cell format.
  • cell formats can be implemented where the cell length exceeds the 36 bytes (4 bytes + 32 bytes) previously described.
  • FIG. 21B a functional block diagram shows the data paths with reception components of the bus translator.
  • Packet decoders 2150a-b forward packet data to the FIFOs and headers in pairs. For example, packet decoder 2150a forwards packet data to FIFO 2152a-b and side-band information to header 2154. A similar process is followed for packet decoder 2150b. Packet decoder 2150b forwards packet data to FIFO 2156a-b and side-band information to header 2158.
  • Cell encoder(s) 2160 receive the data and control information and produce cells to serializer/deserializer (SERDES) circuits, shown as their functional components SERDES special character 2162, and SERDES data 2164a-b.
  • SERDES serializer/deserializer
  • the SERDES special character 2162 contains the special characters used to indicate the start and end of a cell's data payload.
  • the SERDES data 2164a-b contains the data payload for each cell, as well as the control information for the cell. Cell structure is described in additional detail below, with respect to FIG. 2 IE.
  • the bus translator 2102 has memory pools 2116 to act as internal data buffers to handle pipeline latency.
  • the bus translator 2102 has two data FIFOs and one header FIFO, as shown in FIG. 21 A as the FIFOs of memory pool 2116 and in FIG. 21B as elements 2152a-b, 2154, 2156a-b, and 2158.
  • side band information is stored in each of the headers A or B.
  • 32 bytes of data is stored in one or more of the two data FIFOs Al, A2, or Bl, B2 in a ping-pong fashion.
  • the ping-pong fashion is well-known in the relevant art and involves alternating fashion.
  • the cell encoder 2160 merges the data from each of the packet decoders 2150a-b into one lOGbps data stream to the interface adapter.
  • the cell encoder 2160 merges the data by interleaving the data at each cell boundary. Each cell boundary is determined by the special K characters.
  • the received packets are 32 bit aligned, while the parallel interface of the SERDES elements is 64 bit wide. [00226] In practice it can be difficult to achieve line rate for any packet length.
  • Line rate means maintaining the same rate of output in cells as the rate at which packets are being received.
  • Packets can have a four byte header overhead (SOP) and a four byte tail overhead (EOP). Therefore, the bus translators 2102 must parse the packets without the delays of typical parsing and routing components. More specifically, the bus translators 2102 formats parallel data inot cell format using special K characters, as described in more detail below, to merge state information and slot information (together, control information) in band with the data streams.
  • each 32 bytes of cell data is accompanied by a four byte header.
  • FIG. 21C shows a functional block diagram of the data paths with transmission components of the bus translator according to one embodiment of the present invention.
  • Cell decoder(s) 2174 receive cells from the SERDES circuit.
  • the functional components of the SERDES circuit include elements 2170, and 2172a-b.
  • the control information and data are parsed from the cell and forward to the memory pool(s).
  • FIFOs are maintained in pairs, shown as elements 2176a-b and 2176c-d. Each pair forwards control information and data to packet encoders 2178a-b.
  • FIG. 2 ID shows a functional block diagram of the data paths with native mode reception components of the bus translator according to one embodiment of the present invention.
  • the bus translator 2102 can be configured into native mode.
  • Native mode can include when a total of lOGbps connections are maintained at the parallel end (as shown by CMOS I/Os 2112) of the bus translator 2102.
  • the cell format length is no longer fixed at 32 bytes.
  • control information is attached when the bus translator 2102 receives a SOP from the device(s) on the lOGbps link.
  • the bus translator 2102 first detects a data transfer and is, therefore, coming to an operational state from idle, it attaches control information.
  • FIG. 21D two separate data
  • FIFOs are used to temporarily buffer the up-linking data; thus avoiding existing timing paths.
  • the bus translator 2102 processes native mode and non-native mode data paths in a shared operation as shown in FIGS. 19, 20, and 21. Headers and idle bytes are stripped from the data stream by the cell decoder(s), such as decoder(s) 2103 and 2174. Valid data is parsed and stored, and forwarded, as previously described, to the parallel interface.
  • the IBT 304 holds one last data transfer for each source slot. When it receives the EOP with the zero body cell format, the last one or two transfers are released to be transmitted from the parallel interface.
  • FIG. 2 IE shows a block diagram of a cell format according to one embodiment of the present invention.
  • FIG. 2 IE shows both an example packet and a cell according to the embodiments described herein.
  • the example packet shows a start of packet 2190a, payload containing data 2190b, end of packet 2190c, and inter-packet gap 2190c.
  • the cell includes a special character K0 2190; a control information 2194; optionally, one or more reserved 2196a-b; and data 2198a-n.
  • data 2198a-n can contain more than D0-D31.
  • the four rows or slots indicated in FIG. 2 IE illustrate the four lanes of the serial link through which the cells are transmitted and/or received.
  • the IBT 304 transmits and receives cells to and from the BIA 302 through the XAUI interface.
  • the IBT 304 transmits and receives packets to and from the IPC/IGC components, as well as other controller components (i.e., 10GE packet processor) through a parallel interface.
  • the packets are segmented into cells which consist of a four byte header followed by 32 bytes of data.
  • the end of packet is signaled by Kl special character on any invalid data bytes within four byte of transfer or four Kl on all XAUI lanes.
  • each byte is serialized onto one XAUI lane.
  • the following table illustrates in a right to left formation a byte by byte representation of a cell according to one embodiment of the present invention:
  • the packets are formatted into cells that consist of a header plus a data payload.
  • the 4 bytes of header takes one cycle or row on four XAUI lanes. It has K0 special character on LaneO to indicate that current transfer is a header.
  • the control information starts on Lanel of a header.
  • the IBT 304 accepts two IPC/IGC back plane buses and translates them into one lOGbps serial stream.
  • FIG. 22 a flow diagram of the encoding process of the bus translator according to one embodiment of the present invention is shown. The process starts at step 2202 and immediately proceeds to step 2204.
  • the IBT 304 determines the port types through which it will be receiving packets.
  • the ports are configured for 4Gbps traffic from IPC/IGC components. The process immediately proceeds to step 2206.
  • step 2206 the EBT 304 selects a cell format type based on the type of traffic it will be processing.
  • the IBT 304 selects the cell format type based in part on the port type determination of step 2204. The process immediately proceeds to step 2208.
  • step 2208 the IBT 304 receives one or more packets from through its ports from the interface connections, as previously described.
  • the rate at which packets are delivered depends on the components sending the packets. The process immediately proceeds to step 2210.
  • step 2210 the IBT 304 parses the one or more packets received in step 2208 for the information contained therein.
  • the packet decoder(s) of the IBT 304 parse the packets for the information contained within the payload section of the packet, as well as the control or routing information included with the header for that each given packet. The process immediately proceeds to step 2212.
  • step 2212 the IBT 304 optionally stores the information parsed in step 2210.
  • the memory pool(s) of the IBT 304 are utilized to store the information. The process immediately proceeds to step 2214.
  • the IBT 304 formats the information into one or more cells.
  • the cell encoder(s) of the IBT 304 access the information parsed from the one or more packets.
  • the information includes the data being trafficked as well as slot and state information (i.e., control information) about where the data is being sent.
  • the cell format includes special characters which are added to the information. The process immediately proceeds to step 2216.
  • step 2216 the IBT 304 forwards the formatted cells.
  • the SERDES of the IBT 304 receives the formatted cells and serializes them for transport to the BIA 302 of the present invention. The process continues until instructed otherwise.
  • FIGS. 23A-B a detailed flow diagram shows the encoding process of the bus translator according to one embodiment of the present invention. The process of FIGS. 23A-B begins at step 2302 and immediately flows to step 2304.
  • step 2304 the IBT 304 determines the port types through which it will be receiving packets. The process immediately proceeds to step 2306.
  • step 2306 the IBT 304 determines if the port type will, either individually or in combination, exceed the threshold that can be maintained. In other words, the IBT 304 checks to see if it can match the line rate of incoming packets without reaching the internal rate maximum. If it can, then the process proceeds to step 2310. In not, then the process proceeds to step 2308.
  • the IBT 304 selects a variable cell size that will allow it to reduce the number of cells being formatted and forwarded in the later steps of the process.
  • the cell format provides for cells of whole integer multiples of each of the one or more packets received.
  • the IBT 304 selects a cell format that provides for a variable cell size that allows for maximum length cells to be delivered until the packet is completed. For example, if a given packet is 2.3 cell lengths, then three cells will be formatted, however, the third cell will be a third that is the size of the preceding two cells. The process immediately proceeds to step 2312.
  • step 2310 given that the IBT 304 has determined that it will not be operating at its highest level, the IBT 304 selects a fixed cell size that will allow the IBT 304 to process information with lower processing overhead.
  • step 2312 the EBT 304 receives one or more packets.
  • step 2314 the IBT 304 parses the control information from each of the one or more packets.
  • step 2316 the IBT 304 determines the slot and state information for each of the one or more packets. In one embodiment, the slot and state information is determined in part from the control information parsed from each of the one or more packets. The process immediately proceeds to step 2312.
  • step 2318 the IBT 304 stores the slot and state information. The process immediately proceeds to step 2320. [00255] In step 2320, the IBT 304 parses the payload of each of the one or more packets for the data contained therein. The process immediately proceeds to step 2322. [00256] In step 2322, the IBT 304 stores the data parsed from each of the one or more packets. The process immediately proceeds to step 2324. [00257] In step 2324, the IBT 304 accesses the control information. In one embodiment, the cell encoder(s) of the IBT 304 access the memory pool(s) of the IBT 304 to obtain the control information. The process immediately proceeds to step 2326.
  • step 2326 the IBT 304 accesses the data parsed from each of the one or more packets.
  • the cell encoder(s) of the IBT 304 access the memory pool(s) of the IBT 304 to obtain the data.
  • the process immediately proceeds to step 2328.
  • step 2328 the EBT 304 constructs each cell by inserting a special character at the beginning of the cell currently being constructed. In one embodiment, the special character is K0.
  • the IBT 304 inserts the slot information. In one embodiment, the IBT 304 inserts the slot information into the next lane, such as space 2194. The process immediately proceeds to step 2332.
  • step 2332 the IBT 304 inserts the state information.
  • the IBT 304 inserts the state information into the next lane after the one used for the slot information, such as reserved 2196a. The process immediately proceeds to step 2334.
  • step 2334 the IBT 304 inserts the data. The process immediately proceeds to step 2336.
  • step 2336 the IBT 304 determines if there is additional data to be formatted. For example, if there is remaining data from a given packet. If so, then the process loops back to step 2328. If not, then the process immediately proceeds to step 2338.
  • step 2338 the EBT 304 inserts the special character that indicated the end of the cell transmission (of one or more cells).
  • the special character is Kl. The process proceeds to step 2340.
  • step 2340 the IBT 304 forwards the cells. The process continues until instructed otherwise.
  • FIG. 24 a flow diagram illustrates the decoding process of the bus translator according to one embodiment of the present invention. The process of FIG. 24 begins at step 2402 and immediately proceeds to step 2404.
  • the EBT 304 receives one or more cells.
  • the cells are received by the SERDES of the EBT 304 and forwarded to the cell decoder(s) of the EBT 304.
  • the SERDES of the IBT 304 forwards the cells to a synchronization buffer or queue that temporarily holds the cells so that their proper order can be maintained.
  • step 2406 the IBT 304 synchronizes the one or more cells into the proper order.
  • the process immediately proceeds to step 2408.
  • step 2408 the EBT 304 optionally checks the one or more cells to determine if they are in their proper order.
  • steps 2506, 2508, and 2510 are performed by a synchronization FIFO. The process immediately proceeds to step 2410.
  • step 2410 the IBT 304 parses the one or more cells into control information and payload data. The process immediately proceeds to step
  • step 2412 the IBT 304 stores the control information payload data.
  • step 2414 the EBT 304 formats the information into one or more packets.
  • step 2416 the IBT 304 forwards the one or more packets.
  • the process continues until instructed otherwise.
  • FIGS. 25A-B a detailed flow diagram of the decoding process of the bus translator according to one embodiment of the present invention is shown.
  • the process of FIGS. 25A-B begins at step 2502 and immediately proceeds to step 2504.
  • step 2504 the IBT 304 receives one or more cells.
  • step 2506 the IBT 304 optionally queues the one or more cells.
  • step 2508 the IBT 304 optionally determines if the cells are arriving in the proper order. If so, then the process immediately proceeds to step 2512.
  • step 2510 The IBT 304 holds one or more of the one or more cells until the proper order is regained. In one embodiment, in the event that cells are lost, the IBT 304 provides error control functionality, as described herein, to abort the transfer and/or have the transfer re-initiated. The process immediately proceeds to step 2514. [00280] In step 2512, the IBT 304 parses the cell for control information. The process immediately proceeds to step 2514. [00281] In step 2514, the EBT 304 determines the slot and state information.
  • step 2516 the EBT 304 stores the slot and state information.
  • step 2518 the state and slot information includes configuration information as shown in the table below:
  • the IBT 304 has configuration registers. They are used to enable Backplane and IPC/IGC destination slots. [00285] In step 2518, the IBT 304 parses the cell for data. The process immediately proceeds to step 2520. [00286] In step 2520, the IBT 304 stores the data parsed from each of the one or more cells. The process immediately proceeds to step 2522. [00287] In step 2522, the IBT 304 accesses the control information. The process immediately proceeds to step 2524. [00288] In step 2524, the IBT 304 access the data. The process immediately proceeds to step 2526. [00289] In step 2526, the EBT 304 forms one or more packets. The process immediately proceeds to step 2528. [00290] In step 2528, the IBT 304 forwards the one or more packets. The process continues until instructed otherwise.
  • Link Error - Link error occurs as a result of a bit error or a byte alignment problem within a SERDES. Since the clock is recovered from the data stream, there is a possibility of a byte alignment problem if there isn't enough data transition. Bit error can also occur as a result of external noise on the line.
  • the SERDES can also detect exception conditions such as SOP characters in lane 1 and can mark them as link errors.
  • Lane Synchronization Error - The lane is defined as one serial link among the four serial links that make up the 10 Gbps SERDES. As described elsewhere herein, there are four deep FIFOs within the SERDES core to compensate for any transmission line skew and synchronize the lanes such as to present a unified 10 Gbps stream to the core logic. There are possible cases where the FIFOs might overflow or underflow, which can result in lane synchronization error. There are also scenarios when a lane synchronization sequence might determine a possible alignment problem.
  • Stripe Synchronization Error - Stripe synchronization error refers to any error in the flow of wide cells of data sent across multiple stripes through the switching fabric according to the invention.
  • Such stripe synchronization errors can be due to a link error in a serial pipe leading to or from a cross-point, or to an error in the cross-point itself.
  • a receiving BIA contains deep FIFOs (such as 56 or 64 FIFOs) that are sorted according to sending source and stripe.
  • Stripe synchronization errors can be detected by monitoring the FIFOs and detecting an overflow and/or underflow of one or more FIFOs within the striped data paths. In other scenarios, the stripes may become completely out of synchronization. In one recovery embodiment, some or all of the XPNT modules would arbitrate independently, as the XPNT modules operate independently, as described elsewhere herein, to clear the FIFOs affected and recover from a known state.
  • the present invention can manage the bus translator as illustrated in FIG. 26.
  • FIG. 26 a flow diagram shows the administrating process of the bus translator according to one embodiment of the present invention. The process of FIG. 26 begins at step 2602 and immediately proceeds to step 2604.
  • step 2604 the IBT 304 determines the status of its internal components. The process immediately proceeds to step 2606.
  • step 2606 the IBT 304 determines the status of its links to external components. The process immediately proceeds to step 2608.
  • step 2608 the EBT 304 monitors the operations of both the internal and external components. The process immediately proceeds to step 2610.
  • step 2610 the IBT 304 monitors the registers for administrative commands. The process immediately proceeds to step 2612.
  • step 2612 the IBT 304 performs resets of given components as instructed. The process immediately proceeds to step 2614.
  • step 2614 the EBT 304 configures the operations of given components. The process continues until instructed otherwise.
  • any errors are detected on the receiving side of the
  • BIA 302 are treated in a fashion identical to the error control methods described herein for errors received on the XPNT 202 from the BIA 302. In operational embodiments where the destination slot cannot be known under certain conditions by the BIA 302, the following process is carried out by BIA 302:
  • administrative module 676 of FIG. 6 provides the monitoring, detection and correction functionality of the present invention.
  • administrative module 676 handles stripe synchronization errors.
  • administrative module 676 can include a level monitor 2806, a stripe synchronization error detector 2808, a control character (K2) presence tracker 2810, and a flow controller 2812.
  • Level monitor 2806 checks FIFOs and determines the amount of data within each FIFO and/or within a group FIFOs associated with a particular stripe and source (such as a slot or a particular source packet processor of a slot).
  • Stripe synchronization error detector 2808 detects stripe synchronization errors based on the conditions of the FIFOs monitored by level monitor 2806.
  • a stripe synchronization error can be any error in the flow of wide cells of data sent across multiple stripes through the switching fabric according to the invention.
  • Such stripe synchronization errors can be due to a link error in a serial pipe leading to or from a cross-point, or to an error in the cross-point itself.
  • a link error in a serial pipe leading from a sending BIA to a cross-point is referred to as an "incoming link error”
  • a link error in a serial pipe leading from a cross-point to a receiving BIA is referred to as an "outgoing link error.”
  • stripe synchronization error detector 2808 sends a signal to flow controller 2812.
  • Flow controller 2812 then initiates an appropriate recovery routine to re-synchronize data flow across the stripes in the switching fabric.
  • such a recovery routine can involve sending control characters (such as a special K2 characters) across the stripes in the switching fabric.
  • Control character (K2) presence tracker 2810 monitors special K2 characters received in the data flow at a BIA.
  • Flow controller 2812 also provides control logic for the administrative module 676 and the modules therein. Flow controller 2812 allows the modules of the administrative module 676 to perform their functions as described herein by the transmitter and receiving information regarding the status of the various FIFOs, BIAs, XPNTs, and other components of the present invention. Examples of detection and recovery from stripe synchronization errors are described further below with respect to FIG. 28B.
  • FIG. 28B is a diagram that illustrates a switch 2800B having slots
  • Slot 2852, 2854 coupled through five cross points (sXPNTs) 2856A-E to a slot 2852 according to the present invention.
  • Slot 2852 includes a set of sync- receive queues or FIFOs 2860.
  • Serial link 2853 couples slot 2852 and cross point 2856A.
  • Serial link 2857 couples cross point 2856A and slot 2858.
  • Slots 2852, 2854 are also referred to as slot 0 and slot 1, respectively, and slot 2858 is also referred to as slot 2. For clarity, only two slots are shown in this example; however, additional slots can be added.
  • One type of error can occur when link 2853 between the slotO 2852 to xpntO 2856A is broken. In such an event, xpntO 2856A will detect a broken link which will result in it sending an error signal back to the source slotO 2852. This will cause the slotO 2852 to stop sending traffic and send out a K2 sequence.
  • The- xpntO 2856A can also send an abort cell (AOP) to all the destinations in order to notify them that an error has occurred. In one embodiment, this is done as soon as error is detected.
  • AOP abort cell
  • FIG. 31 shows an example of how such an error condition in an incoming link 2853 is evident in the levels of data present in FIFOs 2862 in slot 2.
  • FIG. 31 shows ten FIFOs 2862 sorted by stripe and source slot. In this example, five stripes 0-4 and two slot 0 and 1 are shown. As shown in FIG. 31, the incoming link error causes a sync queue in slot2 2858 that corresponds to the stripeO/slotl link to overflow since it will receive more data from slotl 2854 than the other stripes and an underflow for the queue in slot2 2858 that corresponds to stripeO/slotO 2852 since link 2853 is broken.
  • Administrative module 676 can detect this type of strip synchronization error condition as follows.
  • Level monitor 2806 monitors the levels of each of the FIFOs 2862.
  • Stripe synchronization error detector 2808 detects the presence of any overflow and/or underflow condition in the levels of the sorted FIFOs. In this example of an incoming link error, stripe synchronization error detector 2808 would detect the occurrence of the underflow condition in the FIFO for stripeO/slotO and the overflow condition in the FIFO for stripeO/slotl.
  • Stripe synchronization error detector 2808 sends a signal to flow controller 2812. Flow controller 2812 then initiates an appropriate recovery routine to re-synchronize data flow across the stripes in the switching fabric.
  • such a recovery routine can involve sending control characters (such as a special K2 characters) from slotO across the stripes in the switching fabric.
  • Control character (K2) presence tracker 2810 monitors special K2 characters received in the data flow at a BIA.
  • the slotO 2852 when the slotO 2852 is able to, it sends out a K2 sequence that will allow the queues to sync up.
  • the sync is done at the first K0 character that comes from slotO 2852 with SOP, in other words, sync to 1st new packet after K2. Since the sync queue corresponding to slot 1/stripeO in slot2 2858 can overflow, there will be a flow control event sent from slot2 2858 to xpntO 2856A to stop sending data from slotl 2854 thus allowing the traffic from slotl 2854 not to be effected as a result of the slotO 2852 link failure and maintain synchronization for data from slotl 2854.
  • the switch shown in FIG. 28B breaks down.
  • the overall system can still function in the presence of a redundant switch fabric and the redundant fabric transceiver (RFT) of the present invention, as described below.
  • the RFT can detect the link failure and follows the steps outlined in the below to switch over to the fabric of an alternative switch.
  • Still another example is when the link 2857 between xpntO 2856A to slot2 2858 is broken.
  • the BIA at slot2 detects the break.
  • a RFT of the BIA detects the break, as described below with respect to embodiments of the present invention.
  • Flow controller 2812 of the BIA sends a flow control event/signal back to the xpntO 2856A which will get propagated back to slotO 2852, slotl 2854, and any slots present in the system. This can cause the source slots to stop sending traffic to slot2 2858. These slots can still send traffic to other destination slots, similar to slot2 2858.
  • the BIA will abort any partial packets that it has received and wait for the K2 sequence to recover the link. As described herein, it will sync to the first SOP following a K2.
  • the presence of a first SOP following a K2 can be detected by control character presence tracker 2810.
  • FIG. 29 a flow diagram illustrating a routine for maintaining synchronization of striped cell traffic is described.
  • module 676 sends a common control character in striped cells in all the lanes for a predetermined number of cycles. In one embodiment, a number of the common control characters are sent through the system.
  • module 676 evaluates the common control characters received in stripe receive synchronization queues. The module 676 evaluates the received common control characters to determine whether the system is re- synchronized.
  • step 2906 the module 676 determines the re-synchronization condition. If the system is re-synchronized, then the routine proceeds to step 2910. If not, then the system proceeds to step 2908. In one embodiment, the module 676 determines if the FIFOs are all empty or cleared at the same time. In another embodiment, the module 676 is checks the state bits for each of the FIFOs.
  • step 2908 the module 676 generates an error messages or other administrative signal.
  • the module 676 generates an error message such that the other components of the system begin recovery measures anew.
  • step 2910 the module 676 returns to step 2902 and awaits reception of an error condition or other administrative command to begin routine 2900.
  • Another routine of the module 676 is illustrated in FIG. 30. In FIG.
  • a flow diagram (routine) 3000 shows a routine for detecting out of synchronization traffic flow through a cross point switch in a backplane switching fabric.
  • the routine 3000 allows the module 676 to determine when routine 2900 is required.
  • step 3002 the module 676 monitors the levels of stripe receive synchronization queues.
  • level monitor 2806 performs this function within the module 676.
  • step 3004 the module 676 determines whether an out of synchronization queue threshold, such as, an overflow and/or underflow condition, is detected. In one embodiment, stripe synchronization error detector 2808 performs this function within the module 676. If so, then the process proceeds to step 3006. If not, then the process proceeds to step 3002. In one embodiment, the module 676 transmits a no error message or signal that can be received by other systems and logged for future reference.
  • stripe synchronization error detector 2808 performs this function within the module 676. If so, then the process proceeds to step 3006. If not, then the process proceeds to step 3002. In one embodiment, the module 676 transmits a no error message or signal that can be received by other systems and logged for future reference.
  • step 3006 the module 676 generates an out of synchronization message or other administrative signal that alerts the other components of the present invention that synchronization has been lost.
  • flow controller 2812 sends a signal back to the transmitting SXPNT which is further sent back to the RFT, which can then instantiate the K2 sequence of the present invention, as described elsewhere herein.
  • step 3008 the module 676 initiates a re-synchronization routine for striped cell traffic across all lanes. In one embodiment, the module 676 initiates the routine of FIG. 29.
  • Administrative module 676 and any of a level monitor 2806, a stripe synchronization error detector 2808, a control character (K2) presence tracker 2810, and a flow controller 2812, can be implemented in software, firmware, hardware or any combination thereof. Further, the functionality carried out in administrative module 676, and each of level monitor 2806, stripe synchronization error detector 2808, control character (K2) presence tracker 2810, and flow controller 2812, is described for convenience with respect to modules or blocks; however, the boundaries of such modules and distribution of functionality there between is illustrative and not intended to limit the present invention. Indeed, the functionality of administrative module 676, and each of level monitor 2806, stripe synchronization error detector 2808, control character (K2) presence tracker 2810, and flow controller 2812, can be combined into one module or distributed across any combination of modules.
  • RFTs redundant fabric transceivers
  • RFT ASICs are a bridge between one SBIA ASIC and two switching fabric modules (SFMs) in order to provide switching redundancy in the switching system described herein.
  • FIGs. 32A-B show the basic connections of a switch fabric.
  • FIG. 32A-B show the basic connections of a switch fabric.
  • a diagram 3200A shows a non-redundant switching system.
  • the blade A 3202 communicates with blade B 3206 through switch A 3204. Both blades A and B handle ingress and egress traffic.
  • a diagram 3200B shows a redundant switching system.
  • the blade A 3202 communicates with blade B 3206 through two switches, A & B, 3204 and 3205 respectively.
  • Multiplexer (MUX) 3208 selects between the two signals from switches 3204 and 3205.
  • MUX Multiplexer
  • the fabric active 3210 provides a signal to all the slave modules (ingress and egress).
  • point-to-point serial links are used on the backplane. This redundant approach uses twice the serial links as a non-redundant approach.
  • the ingress module 3202 sends incoming traffic to the active SFM and sends idle traffic patterns to the standby SFM.
  • the active SFM would be switch 3204 and the standby SFM would be switch 3205.
  • the egress blade 3206 would receive two data paths of traffic from these SFMs. The egress blade 3206 would be able to select the active signals as instructed by the fabric active 3210.
  • the RFT of the present invention provides redundant switching and is capable of performing the following tasks: i) operations as a multiplexer and de-multiplexer; ii) sorting of traffic based on encoded source/destination slot information in order to handle flow control; iii) flow control generation; iv) SERDES; and v) error handling.
  • the RFT is an implementation of the present invention that performs the previously detailed features described herein with regard to the module 676.
  • FIG. 33A shows a detailed diagram 3300A showing one embodiment where the RFT is implemented in a redundant system.
  • switching blade (SFM-A) 3302 and switching blade (SFM-B) 3304 are coupled to backplane 3306, which is in turn coupled to Ingress/Egress Blade (Slave Module) 3308.
  • Each of blades 3302 and 3304 include SXPNTs for transmitting and receiving data through data paths.
  • blade 3302 includes SXPNTs 3310A-E
  • blade 3304 includes SXPNTs 3312A-E.
  • Each of the groups of SXPNTs 3310A-E and 3312A-E are coupled, respectively, to data paths 3311A-E and 3313A-E through the backplane connection 3306 to one or more RFTs 3316A-E within the blade 3308.
  • each stripe there is one RFT for each stripe received.
  • the RFTs 3316A-E forward the received data to a SBIA 3320.
  • one RFT provides a bridge for the XAUI links (e.g., 15 links, 10 links from the two switching blades, and 5 links the SBIA).
  • Such an implementation would likely require several dozen SERDES, since one reliable embodiment calls for four SERDES for each XAUI link).
  • using a single RFT may introduce vulnerability to the system as the one RFT would handle all traffic. Therefore, the illustrated embodiment of five RFT modules provides a logical division of the processing workload.
  • FIG. 33B shows a diagram 3300B of a RFT, according to one embodiment of the present invention.
  • RFT 3300B is shown implemented as RFT 3316A would be implemented, with respect to stripeO traffic from SXPNTs 3310A and 3312A.
  • the SERDES 3350 and 3352 provide the data interface and route traffic to SYNCHQ FIFOs 3354 and 3356, respectively, as shown in FIG. 33B.
  • the received serial data is converted to parallel data by the SERDES, as described elsewhere herein.
  • a clock can be recovered from the incoming data stream.
  • each SERDES will generate a clock recovered from the data.
  • the FIFOs 3354 and 3356 provide clock compensation for transmit and receiving data by adding and/or removing idle characters to/from the FIFO data stream. Both FIFOs 3354 and 3356 feed into MUX 3358.
  • MUX 3358 combines the incoming traffic and splits the outgoing traffic and provides both data/control signals and flow control signals for redundant stripes.
  • all traffic is routed into a symmetric architecture for uplink/downlink logic.
  • This architecture is shown in FIG. 33B by components 3360, 3362, and 3364, and also by 3366, 3368, and 3370.
  • Both BIA_RX 3370 and BP_RX 3360 receive de-serialized and synchronized packet data from FIFOs.
  • SYNCQ FIFO 3372 performs the same functions as FEPOs 3354 and 3356 described above, but with respect to SERDES 3374, BIA_RX 3370 sorts the data into seven logic data queues in the UPLINK_RAM 3368 based on the encoded destination slot number (e.g., the seven queues are used to sort packets with different destinations).
  • BP_RX sorts data into DOWNLESfK_RAM 3362 based on encoded source slot number.
  • any latency in the SERDES 3350, 3352, and 3374 is compensated for by throttling the traffic at the seven logic data queues described above.
  • Both BIA_TX 3364 and BP_TX 3366 modules arbitrate the read operation from the downlink/uplink ram, 3362 and 3368, respectively, and compose data for transmission.
  • RFT registers 3376 provides access to internal registers that can be managed from module 676. The operations of the modules of RFT 3300B depend on the parameters set in the registers of module 3376. In one embodiment, the module 3376 provides the module 676 with information about the status of the modules of the RFT 3300B.
  • the backplane provides the connection between switching fabric modules and the slave modules.
  • this connection can include of the following signals: i) Serial TX and RX pairs; ii) flow control data and sync; iii) control signals, such as, but not limited to cross point error signal, intercept signal, and fabric active signal; and iv) clock distribution.
  • the maximum size of a payload for transfer in the backplane is 160 bytes (148 bytes of data max, 10 bytes of "Start of Cell” (SOC) control information, and 2 bytes reserved.
  • a complete 160-byte transfer, in this embodiment, is referred to as a "cell,” as described elsewhere herein cells are not limited by this embodiment.
  • a cycle is a single 3.2ns clock pulse (i.e. 312.5 MHZ).
  • the cell transfer can accomplished (as shown in FIG. 15A) in 20 byte "blocks,” in 8 consecutive cycles.
  • K0 indicates "start of cell” that is the first block of a cell across all five stripes.
  • Kl indicates "end of packet" that can appear in any block of a cell. It is transparent to RFT and SXPNT.
  • K2 is used to encode the stripe synchronization sequence.
  • Stripe synchronization requires a K2 character to be sent across all lanes and all stripes.
  • the special character is sent 112 times.
  • all stripes of the sync queues are marked as "in sync.”
  • the number 112 is chosen because it matches, in this embodiment, the depth of the sync queues, thus, if there is any data left in the queue after the final K2 character is detected, this can be considered a stripe synchronization error.
  • the present invention is not limited by this embodiment, and the sync queues can be of a different depth.
  • the feature for implementing the special characters is to fill/flush the sync queues.
  • the SBIA will send out 112 times the pattern shown in FIG. 34 A.
  • the state field is encoded with the source slot number as well as 1 bit used to tell whether the cell is toward the beginning or end of the sequence.
  • the state field can be encoded with the source slot number as well as 1 bit used to tell whether the cell is within the first 96 (of 112) transfers of the stripe sequence or whether this is the last 16 (of 112) K 2 transfer after which valid data follows.
  • step 3452 the source SBIA checks the RFT/SXPNT for a ready state.
  • step 3454 the RFT/SXPNT returns its state. If it is ready, then the routine proceeds to step 3456. If it is not ready, then the routine returns to prior to step 3452. In one embodiment, the source SBIA can re-check after a predetermined period of time.
  • step 3456 the source SBIA sends Idle characters to the
  • the source SBIA sends enough idle characters to give the destination SBIA enough time to drain any remaining data from its buffers. In an embodiment, the source SBIA sends 768x2 words of idle characters.
  • step 3458 the source SBIA sends special characters (K2) to the
  • the FIFOs in the RFT/SXPNT for the source slot should be empty by the time the K2s are sent.
  • the RFT receives the K2 sequence, if the FIFO is not empty, then it will treat the sequence as an error in the SBIA received data.
  • the RFT receives the data successfully, it checks to see if the SXPNT is ready to receive the data before sending the K2 sequence.
  • the K2 sequence is sent from the RFT to the SXPNT, it won't stop until the whole sequence is sent.
  • 112 words of K2 characters are sent.
  • Steps 3460, 3462, and 3464 illustrate the above-mentioned contingency.
  • step 3466 the source SBIA sends more idle characters to the
  • the source SBIA sends 512x2 words of idle characters.
  • the routine 3450 is executed by the module 676 periodically in order to clear the FIFOs and re-synchronize the systems of the present invention.
  • the discussion of FIG. 34B highlights the importance of the clock for the SXPNT and SBIA, because it should maintain stringent jitter and rising time requirements to properly execute the routine 3450. Additionally, the striped nature of the RFTs and SXPNTs requires that synchronization be maintained at all times. Therefore, the routines described herein, and the various embodiments thereof for error detection and recovery are particularly important.
  • both synchronous and asynchronous systems can be implemented.
  • all the blades including fabric use the same clock source.
  • the clock source can sit on the fabric and be distributed to the slave modules across the backplane so that the backplane will serve as a purely passive component.
  • two system clocks can be fed into one slave module from two switch fabric modules.
  • the circuitry on the slave module would serve as the master clock. If the master clock fails in a fail-over event, then the other clock will become the master clock and the switching should be transparent for the components on the slave module.
  • the system implements control logic on the fabric to decode a time-division multiplexed (TDM) signal to parallel signal to eliminate the need of a central ready synchronization signal.
  • TDM time-division multiplexed
  • the flow control information that passes between the SXPNT and RFT is TDM and requires a common sync signal to define the start of the time slot.
  • a central synchronization signal that tracks the clock distribution increases the robustness of the system.
  • FIG. 35 illustrates a block diagram 3500 of a synchronous flow control embodiment that includes RFTs.
  • Blade module 3502 includes five SXPNTs 3508A-E.
  • Flow controller module 3506 generates various signals as described herein. In one embodiment, the module 3506 provides a clock signal to the components of the system.
  • Blade module 3504 receives signals across the backplane connection to the RFTs 3510A-E. The RFTs send and receive signals to/from the SBIA 3512.
  • the flow controller module 3504 is connected across the backplane to each of the RFTs 3510A-E and the SBIA 3512.
  • each SBIA 3512 has a dedicated 1-bit ready signal for each RFT 3510A-E to stop a particular stripe from sending packets from each of the specific slots.
  • Each RFT 3510A-E also sends a dedicated 1-bit ready signal to control the receiving of packets from the specific source SXPNT 3508A-E based on the available space in the internal receive FIFO (e.g., downlink ram); and
  • each SXPNT has a dedicated 2-bit ready signal for each RFT 3510A-E to notify the congestion situation at destination slots. Every SBIA 3512 also receives 2-bit ready signal from each RFT 3510A-E to stop the traffic for the destination slots.
  • a common synchronization signal is used to synchronize all of the transmit and receive ready signals between RFT/SXPNT and RFT/SBIA.
  • the transmit ready signal uses 2-bit to encode 7 states in four slots (8 cycles) and receive ready uses only one bit to encode 7 states in 7 slots (14 cycles).
  • the common synchronization can be a synchronization pulse at every 56 cycles that is the minimum common multiple of 8 and 14.
  • the present invention is not limited to these cycle counts, as one skilled in the relevant art(s) would recognize that different durations can be implemented.
  • the time slot for each state can be set at
  • FIG. 36 shows a time flow diagram of how an SBIA can interpret the ready signal from the SXPNT.
  • the sync pulse is used to reset the internal counter in both SBIA and SXPNT.
  • the SXPNT will send out the ready state corresponding to slots 1 and 0 internally.
  • the SXPNT will encode the slot 2 and 3 ready signals and so on.
  • the pattern repeats itself every 8 cycles. In other words, every slot is encoded 7 times between two sync pulses
  • FIG. 37 illustrates the switching system of the present invention with asynchronous flow control.
  • System 3700 includes blade module 3702 with SXPNTs 3708A-E and blade module 3704 with RFTs 3714A-E.
  • flow controller modules 3706 and 3707 are able to provide clock signals to the components of the system.
  • the flow control between SXPNTs 3708 A-E and RFTs 3714A-E can be changed to asynchronous via control logic modules 3710 in blade 3702 and module 3712 in blade 3704.
  • the control logic module 3710 sits on the fabric and interfaces with the SXPNTs 3708 A-E for the synchronous flow control interface.
  • the control logic module 3710 can receive, interpret, and transmit various signals.
  • the module 3710 performs the following operations:
  • the RFT module of the present invention can be on the receiving end of the errors described above.
  • the type of errors that can be detected by the RFT chips includes: [00389] a) Link error: -This can be the result of a bit error or byte alignment error.
  • the SERDES should send an "IE" special character (error notification character) on the parallel data path to indicate the link error.
  • the SERDES should send a "GLINK" signal to indicate the receiving lane sync error.
  • XPNT error This is a wire or signal from the five SXPNT chips.
  • the RFT detects an error in the received data from the SBIA.
  • the errors can include link error, lane synchronization error and format error. Once the error is detected, the following procedure (steps 1-4) can be applied to recover from the error.
  • the RFT detects the error in the received data from one of the SXPNTs to which is it connected.
  • the errors can include link error, lane synchronization error and format error. Once one or more errors is detected, the following procedure can be applied to recover from the error(s).
  • the RFT error signal notifies the SBIA that its RFT is under error condition so that the SBIA will stop packet transmission to RFT.
  • This signal includes the following error notifications:
  • the module 676 has the capability to disable the current switching module and enable the standby switching module to keep the system's processes active.
  • the RFT when the RFT detects an error in the received data from the SXPNT, it can generate an interrupt signal to disrupt the flow control monitored within module 676.
  • the module 676 then reads the status registers in the SXPNT and the RFT to determine what kind of error occurred and which routine to instantiate to correct for it.
  • the errors that can generate the interrupt signal can be predetermined by programming an interrupt mask register within the RFT. These errors can include, but are not limited to: a) Core to SERDES sync FIFO overflow; b) SERDES to Core sync FIFO overflow; c) link is down; e) Code error, and/or format error; and f) XPNT error. Additional errors can be monitored and predetermined as one skilled in the relevant art(s) would recognize based on at least the teaching described herein.
  • the module 676 collects the interrupt signals from all slave modules and, in one embodiment, the module 676 also collects another 2-bit "Fabric Present" signal to start its fail-over decision procedure.
  • the "Fabric Present" signal can indicate that the corresponding switching module is in place. For example, if a user unplugs one switching module, then the corresponding "Fabric Present" will get de-asserted.
  • the module 676 uses the 2-bit "Fabric Active" to tell all slave modules which switch module to direct the traffic. In one embodiment, to initiate the fail-over procedure, the module 676 first resets the standby switch module and inverts the 2-bit signal.
  • the network switch has one active/working switching blade and one idle/standby switching blade.
  • the RFT can send packets to the active blade and can send idle characters to the idle blade.
  • the module 676 detects the failure of the working switching blade or the working switching blade is unplugged, the RFT will be notified the fail-over situation by the system using 2-bit "Fabric Active" signal.
  • the new switching blade is assumed to be in the initial state after reset. The module 676 checks the status of the new switching blade before it issues a fail-over command.
  • the RFT always sends the lane sync sequence to the standby switching blade to maintain a healthy link. Thus, when fail-over occurs, no time is needed to activate the standby switching blade.
  • the SBIA to RFT detects the fail-over by monitoring "Fabric Active" signals: [00417] 1) Send RFT error signal to SBIA. SBIA will stop sending data at cell boundary and repeat lane sync sequence until RFT error signal is de-asserted. Once de-asserted, stripe sync sequence will be sent out for all slots.
  • the SXPNT to RFT detects fail-over by monitoring "Fabric Active" signals:
  • SBIA receives AOP, it will discard received data before the stripes sync.
  • a hitless switch-over of the blades of the system is possible.
  • the word "hitless” means there in no packet loss due to fabric change. Under normal conditions, a user might still want to change the fabric for a better or more robust performance. In this case, the user would want to avoid any unnecessary packet drops. Additionally, another reason to use the upgrade procedure is to do fabric testing. At least two procedures can be used to perform the switch-over: debug and production.
  • a first procedure allows the module 676 to control the switch-over event through register programming:
  • the module 676 sets '1' to "Fabric enable mode” and "Hitless enable mode” bit in Configuration register. This will allow the module 676 to enable new fabric and hitless mode through register programming.
  • the module 676 disables the BIA receiver by setting bits in, for example, the RFT register accordingly. This will throttle the SBIA and prevent it from sending more cells to the RFT.
  • the module 676 can determine the duration, as described previously herein.), the module 676 selects the new fabric by setting "Fabric Active" bits in RFT register.
  • the RFT (be set to enabled) sending new cells to the RFT.
  • the RFT will forward the cells to new fabric without dropping any data.
  • the module 676 clears "Hitless Enable” bit to put the RFT in fail- over mode.
  • the switch-over timer to drain packets in the RFT/SXPNT buffers is located in the RFT and the SBIA traffic throttling is done automatically, as described above.
  • the module 676 does not need to intervene:
  • a command input pin can be driven “high” to enable the hitless switch-over. It is also noted that, in one software embodiment, a "Hitless enable mode” bit and/or “switch delay enable” bit in Configuration register can also set to enable the hitless switch-over.
  • the module 676 can determine the value of
  • Switch Delay Counter This is used to program the switch-over timer when "Fabric Active" signals toggled.
  • both RFT and SXPNT should have sent all the packets in the internal buffers. RFT will activate new fabric and start sending/receiving packets to/from new switching fabric.
  • the command input pin is driven “low” to disable hitless switch-over.
  • the module 676 is suggested to reset the new fabric first before the change. Because the SXPNT will generate the AOP for all slots after the reset (because the links go down), the module 676 can allow enough time before it changes the switch fabric.
  • the core will rely on software interaction to get the core in sync. Once the BIA 302, 600, IBT 304, and XPNT 202 come out of reset, they will continuously send lane synchronization sequence. The receiver will set a software visible bit stating that its lane is in sync. Once software determines that the lanes are in sync, it will try to get the stripes in sync. This is done through software which will enable continuously sending of stripe synchronization sequence. Once again, the receiving side of the BIA 302 will set a bit stating that it is in sync with a particular source slot. Once software determines this, it will enable transmit for the BIA 302, XPNT 202 and IBT 304.
  • the management software residing on management blade is in charge of the system maintenance work.
  • module 676 provides instantiation and access for the management software.
  • the management blade includes a dedicated reset signal for each slave module and switching module.
  • the following reset procedure can be performed at system reboot: [00444] 1) An external reset will be asserted to the SERDES core when a reset is applied to the core. The duration of the reset pulse for the SERDES needs to be longer than 32 cycles (for 156MHz clock). [00445] 2) After reset pulse, the transmitter and the receiver of the SERDES will sync up to each other through defined procedure.
  • the RFT allows the module 676 to reset each of its three lOGbps SERDES individually.
  • the RFT has three SERDES but, in one embodiment, only two
  • SERDES are forwarding packets with one SERDES in standby mode. If user only installs one switching fabric in the chassis, the redundant SERDES does not have its corresponding SERDES Transceiver. Thus, the link for the redundant SERDES will always be down. If the user does not plan to put the switching fabric in the chassis, the user can power down the redundant SERDES to save energy, cycles, and processing overhead. To do this, the module 676 can access the "Power Control" register within the registers of the RFT.
  • control logic 100 can be implemented in control logic.
  • control logic can be implemented in software, firmware, hardware or any combination thereof.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Computer Security & Cryptography (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

L'invention concerne un adaptateur d'interface face arrière à contrôle de défaillance et matrice redondante conçu pour un commutateur de réseau à haute performance. L'émetteur-récepteur à matrice redondante de l'adaptateur d'interface face arrière améliore la capacité dudit adaptateur à recevoir de manière correcte et cohérente des cellules d'entrée étroites portant des paquets de données et à sortir des cellules à bandes larges vers une matrice de commutation.
EP01996937A 2000-11-17 2001-11-16 Commutateur de reseau a haute performance Withdrawn EP1380127A2 (fr)

Applications Claiming Priority (13)

Application Number Priority Date Filing Date Title
US855025 1986-04-22
US24987100P 2000-11-17 2000-11-17
US249871P 2000-11-17
US09/855,038 US7236490B2 (en) 2000-11-17 2001-05-15 Backplane interface adapter
US855024 2001-05-15
US09/855,031 US6697368B2 (en) 2000-11-17 2001-05-15 High-performance network switch
US09/855,015 US7356030B2 (en) 2000-11-17 2001-05-15 Network switch cross point
US855015 2001-05-15
US855038 2001-05-15
US09/855,025 US20020091884A1 (en) 2000-11-17 2001-05-15 Method and system for translating data formats
US09/855,024 US6735218B2 (en) 2000-11-17 2001-05-15 Method and system for encoding wide striped cells
PCT/US2001/043113 WO2002041544A2 (fr) 2000-11-17 2001-11-16 Commutateur de reseau a haute performance
US855031 2004-05-26

Publications (1)

Publication Number Publication Date
EP1380127A2 true EP1380127A2 (fr) 2004-01-14

Family

ID=27559366

Family Applications (1)

Application Number Title Priority Date Filing Date
EP01996937A Withdrawn EP1380127A2 (fr) 2000-11-17 2001-11-16 Commutateur de reseau a haute performance

Country Status (4)

Country Link
EP (1) EP1380127A2 (fr)
JP (1) JP2004537871A (fr)
AU (1) AU2002217771A1 (fr)
WO (1) WO2002041544A2 (fr)

Cited By (20)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7649885B1 (en) 2002-05-06 2010-01-19 Foundry Networks, Inc. Network routing system for enhanced efficiency and monitoring capability
US7657703B1 (en) 2004-10-29 2010-02-02 Foundry Networks, Inc. Double density content addressable memory (CAM) lookup scheme
US7738450B1 (en) 2002-05-06 2010-06-15 Foundry Networks, Inc. System architecture for very fast ethernet blade
US7813367B2 (en) 2002-05-06 2010-10-12 Foundry Networks, Inc. Pipeline method and system for switching packets
US7817659B2 (en) 2004-03-26 2010-10-19 Foundry Networks, Llc Method and apparatus for aggregating input data streams
US7830884B2 (en) 2002-05-06 2010-11-09 Foundry Networks, Llc Flexible method for processing data packets in a network routing system for enhanced efficiency and monitoring capability
US7903654B2 (en) 2006-08-22 2011-03-08 Foundry Networks, Llc System and method for ECMP load sharing
US7948872B2 (en) 2000-11-17 2011-05-24 Foundry Networks, Llc Backplane interface adapter with error control and redundant fabric
US7978702B2 (en) 2000-11-17 2011-07-12 Foundry Networks, Llc Backplane interface adapter
US7978614B2 (en) 2007-01-11 2011-07-12 Foundry Network, LLC Techniques for detecting non-receipt of fault detection protocol packets
US8037399B2 (en) 2007-07-18 2011-10-11 Foundry Networks, Llc Techniques for segmented CRC design in high speed networks
US8090901B2 (en) 2009-05-14 2012-01-03 Brocade Communications Systems, Inc. TCAM management approach that minimize movements
US8149839B1 (en) 2007-09-26 2012-04-03 Foundry Networks, Llc Selection of trunk ports and paths using rotation
US8238255B2 (en) 2006-11-22 2012-08-07 Foundry Networks, Llc Recovering from failures without impact on data traffic in a shared bus architecture
US8271859B2 (en) 2007-07-18 2012-09-18 Foundry Networks Llc Segmented CRC design in high speed networks
US8448162B2 (en) 2005-12-28 2013-05-21 Foundry Networks, Llc Hitless software upgrades
US8599850B2 (en) 2009-09-21 2013-12-03 Brocade Communications Systems, Inc. Provisioning single or multistage networks using ethernet service instances (ESIs)
US8671219B2 (en) 2002-05-06 2014-03-11 Foundry Networks, Llc Method and apparatus for efficiently processing data packets in a computer network
US8718051B2 (en) 2003-05-15 2014-05-06 Foundry Networks, Llc System and method for high speed packet transmission
US8730961B1 (en) 2004-04-26 2014-05-20 Foundry Networks, Llc System and method for optimizing router lookup

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
DE50302370D1 (de) 2002-10-16 2006-04-20 Phoenix Contact Gmbh & Co Modulare Ethernet-Switch Architektur mit G.Links und ohne Adressierung der Schnittstellenmodule
US9178642B2 (en) * 2010-10-27 2015-11-03 Hewlett-Packard Development Company, L.P. Receivers and transceivers for optical multibus systems
CN111124813A (zh) * 2019-12-04 2020-05-08 山东浪潮人工智能研究院有限公司 一种基于自主可控软硬件的监控管理系统

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2770936B2 (ja) * 1990-12-18 1998-07-02 インターナショナル・ビジネス・マシーンズ・コーポレイション 通信ネットワークおよび通信チャンネルをつくる方法
US6151301A (en) * 1995-05-11 2000-11-21 Pmc-Sierra, Inc. ATM architecture and switching element
US5822540A (en) * 1995-07-19 1998-10-13 Fujitsu Network Communications, Inc. Method and apparatus for discarding frames in a communications device
US6038288A (en) * 1997-12-31 2000-03-14 Thomas; Gene Gilles System and method for maintenance arbitration at a switching node

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See references of WO0241544A2 *

Cited By (41)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7948872B2 (en) 2000-11-17 2011-05-24 Foundry Networks, Llc Backplane interface adapter with error control and redundant fabric
US8514716B2 (en) 2000-11-17 2013-08-20 Foundry Networks, Llc Backplane interface adapter with error control and redundant fabric
US8619781B2 (en) 2000-11-17 2013-12-31 Foundry Networks, Llc Backplane interface adapter with error control and redundant fabric
US7995580B2 (en) 2000-11-17 2011-08-09 Foundry Networks, Inc. Backplane interface adapter with error control and redundant fabric
US8964754B2 (en) 2000-11-17 2015-02-24 Foundry Networks, Llc Backplane interface adapter with error control and redundant fabric
US7978702B2 (en) 2000-11-17 2011-07-12 Foundry Networks, Llc Backplane interface adapter
US9030937B2 (en) 2000-11-17 2015-05-12 Foundry Networks, Llc Backplane interface adapter with error control and redundant fabric
US7830884B2 (en) 2002-05-06 2010-11-09 Foundry Networks, Llc Flexible method for processing data packets in a network routing system for enhanced efficiency and monitoring capability
US8170044B2 (en) 2002-05-06 2012-05-01 Foundry Networks, Llc Pipeline method and system for switching packets
US8989202B2 (en) 2002-05-06 2015-03-24 Foundry Networks, Llc Pipeline method and system for switching packets
US7738450B1 (en) 2002-05-06 2010-06-15 Foundry Networks, Inc. System architecture for very fast ethernet blade
US8194666B2 (en) 2002-05-06 2012-06-05 Foundry Networks, Llc Flexible method for processing data packets in a network routing system for enhanced efficiency and monitoring capability
US7813367B2 (en) 2002-05-06 2010-10-12 Foundry Networks, Inc. Pipeline method and system for switching packets
US8671219B2 (en) 2002-05-06 2014-03-11 Foundry Networks, Llc Method and apparatus for efficiently processing data packets in a computer network
US7649885B1 (en) 2002-05-06 2010-01-19 Foundry Networks, Inc. Network routing system for enhanced efficiency and monitoring capability
US8718051B2 (en) 2003-05-15 2014-05-06 Foundry Networks, Llc System and method for high speed packet transmission
US8811390B2 (en) 2003-05-15 2014-08-19 Foundry Networks, Llc System and method for high speed packet transmission
US9461940B2 (en) 2003-05-15 2016-10-04 Foundry Networks, Llc System and method for high speed packet transmission
US9338100B2 (en) 2004-03-26 2016-05-10 Foundry Networks, Llc Method and apparatus for aggregating input data streams
US7817659B2 (en) 2004-03-26 2010-10-19 Foundry Networks, Llc Method and apparatus for aggregating input data streams
US8493988B2 (en) 2004-03-26 2013-07-23 Foundry Networks, Llc Method and apparatus for aggregating input data streams
US8730961B1 (en) 2004-04-26 2014-05-20 Foundry Networks, Llc System and method for optimizing router lookup
US7953923B2 (en) 2004-10-29 2011-05-31 Foundry Networks, Llc Double density content addressable memory (CAM) lookup scheme
US7657703B1 (en) 2004-10-29 2010-02-02 Foundry Networks, Inc. Double density content addressable memory (CAM) lookup scheme
US7953922B2 (en) 2004-10-29 2011-05-31 Foundry Networks, Llc Double density content addressable memory (CAM) lookup scheme
US9378005B2 (en) 2005-12-28 2016-06-28 Foundry Networks, Llc Hitless software upgrades
US8448162B2 (en) 2005-12-28 2013-05-21 Foundry Networks, Llc Hitless software upgrades
US7903654B2 (en) 2006-08-22 2011-03-08 Foundry Networks, Llc System and method for ECMP load sharing
US9030943B2 (en) 2006-11-22 2015-05-12 Foundry Networks, Llc Recovering from failures without impact on data traffic in a shared bus architecture
US8238255B2 (en) 2006-11-22 2012-08-07 Foundry Networks, Llc Recovering from failures without impact on data traffic in a shared bus architecture
US8155011B2 (en) 2007-01-11 2012-04-10 Foundry Networks, Llc Techniques for using dual memory structures for processing failure detection protocol packets
US7978614B2 (en) 2007-01-11 2011-07-12 Foundry Network, LLC Techniques for detecting non-receipt of fault detection protocol packets
US8395996B2 (en) 2007-01-11 2013-03-12 Foundry Networks, Llc Techniques for processing incoming failure detection protocol packets
US9112780B2 (en) 2007-01-11 2015-08-18 Foundry Networks, Llc Techniques for processing incoming failure detection protocol packets
US8037399B2 (en) 2007-07-18 2011-10-11 Foundry Networks, Llc Techniques for segmented CRC design in high speed networks
US8271859B2 (en) 2007-07-18 2012-09-18 Foundry Networks Llc Segmented CRC design in high speed networks
US8149839B1 (en) 2007-09-26 2012-04-03 Foundry Networks, Llc Selection of trunk ports and paths using rotation
US8509236B2 (en) 2007-09-26 2013-08-13 Foundry Networks, Llc Techniques for selecting paths and/or trunk ports for forwarding traffic flows
US8090901B2 (en) 2009-05-14 2012-01-03 Brocade Communications Systems, Inc. TCAM management approach that minimize movements
US9166818B2 (en) 2009-09-21 2015-10-20 Brocade Communications Systems, Inc. Provisioning single or multistage networks using ethernet service instances (ESIs)
US8599850B2 (en) 2009-09-21 2013-12-03 Brocade Communications Systems, Inc. Provisioning single or multistage networks using ethernet service instances (ESIs)

Also Published As

Publication number Publication date
WO2002041544A3 (fr) 2003-11-20
JP2004537871A (ja) 2004-12-16
WO2002041544A2 (fr) 2002-05-23
AU2002217771A1 (en) 2002-05-27

Similar Documents

Publication Publication Date Title
US8964754B2 (en) Backplane interface adapter with error control and redundant fabric
US7356030B2 (en) Network switch cross point
US7512127B2 (en) Backplane interface adapter
US6735218B2 (en) Method and system for encoding wide striped cells
US6697368B2 (en) High-performance network switch
US7206283B2 (en) High-performance network switch
WO2002041544A2 (fr) Commutateur de reseau a haute performance
US20020091884A1 (en) Method and system for translating data formats
US6654370B1 (en) Backplane synchronization in a distributed system with clock drift and transport delay
US6792484B1 (en) Method and apparatus for storing data using a plurality of queues
EP1216549A1 (fr) Resynchronisation de files d'attente: mise a niveau synchrone en temps reel d'un systeme de commutation reparti
WO2002003621A1 (fr) Procede et appareil de transfert de paquets vers une memoire
EP1179929B1 (fr) Transférence et mémorisation de la longeur et les données comme un flux dans un commutateur de paquets
EP1249093A2 (fr) Synchronisation de contre-pression asynchrone d'une destination vers des sources multiples

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 20030616

AK Designated contracting states

Kind code of ref document: A2

Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LI LU MC NL PT SE TR

AX Request for extension of the european patent

Extension state: AL LT LV MK RO SI

RBV Designated contracting states (corrected)

Designated state(s): DE GB

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE APPLICATION IS DEEMED TO BE WITHDRAWN

18D Application deemed to be withdrawn

Effective date: 20050601