US 5,933,429 AGrant
Multipoint-to-Multipoint Echo Processing in a Network Switch
Issue Date:1999-08-03
•9 Claims
•8 Drawing Sheets
Abstract
An apparatus and a method are disclosed for unencumbering valuable switching resources in a network switch involved in a multipoint-to-multipoint switching scenario. The network switch includes an input processing port that is connected to a plurality of input links, and an output processing port that is connected to a plurality of output links. A data cell received on an input link is processed by the input processing port by appending a link number, a port number, and a connection identification code associated with the input processing port to the data cell. The data cell is then transferred to the output processing port where it is processed by comparing the appended link number, port number, and connection identification code with those associated with the output processing port. The data cell is then stored in a data buffering queue in the output processing port according to a matching scheme.
Metadata
Assignees
- Fujitsu Network Communications, Inc.
- Fujitsu Limited
Inventors
- Richard G. Bubenik
- Stephen A. Caldara
- Stephen A. Hauser
- Thomas A. Manning
- Stephen R. Veit
Application Information
Application Number:US 8279322
Filing Date:1997-04-29
Priority Date:1996-07-18
Art Unit:271
Classifications
IPC:
H04L 1256
Field of Search:
370340389;390;392;395;396;397;398;399;412;413;414;415;416;417;418;419826;825.07;825.5;825.51
Patent Drawings (8 sheets)
Description
Field of the Invention
The present invention is generally related to network switching and, more particularly, to an apparatus and a method for unencumbering valuable switching resources in a network switch involved a multipoint-to-multipoint switching scenario.
Background of the Invention
Telecommunications networks such as asynchronous transfer mode (ATM) networks are used for the transfer of audio, video, and other data. ATM networks deliver data by routing data units such as ATM cells from a source to a destination through switches. Switches typically include multiple input/output (I/O) ports through which ATM cells are received and transmitted. The appropriate output port to which a received ATM cell is to be routed to and thereafter transmitted from is determined based upon an ATM cell header.
In a multipoint-to-multipoint switching scenario, ATM cells from a variety of sources are transferred from multiple input queues to multiple output queues within a switch. In such a scenario, it is often beneficial to eliminate duplicate processing of ATM cells or to otherwise prevent the flow of certain ATM cells through a switch by selectively screening ATM cells before allowing them to be transferred through the switch. By only allowing certain ATM cells to be transferred through the switch, valuable switching resources become unencumbered. Accordingly, it would be desirable to devise a scheme whereby valuable switching resources in a network switch may become unencumbered in a multipoint-to-multipoint switching scenario.
Summary of the Invention
An apparatus and a method are disclosed for unencumbering valuable switching resources in a network switch involved a multipoint-to-multipoint switching scenario. The network switch includes a switch fabric, an input processing port connected between a plurality of input links and the switch fabric and having a plurality of data buffering queues, and an output processing port connected between the switch fabric and a plurality of output links and having a plurality of data buffering queues. All of the data buffering queues have a connection identification code, and the data buffering queues in the output processing port have a data cell processing code. The input processing port processes a data cell received on one of the input links by appending to the data cell a link number indicating the input link where the data cell arrived, a port number indicating the input processing port, and a connection identification code associated with a data buffering queue in the input processing port where the data cell will be buffered. The output processing port processes a data cell processed by the input processing port and transferred to the output processing port through the switch fabric by comparing the link number to a link number of a link connected to the output processing port, the port number to a port number of the output processing port, and the connection identification code to a connection identification code associated with a data buffering queue in the output processing port. The data cell is then stored in the data buffering queue in the output processing port according to a matching scheme between the link numbers, the port numbers, and the connection identification codes as dictated by the value of the data cell processing code.
For a first value of the data cell processing code, the output processing port matching scheme requires that the link numbers, the port numbers, and the connection identification codes match in order for the data cell to be stored in the data buffering queue in the output processing port. For a second value of the data cell processing code, the output processing port matching scheme requires that the link numbers, the port numbers, and the connection identification codes do not match in order for the data cell to be stored in the data buffering queue in the output processing port. This mechanism allows each output queue to receive a unique set of ATM cells from a variety of sources, wherein the ATM cells are transferred from multiple input queues to each output queue.
From the above descriptive summary it is apparent how the present invention apparatus can save valuable switching resources in a network switch.
Accordingly, the primary object of the present invention is to provide an apparatus and a method for unencumbering valuable switching resources in a network switch involved a multipoint-to-multipoint switching scenario.
The above-stated primary object, as well as other objects, features, and disadvantages, of the present invention will become readily apparent from the following detailed description which is to be read in conjunction with the appended drawings.
Brief Description of the Drawings
In order to facilitate a fuller understanding of the present invention, reference is now made to the appended drawings. These drawings should not be construed as limiting the present invention, but are intended to be exemplary only.
FIG. 1 is a block diagram of a network switch;
FIG. 2 illustrates the structure of an input queue;
FIG. 3 illustrates the structure of a scheduling list;
FIG. 4 shows the standard data bus format of a data cell;
FIG. 5 shows the internal switch data cell format of a converted data cell;
FIG. 6 shows the format of an input queue descriptor;
FIG. 7 shows the format of an output queue descriptor;
FIG. 8 contains a table indicating the different echo field codes and the corresponding output port processor functions associated with those codes.
FIG. 9 shows a "No Echo" multipoint-to-multipoint switching scenario.
Detailed Description of the Present Invention
Referring to FIG. 1, there is shown a network switch 1 comprising a Data Crossbar 10, a Bandwidth Arbiter (BA) 12, a plurality of input port processors 14, a plurality of output port processors 16, and a plurality of Multipoint Topology Controllers (MTC) 18. The Data Crossbar 10, which may be an N.times.N crosspoint switch, is used for data cell transport and, in this particular embodiment, yields N.times.670 Mbps throughput. The BA 12 controls switch interconnections, dynamically schedules momentarily unused bandwidth, and resolves multipoint-to-point bandwidth contention. Each input port processor 14 schedules the transmission of data cells to the Data Crossbar 10 from multiple connections. Each output port processor 16 receives data cells from the Data Crossbar 10 and organizes those data cells onto output links.
In order to traverse the switch 1, a data cell 22 first enters the switch 1 on a link 24 to an input port processor 14 and is buffered in a queue 26 of input buffers. The data cell 22 is then transmitted from the queue 26 of input buffers through the Data Crossbar 10 to a queue 28 of output buffers in an output port processor 16. From the queue 28 of output buffers, the data cell 22 is transmitted onto a link 30 outside of the switch 1 to, for example, another switch.
To facilitate traversal of the switch 1, each input port processor 14 includes a cell buffer RAM 32 and each output port processor 16 includes a cell buffer RAM 34. The cell buffer RAM's 32 and 34 are organized into the respective input and output queues 26 and 28. All data cells 22 in a connection pass must through a unique input queue 26 and a unique output queue 28 for the life of the connection. The queues 26 and 28 thus preserve cell ordering. This strategy also allows quality of service ("QoS") guarantees on a per connection basis.
Three communication paths are used to facilitate traversal of the switch 1 via probe and feedback messages: a Probe Crossbar 42, an XOFF Crossbar 44, and an XON Crossbar 46. The Probe Crossbar 42, which in this particular embodiment is an N.times.N crosspoint switch, is used to transmit a multiqueue number from an MTC 18 to an output port processor 16. Each input port processor 14 includes a plurality of scheduling lists 47, each of which is a circular list containing input queue numbers for a particular connection. Each multiqueue number is derived from information provided to the MTC 18 from a scheduling list 47 in an input port processor 14. A multiqueue number identifies one or more output queues 28 to which a data cell may be transmitted when making a connection. An output port processor 16 uses the multiqueue number to direct a request message probe to the appropriate output queue or queues 28 and thereby determine if there are enough output buffers available in the output queue or queues 28 for the data cell.
The XOFF Crossbar 44, which in this particular embodiment is an N.times.N crosspoint switch, is used to communicate "DO NOT SEND" type feedback messages from an output port processor 16 to an input port processor 14. The XOFF feedback messages are asserted to halt the transmission of request message probes through the Probe Crossbar 42 from an input port processor 14 to an output port processor 16, and thus put a scheduling list 47 within the receiving input port processor 14 in an XOFF state, meaning that the scheduling list 47 cannot be used to provide a multiqueue number. The scheduling list 47 remains in an XOFF state until receiving an XON message from the output port processor 16, as described below. An input port processor 14 responds to an asserted XOFF feedback message by modifying XOFF state bits in a descriptor of the scheduling list 47. The XOFF state bits prevent the input port processor 14 from attempting to send a request message probe from the input port processor 14 to the output port processor 16 until notified by the output port processor 16 that output buffers are available for a corresponding connection.
The "DO NOT SEND" type feedback messages also halt the transmission of data cells from an input port processor 14 to an output port processor 16 when sufficient buffer space is not available to receive data cells in the output port processor 16. In such a case, an input port processor 14 will not transmit any data cells through the Data Crossbar 10. An idle cell, containing a complemented cyclic redundancy check (CRC) calculation, is transmitted instead.
The XON Crossbar 46, which in this particular embodiment is an N.times.N crosspoint switch, is used to communicate "ENABLE SEND" type feedback messages from an output port processor 16 to an input port processor 16. More particularly, the XON Crossbar 46 communicates an XON feedback message from an output port processor 16 to an input port processor 14. When an XOFF feedback message has been asserted by an output port processor 16 in response to a request probe message from an input port processor 14, the output port processor 16 sets a state bit in a queue descriptor of a corresponding output queue 28. When the number of data cells in that output queue 28 drops below an XON threshold, an XON message is sent from that output port processor 16 to the input port processor 14. The XON message enables the scheduling list 47 in the input port processor 14 to be used in the sending of request probe messages, and hence data cells.
The Probe & XOFF communication paths operate in a pipelined fashion. First, an input port processor 14 selects a scheduling list 47, and information associated with that scheduling list 47 is used to determine the output port processor 16, or the output queue 28, to which a data cell will be transmitted. More particularly, a multiqueue number, which is derived from information provided to an MTC 18 from a scheduling list 47 in an input port processor 14, is transmitted from the MTC 18 to one or more output port processors 16 using the Probe Crossbar 42. Each output port processor 16 then tests for buffer availability and asserts a "DO NOT SEND" type feedback message through the XOFF Crossbar 44 if output buffering is not available for that connection. If output buffering is available for that connection, the input port processor 14 transmits a data cell to one or more output queues 28 through the Data Crossbar 10.
Each input port processor 14 within the switch 1 also includes a Switch Allocation Table (SAT) 20 for mapping bandwidth allocation. SAT's 20 are the basic mechanism behind the scheduling of data cells. Each SAT 20 includes a plurality of sequentially ordered cell time slots 50 and a pointer 52 which is always directed to one of the cell time slots 50. All of the pointers 52 in the switch 1 are synchronized such that at any given point in time each of the pointers 52 is directed to the same cell time slot 50 in the respective SAT 20 with which the pointer 52 is associated, e.g., the first cell time slot. In operation, the pointers 52 are advanced in lock-step, with each cell time slot 50 being active for 32 clock cycles at 50 MHz. When a pointer 52 is directed toward a cell time slot 50, an input port processor 14 uses the corresponding entry 51 in the cell time slot 50 to obtain a data cell for launching into the Data Crossbar 10.
If valid, the contents of each SAT entry 51 point to a scheduling list 47. The contents of each (non-empty) entry in a scheduling list 47 consists of an input queue number. Each input queue number points to a input queue descriptor which contains state information that is specific to a particular connection. Each input queue descriptor, in turn, points to the head and the tail of a corresponding input queue 26, which contains data cells for transmission through the Data Crossbar 10.
If a SAT entry 51 does not contain a pointer to a scheduling list, i.e. the SAT entry 51 is set to zero, then the corresponding cell time slot 50 in the SAT 20 has not been allocated and that cell time slot 50 is available for dynamic bandwidth. Also, if a SAT entry 51 does contain a pointer to a scheduling list 47 but no input queue number is listed in scheduling list 47, then there are no data cells presently available for transmission and the corresponding cell time slot 50 is also available for dynamic bandwidth. Any bandwidth that has not been allocated is referred to as dynamic bandwidth, which is granted to certain types of connections by the BA 12 so as to increase the efficiency of the switch 1.
The switch 1 is configured to allow connections having different quality of service attributes to be managed in such a way that there is no interference between the characteristics of any connection with any other connection. In order to achieve this capability, an input port processor 14 manages each connection with a set of data structures that are unique for each connection.
There are two major data structures used by an input port processor 14 for managing different resources. One data structure is the input queue 26 and the other data structure is the scheduling list 47. In general, an input queue 26 is used to manage buffers. An input queue 26 consists of a group of one or more buffers organized as a FIFO and manipulated as a linked list structure using pointers. Incoming data cells 22 are added (enqueued) to the tail of an input queue 26. Data cells which are sent to the Data Crossbar 10 are removed (dequeued) from the head of an input queue 26. The ordering of data cells is always maintained. For a given connection, the sequence of data cells that are sent to the Data Crossbar 10 is identical to that in which they arrived at an input port processor 14, although the time interval between departing data cells may be different than the time interval between arriving data cells. FIG. 2 illustrates the structure of an input queue 26.
A scheduling list 47 is used to manage bandwidth. A scheduling list 47 consists of one or more input queue numbers organized as a circular list. As with input queues 26, scheduling lists 47 are manipulated as a linked list structure using pointers. Input queue numbers are added to the tail of a scheduling list 47 and removed from the head of a scheduling list 47. An input queue number can only appear once on any given scheduling list 47. In addition to being added and removed, input queue numbers can be recirculated on a scheduling list 47 by removing the input queue number from the head of the scheduling list 47 and then adding the removed input queue number back onto the tail of the scheduling list 47. This results in round-robin servicing of input queues 26 on a particular scheduling list 47. FIG. 3 illustrates the structure of a scheduling list 47.
When a data cell 22 is received at an input port processor 14, the first action performed by the input port processor 14 is to check the header of the data cell for errors and then to check that the data cell is associated with a valid connection. Cell header integrity is verified by computing a Header Error Check (HEC) on bytes in the header of a received data cell and then comparing the computed HEC to the HEC field in the header of the received data cell. If the computed HEC and the HEC field do not match, then there is a header error and the data cell will be dropped.
For each incoming data cell, an input port processor 14 will use VPI/VCI fields specified in the header of the data cell as an index into a translation table in the input port processor 14. The translation table correlates valid connections and input queue numbers. The input port processor 14 first checks to see if the data cell belongs to a valid connection; i.e. one that has been set up by switch control software. If the connection is valid, then the data cell will be assigned an input queue number from the translation table. If the connection is not valid, then the data cell will either be dropped or be assigned an exception input queue number from the translation table, which results in further processing of the data cell.
While the data cell is being checked, it is converted from a standard data bus format into a internal switch data cell format. FIG. 4 shows the standard data bus format of a data cell. FIG. 5 shows the internal switch data cell format of a converted data cell.
As previously described, an input queue number is used to point to a queue descriptor, which is a data structure containing state information that is unique to a particular connection. There is a queue descriptor for each queue in the switch 1; i.e. for both the input queues 26 in the input port processor 14 and the output queues 28 in the output port processor 16. The queue descriptors are maintained by switch control software. FIG. 6 shows the format of an input queue descriptor. FIG. 7 shows the format of an output queue descriptor.
After a data cell is assigned an input queue number, the input port processor 14 will look at the corresponding queue descriptor for further information on how to process the data cell. The input port processor 14 will first try to assign a buffer for the data cell. If a buffer is available, then the data cell buffer number is enqueued to the tail of the queue and the data cell is written out to the cell buffer RAM 32. If there is no buffer available, the data cell is dropped and a statistic is updated.
In addition to processing and buffering incoming streams of data cells, the input port processor 14 must transfer data cells from a cell buffer to one or more output port processors 16 through the Data Crossbar 10. The transfer of the data cells is performed through the use of the Probe Crossbar 20, the XOFF Crossbar 24, and the Data Crossbar 10, as previously described. Specifically, a multiqueue number, which is derived from information provided to an MTC 18 from a scheduling list 47 in an input port processor 14, is transmitted from the MTC 18 to one or more output port processors 16 using the Probe Crossbar 42. Each output port processor 16 then tests for buffer availability and asserts a "DO NOT SEND" type feedback message through the XOFF Crossbar 44 if output buffering is not available for that connection. If output buffering is available for that connection, the input port processor 14 transmits a data cell to one or more output queues 28 through the Data Crossbar 10. However, before any data cells are enqueued into any output queue 28, the output port processor 16 processes each data cell based on information contained in the trailer of the converted data cell.
Referring particularly to FIGS. 6 and 7, the input queue descriptor and the output queue descriptor both include a connection identification (Conn ID) field 60. This field 60 contains an arbitrary code that is assigned by the switch control software indicating 1 of 8 possible data flow paths upon which to perform a cell mask. When processing a data cell, an input port processor 14 will insert the code from the connection identification field 60 of the input queue descriptor into a similar connection identification (Conn ID) field 62 in the converted data cell (see FIG. 6). The converted data cell also includes an ingress port number field 64, indicating the number of the input port processor 14 where the data cell 22 was received, and an ingress link number field 66, indicating the number of the input link 24 that the data cell 22 arrived on. Note that the output queue descriptor also contains an "echo" field 68 for a 2-bit code which indicates what action that an output port processor 16 should take when processing a data cell transmitted from an input port processor 14, as will be described in detail below. The code in the echo field 68 is also assigned by the switch control software.
For every data cell transmitted from an input port processor 14, an output port processor 16 processes the data cell by comparing its own port number, link number, and connection identification code to the port number, link number, and connection identification code of the converted data cell. In conjunction with the 2-bit code in the echo field 68 of the output queue descriptor, this comparison is used to decide whether or not to enqueue the data cell arriving at a corresponding output queue 28.
Referring to FIG. 8, there is shown a table indicating the different echo field codes and the corresponding output port processor functions associated with those codes. For example, if the echo field 68 in the output queue descriptor is set to "00", the output port processor 16 will always enqueue the data cell. In contrast, if the echo field 68 in the output queue descriptor is set to "11", the output port processor 16 will never enqueue the data cell. More importantly, however, are the actions of the output port processor 16 when the echo field 68 in the output queue descriptor is set to "01" or "10". More specifically, echo processing of data cells received by an output port processor 16 conserves resources in the switch 1 in a multipoint-to-multipoint switching scenario.
To illustrate the aforementioned conservation of switching resources in a multipoint-to-multipoint switching scenario, it must be understood that a switch 1 is often used within a network of similar switches wherein data cells are routed through the network. In a multipoint-to-multipoint switching scenario, data cells from a variety of sources are transferred from multiple input queues 26 to multiple output queues 28 within a switch 1. In such a scenario, it is often beneficial to eliminate duplicate processing of data cells or to otherwise prevent the flow of certain data cells through a switch 1 so as to free up valuable switching resources. Echo processing of data cells received by an output port processor 16 achieves this objective by essentially screening converted data cells according to the port number, link number, and connection identification code contained in the converted data cells.
When the echo field 68 in the output queue descriptor is set to "01", a "No Echo" situation, the output port processor 16 will always enqueue the data cell unless the port number, the link number, and the connection identification code of the data cell match the port number, link number, and connection identification code of the output port processor 16. Alternatively, when the echo field 68 in the output queue descriptor is set to "10", an "Only Echo" situation, the output port processor 16 will enqueue the data cell only if the port number, the link number, and the connection identification code of the data cell match the port number, link number, and connection identification code of the output port processor 16.
Referring to FIG. 9, there is shown an example of a "No Echo" multipoint-to-multipoint switching scenario, wherein a plurality of data cells (A, B, C, and D) are being transmitted from a corresponding plurality of sources (T1, T2, T3, and S1) to a plurality of destinations (R1, R2, R3, and S2). More specifically, T1, T2, and T3 denote end station transmitters, R1, R2, and R3 denote end station receivers, and S1 and S2 denote other switching elements within a network. The data cells are received by input port processors 14a and 14b, where they are processed and enqueued in input queues 26a, 26b, 26c, and 26d. Input port processor 14a and output port processor 16a have the same port number, and input port processor 14b and output port processor 16b have the same port number. Links 24a, 24c, 30a, and 30c all have the same link number, and links 24b, 24d, 30b, and 30d all have the same link number. All of the input queues 26 and output queues 28 have been assigned an arbitrary connection identification code of 6.
As previously described, the processing of the data cells includes amending the trailer in each data cell to include an arbitrary connection identification code, a link number, and a port number. In this particular example, data cell A is assigned an arbitrary connection identification code of 6, a link number of 24a, and a port number of 14a. Similarly, data cell B has been assigned an arbitrary connection identification code of 6, a link number of 24b, and a port number of 14a, data cell C has been assigned an arbitrary connection identification code of 6, a link number of 24c, and a port number of 14b; data cell D has been assigned an arbitrary connection identification code of 6, a link number of 24d, and a port number of 14b. For each data cell, multiqueue numbers are transmitted simultaneously to the output port processors 16a and 16b, whereby each output port processor 16a and 16b tests for buffer availability, i.e. output port processor 16a tests output queues 28a and 28b for buffer availability, and output port processor 16b tests output queues 28c and 28d for buffer availability. If sufficient buffering is available, the data cells are then transmitted through the Data Crossbar 10 and the data cells are processed by the corresponding output port processors 16a and 16b.
In the "No Echo" scenario, the output port processors 16a and 16b will enqueue the data cells unless the port number, the link number, and the connection identification code of the data cells match the port number, link number, and connection identification code of the output port processors 16a and 16b. Thus, output queue 28a will enqueue data cells B, C, and D, output queue 28b will enqueue data cells A, C, and D, output queue 28c will enqueue data cells A, B, and D, and output queue 28d will enqueue data cells A, B, and C.
Connection identification codes provide another control to screen sources or destinations from transmitting or receiving, respectively. This augments the physical port and link number screening.
As illustrated above, echo processing allows each output queue 28a-d to receive data cells from a different set of sources while utilizing a single set connection resources, namely input queues 26a-d, scheduling lists 47, and output queues 28a-d. Echo processing thus allows valuable switching resources to become unencumbered in a network switch involved in a multipoint-to-multipoint switching scenario.
It will be understood that various changes and modifications to the above described method and apparatus may be made without departing from the inventive concepts disclosed herein. Accordingly, the present invention is not to be viewed as limited to the embodiment described herein.
Claims
What is claimed is:
1. A method for unencumbering valuable switching resources in a network switch, wherein said network switch has an input processing port and an output processing port connected to a plurality of links and having a plurality of data buffering queues, wherein each of said data buffering queues has a connection identification code, and wherein said data buffering queues in said output processing port have a data cell processing code, said method comprising the steps of: receiving a data cell at an output processing port, said data cell containing a link number indicating an input link where said data cell arrived, a port number indicating an input processing port where said data cell was received, and a connection identification code associated with a data buffering queue in said input processing port where said data cell was buffered; comparing said link number to a link number of a link connected to said output processing port, said port number to a port number of said output processing port, and said connection identification code to a connection identification code associated with a data buffering queue in said output processing port; and storing said data cell in said data buffering queue in said output processing port according to a matching scheme between said link numbers, said port numbers, and said connection identification codes as dictated by the value of said data cell processing code.
2. The method as defined in claim 1, wherein said matching scheme requires that said link numbers, said port numbers, and said connection identification codes match in order for said data cell to be stored in said data buffering queue.
3. The method as defined in claim 1, wherein said matching scheme requires that said link numbers, said port numbers, and said connection identification codes do not match in order for said data cell to be stored in said data buffering queue.
4. A method for unencumbering valuable switching resources in a network switch, wherein said network switch has an input processing port and an output processing port connected to a plurality of links and having a plurality of data buffering queues, wherein each of said data buffering queues has a connection identification code, and wherein said data buffering queues in said output processing port have a data cell processing code, said method comprising the steps of: receiving a data cell at an output processing port, said data cell containing a link number indicating an input link where said data cell arrived, a port number indicating an input processing port where said data cell was received, and a connection identification code associated with a data buffering queue in said input processing port where said data cell was buffered; and processing said data cell according to a matching scheme, as dictated by the value of said data cell processing code, between said link number and a link number of a link connected to said output processing port, said port number and a port number of said output processing port, and said connection identification code and a connection identification code associated with a data buffering queue in said output processing port.
5. The method as defined in claim 4, wherein said step of processing said data cell comprises storing said data cell in said data buffering queue in said output processing port when said link numbers, said port numbers, and said connection identification codes match.
6. The method as defined in claim 4, wherein said step of processing said data cell comprises storing said data cell in said data buffering queue in said output processing port when said link numbers, said port numbers, and said connection identification codes do not match.
7. A network switch that is capable of unencumbering valuable switching resources within the network switch, said network switch comprising: a switch fabric; an input processing port connected between a plurality of input links and said switch fabric and having a plurality of data buffering queues, wherein each of said data buffering queues has a connection identification code, wherein said input processing port processes a data cell received on one of said plurality of input links by appending to said data cell a link number indicating an input link where said data cell arrived, a port number indicating said input processing port, and a connection identification code associated with a data buffering queue in said input processing port where said data cell will be buffered; and an output processing port connected between said switch fabric and a plurality of output links and having a plurality of data buffering queues, wherein each of said data buffering queues has a connection identification code, wherein said data buffering queues in said output processing port have a data cell processing code, wherein said output processing port processes a data cell processed by said input processing port and transferred to said output processing port through said switch fabric by comparing said link number to a link number of a link connected to said output processing port, said port number to a port number of said output processing port, and said connection identification code to a connection identification code associated with a data buffering queue in said output processing port, and then storing said data cell in said data buffering queue in said output processing port according to a matching scheme between said link numbers, said port numbers, and said connection identification codes as dictated by the value of said data cell processing code.
8. The network switch as defined in claim 7, wherein said output processing port matching scheme requires that said link numbers, said port numbers, and said connection identification codes match in order for said data cell to be stored in said data buffering queue.
9. The network switch as defined in claim 7, wherein said output processing port matching scheme requires that said link numbers, said port numbers, and said connection identification codes do not match in order for said data cell to be stored in said data buffering queue.
Patent Citations (246)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US3804991 | 1974-04-01 | Hammond et al. | |
| US3974343 | 1976-08-01 | Cheney et al. | |
| US4069399 | 1978-01-01 | Barrett et al. | |
| US4603382 | 1986-07-01 | Cole et al. | |
| US4715030 | 1987-12-01 | Koch et al. | |
| US4727537 | 1988-02-01 | Nichols | |
| US4737953 | 1988-04-01 | Koch et al. | |
| US4797881 | 1989-01-01 | Ben-Artzi | |
| US4821034 | 1989-04-01 | Anderson et al. | |
| US4837761 | 1989-06-01 | Isono et al. | |
| US4849968 | 1989-07-01 | Turner | |
| US4870641 | 1989-09-01 | Pattavina | |
| US4872159 | 1989-10-01 | Hemmady et al. | |
| US4872160 | 1989-10-01 | Hemmady et al. | |
| US4878216 | 1989-10-01 | Yunoki | |
| US4893302 | 1990-01-01 | Hemmady et al. | |
| US4893307 | 1990-01-01 | McKay et al. | |
| US4894824 | 1990-01-01 | Hemmady et al. | |
| US4897841 | 1990-01-01 | Gang, Jr. | |
| US4899333 | 1990-02-01 | Roediger | |
| US4920531 | 1990-04-01 | Isono et al. | |
| US4922503 | 1990-05-01 | Leone | |
| US4933938 | 1990-06-01 | Sheehy | |
| US4947390 | 1990-08-01 | Sheehy | |
| US4953157 | 1990-08-01 | Franklin et al. | |
| US4956839 | 1990-09-01 | Torii et al. | |
| US4958341 | 1990-09-01 | Hemmady et al. | |
| US4979100 | 1990-12-01 | Makris et al. | |
| US4993018 | 1991-02-01 | Hajikano et al. | |
| US5021949 | 1991-06-01 | Morten et al. | |
| US5029164 | 1991-07-01 | Goldstein et al. | |
| US5060228 | 1991-10-01 | Tsutsui et al. | |
| US5067123 | 1991-11-01 | Hyodo et al. | |
| US5070498 | 1991-12-01 | Kakuma et al. | |
| US5083269 | 1992-01-01 | Syobatake et al. | |
| US5084867 | 1992-01-01 | Tachibana et al. | |
| US5084871 | 1992-01-01 | Carn et al. | |
| US5090011 | 1992-02-01 | Fukuta et al. | |
| US5090024 | 1992-02-01 | Vander Mey et al. | |
| US5093912 | 1992-03-01 | Dong et al. | |
| US5115429 | 1992-05-01 | Hluchyj et al. | |
| US5119369 | 1992-06-01 | Tanabe et al. | |
| US5119372 | 1992-06-01 | Verbeek | |
| US5128932 | 1992-07-01 | Li | |
| US5130975 | 1992-07-01 | Akata | |
| US5130982 | 1992-07-01 | Ash et al. | |
| US5132966 | 1992-07-01 | Hayano et al. | |
| US5146474 | 1992-09-01 | Nagler et al. | |
| US5146560 | 1992-09-01 | Goldberg et al. | |
| US5150358 | 1992-09-01 | Punj et al. | |
| US5151897 | 1992-09-01 | Suzuki | |
| US5157657 | 1992-10-01 | Potter et al. | |
| US5163045 | 1992-11-01 | Caram et al. | |
| US5163046 | 1992-11-01 | Hahne et al. | |
| US5179556 | 1993-01-01 | Turner | |
| US5179558 | 1993-01-01 | Thacker et al. | |
| US5185743 | 1993-02-01 | Murayama et al. | |
| US5191582 | 1993-03-01 | Upp | |
| US5191652 | 1993-03-01 | Dias et al. | |
| US5193151 | 1993-03-01 | Jain | |
| US5197067 | 1993-03-01 | Fujimoto et al. | |
| US5198808 | 1993-03-01 | Kudo | |
| US5199027 | 1993-03-01 | Barri | |
| US5239539 | 1993-08-01 | Uchida et al. | |
| US5253247 | 1993-10-01 | Hirose et al. | |
| US5253248 | 1993-10-01 | Dravida et al. | |
| US5255264 | 1993-10-01 | Cotton et al. | |
| US5255266 | 1993-10-01 | Watanabe et al. | |
| US5257311 | 1993-10-01 | Naito et al. | |
| US5258979 | 1993-11-01 | Oomuro et al. | |
| US5265088 | 1993-11-01 | Takigawa et al. | |
| US5267232 | 1993-11-01 | Katsube et al. | |
| US5268897 | 1993-12-01 | Komine et al. | |
| US5271010 | 1993-12-01 | Miyake et al. | |
| US5272697 | 1993-12-01 | Fraser et al. | |
| US5274641 | 1993-12-01 | Shobatake et al. | |
| US5274768 | 1993-12-01 | Traw et al. | |
| US5280469 | 1994-01-01 | Taniguchi et al. | |
| US5280470 | 1994-01-01 | Buhrke et al. | |
| US5282201 | 1994-01-01 | Frank et al. | |
| US5283788 | 1994-02-01 | Morita et al. | |
| US5285446 | 1994-02-01 | Yonehara | |
| US5287349 | 1994-02-01 | Hyodo et al. | |
| US5287535 | 1994-02-01 | Sakagawa et al. | |
| US5289462 | 1994-02-01 | Ahmadi et al. | |
| US5289463 | 1994-02-01 | Mobasser | |
| US5289470 | 1994-02-01 | Chang et al. | |
| US5291481 | 1994-03-01 | Doshi et al. | |
| US5291482 | 1994-03-01 | McHarg et al. | |
| US5295134 | 1994-03-01 | Yoshimura et al. | |
| US5301055 | 1994-04-01 | Bagchi et al. | |
| US5301184 | 1994-04-01 | Uriu et al. | |
| US5301190 | 1994-04-01 | Tsukuda et al. | |
| US5301193 | 1994-04-01 | Toyofuku et al. | |
| US5303232 | 1994-06-01 | Proctor et al. | |
| US5305311 | 1994-04-01 | Lyles | |
| US5309431 | 1994-05-01 | Tominaga et al. | |
| US5309438 | 1994-05-01 | Nakajima | |
| US5311586 | 1994-05-01 | Bogart et al. | |
| US5313454 | 1994-05-01 | Bustini et al. | |
| US5313458 | 1994-05-01 | Suzuki | |
| US5315586 | 1994-05-01 | Charvillat | |
| US5319638 | 1994-06-01 | Lin | |
| US5321695 | 1994-04-01 | Faulk, Jr. | |
| US5323389 | 1994-06-01 | Bitz et al. | |
| US5333131 | 1994-07-01 | Tanabe et al. | |
| US5333134 | 1994-07-01 | Ishibashi et al. | |
| US5335222 | 1994-08-01 | Kamoi et al. | |
| US5335325 | 1994-08-01 | Frank et al. | |
| US5339310 | 1994-08-01 | Taniguchi | |
| US5339317 | 1994-08-01 | Tanaka et al. | |
| US5339318 | 1994-08-01 | Tanaka et al. | |
| US5341366 | 1994-08-01 | Soumiya et al. | |
| US5341373 | 1994-08-01 | Ishibashi et al. | |
| US5341376 | 1994-08-01 | Yamashita | |
| US5345229 | 1994-09-01 | Olnowich et al. | |
| US5350906 | 1994-09-01 | Brody et al. | |
| US5355372 | 1994-10-01 | Sengupta et al. | |
| US5357506 | 1994-10-01 | Sugawara | |
| US5357507 | 1994-10-01 | Hughes et al. | |
| US5357508 | 1994-10-01 | Le Boudec et al. | |
| US5357510 | 1994-10-01 | Norizuki et al. | |
| US5359600 | 1994-10-01 | Ueda et al. | |
| US5361251 | 1994-11-01 | Aihara et al. | |
| US5361372 | 1994-11-01 | Rege et al. | |
| US5363433 | 1994-11-01 | Isono | |
| US5365514 | 1994-11-01 | Hershey et al. | |
| US5371893 | 1994-12-01 | Price et al. | |
| US5373504 | 1994-12-01 | Tanaka et al. | |
| US5375117 | 1994-12-01 | Morita et al. | |
| US5377262 | 1994-12-01 | Bales et al. | |
| US5377327 | 1994-12-01 | Jain et al. | |
| US5379297 | 1995-01-01 | Glover et al. | |
| US5379418 | 1995-01-01 | Shimazaki et al. | |
| US5390170 | 1995-02-01 | Sawant et al. | |
| US5390174 | 1995-02-01 | Jugel | |
| US5390175 | 1995-02-01 | Hiller et al. | |
| US5392280 | 1995-02-01 | Zheng | |
| US5392402 | 1995-02-01 | Robrock, II | |
| US5394396 | 1995-02-01 | Yoshimura et al. | |
| US5394397 | 1995-02-01 | Yanagi et al. | |
| US5398235 | 1995-03-01 | Tsuzuki et al. | |
| US5400337 | 1995-03-01 | Munter | |
| US5402415 | 1995-03-01 | Turner | |
| US5412648 | 1995-05-01 | Fan | |
| US5416703 | 1995-05-01 | Sakaue et al. | |
| US5420858 | 1995-05-01 | Marshall et al. | |
| US5420988 | 1995-05-01 | Elliott | |
| US5422879 | 1995-06-01 | Parsons et al. | |
| US5425021 | 1995-06-01 | Derby et al. | |
| US5425026 | 1995-06-01 | Mori | |
| US5432713 | 1995-07-01 | Takeo et al. | |
| US5432784 | 1995-07-01 | Ozveren | |
| US5432785 | 1995-07-01 | Ahmed et al. | |
| US5432908 | 1995-07-01 | Heddes et al. | |
| US5436886 | 1995-07-01 | McGill | |
| US5436893 | 1995-07-01 | Barnett | |
| US5440547 | 1995-08-01 | Easki et al. | |
| US5444702 | 1995-08-01 | Burnett et al. | |
| US5446733 | 1995-08-01 | Tsuruoka | |
| US5446737 | 1995-08-01 | Cidon et al. | |
| US5446738 | 1995-08-01 | Kim et al. | |
| US5448559 | 1995-09-01 | Hayter et al. | |
| US5450406 | 1995-09-01 | Esaki et al. | |
| US5452296 | 1995-09-01 | Shimizu | |
| US5455820 | 1995-10-01 | Yamada | |
| US5455825 | 1995-10-01 | Lauer et al. | |
| US5457687 | 1995-10-01 | Newman | |
| US5459743 | 1995-10-01 | Fukuda et al. | |
| US5461611 | 1995-10-01 | Drake, Jr. et al. | |
| US5463620 | 1995-10-01 | Sriram | |
| US5465331 | 1995-11-01 | Yang et al. | |
| US5475679 | 1995-12-01 | Munter | |
| US5479401 | 1995-12-01 | Bitz et al. | |
| US5479402 | 1995-12-01 | Hata et al. | |
| US5483526 | 1996-01-01 | Ben-Nun et al. | |
| US5485453 | 1996-01-01 | Wahlman et al. | |
| US5485455 | 1996-01-01 | Dobbins et al. | |
| US5487063 | 1996-01-01 | Kakuma et al. | |
| US5488606 | 1996-01-01 | Kakuma et al. | |
| US5491691 | 1996-02-01 | Shrayer et al. | |
| US5491694 | 1996-02-01 | Oliver et al. | |
| US5493566 | 1996-02-01 | Ljungberg et al. | |
| US5497369 | 1996-03-01 | Wainwright | |
| US5499238 | 1996-03-01 | Shon | |
| US5504741 | 1996-04-01 | Yamanaka et al. | |
| US5504742 | 1996-04-01 | Kakuma et al. | |
| US5506834 | 1996-04-01 | Sekihata et al. | |
| US5506839 | 1996-04-01 | Hatta | |
| US5506956 | 1996-04-01 | Cohen | |
| US5509001 | 1996-04-01 | Tachibana et al. | |
| US5509007 | 1996-04-01 | Takashima et al. | |
| US5513134 | 1996-04-01 | Cooperman et al. | |
| US5513178 | 1996-04-01 | Tanaka | |
| US5513180 | 1996-04-01 | Miyake et al. | |
| US5515359 | 1996-05-01 | Zheng | |
| US5517495 | 1996-05-01 | Lund et al. | |
| US5519690 | 1996-05-01 | Suzuka et al. | |
| US5521905 | 1996-05-01 | Oda et al. | |
| US5521915 | 1996-05-01 | Dieudonne et al. | |
| US5521916 | 1996-05-01 | Choudhury et al. | |
| US5521917 | 1996-05-01 | Watanabe et al. | |
| US5521923 | 1996-05-01 | Willmann et al. | |
| US5523999 | 1996-06-01 | Takano et al. | |
| US5524113 | 1996-06-01 | Gaddis | |
| US5526344 | 1996-06-01 | Diaz et al. | |
| US5528588 | 1996-06-01 | Bennett et al. | |
| US5528590 | 1996-06-01 | Iidaka et al. | |
| US5528591 | 1996-06-01 | Lauer | |
| US5530695 | 1996-06-01 | Dighe et al. | |
| US5533009 | 1996-07-01 | Chen | |
| US5533020 | 1996-07-01 | Byrn et al. | |
| US5535196 | 1996-07-01 | Aihara et al. | |
| US5535197 | 1996-07-01 | Cotton | |
| US5537394 | 1996-07-01 | Abe et al. | |
| US5541912 | 1996-07-01 | Choudhury et al. | |
| US5544168 | 1996-08-01 | Jeffrey et al. | |
| US5544169 | 1996-08-01 | Norizuki et al. | |
| US5544170 | 1996-08-01 | Kasahara | |
| US5546389 | 1996-08-01 | Wippenback et al. | |
| US5546391 | 1996-08-01 | Hochschild et al. | |
| US5546392 | 1996-08-01 | Boal et al. | |
| US5550821 | 1996-08-01 | Akiyoshi | |
| US5550823 | 1996-08-01 | Irie et al. | |
| US5553057 | 1996-09-01 | Nakayama | |
| US5553068 | 1996-09-01 | Aso et al. | |
| US5555243 | 1996-09-01 | Kakuma et al. | |
| US5555265 | 1996-09-01 | Kakuma et al. | |
| US5557607 | 1996-09-01 | Holden | |
| US5568479 | 1996-10-01 | Watanabe et al. | |
| US5570348 | 1996-10-01 | Holden | |
| US5570361 | 1996-10-01 | Norizuki et al. | |
| US5570362 | 1996-10-01 | Nishimura | |
| US5572522 | 1996-11-01 | Calamvokis et al. | |
| US5577032 | 1996-11-01 | Sone et al. | |
| US5577035 | 1996-11-01 | Hayter et al. | |
| US5583857 | 1996-12-01 | Soumiya et al. | |
| US5583858 | 1996-12-01 | Hanaoka | |
| US5583861 | 1996-12-01 | Holden | |
| US5590132 | 1996-12-01 | Ishibashi et al. | |
| US5602829 | 1997-02-01 | Nie et al. | |
| US5610913 | 1997-03-01 | Tomonaga et al. | |
| US5623405 | 1997-04-01 | Isono | |
| US5625846 | 1997-04-01 | Kobayakawa et al. | |
| US5633861 | 1997-05-01 | Hanson et al. | |
| JPX484943 | 1992-03-01 |
Non-Patent Literature (15)
- H.T. Kung and K. Chang, Receiver-Oriented Adaptive Buffer Allocation in a Credit-Based Flow Control for ATM Networks, Proceedings of INFOCOM '95, Apr. 2-6, 1995, pp. 1-14.
- H.T. Kung et al., Credit-Based Flow Control for ATM Networks: Credit Update Protocol, Adaptive Credit Allocation and Statistical Multiplexing, Proceedings of ACM SIGCOMM '94 Symposium on Communications Architectures, Protocols and Applications, Aug. 31-Sep. 2, 1994, pp. 1-14.
- Head of Line Arbitration in ATM Switches with Input-Output Buffering and Backpressure Control. By Hosein F. Badran and H. T. Mouftah, GLOBECOM '91, pp. 0347-0351.
- An Ascom Timeplex White Paper, Meeting Critical Requirements with Scalable Enterprise Networking Solutions Based on a Unified ATM Foundation, pp. 1-12, Apr. 1994.
- Douglas H. Hunt, ATM Traffic Management -Another Perspective, Business Communications Review, Jul. 1994.
- Richard Bubenik et al., Leaf Initiated Join Extensions, Technical Committee, Signalling Subworking Group, ATM Forum/94-0325RI, Jul. 1, 1994.
- Douglas H. Hunt et al., Flow Controlled Virtual Connections Proposal for ATM Traffic Management (Revision R2), Traffic Management Subworking Group, ATM.sub.-- Forum/94-0632R2, Aug. 1994.
- Flavio Bonomi et al., The Rate-Based Flow Control Framework for the Available Bit Rate ATM Service, IEEE Network, Mar./Apr. 1995, pp. 25-39.
- R. Jain, Myths About Congestion Management in High Speed Networks, Internetworking Research and Experience, vol. 3, 101-113 (1992).
- Douglas H. Hunt et al., Credit-Based FCVC Proposal for ATM Traffic Management (Revision R1), ATM Forum Technical Committee Traffic Management Subworking Group, ATM.sub.-- Forum/94-0168R1, Apr. 28, 1994.
- Douglas H. Hunt et al., Action Item Status for Credit-Based FCVC Proposal, ATM Forum Technical Committee Traffic Management Subworking Group, ATM.sub.-- Forum/94-0439, Apr. 28, 1994.
- Timothy P. Donahue et al., Arguments in Favor of Continuing Phase 1 as the Initial ATM Forum P-NNI Routing Protocol Implementation, ATM Forum Technical Committee, ATM Forum/94-0460, Apr. 28, 1994.
- Rob Coltun et al., PRP: A-NNI Routing Protocol Proposal, ATM Forum Technical Committee, ATM.sub.-- Forum/94-0492, Apr. 28, 1994.
- Richard Bubenik et al., Requirements For Phase 2 Signaling Protocol, ATM Forum Technical Committee, Signalling Subworking Group, ATM Forum 94-1078, Jan. 1, 1994.
- SITA, ATM RFP: C-Overall Technical Requirements, Sep. 1994.