US20080205407A1 - Network switch cross point - Google Patents

Abstract

A switching fabric having cross points that process multiple stripes of serial data. Each cross point includes a plurality of port slices and ports. Each port includes a plurality of FIFOs, a FIFO read arbitrator, a multiplexer, a dispatcher, and an accumulator. In one embodiment, each cross point has eight ports and eight port slices. A method for processing a stripe of data at a cross point at one port slice includes storing data received from other port slices in a plurality of FIFOs and arbitrating the reading of the stored data. A step of writing data received from a port at the one port slice to an appropriate FIFO in a different port slice is also included. In one embodiment, a method for processing data in port slice based on wide cell encoding and an external flow control command is provided.

Description

CROSS-REFERENCE TO RELATED APPLICATION
• This application claims the benefit of U.S. Provisional Application No. 60/249,871, filed Nov. 17, 2000, the full text of which is incorporated herein by reference as if reproduced in full below.
BACKGROUND OF THE INVENTION
• 1. Field of the Invention
• The invention relates generally to network switches.
• 2. Background Art
• A network switch is a device that provides a switching function (i.e., 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. Typically, a switch is a computer having a plurality of circuit cards coupled to a backplane. In the switching art, 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). In the OSI model, switches generally route data frames based on the lower level protocols such asLayer 2 orLayer 3. In contrast, 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. In the case of an ethernet frame, the digital switch will determine the physical path of the frame based on the source and destination addresses. Standard Ethernet operates at a ten Mbit/s data rate. Another implementation of Ethernet known as “Fast Ethernet” (FE) has a data rate of 100 Megabits/s. Yet another implementation of FE operates at 10 Gigabits/sec.
• A digital switch will typically have physical ports that are configured to communicate using different protocols at different data rates. For example, a blade within a switch may have certain ports that are 10 Mbit/s, or 100 Mbit/s ports. It may have other ports that conform to optical standards such as SONET and are capable of such data rates as 10 gigabits per second.
• 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.
• It is desired to take advantage of new optical technologies and increase port densities and data rates on blades. However, what is needed is a switch and a switch fabric capable of handling higher bit rates and providing a maximum aggregate bit carrying capacity well in excess of conventional switches.
BRIEF SUMMARY OF THE INVENTION
• 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.
• In one embodiment, 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. For example, the initial block of a wide cell includes control information and state information. Further, the control information and state information is carried in each stripe. In particular, the control information and state information is carried in each subblock of the initial block of a wide cell. In this way, 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 subblocks 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 a 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 Gb/sec 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×10 Gigabit/sec Ethernet (also called 4×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.
• In one embodiment, 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. In one example implementation, the serial pipe coupling a blade to switching fabric is a 50 Gb/s serial pipe made up of five 10 Gb/s serial links. Each of the 10 Gb/s 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.
• In one embodiment of the present invention, 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. 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.
• According to the present invention, the wide cells extend across multiple stripes and include in-band control information in each stripe. In one embodiment, 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.
• In one example, 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 indentifier and originating source. The five serializer transmitters transmit the data slices of the wide cell that corresponds to the stripes.
• According to a further feature, a BIA can also include a traffic sorter which sorts received narrow input cells based on a destination slot identifier. In one example, 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.
• In one embodiment, 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. During a processing cycle, 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. In one example, the five deserializer receivers receive five subblocks 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.
• In one embodiment, the BIA further includes stripe interfaces and stripe receive synchronization queues. Each stripe interface sorts received subblocks in each stripe based on originating slot identifier information and stores the sorted received subblocks 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 subblocks 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. Finally, the 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).
• According to a further feature of the present invention, 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. In one embodiment, 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 subblock 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. Finally, 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.
• According to a further embodiment of the present invention, 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.
• In one example, 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 subblocks in each stripe based on originating slot identifier information, storing the sorted received subblocks 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 subblocks 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. In one embodiment, 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.
• Further embodiments, features, and advantages of the present inventions, as well as the structure and operation of the various embodiments of the present invention, are described in detail below with reference to the accompanying drawings.
BRIEF DESCRIPTION OF THE DRAWINGS/FIGURES
• The accompanying drawings, which are incorporated herein and form a part of the specification, illustrate the present invention and, together with the description, further serve to explain the principles of the invention and to enable a person skilled in the pertinent art to make and use the invention.
• In the drawings:
• 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 ofFIG. 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. 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.
• 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. 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.
• 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. 21D 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.
• FIGS. 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.
• The present invention will now be described with reference to the accompanying drawings. In the drawings, like reference numbers indicate identical or functionally similar elements. Additionally, the left-most digit(s) of a reference number identifies the drawing in which the reference number first appears.
DETAILED DESCRIPTION OF THE INVENTIONTable of ContentsI. Overview and DiscussionII. TerminologyIII. Digital Switch Architecture
• A. Cross Point Architecture
• B. Port Slice Operation with Wide Cell Encoding and Flow Control
• C. Backplane Interface Adapter
• D. Overall Operation of Backplane Interface Adapter
• E. First Traffic Processing Path
• F. Narrow Cell Format
• G. Traffic Sorting
• H. Wide Striped Cell Generation
• I. Encoding Wide Striped Cells
• J. Initial Block Encoding
• K. End of Packet Encoding
• L. Switching Fabric Transmit Arbitration
• M. Cross Point Processing of Stripes
• N. Second Traffic Processing Path
• O. Cell Boundary Alignment
• P. Packet Alignment
• Q. Wide Striped Cell Size at Line Rate
• R. IBT and Packet Processing
• S. Narrow Cell and Packet Encoding Processes
• T. Administrative Process and Error Control
• U. Reset and Recovery Procedures
IV. Control LogicV. ConclusionI. Overview and Discussion
• 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. In one embodiment, 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.
• In one implementation, 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).
• The present invention is described in terms of this example environment. Description in these terms is provided for convenience only. It is not intended that the invention be limited to application in these example environments. In fact, after reading the following description, it will become apparent to a person skilled in the relevant art how to implement the invention in alternative environments known now or developed in the future.
II. Terminology
• To more clearly delineate the present invention, an effort is made throughout the specification to adhere to the following term definitions as consistently as possible.
• The terms “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.
• The term “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.
• The term “serial pipe” refers to one or more serial links. In one embodiment, not intended to limit the invention, a serial pipe is a 10 Gb/s serial pipe and includes four 2.5 Gb/s serial links.
• The term “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.
• The term “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.
III. Digital Switch Architecture
• An overview of the architecture of theswitch100 of the invention is illustrated inFIG. 1.Switch100 includes a switch fabric102 (also called a switching fabric or switching fabric module) and a plurality ofblades104. In one embodiment of the invention,switch100 includes 8blades104a-104h. Eachblade104 communicates withswitch fabric102 via serial pipe106. Eachblade104 further includes a plurality of physical ports108 for receiving various types of digital data from one or more network connections.
• In a preferred embodiment of the invention, switch100 having 8 blades is capable of switching of 400 gigabits per second (Gb/s) full-duplex traffic. As used herein, all data rates are full-duplex unless indicated otherwise. Eachblade104 communicates data at a rate of 50 Gb/s over serial pipe106.
• Switch100 is shown in further detail inFIG. 2. As illustrated,switch fabric102 comprises five cross points202. Data sent and received between each blade andswitch fabric102 is striped across the fivecross point chips202A-202E. Each cross point202A-202E then receives one stripe or ⅕ of the data passing throughswitch fabric102. As depicted inFIG. 2, each serial pipe106 of ablade104 is made up of fiveserial links204. The fiveserial links204 of eachblade104 are coupled to the five corresponding cross points202. In one example, each of theserial links204 is a 10G serial link, such as, a 10G serial link made up of 4-2.5 Gb/s serial links. In this way, serial link technology is used to send data across thebackplane102.
• Each cross point202A-202E is an 8-port cross point. In one example, each cross point2202A-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 K1 character. The K0 character delimits a start of new cell within a stripe. The K1 character delimits an end of a packet within the stripe. Such encoding within each stripe, allows eachcross point202A-202E to operate autonomously or independently of other cross points. In this way, the cross points202A-202E and their associated stripes are loosely-coupled.
• In eachcross point202, there are a set of data structures, such as data 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.
• In embodiments of the present invention, 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 Gb/s from respective serial links. Each cross point202A-202E has a 160 Gb/s switching capacity (160 Gb/s=10 Gb/s*8 ports*2 directions full-duplex). Such cell sizes, serial link data rate, and switching capacity are illustrative and not necessarily intended to limit the present invention. Cross-point architecture and operation is described further below.
• In attempting to increase the throughput of switches, conventional wisdom has been to increase the width of data buses to increase the “parallel processing” capabilities of the switch and to increase clock rates. Both approaches, however, have met with diminishing returns. For example, very wide data buses are constrained by the physical limitations of circuit boards. Similarly, very high clock rates are limited by characteristics of printed circuit boards. Going against conventional wisdom, the inventors have discovered that significant increases in switching bandwidth could be obtained using serial link technology in the backplane.
• In the preferred embodiment, each serial pipe106 is capable of carrying full-duplex traffic at 50 Gb/s, and eachserial link204 is capable of carrying full-duplex traffic at 10 Gb/s. The result of this architecture is that each of the fivecross points202 combines five 10 gigabit per second serial links to achieve a total data rate of 50 gigabits per second for each serial pipe106. Thus, the total switching capacity acrossbackplane102 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 Gb/s serial pipe tobackplane102 from ablade104 is that eachblade104 can support across a range of packet sizes four 10 Gb/s 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.
• Referring now toFIG. 3A, the architecture of ablade104 is shown in further detail.Blade104 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 processors306.BIA302 is responsible for striping the data across the fivecross points202 ofbackplane102. In a preferred embodiment,BIA302 is implemented as an application-specific circuit (ASIC).BIA302 receives data from packet processors306 through IBTs304 (or directly from compatible packet processors).BIA302 may pass the data to backplane102 or may perform local switching between the local ports onblade104. In a preferred embodiment,BIA302 is coupled to four serial links308. Each serial link308 is coupled to an IBT304.
• Each packet processor306 includes one or more physical ports. Each packet processor306 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 IBT304. Each IBT304 receives the parallel data from each packet processor306. IBT304 then converts the parallel data to at least one serial bit streams. IBT304 provides the serial bit stream toBIA302 via a pipe308, described herein as one or more serial links. In a preferred embodiment, each pipe308 is a 10 Gb/s XAUI interface.
• In the example illustrated inFIG. 3A,packet processors306C and306D comprise 24—ten or 100 megabit per second Ethernet ports, and two 1000 megabit per second or 1 Gb/s Ethernet ports. Before the data is converted, the input data packets are converted to 32-bit parallel data clock data 133 MHz to achieve a four Gb/s 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.
• Also in the example ofFIG. 3A,IBT304C is connected topacket processors306C and306D. In this example,IBT304A is connected to apacket processor306A. This may be, for example, a ten gigabit per second OC-192 packet processor. In these examples, each IBT304 will receive as its input a 64-bit wide data stream clocked at 156.25 MHz. Each IBT304 will then output a 10 gigabit per second serial data stream toBIA302. According to one narrow cell format, 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.
• BIA302 receives the output ofIBTs304A-304D. Thus,BIA302 receives 4times 10 Gb/s of data. Or alternatively, 8times 5 gigabit per second of data.BIA302 runs at a clock speed of 156.25 MHz. With the addition of management overhead and striping,BIA302outputs 5times 10 gigabit per second data streams to the fivecross points202 inbackplane102.
• BIA302 receives the serial bit streams from IBTs304, determines a destination of each inbound packet based on packet header information, provides local switching between local IBTs304, formats data destined for a remote port, aggregates the serial bit streams from IBTs304 and produces an aggregate bit stream. The aggregated bit stream is then striped across the fivecross points202A-202E.
• FIG. 3B shows a configuration ofblade104 according another embodiment of the present invention. In this configuration,BIA302 receives output on serial links from a 10 Gb/spacket processor316A,IBT304C, and an Optical Channel OC-192C packet processor316B. IBT304 is further coupled topacket processors306C,306D as described above. 10 Gb/spacket processor316A outputs a serial data stream of narrow input cells carrying packets of data toBIA302 overserial link318A.IBT304C outputs a serial data stream of narrow input cells carrying packets of data toBIA302 overserial link308C. Optical Channel OC-192C packet processor316B outputs two serial data streams of narrow input cells carrying packets of data toBIA302 over twoserial links318B,318C.
A. Cross Point Architecture
• FIG. 4 illustrates the architecture of across point202.Cross point202 includes eightports401A-401H coupled to eight port slices402A-402H. As illustrated, each port slice402 is connected by a wire404 (or other connective media) to each of the other seven port slices402. Each port slice402 is also coupled to through a port401arespective blade104. To illustrate this,FIG. 4 shows connections forport401F and port slice402F (also referred to as port-slice5). For example,port401F is coupled viaserial link410 toblade104F.Serial link410 can be a 10G full-duplex serial link.
• Port slice402F is coupled to each of the seven other port slices402A-402E and402G-402H through links420-426. Links420-426 route data received in the other port slices402A-402E and402G-402H which has a destination port number (also called a destination slot number) associated with a port ofport slice402F (i.e. destination port number5). Finally,port slice402F includes alink430 that couples the port associated withport slice402F to the other seven port slices.Link430 allows data received at the port ofport slice402F to be sent to the other seven port slices. In one embodiment, each of the links420-426 and430 between the port slices are buses to carry data in parallel within thecross point202. Similar connections (not shown in the interest of clarity) are also provided for each of the other port slices402A-402E,402G and402H.
• FIG. 5 illustrates the architecture ofport401F andport slice402F in further detail. The architecture of theother ports401A-401E,401G, and401H and port slices402A-402E,402G and402H is similar toport401F andport slice402F. Accordingly,only port401F andport slice402F need be described in detail.Port401F includes one or more deserializer receiver(s)510 and serializer transmitter(s)580. In one embodiment, 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. In embodiments of the invention,port401F can be part ofport slice402F on a common chip, or on separate chips, or in separate units.
• Port slice402F includes a receivesynch FIFO module515 coupled between deserializer receiver(s)510 andaccumulator520. Receivesynch FIFO module515 stores data output fromdeserializer receivers510 corresponding toport slice402F.Accumulator520 writes data to an appropriate data FIFO (not shown) in the other port slices402A-402E,402G, and402H based on a destination slot or port number in a header of the received data.
• Port slice402F also receives data from other port slices402A-402E,402G, and402H. This data corresponds to the data received at the other seven ports of port slices402A-402E,402G, and402H which has a destination slot number corresponding to port slice402F. Port slice402F includes sevendata FIFOs530 to store data from corresponding port slices402A-402E,402G, and402H. Accumulators (not shown) in the sevenport slices402A-402E,402G, and402H extract the destination slot number associated withport slice402F and write corresponding data to respective ones of sevendata FIFOs530 forport slice402F. As shown inFIG. 5, eachdata FIFO530 includes a FIFO controller and FIFO random access memory (RAM). The FIFO controllers are coupled to aFIFO read arbitrator540. FIFO RAMs are coupled to amultiplexer550. FIFO readarbitrator540 is further coupled tomultiplexer550.Multiplexer550 has an output coupled todispatcher560.Dispatch560 has an output coupled to transmitsynch FIFO module570. Transmitsynch FIFO module570 has an output coupled to serializer transmitter(s)580.
• During operation, 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 readarbitrator540. FIFO readarbitrator540 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 readarbitrator540 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 points202.
• To process a read request, FIFO readarbitrator540 switches multiplexer550 to forward a cell of data from the data FIFO RAM associated with the read request todispatcher560.Dispatcher560 outputs the data to transmitsynch FIFO570. Transmitsynch FIFO570 stores the data until sent in a serial data stream by serializer transmitter(s)580 toblade104F.
• B. Port Slice Operation with Wide Cell Encoding and Flow Control
• According to a further embodiment, a port slice operates with respect to wide cell encoding and a flow control condition.FIGS. 27A-27E show a routine2700 for processing data in port slice based on wide cell encoding and a flow control condition (steps2710-2790). In the interest of brevity, routine2700 is described with respect to an example implementation ofcross point202 and anexample port slice402F. The operation of the other port slices402A-402E,402G and402H is similar.
• Instep2710, entries in receivesynch FIFO515 are managed. In one example, receivesynch FIFO module515 is an 8-entry FIFO with write pointer and read pointer initialized to be 3 entries apart. Receivesynch FIFO module515 writes 64-bit data from aSERDES deserialize receiver510, reads 64-bit data from a FIFO with a clock signal and delivers data toaccumulator520, 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.
• Instep2720,accumulator520 receives two chunks of 32-bit data are received from receivesynch FIFO515.Accumulator520 detects a special character K0 in the first bytes of first chunk and second chunk (step2722).Accumulator520 then extracts a destination slot number from the state field in the header if K0 is detected (step2724).
• As shown inFIG. 27B,accumulator520 further determines whether the cell header is low-aligned or high-aligned (step2726).Accumulator520 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 (step2728). Instep2730,accumulator520writes 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).Accumulator520 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 (step2732).Accumulator520 performs an early termination of a cell if an error condition is detected by inserting K0 and ABORT state information in the data (step2734). Whenaccumulator520 detects a K1 character in the first byte of data_l(first chunk) and data_h(second chunk) (step2736), andaccumulator520 writes subsequent 64-bit data to all destination data FIFOs (step2738).
• As shown inFIG. 27C, instep2740, if two 32-bit chunks of data are valid, then they are written to data FIFO RAM in one ofdata FIFOs530. Instep2742, 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 (step2744).
• Instep2746, a respective FIFO controller indicates to FIFO readarbitrator540 if K0 has been read or FIFO RAM is empty. This indication is a read request for arbitration. Instep2748, a respective FIFO controller indicates to FIFO readarbitrator540 whether K0 is aligned to the first 32-bit chunk or the second 32-bit chunk. When 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 readarbitrator540 after the current cell is completely read from the FIFO RAM (step2750).
• As shown inFIG. 27D, instep2760, FIFO readarbitrator540 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 readarbitrator540 switches to the next requestor and delivers 64-bit data from FIFO RAM of the requesting FIFO controller to the dispatcher560 (step2762). If end of current cell is 32-bit aligned, then FIFO readarbitrator540 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 dispatcher560 (step2764). Further, instep2766, FIFO readarbitrator540 indicates to thedispatcher560 when all 7 FIFO RAMs are empty.
• As shown inFIG. 27E, instep2770,dispatcher560 delivers 64-bit data to the SERDESsynch FIFO module570 and in turn to serializer transmitter(s)580, if non-idle data is received from the FIFO readarbitrator540.Dispatcher560 injects a first alignment sequence to be transmitted to the SERDESsynch FIFO module570 and in turn totransmitter580 when FIFO read arbitrator indicates that all 7 FIFO RAMs are empty (step2772).Dispatcher560 injects a second alignment sequence to be transmitted to the SERDESsynch FIFO module570 and in turn totransmitter580 when the programmable timer expires and the previous cell has been completely transmitted (step2774).Dispatcher560 indicates to the FIFO readarbitrator540 to temporarily stop serving any requestor until the current pre-scheduled alignment sequence has been completely transmitted (step2776). Control ends (step2790).
C. Backplane Interface Adapter
• To describe the structure and operation of the backplane interface adapter reference is made to components shown inFIGS. 6-9.FIG. 6 is a diagram of a backplane interface adapter (BIA)600 according to an embodiment of the present invention.BIA600 includes twotraffic processing paths603,604.FIG. 7 is a diagram showing a firsttraffic processing path603 for local serial traffic received atBIA600 according to an embodiment of the present invention.FIG. 8 is a diagram showing in more detail anexample switching fabric645 according to an embodiment of the present invention.FIG. 9 is a diagram showing a secondtraffic processing path604 for backplane serial traffic received atBIA600 according to an embodiment of the present invention. For convenience,BIA600 ofFIG. 6 will also be described with reference to a more detailed embodiment of elements alongpaths603,604 as shown inFIGS. 7 and 9, and theexample switching fabric645 shown inFIG. 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 inFIGS. 11-16.
D. Overall Operation of Backplane Interface Adapter
• FIG. 10 is a flowchart of a routine1000 interfacing serial pipes carrying packets of data in narrow input cells and a serial pipe carrying packets of data in wide striped cells (steps1010-1060).Routine1000 includes receiving narrow input cells (step1010), sorting the received input cells based on a destination slot identifier (1020), generating wide striped cells (step1030), storing the generated wide striped cells in corresponding stripe send queues based on a destination slot identifier and an originating source packet processor (step1040), arbitrating the order in which the stored wide striped cells are selected for transmission (step1050) and transmitting data slices representing blocks of wide cells across multiple stripes (step1060). For brevity, each of these steps is described further with respect to the operation of the first traffic processing path inBIA600 in embodiments ofFIGS. 6 and 7 below.
• FIG. 11 is a flowchart of a routine1100 interfacing serial pipes carrying packets of data in wide striped cells to serial pipes carrying packets of data in narrow input cells (steps1110-1180).Routine1100 includes receiving wide striped cells carrying packets of data in multiple stripes from a switching fabric (step1110), sorting the received subblocks in each stripe based on source packet processor identifier and originating slot identifier information (step1120), storing the sorted received subblocks in stripe receive synchronization queues (step1130), assembling wide striped cells in the order of the arbitrating step based on the received subblocks of data (step1140), translating the received wide striped cells to narrow input cells carrying the packets of data (step1150), storing narrow cells in a plurality of destination queues (step1160), 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 (step1180). In one additional embodiment, 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. For brevity, each of these steps is described further with respect to the operation of the second traffic processing path inBIA600 in embodiments ofFIGS. 6 and 7 below.
• As shown inFIG. 6, trafficprocessing flow path603 extends in traffic flow direction from local packet processors toward a switchingfabric645. Trafficprocessing flow path604 extends in traffic flow direction from the switchingfabric645 toward local packet processors.BIA600 includes deserializer receiver(s)602,traffic sorter610, wide cell generator(s)620, stripe sendqueues625, switching fabric transmitarbitrator630 and sterilizer transmitter(s)640 coupled alongpath603.BIA600 includes deserializer receiver(s)650, stripe interface module(s)660, stripe receivesynchronization queues685, controller670 (includingarbitrator672, striped-basedwide cell assemblers674, and administrative module676), wide/cell translator680,destination queues615, local destination transmitarbitrator690, and sterilizer transmitter(s)692 coupled alongpath604.
E. First Traffic Processing Path
• 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, fourdeserializer receivers602 are coupled to four serial links (such as, links308A-D,318A-C described above inFIGS. 3A-3B). As shown in the example ofFIG. 7, eachdeserialize receiver602 includes adeserializer receiver702 coupled to across-clock domain synchronizer703. For example, eachdeserializer receiver702 coupled to across-clock domain synchronizer703 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. In one embodiment, eachdeserializer receiver702 can receive interleaved streams of data from two serial links coupled to two sources.FIG. 7 shows one example where four deserializer receivers702 (q=4) are coupled to two sources (j=2) of a total of eight serial links (k=8). In one example, eachdeserializer receiver702 receives a capacity of 10 Gb/s of serial data.
F. Narrow Cell Format
• FIG. 13 shows the format of an examplenarrow cell1300 used to carry packets of data in the narrow input cells. Such a format can include, but is not limited to, a data cell format received from a XAUI interface.Narrow cell1300 includes four lanes (lanes0-3). Each lane0-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 inlane0 of control information, and one byte in lane I of state information. One byte is reserved in each oflanes2 and3. Table1310 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 ofpacket cell), data (meaning a cell carrying payload data of a packet), and abort (meaning a packet transfer is being aborted).
G. Traffic Sorting
• Traffic sorter610 sorts received narrow input cells based on a destination slot identifier.Traffic sorter610 routes narrow cells destined for the same blade as BIA600 (also called local traffic) todestination queues615. Narrow cells destined for other blades in a switch across the switching fabric (also called global traffic) are routed towide cell generators620.
• FIG. 7 shows a further embodiment wheretraffic sorter610 includes a global/traffic sorter712 coupled to abackplane sorter714. Global/traffic sorter712 sorts received narrow input cells based on the destination slot identifier.Traffic sorter712 routes narrow cells destined for the same blade asBIA600 todestination queues615. Narrow cells destined for other blades in a switch across the switching fabric (also called global traffic or backplane traffic) are routed tobackplane traffic sorter714.Backplane traffic sorter714 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 sorter714 then routes the sorted groups of narrow input cells of the backplane traffic to corresponding wide cell generators720. Each wide cell generator720 then processes a corresponding group of narrow input cells. Each group of narrow input cells represents portions of packets sent from two corresponding interleaved sources (j=2) and destined for a respective blade. In one example, 56 wide cell generators720 are coupled to the output of fourbackplane traffic sorters714. The total of 56 wide cell generators720 is given by 56=q*j*l−1, where j=2 sources, l=8 blades, and q=four serial input pipes and fourdeserializer receivers702.
H. Wide Striped Cell Generation
• Wide cell generators620 generate wide striped cells. The wide striped cells carry the packets of data received byBIA600 in the narrow input cells. The wide cells extend across multiple stripes and include in-band control information in each stripe. In the interest of brevity, the operation ofwide cell generators620,720 is further described with respect to a routine1200 inFIG. 12.Routine1200 however is not intended to be limited to use inwide cell generator620,720 and may be used in other structure and applications.
• FIG. 12 shows a routine1200 for generating wide striped cell generation according to the present invention (steps1210-1240). In one embodiment, each wide cell generator(s)620,720 perform steps1210-1240. Instep1210,wide cell generator620,720 parse each narrow input cell to identify a header. When control information is found in a header, a check is made to determine whether the control information indicates a start of packet (step1220). For example, to carry outsteps1210 and1220,wide cell generator620,720 can readlane0 ofnarrow cell1300 to determine control information indicating a start of packet is present. In one example, this start of packet control information is a special control character K0.
• For each detected packet (step1225), steps1230-1240 are performed. Instep1230,wide cell generator620,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 routine1400 andFIGS. 15A-D, and16.
• Instep1230,wide cell generator620 then writes the one or more new wide striped cells into a plurality of sendqueues625. In the example ofFIG. 7, a total of 56 wide cell generators720 are coupled to 56 stripes sendqueues725. In this example, the 56 wide cell generators720 each write newly generated wide striped cells into respective ones of the 56 stripe sendqueues725.
I. Encoding Wide Striped Cells
• According to a further feature of the present invention, system and method for encoding wide striped cells is provided. In one embodiment,wide cell generators620,720 each generate wide striped cells which are encoded (step1230).FIG. 14 is a flowchart of a routine1400 for encoding wide striped cells according to an embodiment of the present invention (steps1410-1460).
J. Initial Block Encoding
• Instep1410,wide cell generator620,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 subblock of an initial block of a wide striped cell.FIG. 15A shows the encoding of an initial block in a widestriped cell1500 according to an embodiment of the present invention. The initial block is labeled ascycle1. The initial block has twenty bytes that extend across five stripes1-5. Each stripe has a subblock of four bytes. The four bytes of a subblock correspond to four one byte lanes. In this way, a stripe is a data slice of a subblock of a wide cell. A lane is a data slice of one byte of the subblock. Instep1410, then control information (K0) is provided all eachlane0 of the stripes1-5. State information is provided in each in each lane I of the stripes1-5. Also, two bytes are reserved inlanes2 and3 ofstripe5.
• FIG. 15B is a diagram illustrating state information used in a wide striped cell according to an embodiment of the present invention. As shown inFIG. 15B, state information for a wide striped cell can include any combination of state information including one or more of the following: 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.
• Instep1420, wide cell generator(s)620,720 distribute initial bytes of packet data into available space in the initial block. In the example widestriped cell1500 shown inFIG. 1 SA, two bytes of data D0, D1 are provided inlanes2 and3 ofstripe1, two bytes of data D2, D3 are provided inlanes2 and3 ofstripe2, two bytes of data D4, D5 are provided inlanes2 and3 ofstripe3, and two bytes of data D6, D7 are provided inlanes2 and3 ofstripe4.
• Instep1430, 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). In the example widestriped cell1500, maximum size of a wide striped cell is 160 bytes (8 blocks) which corresponds to a maximum of 148 bytes of data. In addition to the data bytes D0-D7 in the initial block, widestriped cell1500 further has data bytes D8-D147 distributed in seven blocks (labeled inFIG. 15A as blocks2-8).
• In general, 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 (step1440) and whether the end of packet is reached (step1450). If the maximum cell size is reached instep1440 and more packet data needs to be distributed then control returns to step1410 to create additional wide striped cells to carry the rest of the packet data. If the maximum cell size is not reached instep1440, then an end of packet check is made (step1450). 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 instep1450, then control proceeds to step1460.
K. End of Packet Encoding
• Instep1460, 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. 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 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 K1 is used to indicate end of packet. A set of four end of packet conditions are shown (items1-4). The four end of packet conditions are whether the end of packet occurs during the initial block (item1) or during any subsequent block (items2-4). The end of packet conditions for subsequent blocks further include whether the end of packet occurs within a block (item2), at a block boundary (item3), or at a cell boundary (item4). As shown initem1 ofFIG. 15C, when the end of packet occurs during the initial block, control and state information (K0, state) and reserved information are preserved as in any other initial block transmission. K1 bytes are added as data in remaining data bytes.
• As shown initem2 ofFIG. 15C, when the end of packet occurs during a subsequent block (and not at a block or cell boundary), K1 bytes are added as data in remaining data bytes until an end of a block is reached. InFIG. 15C,item2, an end of packet is reached at data byte D33 (stripe2,lane1 in block of cycle3). K1 bytes are added for each lane for remainder of block. When the end of packet occurs at a block boundary of a subsequent block (item3), K1 bytes are added as data in an entire subsequent block. InFIG. 15C,item3, an end of packet is reached at data byte D27 (end of block of block2). K1 bytes are added for each lane for entire block (block3). When the end of packet occurs during a subsequent block but at a cell boundary (item4), one wide striped cell having an initial block with K1 bytes added as data is generated. InFIG. 15D,item4, an end of packet is reached at data byte D147 (end of cell and end of block for block8). One wide striped cell consisting of only an initial block with normal control, state and reserved information and with K1 bytes added as data is generated. As shown inFIG. 15D, such an initial block with K1 bytes consists of stripes1-5 with bytes as follows: stripe1 (K0, state, K1,K1), stripe2 (K0, state, K1,K1), stripe3 (K0, state, K1,K1), stripe4 (K0, state, K1,K1), stripe5 (K0, state, reserved, reserved).
L. Switching Fabric Transmit Arbitration.
• In one embodiment,BIA600 also includes switching fabric transmitarbitrator630. Switching fabric transmitarbitrator630 arbitrates the order in which data stored in the stripe sendqueues625,725 is sent bytransmitters640,740 to the switching fabric. Each stripe sendqueue625,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. During operation the switching fabric transmitarbitrator630 selects astripe send queue625,725 and pushes the next available cell to thetransmitters640,740. In this way one full cell is sent at a time. (Alternatively, a portion of a cell can be sent.) Each stripe of a wide cell is pushed to therespective transmitter640,740 for that stripe. In one example, during normal operation, 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. However, the packets for the different slots are sent during an arbitration cycle. In an alternative embodiment, other blades or slots are then selected in a round-robin fashion.
• M. Cross Point Processing of Stripes including Wide Cell Encoding
• In on embodiment, switchingfabric645 includes a number n of cross point switches202 corresponding to each of the stripes. Each cross point switch202 (also referred to herein as a cross point or cross point chip) handles one data slice of wide cells corresponding to one respective stripe. In one example, five cross point switches202A-202E are provided corresponding to five stripes. For clarity,FIG. 8 shows only two of five cross point switches corresponding tostripes1 and5. The five cross point switches202 are coupled between transmitters and receivers of all of the blades of a switch as described above with respect toFIG. 2. For example,FIG. 8 shows cross point switches202 coupled between one set oftransmitters740 for stripes of one blade and another set ofreceivers850 on a different blade.
• The operation of across point202 and in particular aport slice402F is now described with respect to an embodiment where stripes further include wide cell encoding and a flow control indication.
• Port slice402F also receives data from other port slices402A-402E,402G, and402H. This data corresponds to the data received at the other seven ports of port slices402A-402E,402G, and402H which has a destination slot number corresponding to port slice402F. Port slice402F includes sevendata FIFOs530 to store data from corresponding port slices402A-402E,402G, and402H. Accumulators (not shown) in the sevenport slices402A-402E,402G, and402H extract the destination slot number associated withport slice402F and write corresponding data to respective ones of sevendata FIFOs530 forport slice402F. As shown inFIG. 5, eachdata FIFO530 includes a FIFO controller and FIFO random access memory (RAM). The FIFO controllers are coupled to aFIFO read arbitrator540. FIFO RAMs are coupled to amultiplexer550. FIFO readarbitrator540 is further coupled tomultiplexer550.Multiplexer550 has an output coupled todispatcher560.Dispatch560 has an output coupled to transmitsynch FIFO module570. Transmitsynch FIFO module570 has an output coupled to serializer transmitter(s)580.
• During operation, 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 readarbitrator540. FIFO readarbitrator540 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 readarbitrator540 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 points202.
• To process a read request, FIFO readarbitrator540 switches multiplexer550 to forward a cell of data from the data FIFO RAM associated with the read request todispatcher560.Dispatcher560 outputs the data to transmitsynch FIFO570. Transmitsynch FIFO570 stores the data until sent in a serial data stream by serializer transmitter(s)580 toblade104F.
• Cross point operation according to the present invention is described further below with respect to a further embodiment involving wide cell encoding and flow control.
N. Second Traffic Processing Path
• FIG. 6 also shows a traffic processing path for backplane serial traffic received atbackplane interface adapter600 according to an embodiment of the present invention.FIG. 9 further shows the second traffic processing path in even more detail.
• As shown inFIG. 6,BIA600 includes one ormore deserialize receivers650, wide/narrow cell translators680, andserializer transmitters692 along the second path.Receivers650 receive wide striped cells in multiple stripes from the switchingfabric645. The wide striped cells carry packets of data. In one example, fivedeserializer receivers650 receive five subblocks 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. In one digital switch embodiment, 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 toFIG. 8.
• Translators680 translate the received wide striped cells to narrow input cells carrying the packets of data.Serializer transmitters692 transmit the narrow input cells to corresponding source packet processors or IBTs.
• BIA600 further includes stripe interfaces660 (also called stripe interface modules), stripe receive synchronization queues (685), andcontroller670 coupled betweendeserializer receivers650 and acontroller670. Eachstripe interface660 sorts received subblocks in each stripe based on source packet processor identifier and originating slot identifier information and stores the sorted received subblocks in the stripe receivesynchronization queues685.
• Controller670 includes anarbitrator672, a striped-basedwide cell assembler674, and anadministrative module676.Arbitrator672 arbitrates an order in which data stored in stripe receivesynchronization queues685 is sent to striped-basedwide cell assembler674. Striped-basedwide cell assembler674 assembles wide striped cells based on the received subblocks of data. A narrow/wide cell translator680 then translates the arbitrated received wide striped cells to narrow input cells carrying the packets of data.Administrative module676 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.BIA600 further includesdestination queues615 and a local destination transmitarbitrator690 in the second path.Destination queues615 store narrow cells sent by traffic sorter610 (from the first path) and the narrow cells translated by the translator680 (from the second path). Local destination transmitarbitrator690 arbitrates an order in which narrow input cells stored indestination queues690 is sent to serializertransmitters692. Finally,serializer transmitters692 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.BIA600 includes five groups of components for processing data slices from five slices. InFIG. 9 only twogroups900 and901 are shown for clarity, andonly group900 need be described in detail with respect to one stripe since the operations of the other groups is similar for the other four stripes.
• In the second traffic path,deserializer receiver950 is coupled to crossclock domain synchronizer952.Deserializer receiver950 converts serial data slices of a stripe (e.g., subblocks) to parallel data. Crossclock domain synchronizer952 synchronizes the parallel data.
• Stripe interface960 has adecoder962 andsorter964 to decode and sort received subblocks in each stripe based on source packet processor identifier and originating slot identifier information.Sorter964 then stores the sorted received subblocks in stripe receivesynchronization queues965. Five groups of 56 stripe receivesynchronization queues965 are provided in total. This allows one queue to be dedicated for each group of subblocks received from a particular source per global blade (up to 8 source packet processors per blade for seven blades not including the current blade).
• Arbitrator672 arbitrates an order in which data stored in stripe receivesynchronization queues685 sent to striped-basedwide cell assembler674. Striped-basedwide cell assembler674 assembles wide striped cells based on the received subblocks of data. A narrow/wide cell translator680 then translates the arbitrated received wide striped cells to narrow input cells carrying the packets of data as described above inFIG. 6.
• Destination queues includelocal destination queues982 andbackplane traffic queues984.Local destination queues982 store narrow cells sent bylocal traffic sorter716.Backplane traffic queues984 store narrow cells translated by thetranslator680. Local destination transmitarbitrator690 arbitrates an order in which narrow input cells stored indestination queues982,984 is sent to serializertransmitters992. Finally,serializer transmitters992 then transmit the narrow input cells to corresponding IBTs and/or source packet processors (and ultimately out of a blade through physical ports).
O. Cell Boundary Alignment
• 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 K0 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 inBIA600.
P. Packet Alignment
• 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.
Q. Wide Striped Cell Size at Line Rate
• In one example, a wide cell has a maximum size of eight blocks (160 bytes) which can carry a 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 Gb/sec rate through the digital switch.
R. IBT and Packet Processing
• The integrated packet controller (IPC) and integrated giga controller (IGC) functions are provided with a bus translator, described above as the IPC/IGC Bus Translator (IBT)304. In one embodiment, the IBT is an ASIC that bridges one or more IPC/IC ASIC. In such an embodiment, the IBT translates two 4/5 gig parallel stream into one 10 Gbps serial stream. The parallel interface can be the backplane interface of the IPC/IGC ASICs. The one 10 Gbps serial stream can be further processed, for example, as described herein with regard to interface adapters and striping.
• Additionally, IBT304 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. For example, the IBT304 can be implemented in packet processors using 10GE and OC-192 configurations. The functionality of the IBT304 can be incorporated within existing packet processors or attached as an add-on component to a system.
• InFIG. 17, a block diagram1700 illustrates the components of abus translator1702 according to one embodiment of the present invention. The previously described IBT304 can be configured as thebus translator1702 ofFIG. 17. For example, IBT304 can be implemented to include the functionality of thebus translator1702.
• More specifically, thebus translator1702 translatesdata1704 intodata1706 anddata1706 intodata104. Thedata1706 is received by transceiver(s)1710 is forwarded to atranslator1712. Thetranslator1712 parses and encodes thedata1706 into a desired format.
• Here, thetranslator1712 translates thedata1706 into the format of thedata1704. Thetranslator1712 is managed by anadministration module1718. One ormore memory pools1716 store the information of thedata1706 and thedata1704. One ormore clocks1714 provide the timing information to the translation operations of thetranslator1712. Once thetranslator1712 finishes translating thedata1706, it forwards the newly formatted information as thedata1704 to the transceiver(s)1708. The transceiver(s)1708 forward thedata1704.
• As one skilled in the relevant art would recognize based on the teachings described herein, the operational direction ofbus translator1702 can be reversed and thedata1704 received by thebus translator1702 and thedata1706 forwarded after translation.
• For ease of illustration, but without limitation, the process of translating thedata1706 into thedata1704 is herein described as receiving, reception, and the like. Additionally, for ease of illustration, but without limitation, the process of translating thedata1704 into thedata1706 is herein described as transmitting, transmission, and the like.
• InFIG. 18, a block diagram of the reception components according to one embodiment of the present invention. In one embodiment,bus translator1802 receives data in the form of packets from interface connections1804a-n. The interface connections1804a-ncouple to one ormore receivers1808 ofbus translator1802.Receivers1808 forward the received packets to one ormore packet decoders1810. In one embodiment, the receiver(s)1808 includes one or more physical ports. In an additional embodiment, each ofreceivers1808 includes one or more logical ports. In one specific embodiment, the receiver(s)1808 consists of four logical ports.
• Thepacket decoders1810 receive the packets from thereceivers1808. Thepacket decoders1810 parse the information from the packets. In one embodiment, as is described below in additional detail, thepacket decoders1810 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. Thepacket decoders1810 forward the parsed information to memory pool(s)1812. In one embodiment, thebus translator1802 includes more than onememory pool1812. 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 thepools1812 and1818.
• Reference clock1820 provides timing information to the packet decoder(s)1810. In one embodiment,reference clock1820 is coupled to the IPC/IGC components sending the packets through the connections1804a-n. In another embodiment, thereference clock1820 provides reference and timing information to all the parallel components of thebus translator1802.
• 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.
• In the description that follows, these cells are also referred to as narrow cells. Furthermore, the cell encoder(s)1814 can be configured to format the information into one or more cell types. In one embodiment, the cell format is a fixed size. In another embodiment, the cell format is a variable size.
• The cell format is described in detail below with regard to cell encoding and decoding processes ofFIGS. 22,23A-B,24, and25A-B.
• 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 connections1806a-n.
• Reference clock1828 provides timing information to the cell encoder(s)1814. In one embodiment,reference clock1828 is coupled to the interface adapter components receiving the cells through the connections1806a-n. In another embodiment, thereference clock1828 provides reference and timing information to all the serial components of thebus translator1802.
• Flow controller1822 measures and controls the incoming packets and outgoing cells by determining the status of the components of thebus translator1802 and the status of the components connected to thebus translator1802. Such components are previously described herein and additional detail is provided with regard to the interface adapters of the present invention.
• In one embodiment, theflow controller1822 controls the traffic through the connection1806 by asserting a ready signal and de-asserting the ready signal in the event of an overflow in thebus translator1802 or the IPC/IGC components further connected.
• Administration module1824 provides control features for thebus translator1802. In one embodiment, theadministration module1824 provides error control and power-on and reset functionality for thebus translator1802.
• FIG. 19 illustrates a block diagram of the transmission components according to one embodiment of the present invention. In one embodiment,bus translator1902 receives data in the form of cells from interface connections1904a-n. The interface connections1904a-ncouple to one ormore receivers1908 ofbus translator1902. In one embodiment, the receiver(s)1908 include one or more physical ports. In an additional embodiment, each ofreceivers1908 includes one or more logical ports. In one specific embodiment, the receiver(s)1908 consists of four logical ports.Receivers1908 forward the received cells to asynchronization module1910. In one embodiment, thesynchronization module1910 is a FIFO used to synchronize incoming cells to thereference clock1922. It is noted that although there is no direct arrow shown inFIG. 19 fromreference clock1922 tosynchronization module1910, the two module can communicate such that the synchronization module is capable of synchronizing the incoming cells. Thesynchronization module1910 forwards the one ormore cell decoders1912.
• Thecell decoders1912 receive the cells from thesynchronization module1910. Thecell decoders1912 parse the information from the cells. In one embodiment, as is described below in additional detail, thecell decoders1912 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.
• In one embodiment, the cell format can be fixed. In another embodiment, the cell format can be variable. In yet another embodiment, the cells received by thebus translator1902 can be of more than one cell format. Thebus translator1902 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.
• Thecell decoders1912 forward the parsed information to memory pool(s)1914. In one embodiment, thebus translator1902 includes more than onememory pool1914. In an alternative embodiment, alternate memory pool(s)1916 can be sent the information. In an additional embodiment, 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 thepools1914 and1916.
• Reference clock1922 provides timing information to the cell decoder(s)1912. In one embodiment,reference clock1922 is coupled to the interface adapter components sending the cells through the connections1904a-n. In another embodiment, thereference clock1922 provides reference and timing information to all the serial components of thebus translator1902.
• 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)1920. The transmitter(s)1920 receive the packets and transmit the packets through interface connections1906a-n.
• Reference clock1928 provides timing information to the packet encoder(s)1918. In one embodiment,reference clock1928 is coupled to the IPC/IGC components receiving the packets through the connections1906a-n. In another embodiment, thereference clock1928 provides reference and timing information to all the parallel components of thebus translator1902.
• Flow controller1926 measures and controls the incoming cells and outgoing packets by determining the status of the components of thebus translator1902 and the status of the components connected to thebus translator1902. Such components are previously described herein and additional detail is provided with regard to the interface adapters of the present invention.
• In one embodiment, theflow controller1926 controls the traffic through the connection1906 by asserting a ready signal and de-asserting the ready signal in the event of an overflow in thebus translator1902 or the IPC/IGC components further connected.
• Administration module1924 provides control features for thebus translator1902. In one embodiment, theadministration module1924 provides error control and power-on and reset functionality for thebus translator1902.
• InFIG. 20, a detailed block diagram of the bus translator according to one embodiment, is shown.Bus translator2002 incorporates the functionality ofbus translators1802 and1902.
• In terms of packet processing, packets are received by thebus translator2002 byreceivers2012. The packets are processed into cells and forwarded to a serializer/deserializer (SERDES)2026.SERDES2026 acts as a transceiver for the cells being processed by thebus translator2002. TheSERDES2026 transmits the cells viainterface connection2006.
• In terms of cell processing, cells are received by thebus translator2002 through theinterface connection2008 to theSERDES2026. The cells are processed into packets and forwarded totransmitters2036. Thetransmitters2036 forward the packets to the IPC/IGC components through interface connections2010a-n.
• The reference clocks2040 and2048 are similar to those previously described inFIGS. 18 and 19. Thereference clock2040 provides timing information to the serial components of thebus translator2002. As shown, thereference clock2040 provides timing information to the cell encoder(s)2020, cell decoder(s)2030, and theSERDES2026. Thereference clock2048 provides timing information to the parallel components ofbus translator2002. As shown, thereference clock2048 provides timing information to the packet decoder(s)2016 and packet encoder(s)2034.
• The above-described separation of serial and parallel operations is a feature of embodiments of the present invention. In such embodiments, the parallel format of incoming and leaving packets at ports2014a-nand2038a-b, respectively, is remapped into a serial cell format at theSERDES2026.
• Furthermore, according to embodiments of the present invention, the line rates of the ports2014a-nhave a shared utilization limited only by the line rate ofoutput2006. Similarly for ports2038a-nandinput2008.
• The remapping of parallel packets into serial cells is descibed in further detail herein, more specifically with regard toFIG. 21E.
• InFIG. 21A, a detailed block diagram of the bus translator, according to another embodiment of the present invention, is shown. The receivers and transmitters ofFIGS. 18,19, and20 are replaced with CMOS I/Os2112 capable of providing the same functionality as previously described. The CMOS I/Os2112 can be configured to accommodate various numbers of physical and logical ports for the reception and transmission of data.
• Administration module2140 operates as previously described. As shown, theadministration module2140 includes an administration control element and an administration register. The administration control element monitors the operation of thebus translator2102 and provides the reset and power-on functionality as previously described with regard toFIGS. 18,19, and20. The administration register caches operating parameters such that the state of thebus translator2102 can be determined based on a comparison or look-up against the cached parameters.
• The reference clocks2134 and2136 are similar to those previously described inFIGS. 18,19, and20. Thereference clock2136 provides timing information to the serial components of thebus translator2102. As shown, thereference clock2136 provides timing information to the cell encoder(s)2118, cell decoder(s)2128, and theSERDES2124. Thereference clock2134 provides timing information to the parallel components ofbus translator2102. As shown, thereference clock2134 provides timing information to the packet decoder(s)2114 and packet encoder(s)2132.
• As shown inFIG. 21A,memory pool2116 includes two pairs of FIFOs. Each FIFO pair with a header queue. Thememory pool2116 performs as previously described memory pools inFIGS. 18 and 20. In one embodiment, 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.
• Additionally,memory pool2130 includes two pairs of FIFOs. Thememory pool2130 performs as previously described memory pools inFIGS. 19 and 20. In one embodiment, decoded cell information is stored in one or more FIFOs along with corresponding timing, place of origin, destination, and similar information.
• Interface connections2106 and2108 connect previously described interface adapters to thebus translator2102 through theSERDES2124. In one embodiment, theconnections2106 and2108 are serial links. In another embodiment, the serial links are divided four lanes.
• In one embodiment, thebus translator2102 is an IBT304 that translates one or more 4 Gbps parallel IPC/IGC components into four 3.125 Gbps serial XAUI interface links or lanes. In one embodiment, the back planes are the IPC/IGC interface connections. Thebus translator2102 formats incoming data into one or more cell formats.
• In one embodiment, the cell format can be a four byte header and a 32 byte data payload. In a further embodiment, each cell is separated by a special K character into the header. In another embodiment, the last cell of a packet is indicated by one or more special K1 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. In an alternative embodiment, cell formats can be implemented where the cell length exceeds the 36 bytes (4 bytes+32 bytes) previously described.
• InFIG. 21B, a functional block diagram shows the data paths with reception components of the bus translator. Packet decoders2150a-bforward packet data to the FIFOs and headers in pairs. For example,packet decoder2150aforwards packet data to FIFO2152a-band side-band information toheader2154. A similar process is followed forpacket decoder2150b.Packet decoder2150bforwards packet data to FIFO2156a-band side-band information toheader2158. Cell encoder(s)2160 receive the data and control information and produce cells to serializer/deserializer (SERDES) circuits, shown as their functional components SERDESspecial character2162, and SERDES data2164a-b. The SERDESspecial character2162 contains the special characters used to indicate the start and end of a cell's data payload. The SERDES data2164a-bcontains 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 toFIG. 21E.
• Thebus translator2102 hasmemory pools2116 to act as internal data buffers to handle pipeline latency. For each IPC/IGC component, thebus translator2102 has two data FIFOs and one header FIFO, as shown inFIG. 21A as the FIFOs ofmemory pool2116 and inFIG. 21B as elements2152a-b,2154,2156a-b, and2158. In one embodiment, 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 A1, A2, or B1,B2 in a ping-pong fashion. The ping-pong fashion is well-known in the relevant art and involves alternating fashion.
• In one embodiment, thecell encoder2160 merges the data from each of the packet decoders2150a-binto one 10 Gbps data stream to the interface adapter. Thecell encoder2160 merges the data by interleaving the data at each cell boundary. Each cell boundary is determined by the special K characters.
• According to one embodiment, the received packets are 32 bit aligned, while the parallel interface of the SERDES elements is 64 bit wide.
• 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, thebus translators2102 must parse the packets without the delays of typical parsing and routing components. More specifically, thebus translators2102 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. Thus, in one embodiment, 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 includeelements2170, and2172a-b. The control information and data are parsed from the cell and forward to the memory pool(s). In one embodiment, FIFOs are maintained in pairs, shown as elements2176a-band2176c-d. Each pair forwards control information and data to packet encoders2178a-b.
• FIG. 21D 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. In one embodiment, thebus translator2102 can be configured into native mode. Native mode can include when a total of 10 Gbps connections are maintained at the parallel end (as shown by CMOS I/Os2112) of thebus translator2102. In one embodiment, due to the increased bandwidth requirement (from 8 Gbps to 10 Gbps), the cell format length is no longer fixed at 32 bytes. In embodiments where a 10 Gbps traffic is channeled through thebus translator2102, control information is attached when thebus translator2102 receives a SOP from the device(s) on the 10 Gbps link. In an additional embodiment, when thebus translator2102 first detects a data transfer and is, therefore, coming to an operational state from idle, it attaches control information.
• In an additional embodiment, as shown inFIG. 21D, two separate data FIFOs are used to temporarily buffer the uplinking data; thus avoiding existing timing paths.
• Although a separate native mode data path is not shown for cell to packet translation, one skilled in the relevant art would recognize how to accomplish it based at least on the teachings described herein. For example, by configuring two FIFOs for dedicated storage of 10 Gbps link information. In one embodiment, however, thebus translator2102 processes native mode and non-native mode data paths in a shared operation as shown inFIGS. 19,20, and21. Headers and idle bytes are stripped from the data stream by the cell decoder(s), such as decoder(s)2103 and2174. Valid data is parsed and stored, and forwarded, as previously described, to the parallel interface.
• In an additional embodiment, where there is a zero body cell format being received by the interface adapter or BIA, the IBT304 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.
S. Narrow Cell and Packet Encoding Processes
• FIG. 21E shows a block diagram of a cell format according to one embodiment of the present invention.FIG. 21E shows both an example packet and a cell according to the embodiments described herein. The example packet shows a start ofpacket2190a,payload containing data2190b, end ofpacket2190c, andinter-packet gap2190c.
• According to one embodiment of the present invention, the cell includes a special character K02190; acontrol information2194; optionally, one or more reserved2196a-b; and data2198a-n. In an alternate embodiment, data2198a-ncan contain more than D0-D31.
• In one embodiment, the four rows or slots indicated inFIG. 21E illustrate the four lanes of the serial link through which the cells are transmitted and/or received.
• As previously described herein, the IBT304 transmits and receives cells to and from theBIA302 through the XAUI interface. The IBT304 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 K1 special character on any invalid data bytes within four byte of transfer or four K1 on all XAUI lanes. In one embodiment, 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:

• 	Lane0	Lane1	Lane2	Lane3
  	K0	State	Reserved	Reserved
  	D0	D1	D2	D3
  	D4	D5	D6	D7
  	D8	D9	D10	D11
  	D12	D13	D14	D15
  	. . .	. . .	. . .	. . .
  	D28	D29	D30	D31

• 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 onLane 0 to indicate that current transfer is a header. The control information starts onLane 1 of a header.
• In one embodiment, the IBT304 accepts two IPC/IGC back plane buses and translates them into one 10 Gbps serial stream.
• InFIG. 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 atstep2202 and immediately proceeds to step2204.
• Instep2204, the IBT304 determines the port types through which it will be receiving packets. In one embodiment, the ports are configured for 4 Gbps traffic from IPC/IGC components. The process immediately proceeds to step2206.
• Instep2206, the IBT304 selects a cell format type based on the type of traffic it will be processing. In one embodiment, the IBT304 selects the cell format type based in part on the port type determination ofstep2204. The process immediately proceeds to step2208.
• Instep2208, the IBT304 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 step2210.
• Instep2210, the IBT304 parses the one or more packets received instep2208 for the information contained therein. In one embodiment, the packet decoder(s) of the IBT304 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 step2212.
• Instep2212, the IBT304 optionally stores the information parsed instep2210. In one embodiment, the memory pool(s) of the IBT304 are utilized to store the information. The process immediately proceeds to step2214.
• Instep2214, the IBT304 formats the information into one or more cells. In one embodiment, the cell encoder(s) of the IBT304 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. As previously described, the cell format includes special characters which are added to the information. The process immediately proceeds to step2216.
• Instep2216, the IBT304 forwards the formatted cells. In one embodiment, the SERDES of the IBT304 receives the formatted cells and serializes them for transport to theBIA302 of the present invention. The process continues until instructed otherwise.
• InFIGS. 23A-B, a detailed flow diagram shows the encoding process of the bus translator according to one embodiment of the present invention. The process ofFIGS. 23A-B begins atstep2302 and immediately flows to step2304.
• Instep2304, the IBT304 determines the port types through which it will be receiving packets. The process immediately proceeds to step2306.
• Instep2306, the IBT304 determines if the port type will, either individually or in combination, exceed the threshold that can be maintained. In other words, the IBT304 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 step2310. In not, then the process proceeds to step2308.
• Instep2308, given that the IBT304 has determined that it will be operating at its highest level, the IBT304 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. In one embodiment, the cell format provides for cells of whole integer multiples of each of the one or more packets received. In another embodiment, the IBT304 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 step2312.
• Instep2310, given that the IBT304 has determined that it will not be operating at its highest level, the IBT304 selects a fixed cell size that will allow the IBT304 to process information with lower processing overhead. The process immediately proceeds to step2312.
• Instep2312, the IBT304 receives one or more packets. The process immediately proceeds to step2314.
• Instep2314, the IBT304 parses the control information from each of the one or more packets. The process immediately proceeds to step2316.
• Instep2316, the IBT304 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 step2318.
• Instep2318, the IBT304 stores the slot and state information. The process immediately proceeds to step2320.
• Instep2320, the IBT304 parses the payload of each of the one or more packets for the data contained therein. The process immediately proceeds to step2322.
• Instep2322, the IBT304 stores the data parsed from each of the one or more packets. The process immediately proceeds to step2324.
• Instep2324, the IBT304 accesses the control information. In one embodiment, the cell encoder(s) of the IBT304 access the memory pool(s) of the IBT304 to obtain the control information. The process immediately proceeds to step2326.
• Instep2326, the IBT304 accesses the data parsed from each of the one or more packets. In one embodiment, the cell encoder(s) of the IBT304 access the memory pool(s) of the IBT304 to obtain the data. The process immediately proceeds to step2328.
• Instep2328, the IBT304 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 process immediately proceeds to step2330.
• Instep2330, the IBT304 inserts the slot information. In one embodiment, the IBT304 inserts the slot information into the next lane, such asspace2194. The process immediately proceeds to step2332.
• Instep2332, the IBT304 inserts the state information. In one embodiment, the IBT304 inserts the state information into the next lane after the one used for the slot information, such as reserved2196a. The process immediately proceeds to step2334.
• Instep2334, the IBT304 inserts the data. The process immediately proceeds to step2336.
• Instep2336, the IBT304 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 tostep2328. If not, then the process immediately proceeds to step2338.
• Instep2338, the IBT304 inserts the special character that indicated the end of the cell transmission (of one or more cells). In one embodiment, when the last of a cells is transmitted, the special character is K1. The process proceeds to step2340.
• Instep2340, the IBT304 forwards the cells. The process continues until instructed otherwise.
• InFIG. 24, a flow diagram illustrates the decoding process of the bus translator according to one embodiment of the present invention. The process ofFIG. 24 begins atstep2402 and immediately proceeds to step2404.
• Instep2404, the IBT304 receives one or more cells. In one embodiment, the cells are received by the SERDES of the IBT304 and forwarded to the cell decoder(s) of the IBT304. In another embodiment, the SERDES of the IBT304 forwards the cells to a synchronization buffer or queue that temporarily holds the cells so that their proper order can be maintained. These steps are described below with regard tosteps2406 and2408. The process immediately proceeds to step2406.
• Instep2406, the IBT304 synchronizes the one or more cells into the proper order. The process immediately proceeds to step2408.
• Instep2408, the IBT304 optionally checks the one or more cells to determine if they are in their proper order.
• In one embodiment, steps2506,2508, and2510 are performed by a synchronization FIFO. The process immediately proceeds to step2410.
• Instep2410, the IBT304 parses the one or more cells into control information and payload data. The process immediately proceeds to step2412.
• Instep2412, the IBT304 stores the control information payload data. The process immediately proceeds to step2414.
• Instep2414, the IBT304 formats the information into one or more packets. The process immediately proceeds to step2416.
• Instep2416, the IBT304 forwards the one or more packets. The process continues until instructed otherwise.
• InFIGS. 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 ofFIGS. 25A-B begins atstep2502 and immediately proceeds to step2504.
• Instep2504, the IBT304 receives one or more cells. The process immediately proceeds to step2506.
• Instep2506, the IBT304 optionally queues the one or more cells. The process immediately proceeds to step2508.
• Instep2508, the IBT304 optionally determines if the cells are arriving in the proper order. If so, then the process immediately proceeds to step2512. If not, then the process immediately proceeds to step2510.
• Instep2510, The IBT304 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 IBT304 provide error control functionality, as described herein, to abort the transfer and/or have the transfer re-initiated. The process immediately proceeds to step2514.
• Instep2512, the IBT304 parses the cell for control information. The process immediately proceeds to step2514.
• Instep2514, the IBT304 determines the slot and state information. The process immediately proceeds to step2516.
• Instep2516, the IBT304 stores the slot and state information. The process immediately proceeds to step2518.
• In one embodiment, the state and slot information includes configuration information as shown in the table below:

• Field	Name	Description
  State [3:0]	Slot Number	Destination slot number from IBT to SBIA.
  		IPC can address 10 slots(7 remote, 3 local)
  		and IGC can address 14 slots (7 remote
  		and 7 local)
  State [5:4]	Payload State	Encode payload state:
  		00 - RESERVED
  		01 - SOP
  		10 - DATA
  		11 - ABORT
  State [6]	Source/	Encode source/destination IPC id number:
  	Destination	0 - to/from IPC0
  	IPC	1 - to/from IPC1
  State [7]	Reserved	Reserved

• In one embodiment, the IBT304 has configuration registers. They are used to enable Backplane and IPC/IGC destination slots.
• Instep2518, the IBT304 parses the cell for data. The process immediately proceeds to step2520.
• Instep2520, the IBT304 stores the data parsed from each of the one or more cells. The process immediately proceeds to step2522.
• Instep2522, the IBT304 accesses the control information. The process immediately proceeds to step2524.
• Instep2524, the IBT304 access the data. The process immediately proceeds to step2526.
• Instep2526, the IBT304 forms one or more packets. The process immediately proceeds to step2528.
• Instep2528, the IBT304 forwards the one or more packets. The process continues until instructed otherwise.
T. Administrative Process and Error Control
• InFIG. 26, a flow diagram shows the administrating process of the bus translator according to one embodiment of the present invention. The process ofFIG. 26 begins atstep2602 and immediately proceeds to step2604.
• Instep2604, the IBT304 determines the status of its internal components. The process immediately proceeds to step2606.
• Instep2606, the IBT304 determines the status of its links to external components. The process immediately proceeds to step2608.
• Instep2608, the IBT304 monitors the operations of both the internal and external components. The process immediately proceeds to step2610.
• Instep2610, the IBT304 monitors the registers for administrative commands. The process immediately proceeds to step2612.
• Instep2612, the IBT304 performs resets of given components as instructed. The process immediately proceeds to step2614.
• Instep2614, the IBT304 configures the operations of given components. The process continues until instructed otherwise.
• In one embodiment, any errors are detected on the receiving side of theBIA302 are treated in a fashion identical to the error control methods described herein for errors received on theXpnt202 from theBIA302. In operational embodiments where the destination slot cannot be know under certain conditions by theBIA302, the following process is followed:
• a. Send an abort of packet (AOP) to all slots.
• b. Wait for error to go away.
• c. Sync to K0 token after error goes away to begin accepting data.
• In the event that an error is detected on the receiving side of the IBT304, it is treated as if the error was seen by theBIA302 from IBT304. The following process will be used:
• • a. Send an AOP to all slots of down stream IPC/IGC to terminate any packet in progress.
  • b. Wait for error to go away.
  • c. Sync to K0 token after error goes away to begin accepting data.
U. Reset and Recovery Procedures
• The following reset procedure will be followed to get the SERDES in sync. 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 need not be longer than 10 cycles. After reset pulse, the transmitter and the receiver of the SERDES will sync up to each other through defined procedure. It is assumed that the SERDES will be in sync once the core comes out of reset. For this reason, the reset pulse for the core must be considerably greater than the reset pulse for the SERDES core.
• The core will rely on software interaction to get the core in sync. Once theBIA302,600, IBT304, andXpnt202 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 theBIA302 will set a bit stating that it is in sync with a particular source slot. Once software determines this, it will enable transmit for theBIA302,XPNT202 and IBT304.
IV. Control Logic
• Functionality described above with respect to the operation ofswitch100 can be implemented in control logic. Such control logic can be implemented in software, firmware, hardware or any combination thereof.
V. Conclusion
• While specific embodiments of the present invention have been described above, it should be understood that they have been presented by way of example only, and not limitation. It will be understood by those skilled in the art that various changes in form and details may be made therein without departing from the spirit and scope of the invention as defined in the appended claims. Thus, the breadth and scope of the present invention should not be limited by any of the above-described exemplary embodiments, but should be defined only in accordance with the following claims and their equivalents.

Claims (19)

1. A switching fabric comprising:

a plurality of cross points that process multiple stripes of serial data; and

wherein each cross point includes a plurality of port slices.

2. The switching fabric ofclaim 1, wherein said plurality of cross points comprise five cross points.

3. The switching fabric ofclaim 1, wherein each cross point comprises:

a plurality of ports; and

a plurality of port slices coupled respectively to said ports.

4. The switching fabric ofclaim 1, wherein each port slice comprises:

a plurality of FIFOs coupled to other ones of said port slices; and

a FIFO read arbitrator coupled to each FIFO, wherein said FIFO read arbitrator arbitrates read requests sent by said FIFOs.

5. The switching fabric ofclaim 4, wherein each port slice further comprises:

a multiplexer coupled to said FIFOs and to said FIFO read arbitrator; and

a dispatcher coupled to an output of said multiplexer.

6. The switching fabric ofclaim 1, wherein each port slice comprises:

an accumulator that writes received data to an appropriate FIFO in a different port slice.

7. The switching fabric ofclaim 1, wherein each cross point comprises eight ports and eight port slices.

8. A cross point that processes a stripe of serial data, comprising:

a plurality of ports; and

a plurality of port slices coupled respectively to said ports.

9. The cross point ofclaim 8, wherein each port slice comprises:

a plurality of FIFOs coupled to other ones of said port slices; and

a FIFO read arbitrator coupled to each FIFO, wherein said FIFO read arbitrator arbitrates read requests sent by said FIFOs.

10. The cross point ofclaim 9, wherein each port slice further comprises:

a multiplexer coupled to said FIFOs and to said FIFO read arbitrator; and

a dispatcher coupled to an output of said multiplexer.

11. The cross point ofclaim 9, wherein each port slice comprises:

an accumulator that writes received data to an appropriate FIFO in a different port slice.

12. The cross point ofclaim 8, wherein each cross point comprises eight ports and eight port slices.

13. A method for processing a stripe of data at a cross point, comprising, at one port slice:

storing data received from other port slices in a plurality of FIFOs; and

arbitrating the reading of the stored data.

14. The method ofclaim 13, further comprising:

writing data received from a port at the one port slice to an appropriate FIFO in a different port slice.

15. A method for processing data in port slice based on wide cell encoding and an external flow control command, comprising:

managing 64-bit entries in a receive synch FIFO;

receiving two chunks of 32-bit data from the receive synch FIFO;

detecting a K0 in a first byte of the received two chunks of 32-bit data; and

extracting a destination slot from a state field in a cell header when K0 is detected.

16. The method ofclaim 15, further comprising:

determining whether the cell header is low-aligned or high-aligned;

writing 64-bit data to a data FIFO corresponding to the destination slot when the cell header is either low-aligned or high-aligned;

writing two 64-bit data to two data FIFOs corresponding to the two destination slots when the cell header is low-aligned and high-aligned; and

filling the second chunk of 32-bit data with idle characters when a cell does not terminate at the 64-bit boundary and a subsequent cell is destined for a different slot.

17. The method ofclaim 16, further comprising:

performing an early terminate to a cell that inserts K0 and ABORT state information in the data when an error condition is detected.

18. The method ofclaim 16, further comprising:

stopping requests to a FIFO read arbitrator after a current cell is completely read from a FIFO RAM when a flow control condition is detected.

19. The method ofclaim 16, further comprising:

delivering 64-bit data to a SERDES synch FIFO module and transmitter when non-idle data is received from a FIFO read arbitrator;

injecting a first alignment sequence to be transmitted to the SERDES synch FIFO module and transmitter when the FIFO read arbitrator indicates that a plurality of FIFO RAMs are empty

injecting a second alignment sequence to be transmitted to the SERDES transmitter when a programmable timer expires and a previous cell has been completely transmitted; and

indicating to the FIFO read arbitrator to temporarily stop serving any requestor until a current pre-scheduled alignment sequence has been completely transmitted.

Images