LINKED-LIST STRUCTURES FOR MULTIPLE LEVELS OF CONTROL IN AN ATM SWITCH

Abstract: A linked-list structure and method for use in an ATM network switch (13) capable of adaptively providing highly efficient, and thus low cost, integrated services therein. The linked-list structure involves the creation of a list having pointers to a subsequent linked list as list entries. Within the subsequent linked list, each entry can be a pointer to a further linked list. The structure can be expended to further levels of linked lists as required. Bandwidth distribution is thus achieved among list members at each level. The linked-list structure is employed in the present switch (13), which includes an input port processor (20), a bandwidth arbiter (11), and an output port processor (22), for switch bandwidth scheduling for both point-to-point, multipoint-to-point and point-to-multipoint cell transfers from the input port processor, and for output link scheduling at the output port processor (22).

Description: LINKED LIST STRUCTURES FOR MULTIPLE LEVELS OF CONTROL IN AN ATM SWITCH RELATED APPLICATION This application claims benefit of U.S. Provisional Application Serial No. 60/001,498, filed July 19, 1995. FIELD OF THE INVENTION The invention generally relates to the field of telecommunications networks, and specifically to hierarchical data structures providing multiple levels of control in an asynchronous transfer mode switch. BACKGROUND OF THE INVENTION Telecommunications networks such as asynchronous transfer mode ("ATM") networks are used for transfer of audio, video and other data. ATM networks deliver data by routing data units such as ATM cells from source to destination through switches. Switches include input/output ("I/O") ports through which ATM cells are received and transmitted. The appropriate output port for transmission of the cell is determined based on the cell header. In configuring a network element such as a switch for the optimal transfer of various traffic types (sometimes referred to as a service classes) supported by ATM networks, multiple factors such aε throughput delay and desired bandwidth must be considered. Such traffic types, each having its own delay and bandwidth reguirements, include the constant bit rate ("CBR") service class, the variable bit rate ("VBR") service class, the available bit rate ("ABR") service class, and the unspecified bit rate ("UBR") service class. The primary differentiator between the service classes is delay. Telecommunications network applications such as teleconferencing reguire deterministic delay bounds, and are typically assigned to the CBR service class. Transaction processing applications such as automated teller machines require a "tightly bounded" delay specification to provide acceptable response times. Such applications typically are assigned to the VBR service class. File transfer applications such as internetwork traffic merely require a "bounded" delay, and thus typically employ the ABR service classes. The UBR service class normally provides no delay bound. Bandwidth is another consideration in establishing an acceptable switch configuration. Video applications typically have a predictable bandwidth requirement, while file transfer applications are much more aperiodic, or "bursty." Low-delay and complete line utilization are opposing goals when multiplexing asynchronous sources. High utilization is achieved by having a set of connections share bandwidth that is unassigned to connections that need very low delay. This shared bandwidth is known as dynamic bandwidth because it is distributed to connections based on instantaneous operating conditions. VBR, ABR and UBR utilize dynamic bandwidth to achieve high line utilization. A network switch capable of adaptively accommodating network traffic having such dissimilar delay and bandwidth requirements, and thus providing low-cost, highly efficient integrated services, is reguired. SUMMARY OF THE INVENTION Integrated services is the accommodation of various traffic types, wherein each of the traffic types is characterized by delay bounds and by guaranteed bandwidth, and wherein each of the traffic types receives allocated bandwidth, dynamic bandwidth, or a combination of both. The presently disclosed invention is an ATM network switch and method capable of adaptively providing highly efficient, and thus low cost, integrated services therein. In providing such integrated services, if the input rate for a connection is greater than its allocated bandwidth, the connection can optionally use dynamic bandwidth. In general overview, the switch includes at least one input port, at least one output port, and input and output buffers associated with the respective input and output ports. Cells enter the switch through the input port and are buffered in the input buffers. The cells are then transmitted from the input buffers to the output buffers, under the control of respective port processors and a Bandwidth Arbiter ("BA") , and then transmitted to the appropriate output port. In order to provide both connection and traffic type isolation, the buffers are grouped into gueues and flow control is implemented on a per gueue basis. Each gueue includes multiple buffers, and each switch includes multiple input queues and multiple output queues. Upon entering the switch, each cell is loaded into an input cell buffer belonging to a particular input queue for eventual transmission to an output cell buffer belonging to a particular output queue. Per VC queuing enables connection- level flow control, since cells are grouped according to the input and output port pair they traverse. Individual gueues are then assigned to traffic type groups in order to facilitate traffic type flow control. For example, each queue is dedicated to a particular traffic type (sometimes referred to as a service class) such as the variable bit rate ("VBR") service class and the available bit rate ("ABR") service class as described above. In addition to the differentiation of cell traffic into the service categories described above, further levels of priority are introduced within each category because different applications within a category may have different sensitivity to delay. For example, a file transfer performed by a back-up application can tolerate longer delays than a file transfer of a medical image to an awaiting physician. Flow control can also be implemented on these traffic sub- - A - types, with each queue being assigned to a particular connection, thereby providing flow control on a per- connection basis as well as on a per-service category basis. It is then possible for the presently disclosed network switch to provide integrated services by transferring input cells to output buffers using bandwidth assigned specifically to such connections ("allocated bandwidth") , by transferring input cells to output buffers using bandwidth which is instantaneously unassigned to cells requiring allocated bandwidth ("dynamic bandwidth") , and by transferring input cells to output buffers utilizing a mix of both allocated and dynamic bandwidth. Bandwidth arbitration, or the matching of available receivers to transmitters needing to transmit cells to that set of receivers, begins with a determination of what bandwidth is available. A To Switch Port Processor ("TSPP") is responsible for receiving a cell from a unidirectional transmission path known as a "link," for analyzing cell header information to identify a connection with which the cell is associated, and for buffering the cell in accordance with the service class and subclass priority associated with the respective connection. Further, the TSPP is responsible for transferring the cell from the buffer to one or more From Switch Port Processors ("FSPPs") using the associated switch fabric. The bandwidth employed for such transfer can be either allocated or dynamic, or both, as previously characterized. To manage the allocated bandwidth, the TSPP employs a time slotted frame concept through the use of a Switch Allocation Table ("SAT") . The TSPP also uses two data structures in managing different resources, a queue and a list. A queue is used to manage buffers, and consists of a group of one or more buffered cells organized as a FIFO and manipulated as a linked list using pointers. Incoming cells are added (enqueued) to the tail of the queue. Cells which are sent to the switch fabric are removed (dequeued) from the head of the queue. Cell ordering is always maintained. For a given connection, the sequence of cells that is sent to the switch fabric is identical to that in which they arrived although the time intervals between each departing cell may be different from the inter-cell arrival times. Valid SAT entries provide a pointer to a "scheduling list," in which is maintained a list of queues which may have cells intended for transfer to a particular output port. A scheduling list consists of one or more queue numbers organized as a circular list. As with queues, lists are manipulated as a linked-list structure using pointers. Queue numbers are added to the tail of a list and removed from the head of the list. A gueue number can appear only once on any given scheduling list. In addition to being added and removed, queue numbers are recirculated on a list by removing from the head and then adding the removed queue number back onto the tail. This results in round-robin servicing of the queues on a particular list. Allocated time slots which cannot be used at a given instant in time or valid SAT entries where there is no cell to send for that connection cause the TSPP to notify the BA that it can use that time slot as a dynamic bandwidth cell time for any of the TSPPs associated with the switch. In this way, service classes reguiring either or both of allocated and dynamic bandwidth are accommodated. Cells received through the switch fabric are received by the FSPP associated with the appropriate output port. Based upon prioritization information associated with the cell at the TSPP, the cells are prioritized and transmitted, with each cell maintained in the same order, relative to other cells on a connection, in which it was received. The linked-list structure previously alluded to includes multiple levels of lists, providing multiple levels of control. In the abstract, an upper level list contains entries which are each references to a respective, subsequent linked list. Entries in each of the subsequent linked lists are themselves linked lists. The structure can be expanded to yet further levels by adding a linked list in each entry in a subsequent list. When a task is executed using such a structure, fairness is achieved among list members at each level. This structure finds utility in the context of the presently disclosed network switch in multiple instances. For instance, TSPP point-to-point arbitration employs such a structure in creating dynamic lists of cells to be transmitted via dynamic bandwidth through the switch. TSPP multipoint-to-point arbitration also employs such a structure, but with a further level of linked lists. FSPP output scheduling is also accomplished using this linked-list structure. BRIEF DESCRIPTION OF THE DRAWINGS The invention will be more fully understood by reference to the following description and accompanying drawings of which: Fig. 1 is a block diagram of a switch according to the present invention; Fig. 2 is a block diagram illustrating point-to-point and point-to-multipoint operation in the switch of Fig. 1; Fig. 3 illustrates Switch Allocation Tables according to the present invention; Fig. 4 illustrates a scheduling list and associated queues according to the present invention; Fig. 5 illustrates a linked-list structure for multipoint-to-point and point-to-point transfer arbitration according to the present invention; Fig. 6 illustrates the use of priority lists in the present invention; Fig. 7 illustrates the relationship between a dynamic bandwidth threshold, allocated bandwidth, and dynamic bandwidth in the present invention; Fig. 8 illustrates the distribution of unallocated output ports for dynamic bandwidth utilization in the present invention; Fig. 9 is an exemplary queue as used in the present invention; Fig. 10 illustrates the placement of queues on preferred and/or dynamic lists within the FSPP in the present invention; and Fig. 11 illustrates preferred and dynamic lists in an FSPP according to the present invention. DETAILED DESCRIPTION Referring now to Fig. 1, the presently disclosed switch 10 includes a plurality of input ports 20, a plurality of output ports 22 and an NxN switch fabric 11, such as a cross point switch, coupled between the input ports 20 and output ports 22. Each input port 20 includes a To Switch Port Processor ("TSPP") ASIC 14 and each output port 22 includes a From Switch Port Processor ("FSPP") ASIC 16. A Multipoint Topology Controller ("MTC") ASIC 18 is coupled between each TSPP 14 and a bandwidth arbiter ("BA") ASIC 12, and as well as between the bandwidth arbiter 12 and each FSPP 16, as shown. In one embodiment, each MTC supports up to four TSPPs 14 or FSPPs 16. The switch fabric 11 includes a data crossbar 13 for data cell transport and the bandwidth arbiter 12 and MTCs 18 for control signal transport. The Bandwidth Arbiter ("BA") ASIC 12 controls, inter alia, transport of data cells from a TSPP 14 to one or more FSPPs 16 through the data crossbar 13 (i.e., switch port scheduling), including the dynamic scheduling of momentarily unassigned bandwidth (as further described below) . Each FSPP 16 receives cells from the data crossbar 13 and schedules transmission of those cells onto network links 30 (i.e., link scheduling). Each of the input ports 20 and output ports 22 includes a plurality of input buffers 26 and output buffers 28, respectively (Fig. 2) . The buffers 26, 28 are organized into a plurality of input queues 32a-m (referred to herein generally as input queues 32) and a plurality of output queues 34a-m (referred to herein generally as output queues 34) , respectively. More particularly, each input port 20 includes a plurality of input queues 32 and each output port includes a plurality of output queues 34, as shown. The input queues 32 are stored in a Control RAM 41 and a Pointer RAM 50 of the input port 20 and the output queues 34 are stored in a CRl RAM 61 and a CR2 RAM 63 of the output port 22. The actual cell buffering occurs in Cell Buffer RAM 17, with the queues 32 having pointers to this buffer RAM 17. To traverse the switch 10, a data cell 24 enters the switch through an input port 20 and is enqueued on an input queue 32 at the at the respective TSPP 14. The cell is then transmitted from the input queue 32 to one or more output queues 34 via the data crossbar 13. Control signals are transmitted from a TSPP 14 to one or more FSPPs 16 via the respective MTC 18 and the bandwidth arbiter 12. In particular, data and control signals may be transmitted from an input queue 32 to a particular one of the output queues 34, in the case of a point-to-point connection 40. Alternatively, data and control signals may be transmitted from an input queue 32 to a selected set of output queues 34, in the case of a point-to-multipoint connection 42. From the output queue(s) 34, the data cell 24 is transmitted outside of the switch 10, for example, to another switch 21 via a network 30. The bandwidth arbiter 12 contains a crossbar controller 15 which includes probe crossbar, an XOFF crossbar and an XON crossbar, each of which is an NxN switch. A transfer request message, or probe control signal, flows through the probe crossbar and is used to query whether or not sufficient space is available at a destination output queue, or queues 34, to enqueue a cell. The request message is considered a "forward" control signal since its direction is from a TSPP 14 to one or more FSPPs 16 (i.e., the same direction as data) . A two bit control signal flows in the reverse direction (from one or more FSPPs to a TSPP) through the XOFF crossbar and responds to the reguest message guery by indicating whether or not the destination output gueue, or queues 34, are presently capable of accepting data cells and thus, whether or not the transmitting TSPP can transmit cells via the data crossbar 13. In the event that the XOFF control signal indicates that the queried output queue(s) 34 are not presently capable of receiving data, another reverse control signal, which flows through the XON crossbar, notifies the transmitting TSPP once space becomes available at the destination output queue(s) 34. Each output port 22 contains four memories: a Control RAM 1 (CRl RAM) 61, a Control RAM 2 (CR2 RAM) 63, a Cell Buffer RAM 19, and a Quantum Flow Control RAM (QFC RAM) . The Cell Buffer RAM 19 is where the actual cells are buffered while they await transmission. The CRl RAM 61 and the CR2 RAM 63 contain the output queues 34, with each queue 34 containing pointers to cells in the Cell Buffer RAM 19. The CRl RAM 61 contains information required to implement scheduling lists used to schedule link access by the output gueues 34 associated with each link 30 supported by the FSPP 16. The QFC RAM 67 stores update information for transfer to another switch 29 via a network link 30. Update cells are generated in response to the update information provided by a TSPP 14 and specify whether the particular TSPP 14 is presently capable of accepting data cells. In order to provide both connection and traffic type isolation, the buffers 26, 28 are organized into queues 32, 34 respectively and flow control is implemented on a per queue basis. Each queue includes multiple buffers, and each switch includes multiple input queues 32 and multiple output queues 34. Upon entering the switch, each cell 24 is loaded into a particular input queue 32 for eventual transmission to a particular output queue 34. By organizing input cells - lo ¬ in queues by received (input) port and destination (output) port, connection level flow control is facilitated. For example, queues 32a, 34a could be dedicated to a particular connection. In addition, nested queues of queues may be employed to provide per subclass flow control. Referring again to Fig. 1 , the invention will now be described in greater detail. In the preferred architecture each input port includes a TSPP 14, and each output port includes an FSPP 16. The TSPPs and FSPPs each include cell buffer RAM which is organized into queues 32, 34, respectively. All cells in a connection 40 pass through a single queue at each port, one at the TSPP and one at the FSPP, for the life of the connection. The queues preserve cell ordering. This strategy also allows quality of service ("QoS") guarantees on a per connection basis. In the multipoint-to-point case, two or more queues are established to service the multiple sources. As a cell is received into the TSPP 14, the first action performed by the TSPP is to check the cell header for errors and then to check that the cell is associated with a valid connection. To do this, the VPI/VCI fields specified in each cell header are employed as an index into a translation table known as the VXT which is stored in the Control RAM 41. The TSPP first checks to see if this connection is one previously set up by the control software. If recognized, the cell will then be assigned a queue number associated with the connection. At the same time, the cell is converted into an internal cell format by the TSPP. The queue number is associated with a queue descriptor which is a table of state information that is unique to that source. After a cell is assigned a queue number from the VXT, the TSPP looks at the corresponding gueue descriptor for further information on how to process the cell. The next operation is to try to assign a buffer for the cell. If available, the cell buffer number is enqueued to the tail of its respective queue and the cell is written out to external cell buffer RAM 32. In addition to processing and buffering incoming cell streams, the TSPP must transfer the cells from the cell buffer to a group of one or more FSPPs using the switch fabric 11. The bandwidth used for such transfer can either be preassigned (i.e., allocated bandwidth) or dynamically assigned (i.e., dynamic bandwidth). The allocated bandwidth is assigned by Call Acceptance Control (CAC) software. The assignment of dynamic bandwidth depends on the instantaneous utilization of the switch resources, and is controlled by the Bandwidth Arbiter 12. Allocated bandwidth is managed using a time slotted frame concept. With regard to Fig. 3, each TSPP has a data structure called a Switch Allocation Table ("SAT") 23 which is used to manage the allocated bandwidth. All TSPPs in the switch are synchronized such that they are all pointing, using a SAT pointer 25, to the same offset in the SAT at any given cell time. In a preferred embodiment, each slot in the SAT is active for 32 clock cycles at 50 Mhz, providing approximately 64Kbps of cell payload bandwidth. Given a SAT depth of 8192, the pointers scan the SATs every approximately 6msec, thereby providing a maximum delay for transmission opportunity of approximately 6msec. The CAC software is responsible for assigning allocated bandwidth from TSPPs to FSPPs in a conflict-free manner. Each cell time, the TSPP looks at the SAT entry for that cell time. A SAT entry is either not valid or points to a list of queues in TSPP Control RAM 41 called a scheduling list 27 (see Fig. 4) . Queue descriptors for each of the queues are also stored in the Control RAM 41. If the SAT entry is invalid, that cell time is made available to the Bandwidth Arbiter for use in assigning dynamic bandwidth, as described below. Allocated cell time given up by a particular TSPP may be used as a dynamic bandwidth cell time; it may be used by the TSPP that gave up the slot or it may be given to a different TSPP for use. The decision of which TSPP gets a given dynamic cell time is made by the Bandwidth Arbiter. If the SAT entry contains a valid scheduling list number, as illustrated in Fig. 3 as SLIST 427, the TSPP will use the first queue on the referenced scheduling list as the source of the cell to be transferred during that cell time. This is accomplished by the scheduling list containing a "head" pointer 29 and a "tail" pointer 31, as shown in Fig. 4. The head pointer 29 is a pointer to a first queue 33 having a cell to be transmitted to a particular output port. The tail pointer 31 is a pointer to a last queue 35 having a cell to be transmitted to the same output port. Further, each queue associated with this list has a "next" pointer labelled "N" in Fig. 4 which points to the next queue in a sequence of queues. Though not illustrated in Fig. 4, each queue is a linked list, wherein the queue descriptor has a head pointer pointing to the first cell buffered in this gueue, and a tail pointer pointing to the last cell buffered in this queue. Each buffered cell has a next pointer pointing to the next cell in the queue. Thus, as illustrated, the SAT for TSPPO presently indicates that a cell time is available to scheduling list 4 27 (SLIST 4) . The head pointer 29 of this scheduling list is pointing to queue 4 33, which has four cells ready to be transmitted to the respective output port. After the first cell from queue 4 has been transmitted through the switch fabric and the internal pointers of queue 4 have been modified to point to the second cell as the next cell for transmission, queue 4 33 now becomes the last of the three queues associated with SLIST 4 to be selected next time. Specifically, the head pointer of SLIST 4 is modified to point to queue 7, the tail pointer is modified to point to queue 4, and the header data of queue 2 is modified to point to queue 4. If queue 4 does not have another cell to be transmitted, the queue is dequeued, queue 7 is the next queue, and queue 2 is the last queue. Cell times are made available to the Bandwidth Arbiter for assignment as dynamic bandwidth under the following conditions: 1) if the scheduling list identified by the SAT has no queue entry available, this case being referred to as "allocated, unused;" or 2) if the SAT has no scheduling list specified for a particular cell time slot, this case being referred to as "unallocated." A further condition exists in the case where a pacing scheme is implemented in the TSPP to minimize initial delay in transferring a cell using allocated bandwidth. If a SAT slot for a particular scheduling list is indicated, but the pacing counter for that list has not reached the appropriate value, a cell from an associated gueue is prevented from being transferred, and the slot becomes available for dynamic bandwidth transfer. Dynamic bandwidth cell times are managed by taking advantage of a nested set of pointers, or what is referred to as a "list of lists" technique. In general, such a structure is presented in Fig. 5. A set of lists, labelled Dynamic Bandwidth Lists, has plural entries, labelled Port 0,, Port 0 2 , Port 0 3 , Port 0 4 , Port 1,, Port 1 2 , Port 1 3 , .... Each entry represents a dynamic bandwidth list for each port and priority (discussed below) , and has a head pointer-tail pointer pair pointing to scheduling lists for port 0, priority 3. Thus, "Dynamic Bandwidth Lists" is comprised of entries which are themselves lists, or in other words, is a list of lists. The head pointer for Port 0 3 points to scheduling list 12 (SLIST 12). SLIST 12 is the first of plural scheduling lists in the linked-list data structure called the dynamic bandwidth list for the port and priority. The tail pointer for Port 0 3 points to the last entry in this linked-list structure, SLIST 5. Each scheduling list in the structure has a pointer to the next scheduling list in the same structure. Each of SLISTs 12, 2 and 5 also has a head pointer-tail pointer pair pointing to at least one queue having a linked- list data structure. Specifically, the head pointer of SLIST 12 points to Queue 3 (labelled Q3) , and the tail pointer of SLIST 12 points to the last queue in that queue-level linked list. Queue 11 (labelled Qll) . Similarly, the head and tail pointers of SLIST 2 point to a single queue. Queue 8 (Q8) , and the head and tail pointers of SLIST 5 point to Queues 2 and 6, respectively. At the queue level, a head pointer for Q3 points to the first buffered cell in the queue, labelled Cl, having a pointer to the buffered cell data ("C") , and a pointer ("N") to the next cell in the queue. For point-to-point transmission, there is a one-to-one correspondence between scheduling list and queue. This is illustrated in Fig. 5 with SLIST 2 and Queue 8. For multipoint-to-point, there can be plural queues per scheduling list. Such is the case with SLIST 12 and Queues 3 and 11, and with SLIST 5 and Queues 2 and 6. By implementing this overall "list of lists" structure in the presently disclosed ATM switch, multiple levels of control are provided. For instance, the first time an event occurs which enables one cell to be transmitted to Port 0 3 , a cell from the first cell in the first gueue associated with scheduling list 12 will be selected. This is cell Cl of Queue 3. The pointers of the "Dynamic Bandwidth Lists" list and SLISTs 12 and 5 are adjusted such that SLIST 2 is the next scheduling list from which a cell is provided if dynamic bandwidth becomes available for transmission of a cell to output Port 0 3 . SLIST 5 would be second, and SLIST 12 would then be last. Similarly, Queue 3, having just provided a cell, becomes the last queue to be eligible to provide a cell vis a vis SLIST 12, with Queue 11 being the next. This occurs through the manipulation of pointers in SLIST 12 and Queues 3 and 11. Finally, cell Cl, having been transmitted, is dequeued from Queue 3, meaning the pointers of Queue 3 are readjusted to point to C2 as next to be transmitted. Only if another cell is received into Queue 3 will another cell fall in to line behind cell 4. Round-robin selection is thus enabled between the scheduling lists and the gueues, with even bandwidth distribution being provided at each level. Other scheduling policies can be implemented if other bandwidth distributions are desired. As shown, the list of lists approach is applied to the allocation of dynamic bandwidth in the form of Dynamic Bandwidth Lists internal to the TSPP ASIC. 260 dynamic bandwidth lists are employed in the TSPP ASIC in a preferred embodiment. The first 256 of these lists are used for point- to-point ("P2P") and multipoint-to-point ("M2P") connections. Four lists are assigned to each one of the switch output ports. Four other lists are used for point-to-multipoint ("P2M") connections. This is shown at an upper-level in Fig. 6, where for each TSPP, there is a list of lists structure similar to that of Fig. 5. In either the P2P or M2P case, when enough cells have been removed from a gueue to reach a dynamic bandwidth threshold (discussed subseguently) , the queue is dropped, or dequeued, from the linked list of queues. Further, when all queues for a particular scheduling list have been dequeued, the scheduling list is removed from the linked list of lists. If all scheduling lists for a particular entry in the linked list are removed, the pointers in the Dynamic Bandwidth List are given null values. Another example of the application of the list of lists structure to the present ATM switch is described below with respect to Output Link Scheduling. The priority of the scheduling lists is transmitted to the BA. The BA utilizes this priority information to effect the order in which it grants dynamic bandwidth to the TSPP. This prioritization is employed in assigning scheduling lists to one of the four dynamic bandwidth lists. In one embodiment of the disclosed switch, illustrated in Fig. 6, cells from the VBR and ABR service categories are subject to being assigned to any of the four priorities, and UBR cells are subject only to being assigned to the lowest priority dynamic bandwidth list. Each queue for each connection has a dynamic bandwidth threshold 37 associated therewith, as shown in Fig. 4. If a queue buffer depth exceeds the cell depth indicated by the respective dynamic bandwidth threshold 37, the scheduling list for that queue will be added to the appropriate dynamic bandwidth list corresponding to the appropriate output port and priority. For each output port, the dynamic bandwidth list provides an indication of which if any cells are to be transmitted to the respective output port using dynamic bandwidth. The dynamic bandwidth threshold is established at call setup time. In a further embodiment of the present switch, however, the threshold value is adjusted dynamically based upon an empirical analysis of traffic through the switch. With regard to Fig. 7, a dynamic bandwidth threshold for a gueue of CBR cells, or cells reguiring a dedicated bandwidth, would be established such that the requested bandwidth (labelled "A" in Fig. 7) meets or exceeds the requirement. For other applications which may be more bursty but which still require tightly bounded delay, a dynamic bandwidth threshold such as that labelled "B" in Fig. 7 may be suitable, wherein the majority of the traffic is handled by allocated bandwidth, with momentary bursts handled by high-priority dynamic bandwidth. In either case, bandwidth specifically allocated but unused is made available to the BA by the TSPP for dynamic bandwidth allocation. Note that for categories of service which rely solely on allocated bandwidth, the dynamic bandwidth threshold is set above any expected peaks in cell reception. Conversely, for categories of service having no (or low) delay bounds and no guaranteed bandwidth, such as UBR, the dynamic bandwidth threshold is set to zero. As discussed, each queue is also a linked list, wherein the queue descriptor, resident in the control RAM 41, has a head pointer pointing to the first buffer belonging to the queue and containing a cell, and a tail pointer pointing to the last buffer belonging to the queue and containing a cell. The input cells are buffered in the cell buffer RAM 32. The queue header of an empty queue has a head pointer = 0 and a tail pointer = head. Thus, the linked list that forms the queue is just a chain of pointers. The contents of one pointer points to the next pointer, etc. The pointer number is both the logical address of the pointer as well as the logical address of the cell buffer (i.e., the cell buffer number) . There is a one-to-one mapping of a cell pointer and its corresponding cell buffer. The majority of the pointers are stored within Pointer RAM 50 along with the SAT. Cell ordering is preserved since cells are removed from the queue in a first-in-first-out (FIFO) fashion, no matter whether allocated or dynamic bandwidth is used. This is despite the fact that a scheduling list can be granted transmission opportunities by either the SAT or by a dynamic bandwidth list. In a first embodiment, all of the queues in each dynamic bandwidth list share, in round-robin fashion, the available dynamic bandwidth for that port. Assume that queue 4 from Fig. 4 is added to one of the scheduling lists on the dynamic bandwidth list of Fig. 5. In actuality, only pointers of the dynamic bandwidth list, the respective scheduling list, and any other queues on the scheduling list are adjusted to place a queue on this list; no physical relocation of the queue is involved. Assume that over an interval no cells are added to queue 4 as illustrated in Fig. 4 and no cells are removed from the queue as a result of allocated bandwidth being made available. If two cells are transmitted from this queue as a result of dynamic bandwidth being made available during this interval, the cell count in the queue would then be below the respective dynamic bandwidth threshold 37. The queue would then be removed from the dynamic bandwidth list by adjusting the pointers of the appropriate scheduling list and any other queues associated with that scheduling list. The opposite is true for a queue which receives cells above its respective dynamic bandwidth threshold. Note that the first cell to be buffered within a queue will always be the first to be transmitted, whether such transmission is via allocated or dynamic bandwidth. This is necessary to preserve the proper ordering of cells. Therefore, at each cell time, the TSPP is assigned either allocated or dynamic bandwidth. The TSPP uses this information in deciding which connection to use in supplying a particular cell to be transferred during that cell time. The Bandwidth Arbiter 12 ("BA") distributes unallocated and unused-allocated switch bandwidth, the dynamic bandwidth. The distribution is based on requests and information sent by each TSPP. Each TSPP identifies to the BA output ports which will have cells sent to them for a particular cell time as a result of allocated bandwidth. In addition, each TSPP provides to the BA an indication of which output ports are requested for access via dynamic bandwidth, a product of the dynamic bandwidth lists. If a TSPP does not have an allocation on the SAT for a specific cell time, it may vie for dynamic bandwidth. Each TSPP can have several outstanding requests stored in the BA. Each TSPP provides its dynamic bandwidth request(s) for a port(s) to the BA via a serially-communicated request to set the bits for the requested output ports. Each TSPP can set or delete bits in its respective request vector, or can change priority with respect to each reguest - each request has a priority level stored in conjunction therewith. These three commands are executed via a three-bit serial command sent from the respective TSPP to the BA. Up to 16 ports can be requested by the TSPP. In other words, each TSPP can request all of the output ports in a switch having sixteen output ports. A request remains set unless it is explicitly deleted by the TSPP. In the case where a request is matched by the BA with an available output port, a grant in the form of a port number is returned by the BA to the requesting TSPP. The BA interprets the requests and stores them in the form of a register bank, one for each priority with a set bit indicating a requested port. These dynamic bandwidth requests of all vying TSPPs are fed into a Dynamic Arbitration Unit 43 of the BA, which tries to match the requests with the available (not allocated or allocated but unused) ports. Matched requests are communicated back to the TSPPs, which refer to their dynamic bandwidth lists (described above) in sending cells accordingly. State information is retained by the BA to implement a round-robin service scheme and to determine which was the last TSPP served. A TSPP is served when a Free Output Port Vector in the BA is matched to a TSPP request, whereby the requested port is granted and the reguest is subtracted from the Free Output Port Vector. The Free Output Port Vector is then applied to the next TSPP request in an attempt to match unassigned ports to reguested ports. Eventually, the Free Output Port Vector will be all or almost all zeroes, and no further match between unassigned ports and reguested ports can be found. Fig. 8 illustrates the matching process. Here, TSPP 0 has provided a serial request for ports 0 and 2. The BA indicates that ports 0, 1, and 2 are available for dynamic bandwidth cell transfer via the Free Output Port Vector. Assuming TSPP 0 is first in the round-robin list of TSPPs to be matched, a match for ports 0 and 2 is indicated. In point-to-point ("P2P") communication, only one matching port is granted to TSPP 0, in the illustration, port 0. The BA now has ports 1 and 2 left in the Free Output Port Vector for matching with the next requesting TSPP. TSPP 1 has requested ports 0 - 3. Ports 1 and 2 match with the left-over available list. Port 2 is granted, and the new left-over Free Output Port Vector includes port 1. The BA matching process continues until all available ports are granted by the BA, or no unmatched TSPP requests remain. In an embodiment supporting point-to-multipoint ("P2M") cell transfer, matches to P2M request are sought prior to seeking matches to P2P requests, since it is more difficult to match all requested ports from one TSPP at once. To allow the use of allocated and shared (i.e. , dynamic) resources at the output port by a single connection, cell transfers are tagged to indicate whether they were above or below their allocated cell rate. The tagging is performed by the BA. If a cell is shipped using a SAT slot, it is tagged as scheduled. If the cell is shipped because it won bandwidth arbitration, it is tagged as not scheduled. This information is employed in FSPP processing, as described below. Traffic of different priority levels is supported in the presently disclosed switch through the assignment of reguests to one of four priority levels by the originating TSPP. The BA separates these four levels into either "high" or "low" priority, and attempts to match all high-priority requests prior to attempting to match all low-priority reguests. Prior to receiving a cell through the switch fabric, an FSPP receives control information indicative of whether the cell transfer utilizes scheduled bandwidth or a dynamic bandwidth. The control information further indicates the queue(s) within which the cell is to be enqueued. This information allows the FSPP to determine whether it has sufficient resources such as queue space, buffer space, bandwidth, etc., to receive the cell. If the FSPP does not have sufficient resources to receive a cell, it indicates this by asserting an appropriate control signal. The assertion of this signal means the FSPP is able to receive the cell or the FSPP is not present. As illustrated in Fig. 1, external to the FSPP 16 are four memories. Control RAM 1 61, Control RAM 2 63, Cell Buffer RAM 19, and QFC RAM 67. Control RAM 1, Control RAM 2, and Cell Buffer RAM are used to enqueue and dequeue cells. Control RAM 1 and Control RAM 2 contain the information required to implement the queues, dynamic lists and preferred lists (discussed below) necessary to provide the FSPP functions. The Cell Buffer RAM is where the actual cells are buffered while they await transmission. The QFC RAM primarily contains storage for a flow control information received from the TSPP, and is accessed during the generation of flow control update cells. The cell buffer is divided into cell buffer locations, each capable of holding a single cell. Cell buffer locations within the cell buffer are pointed to using cell numbers. The starting address of a cell buffer location is derived from the cell number; each cell buffer location has a unigue cell number pointing to that cell buffer location within the cell buffer. The total number of cell buffer locations is divided among plural cell buffer pools, each dedicated to an internal cell scheduling resource. Each pool is implemented using two internal registers. The cell buffer pool count register contains the current number of cell buffer locations in use for that pool. The cell buffer pool limit register contains the maximum number of cell buffer locations allowed for that pool. Cell numbers are manipulated to place cell buffer locations into queues. When a cell buffer location in the cell buffer is written with a cell, the cell number pointing to that cell buffer location is then placed on a gueue. Cells are transmitted from the queues in the order in which they were received; the first received is the first transmitted. A logical representation of such a gueue is illustrated in Fig. 9. Each queue is implemented as a linked list of cell numbers; each cell on the queue points to the next cell on the queue using its cell number as a pointer, as previously described. Each queue has a separate structure, known as the queue descriptor, maintained in Control RAM 2 to point to the head and tail of the queue. The linked list making up a queue is implemented as a set of pointers in Control RAM 1 such that each cell buffer location has one entry. The pointers are indexed using the cell number, with each entry containing another cell number. Thus, one cell number can point to another cell number. The queue descriptor also contains a count of the cells in the queue. Once a cell is placed on a queue, that queue must then be scheduled for transmission. This is done by placing the gueue number of that queue on a list. There are different types and priorities of lists within the FSPP. Lists are linked lists of queue numbers, similar to the scheduling lists of the TSPP. Each list has a separate structure, known as the list descriptor, maintained internal to the FSPP to point to the head and tail of the list. There are two categories of traffic to be scheduled for transmission: allocated traffic and dynamic traffic. The control information associated with each cell received in the FSPP indicates to which of these two categories the cell belongs. Two types of lists are used for scheduling the two types of traffic: preferred lists and dynamic lists. The queue numbers of queues having allocated traffic are placed on the preferred list. The queue numbers of queues having dynamic traffic are placed on the dynamic list. Queues can be found on both the preferred list and the dynamic list since each queue may have both scheduled and unscheduled cells, as shown in Fig. 10. Here, the first entry in the preferred list is a pointer to queue 7, labelled Q7. Note that Q7 is also pointed to by the second entry in the illustrated dynamic list. The preferred list will be serviced before the dynamic list. If a queue has no cells assigned to it, it is obviously on neither the preferred list nor the dynamic list. If the queue receives one cell via dynamic bandwidth, the queue is placed on the dynamic list. If the queue receives a second cell, but this time via allocated bandwidth, the queue is also placed on the preferred list. Since servicing of preferred lists take precedence over servicing of dynamic lists, the first cell received in the queue will be chosen for transmission out of the switch via the preferred list, not the dynamic list. The queue will remain on the dynamic list after being removed from the preferred list until the remaining cell is chosen for transmission. Therefore, even though the queue was first placed on the dynamic list, then the preferred list, the first cell is dequeued via the preferred list. This is necessary to ensure and maintain proper cell ordering. The BA is responsible for tagging each cell as either shipped in an allocated SAT slot, or as shipped in an unscheduled dynamic slot. It is this information which is used in assigning queues to preferred and/or dynamic lists. Some queues have mixed service traffic with both allocated and dynamic cells. This is a result of providing integrated services whereby a particular connection may have cells to transmit beyond the respective dynamic bandwidth threshold (see discussion pertaining to Fig. 7 above) . Cells below the threshold are sent as allocated traffic. Cells above the threshold may be sent as dynamic traffic. Queue numbers for the allocated traffic are placed on the preferred list, and queue numbers for the dynamic traffic are placed on the dynamic list. Regardless of order of receipt between allocated and dynamic cells, cells from the queue numbers on the preferred list will be scheduled and removed first. The cells are still transmitted in order out of the FSPP, however, since the cell numbers on the queue remain in order and cell numbers are always removed from the head of the queue. Therefore, even if an individual cell at the head of an output queue was received in the FSPP as an unscheduled, dynamic cell, it will be transmitted first, even if the queue is identified next on a preferred list. Once a queue number has been added to a list, either a preferred list or a dynamic list, it remains on that list until the queue has no more cells of the appropriate type. When a queue number makes it to the head of the list, that queue becomes the next queue within the list from which a cell is transmitted. When the cell is transmitted, the queue number is removed from the head of the list and the count of either allocated cells for a preferred list or dynamic cells for a dynamic list is decremented within the queue descriptor. If the decremented counter is non-zero, the queue number is returned to the tail of the list. Otherwise it is dropped from the list. By servicing the queue number from the head of the list and returning it to the tail of the list, the queues within a list receive round-robin scheduling. With reference to Fig. 11, four priorities of preferred lists are provided for each output link to provide delay bounds through the switch for differentiation of different levels of service. Each output link is scheduled independently, so there is no interaction between the preferred lists for different links. Newly received cells in a higher priority list are transmitted before previously received cells in a lower priority preferred list. All the preferred lists with allocated traffic for a link are scheduled with a priority above dynamic lists with dynamic traffic for that link. There are three types of dynamic lists, with four priorities for each type: VBR, ABR, UBR, as shown in Fig. 10. Each type of list is permanently assigned to each output link. In a preferred embodiment of the presently disclosed switch, the four priorities for each of the VBR and ABR dynamic lists are further divided among two priority levels assigned by the BA: high (bandwidth not met) ; and low (bandwidth exceeded) . These two levels enable the VBR service class to achieve a preselected percentage of dynamic bandwidth before allowing a lower priority service class, ABR, to share in the dynamic bandwidth. Once ABR has achieved its preselected percentage, the remaining dynamic bandwidth is shared among VBR, ABR and UBR. Four priorities exist for VBR lists, VBR0-3. VBR has a lower latency, but may have cell loss. VBR dynamic lists are guaranteed a minimum bandwidth on an output link. Once the VBR dynamic lists with traffic have received their guaranteed bandwidth, the ABR dynamic list transmits if its bandwidth has not been reached. When the minimum bandwidth for both VBR and ABR have been satisfied, then the UBR, VBR and ABR dynamic lists vie in round robin fashion for the remaining bandwidth. ABR also provides four levels of priority. It differs from VBR in that it guarantees no cell loss because flow control is utilized. ABR dynamic lists are also guaranteed minimum bandwidth on an output link. As noted above, once ABR minimum bandwidth has been satisfied, UBR, VBR, and ABR all vie in round-robin fashion for remaining bandwidth. The list of lists structure introduced with respect to Figs. 5 and 7 is also applicable to the processing of cells at the FSPP. Specifically, with regard to Fig. 10 once again, each "cell" illustrated on one of the preferred and dynamic lists is actually a pair of pointers to a gueue having one or more cells to be transmitted from the respective port at the respective priority. Each queue is entered only once on a particular list. If that queue has more than one cell to be transmitted, the queue is put on the list again, but behind all other gueues already on the list. Round-robin queue servicing is thus enabled. In summary, each list entry points to a linked list of cells to be transmitted - it is a list of lists. Fairness is provided between queues of like priority, prioritization between lists is enabled, and cell prioritization is maintained. In this fashion, allocated traffic is transmitted first. Any remaining bandwidth is transmitted according to a prioritized scheme. Thus, multiple classes of service can be provided through the same switch, enabling a customer to pay for the level of service desired (in terms of bandwidth and latency) , while maximizing the utilization of the switch bandwidth. Having described preferred embodiments of the invention, it will be apparent to those skilled in the art that other embodiments incorporating the concepts may be used. For instance, simple variations on the data rates specified herein are to be considered within the scope of this disclosure. These and other examples of the invention illustrated above are intended by way of example and the actual scope of the invention is to be limited solely by the scope and spirit of the following claims.

Claims: AMENDED CLAIMS [received by the International Bureau on 6 January 1997 (06.01.97); original claims 1 and 2 amended; new claims 3-22 added; remaining claims unchanged (6 pages)] 1. A linked-list structure for use in an ATM switch comprising: a first list having plural entries; plural first linked lists each having at least one entry, each of said plural first linked lists being addressed by a respective one of said first list entries; and plural second linked lists, each having at least one entry, each of said plural second linked lists being addressed by a respective one of said first linked list entries. 2. A method of arbitrating, by a control element, between plural queues, each belonging to a respective one of plural scheduling lists addressed by one of plural entries in a master list, said method comprising: organizing, by said control element, one or more of said queues having a common first characteristic as a linked-list of queues addressed by said respective scheduling list; organizing, by said control element, one or more of said scheduling lists having a common second characteristic as a linked-list of scheduling lists addressed by a first of said plural entries in said master list; recognizing, by said control element, the selection of said first entry in said master list; addressing a first scheduling list of said linked-list of scheduling lists having said common second characteristic by said control element using said first entry; and addressing a first queue of said linked-list of queues having said common first characteristic by said control element using said first scheduling list. 3. The structure of claim 1, wherein each of said plural entries of said first list is comprised of a head and tail . The structure of claim 3 , wherein each of said plural first linked lists is addressed by a respective one of said head and tail pointer pairs. 5. The structure of claim 1, wherein each of said plural first linked list entries is comprised of a scheduling list having a set of head, tail and next pointers. 6. The structure of claim 5, wherein each of said plural second linked lists is addressed a respective one of said sets of head, tail and next pointers. 7. The structure of claim 1, wherein each of said plural second linked list entries is comprised of a queue having a set of head, tail and next pointers. 8. The structure of claim 7, further comprising plural linked lists of at least one data cell pointer each, wherein each of said queue head pointers addresses a first data cell pointer in a respective data cell pointer linked list, wherein each of said queue tail pointers addresses a last data cell pointer in a respective data cell pointer linked list, and wherein each of said queue next pointers addresses a next consecutive linked queue, if any, in a respective one of said plural second linked list entries. 9. The structure of claim 8, wherein each of said at least one data cell pointers further comprises: an address pointer to a stored data cell; and a next pointer to a next consecutive data cell pointer, if any, in a respective data cell pointer linked list. 10. The method of claim 2, wherein said step of organizing said linked-list of queues further comprises: initializing a next pointer for each queue in said linked- list of queues to point to a next sequential queue in said linked-list of queues, or if no next sequential queue exists, to a null value. 11. The method of claim 2, wherein said step of organizing said linked-list of scheduling lists further comprises: initializing a next pointer for each scheduling list in said linked-list of scheduling lists to point to a next sequential scheduling list in said linked-list of scheduling lists, or if no next scheduling list exists, to a null value. 12. The method of claim 2, wherein said step of addressing said first scheduling list of said linked-list of scheduling lists further comprises: setting a first master list entry head pointer to point to said first scheduling list in said linked-list of scheduling lists; setting a first master list entry tail pointer to point to a last scheduling list in said linked-list of scheduling lists. 13. The method of claim 2, wherein said step of addressing said first queue of said linked-list of queues further comprises : setting a first scheduling list head pointer to point to said first queue in said linked-list of queues; setting a first scheduling list tail pointer to point to a last queue in said linked-list of queues. 14. The method of claim 2 further comprising the steps of: rearranging said linked-list of queues after a prescribed event wherein said first queue of said linked-list of queues is made a last queue of said linked-list of queues, and a next sequential queue in said linked-list of queues is made a new first queue in said linked-list of queues. 5 15. The method of claim 14 wherein said step of rearranging said linked-list of queues further comprises the steps of: adjusting a first scheduling list tail pointer to point to said first queue of said linked-list of queues; and LO adjusting a first scheduling list head pointer to point to said next sequential queue in said linked-list of queues. 16. The method of claim 2 further comprising the steps of: rearranging said linked-list of scheduling lists after a L5 prescribed event wherein said first scheduling list of said linked-list of scheduling lists is made a last scheduling list of said linked-list of scheduling lists, and a next sequential scheduling list in said linked-list of scheduling lists is made a new first scheduling list in said linked-list of scheduling >0 lists. 17. The method of claim 16 wherein said step of rearranging said linked-list of scheduling lists further comprises the steps of: >5 adjusting a first master list entry tail pointer to point to said first scheduling list of said linked-list of scheduling lists; and adjusting a first master list entry head pointer to point to said next sequential scheduling list in said linked-list of JO scheduling lists. 18. A multi-level linked-list structure in an ATM switch, said structure comprising: a first-level list having plural entries, each of said first-level list entries having a head and tail pointer pair; at least one second-level linked list, each comprised of at least one scheduling list having a head and a tail pointer; at least one third-level linked list, each comprised of at 5 least one queue having a head and a tail pointer; and at least one fourth-level linked list, each comprised of at least one data cell structure, wherein each of said first-level head and tail pointers points to a respective one of said at least one second-level LO linked lists, wherein each of said second-level head and tail pointers points to a respective one of said at least one third-level linked lists, wherein each of said third-level head and tail pointers L5 points to a respective one of said at least one fourth-level linked lists, and wherein said multi-level linked-list structure enables round-robin servicing of requests. 20 19. The structure of claim 18, wherein each of said at least one scheduling list further comprises a next pointer, wherein said next pointer points to a next consecutive scheduling list in a respective one of said at least one second-level linked list, or to a null value if there exists no next consecutive !5 scheduling list in said respective one of said at least one second-level linked list. 20. The structure of claim 18, wherein each of said at least one queue further comprises a next pointer, wherein said next 10 pointer points to a next consecutive queue in a respective one of said at least one third-level linked list, or to a null value if there exists no next consecutive queue in said respective one of said at least one third-level linked list. 21. The structure of claim 18, wherein each of said at least one data cell structure further comprises a next pointer, wherein said next pointer points to a next consecutive data cell structure, or to a null value if there exists no next consecutive data cell structure. 22. The structure of claim 18, wherein each of said at least one data cell structure further comprises an address pointer to a stored data cell.

Inventors: CALDARA STEPHEN A, HAUSER STEPHEN A, MANNING THOMAS A, STROUBLE RAYMOND L, CALDARA, STEPHEN, A., HAUSER, STEPHEN, A., MANNING, THOMAS, A., STROUBLE, RAYMOND, L.
Applicants: ASCOM NEXION INC, CALDARA STEPHEN A, HAUSER STEPHEN A, MANNING THOMAS A, STROUBLE RAYMOND L, ASCOM NEXION INC., CALDARA, STEPHEN, A., HAUSER, STEPHEN, A., MANNING, THOMAS, A., STROUBLE, RAYMOND, L.
Application year: 1996
Main classification: H04L12
IPC codes: G06F9, G06F12, G06F15, H04J3, H04L1, H04L7, H04L12, H04L13, H04L29, H04M3, H04Q3, H04Q11