Point-to-multipoint transmission using subqueues

Information

  • Patent Grant
  • 6141346
  • Patent Number
    6,141,346
  • Date Filed
    Thursday, July 18, 1996
    28 years ago
  • Date Issued
    Tuesday, October 31, 2000
    23 years ago
Abstract
An Asynchronous Transfer Mode switch and method which facilitate point-to-multipoint transmission are disclosed. Each input port within the switch includes a switch allocation table ("SAT") which manages bandwidth allocation and delay. Each SAT includes a plurality of sequentially ordered cell time slots, a subqueue and a synchronized pointer which is directed to one of the slots such that at any given point in time each of the pointers is directed to the same slot location in the respective SAT with which the pointer is associated. To execute point-to-multipoint operation where output port conflicts are present the switch transmits copies of the cell to the output ports at different points in time. More particularly, the switch transmits copies of the cell to available output ports, and tracks such transmission for managing future transmission to unserviced output ports. To track transmission the switch includes a map and scoreboard. The subqueues are used to index into a table and may be associated with one or more output ports. The map indicates which subqueues, and hence which output ports, are initially eligible to receive a copy of the cell. The scoreboard indicates which subqueues, and hence which output ports, have received a copy of the cell. Tracking is realized by updating the scoreboard when copies of cells are transmitted. Copies of the cell are not sent to already serviced output ports. When each designated subqueue has been service, and hence each associated output port has been serviced, the cell is dequeued.
Description

FIELD OF THE INVENTION
The present invention is generally related to telecommunications networks, and more particularly to bandwidth allocation and delay management within 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.
One problem associated with ATM networks is loss of cells. Cells are buffered within each switch before being routed and transmitted from the switch. More particularly, switches typically have buffers at either the inputs or outputs of the switch for temporarily storing cells prior to transmission. As network traffic increases, there is an increasing possibility that buffer space may be inadequate and data lost. If the buffer size is insufficient, cells are lost. Cell loss causes undesirable interruptions in audio and video data transmissions, and may cause more serious damage to other types of data transmissions.
One particular situation where cell loss occurs is in point-to-multipoint transmission. In point-to-multipoint transmission a cell is transmitted from a single input to multiple outputs across the switch fabric. In order to execute such a transmission, each of the designated outputs must be available to receive the cell from the transmitting input, i.e., have adequate buffer space. However, the likelihood that each of the designated outputs will be simultaneously prepared to receive the cell when the cell is enqueued decreases as traffic within the switch increases. In some circumstances this may result in delayed transmission. In the worst case, cells will be delayed indefinitely and discarded. It would therefore be desirable to facilitate point-to-multipoint transmission by reducing or eliminating delays and cell loss.
SUMMARY OF THE INVENTION
An Asynchronous Transfer Mode ("ATM") switch and method which facilitate point-to-multipoint transmission is disclosed. The ATM switch includes a plurality of input ports and a plurality of output ports. Each input port within the switch includes a switch allocation table ("SAT") which manages bandwidth allocation and delay. Each SAT includes a plurality of sequentially ordered cell time slots, a subqueue associated with each cell time slot and a pointer which is directed to one of the slots. The SAT pointers at each input port are synchronized such that, at any given point in time, each of the pointers is directed to the same slot location in the respective SAT with which the pointer is associated.
To execute point-to-multipoint operation where output port conflicts are present the switch transmits copies of the cell to the output ports at different points in time. More particularly, the switch transmits copies of the cell to available output ports and tracks such transmission for managing future transmission to unserviced output ports. To track transmission the switch includes a map and scoreboard. The map indicates which subqueues, and hence which output ports, are initially eligible to receive a copy of the cell. The scoreboard indicates which subqueues, and hence which output ports, have received a copy of the cell. Tracking is realized by updating the scoreboard, i.e., toggling bits corresponding to serviced output ports, when copies of cells are transmitted. When subsequent opportunities to transmit arise as the SAT pointers are advanced, copies of the cell are not sent to already serviced output ports. When each designated output port has been serviced, the cell is dequeued.
Point-to-multipoint transmission is facilitated by transmitting copies of the cell at different points in time when output port collisions are detected. Due to cell traffic, a situation will sometimes arise where only a subset of the cells designated for receipt of a copy of the cell are available. In such a case, simultaneous transmission to each of the designated output ports is not possible. By transmitting at different points in time as the output ports become available, buffer space is more rapidly freed and the delay before entering the switch fabric is reduced for some or all of the cells. Traffic and delays are further reduced by tracking serviced output ports and transmitting only to unserviced output ports.





BRIEF DESCRIPTION OF THE DRAWING
These and other features and advantages of the present invention will become apparent from the following detailed description of the drawing in which:
FIG. 1 is a block diagram of a switch which facilitates point-to-multipoint operation;
FIG. 2 is a block diagram which illustrates operation of the switch allocation tables of FIG. 1;
FIGS. 3A and 3B are block diagrams which further illustrates operation of the switch allocation tables; and
FIG. 4 is a flow diagram which illustrates a method for point-to-multipoint operation.





DETAILED DESCRIPTION OF THE DRAWING
Referring now to FIG. 1, the switch includes an N.times.N switch fabric 10, a bandwidth arbiter 12, a plurality of to switch port processors ("TSPP") 14, a plurality of from switch port processors ("FSPP") 16, a plurality of multipoint topology controllers ("MTC") 18 and a plurality of switch allocation tables ("SAT") 20. The N.times.N switch fabric, which may be an ECL crosspoint switch fabric, is used for cell data transport, and yields N.times.670 Mbps throughput. The bandwidth arbiter controls switch fabric interconnection, dynamically schedules momentarily unused bandwidth, and resolves multipoint-to-point bandwidth contention. Each TSPP schedules transmission of cells 22 to the switch fabric from multiple connections. The FSPP receives cells from the switch fabric and transmits those cells onto output links. The switch allocation table controls crossbar input to output mapping, connection bandwidth, and the maximum delay through the switch fabric.
In order to traverse the switch, a cell 22 first enters the switch through an input port 24 and is buffered in a queue 26 of input buffers. The cell is then transmitted from the input buffers to a queue 28 of output buffers in an output port. From the output port 30, the cell is transmitted outside of the switch, for example, to another switch. To facilitate traversal of the switch, each input port 24 includes a TSPP 14, and each output port 30 includes an FSPP 16. The TSPPs and FSPPs each include cell buffer RAM 32 which is organized into queues 26, 28. All cells in a connection 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 thus preserve cell ordering by handling only one connection per queue. This strategy also allows quality of service ("QoS") guarantees on a per connection basis.
Three communication paths are used to implement flow control within the switch via probe and feedback messages: a Probe Crossbar 42, an XOFF Crossbar 44 and an XON Crossbar 46. The Probe Crossbar 42 is an N.times.N crosspoint switch fabric which is used to transmit an FSPP multiQueue Number to each FSPP. The multiQueue number identifies a plurality of destination queues for the cell for use in point-to-multipoint connections. The FSPP uses the queue number or multiqueue number to direct a probe to the appropriate output queue or queues and thereby determine if there are enough output buffers available in the destination queues for receipt of the cell or cells.
The XOFF Crossbar 44 is an N.times.N serial crosspoint switch fabric which is used to communicate "Don't Send" type messages from the FSPP 16 to the TSPP 14. Each TSPP includes a scheduling list 47 of cells to be transmitted. The first bit of the feedback message, namely XOFF, is asserted to halt transmission of request message probes from a particular TSPP, and is thus a state control bit which puts the receiving TSPP scheduling list in an XOFF state, meaning that TSPP Scheduling List 47 will not use bandwidth. XOFF is asserted if the FSPP destination queue is full. The TSPP Scheduling List then remains in the XOFF state until receiving an XON message. The second bit, namely REJECT, is asserted when the entire pool of output buffers at one or more FSPPS has been exhausted. The FSPPs maintain multiple buffer pools for different connection groups. The TSPP responds to an asserted REJECT feedback message by not dequeing the cell through the data crossbar 10. A null cell denoted by a complemented CRC, is transmitted instead. The TSPP responds to an asserted XOFF feedback message by modifying the TSPP XOFF state bits. The XOFF state bits prevent the TSPP from attempting to send a request message from any queue on that Scheduling List until notified by the FSPPs that cell buffers are available.
The XON Crossbar 46 is an N.times.N serial contention-based switch which is used to communicate "Enable Send" type messages. More particularly, the XON Crossbar is employed to communicate the XON message from the FSPP to the TSPP. When the number of cells in the FSPP destination queue increases above a predetermined threshold the FSPP asserts an XOFF and sets a state bit in a queue descriptor indicating that XOFF is asserted. When the number of cells in the FSPP queue drops below an XON threshold, the XON message is sent from the FSPP to the TSPP. The XON message enables the TSPP Scheduling List to resume sending request messages.
The Probe & XOFF communication paths operate in a pipeline fashion. First, the TSPP 14 selects a scheduling list, and information associated with that scheduling list is used to determine output ports 30 for transmission, i.e., a destination output queue. The bandwidth arbitrator 12 reduces this information to a TSPP-to-FSPP connectivity map which is employed to control the Probe, XOFF, and data cross-points in sequence. More particularly, the FSPP Queue number or multiQueue number is transmitted to the FSPP using the Probe crossbar 42. The FSPP then tests for buffer availability, and asserts REJECT and/or XOFF on the XOFF crossbar 44 if sufficient buffers are not available. The TSPP then transmits a null cell if REJECT was asserted. If XOFF was asserted, the TSPP puts the Scheduling List into the XOFF state. If sufficient buffers are available, the TSPP transmits the cell to the FSPP output queue through the data crossbar 47.
Referring now to FIGS. 1 & 2, each TSPP within the switch includes an SAT 20 which manages bandwidth allocation and delay. The SAT is the basic mechanism behind cell scheduling. Each SAT 20 includes a plurality of sequentially ordered cell time slots 50 and a pointer 52 which is directed to one of the slots. All of the pointers in the switch are synchronized such that at any given point in time each of the pointers is directed to the same slot location in the respective SAT with which the pointer is associated, e.g., the first slot. In operation, the pointers are advanced in lock-step, each slot being active for 32 clock cycles at 50 MHz. When the pointer is directed toward a slot, the TSPP uses the corresponding entry 51 in the SAT to obtain a cell for launching into the switch fabric 10. For example, SAT 1 will transmit a cell from connection "a" to output ports "2" and "3" with the pointer in the position illustrated in FIG. 2.
Each of the counters is incremented once for each cell time, and the pointer returns to the first slot after reaching the last slot. Given an SAT depth of 8 k, which defines a frame, the pointers scan the SATs every 6msec, thereby providing a maximum delay for transmission opportunity of 6msec. The delay can be decreased by duplicating a given entry at a plurality of slots within the SAT. The maximum delay that an incoming cell will experience corresponds to the number of slots 54 between the pointer and the slot containing the entry which specifies the destination of the cell. When multiple entries are made in order to decrease the maximum possible number of separating slots, the duplicate entries are preferably spaced equidistantly within the SAT, as illustrated. Hence, maximum delay for transmission opportunity corresponds to the frequency and spacing of duplicate entries within the SAT.
The amount of bandwidth allocated to a particular connection corresponds to the frequency at which a given entry appears in the SAT. Each slot 50 provides 64Kbps of bandwidth. Since the pointers cycle through the SATs at a constant rate, the total bandwidth allocated to a particular connection is equal to the product of 64 Kbps and the number of occurrences of that entry. For example, entry (a,2,3), which occurs in three slots, is allocated 192 Kbps of bandwidth.
Referring now to FIGS. 1, 3A & 3B, in point-to-multipoint operation a situation will sometimes arise wherein it is not possible to transmit the cell to each output port designated by the entry, typically because of output port conflicts due to other traffic within the switch. To execute point-to-multipoint operation in such a situation, the switch transmits the cells to the designated output ports at different points in time. More particularly, the switch transmits the cell to the designated output ports as those ports become available. For example, connection "a" is designated for ports 2, 3 & 4, but the transmission to port 2 is in conflicts with connection "b" from SAT 2 at a first cell time and the transmission to port 3 is in conflicts with connection "c" from SAT 3 even though the transmission to port 4 is not in conflict. To resolve this situation the transmission to port 4 is executed and the transmission to ports 2 and 3 is delayed. Repeat transmission to an already serviced port is prevented by tracking the serviced ports. Tracking also provides an indication of when all designated output ports have been serviced.
The lookup table is employed to determine the appropriate output ports associated with the entry, e.g., "a (2, 3)." The lookup table includes an area corresponding to each input port (here quadrants), and each quadrant includes words stored therein. The input port number is used to select the appropriate quadrant in the lookup table. The scheduling list number is then used to select a subgroup of eight 16-bit words (for a 16 port switch). Finally, the subqueue number is used to select one word from the subgroup; the word which indicates the output ports for transmission.
In order to track point-to-multipoint transmission executed at different points in time, the switch includes a map 56 and scoreboard 58, and the SAT 20 includes a three bit subqueue 60 field associated with each slot. The map and scoreboard are each 8 bits long and form bitmasks. The map is initialized according to the subqueues which act as offsets into the map. For example, subqueue "110" indicates an offset of 6 and subqueue "100" indicates an offset of 4. Hence, bits 4 and 6 in the map are initialized to logic "1" and the other bits are initialized to logic "0." The scoreboard is initialized to all logic "0" bits.
Tracking is realized by updating the scoreboard when copies of cells are transmitted. When the pointer reaches the slot corresponding to the connection for the enqueued point-to-multipoint cell, e.g., "a (4)," the offset indicated by the subqueue (110 indicating 6) is employed to set bit 6 of the scoreboard. The scoreboard is then compared to the map and if a complete match is determined then each cell has been transmitted and the scoreboard is cleared. If the map and scoreboard do not match completely then the point-to-multipoint transmission has not been made to each designated output queue. The updated scoreboard and map thus track which designated output ports have received copies of the cell.
FIG. 4 illustrates a method for point-to-multipoint operation. In an initial step 70 the need for a point-to-multipoint connection with allocated bandwidth is identified. In a following step 72 output port conflicts are identified. If there are no conflicts, the copies of the cell can be transmitted to each designated output port simultaneously. If there are conflicts, the point-to-multipoint transmission is broken into pieces to avoid the output port conflicts. To do so, the map and scoreboard are initialized 74. Flow then continues to a transmission portion 76 to transmit each copy and determine when each designated output port has been serviced.
The transmission portion is looped until each output port has been serviced. In step 78 the scheduling list number and subqueue number are retrieved from the SAT. A determination 80 is then made as to whether a cell is available to transmit. If no cell is available, other processing takes place. If a cell is available, the output ports are determined by indexing into the bit vector lookup table with the entry in the subqueue in step 82. Copies of the cell are then transmitted to the available output ports in step 84. The subqueue bit is then set in step 86 and a determination 88 is made as to whether the subqueue scoreboard is equal to the subqueue map, i.e., whether all of the designated output ports have been serviced. If the subqueue scoreboard is equal to the subqueue map, then all output ports have been serviced and the scoreboard is cleared 90 and the cell is dequeued 92. If the subqueue scoreboard is not equal to the subqueue map, i.e., some designated output ports remain unserviced, flow returns to step 78.
Having described the preferred embodiments of the invention, it will now become apparent to one of skill in the art that other embodiments incorporating their concepts may be used. It is felt therefore that the invention should not be limited to disclosed embodiments, but rather should be limited only by the spirit and scope of the appended claims.
Claims
  • 1. A switch for receiving a data unit and for transmitting the data unit to a plurality of designated destinations, comprising:
  • a plurality of input ports operative to receive the data unit in one of said plurality of input ports;
  • a first shared data unit buffer memory collectively associated with said plurality of input ports for buffering the data unit received in said one of said plurality of input ports;
  • a second shared data unit buffer memory for buffering copies of the data unit transmitted from said first shared data unit buffer memory to said second shared data unit buffer memory;
  • a plurality of output ports collectively associated with said second shared data unit buffer memory, said output ports operative to transmit the copies of the data unit transmitted to the second shared data unit buffer memory to at least one of the plurality of designated destinations; and
  • a tracking device operative to track receipt of the copies of the data unit by said second shared data unit buffer memory at different points in time,
  • whereby the data unit received in said input port may be transmitted to said second shared data unit buffer memory at different points in time without executing redundant transmission to any given selected output port.
  • 2. The switch of claim 1 further including a scoreboard bitmask having a plurality of bits, each bit corresponding to one of a plurality of subqueues, wherein each subqueue is associated with one or more output ports.
  • 3. The switch of claim 2 further including a map bitmask having a plurality of bits, each bit corresponding to one of said plurality of subqueues, wherein each subqueue is associated with one or more output ports and said bits are set corresponding to eligible output ports.
  • 4. The switch of claim 3 further including a switch allocation table associated with each input port of said plurality of input ports, said switch allocation table having a plurality of entries and a pointer directed toward one of said plurality of entries, each switch allocation table entry being associated with a connection identifier and at least one output port identifier, said pointer being incremented through said entries at a predetermined rate.
  • 5. The switch of claim 4 wherein said switch allocation table includes a subqueue field having an entry associated with each input port of said plurality of input ports, said subqueue entries including an index to a table of unserviced output ports.
  • 6. The switch of claim 5 further including a bit vector lookup table including output port identifiers, said bit vector lookup table providing identifiers of unserviced output ports for a given connection when indexed by said subqueue field entry.
  • 7. A method for point-to-multipoint transmission of a data unit from a telecommunications switch having a plurality of input ports and a plurality of output ports comprising the steps of:
  • receiving the data unit in the switch;
  • designating a plurality of the output ports for receipt of copies of the data unit;
  • determining which output ports of the plurality of output ports are available for receipt of a copy of the data unit;
  • transmitting a copy of the data unit to each output port identified as being available for receipt of a copy of the data unit; and
  • delaying transmission of a copy of the data unit to each output port identified as not being available for receipt of a copy of the data unit until a later point in time,
  • whereby the data unit may be transmitted to the designated output ports at different points in time without executing redundant transmission to any given designated output port.
  • 8. The method of claim 7 including the further step of initializing a scoreboard of unserviced output ports designated in said designating step.
  • 9. The method of claim 8 including the further step of retrieving a subqueue index entry from a switch allocation table.
  • 10. The method of claim 9 including the further step of indexing a bit vector lookup table with the retrieved subqueue index entry to obtain at least one output port identifier.
  • 11. The method of claim 10 including the further step of setting the subqueue index entry based upon the copies of the data unit transmitted in said transmitting step.
  • 12. The method of claim 11 including the further step of comparing the subqueue to the scoreboard to determine whether each designated output port has been serviced.
  • 13. The method of claim 12 including the further step of updating the scoreboard to indicate which output ports have been serviced.
  • 14. The method of claim 13 including the further step of clearing the scoreboard if each designated output port has been serviced.
  • 15. The method of claim 14 including the further step of dequeing the data unit when each designated output port has been serviced.
  • 16. An asynchronous transfer mode ("ATM") switch for transmitting copies of a cell received at an input port of said switch to a plurality of output ports of said switch through a switch fabric, comprising:
  • a clock generator operative to generate cell time intervals;
  • at least one cell transmission controller for controlling transmission of copies of the cell at different points in time over a plurality of cell time intervals when output port conflicts prevent transmission of copies of the cell to said plurality of output ports during a single time interval;
  • a tracking device for tracking which output ports of said plurality of output ports have received a copy of the cell, thereby avoiding transmission of redundant copies of the cell to already-serviced output ports; and
  • an output port map indicating which output ports are initially eligible to receive a copy of the cell.
  • 17. The ATM switch of claim 16 further including a scoreboard bitmask indicating which output ports have received a copy of the cell.
  • 18. The ATM switch of claim 17 wherein said scoreboard is updated for each cell time interval in which a copy of the cell is transmitted.
  • 19. The ATM switch of claim 18 further including a plurality of switch allocation tables ("SATs"), each SAT including a plurality of sequentially ordered cell time slots, a subqueue associated with each cell time slot, and a synchronized pointer directed toward one of said cell time slots such that at any given point in time each said synchronized pointer is directed to a corresponding slot in the respective SAT with which said pointer is associated.
  • 20. The ATM switch of claim 19 further including a lookup table having a respective area associated with each said input port, said input ports being identified by input port numbers.
  • 21. The ATM switch of claim 20 further including a plurality of scheduling lists of cells to be transmitted through said switch.
  • 22. The ATM switch of claim 21 wherein said cell transmission controller:
  • a) utilizes said input port number to select an area of said lookup table associated with the input port transmitting the cell,
  • b) employs the scheduling list number to select a subgroup of words from said area selected with the input port number, and
  • c) employs the subqueue number to select a single word from said subgroup, wherein said word indicates output ports for transmission of copies of the cell.
  • 23. The ATM switch of claim 22 wherein said subqueue field contains a three bit number.
  • 24. The ATM switch of claim 23 wherein said output port map and said scoreboard are each eight bits in length, respectively.
  • 25. The ATM switch of claim 24 wherein said subqueues provide an offset into said output port map for initialization thereof.
RELATED APPLICATION

A claim of priority is made to provisional application 60/001,498 entitled COMMUNICATION METHOD AND APPARATUS, filed Jul. 19, 1995.

US Referenced Citations (243)
Number Name Date Kind
3804991 Hammond et al. Apr 1974
3974343 Cheney et al. Aug 1976
4069399 Barrett et al. Jan 1978
4603382 Cole et al. Jul 1986
4715030 Koch et al. Dec 1987
4727537 Nichols Feb 1988
4737953 Koch et al. Apr 1988
4797881 Ben-Artzi Jan 1989
4821034 Anderson et al. Apr 1989
4837761 Isono et al. Jun 1989
4849968 Turner Jul 1989
4870641 Pattavina Sep 1989
4872159 Hemmady et al. Oct 1989
4872160 Hemmady et al. Oct 1989
4878216 Yunoki Oct 1989
4893302 Hemmady et al. Jan 1990
4893307 McKay et al. Jan 1990
4894824 Hemmady et al. Jan 1990
4897841 Gang, Jr. Jan 1990
4899333 Roediger Feb 1990
4920531 Isono et al. Apr 1990
4922503 Leone May 1990
4933938 Sheehy Jun 1990
4947390 Sheehy Aug 1990
4953157 Franklin et al. Aug 1990
4956839 Torii et al. Sep 1990
4958341 Hemmady et al. Sep 1990
4979100 Makris et al. Dec 1990
4993018 Hajikano et al. Feb 1991
5021949 Morten et al. Jun 1991
5029164 Goldstein et al. Jul 1991
5060228 Tsutsui et al. Oct 1991
5067123 Hyodo et al. Nov 1991
5070498 Kakuma et al. Dec 1991
5083269 Syobatake et al. Jan 1992
5084867 Tachibana et al. Jan 1992
5084871 Carn et al. Jan 1992
5090011 Fukuta et al. Feb 1992
5090024 Vander Mey et al. Feb 1992
5093912 Dong et al. Mar 1992
5115429 Hluchyj et al. May 1992
5119369 Tanabe et al. Jun 1992
5119372 Verbeek Jun 1992
5128932 Li Jul 1992
5130975 Akata Jul 1992
5130982 Ash et al. Jul 1992
5132966 Hayano et al. Jul 1992
5146474 Nagler et al. Sep 1992
5146560 Goldberg et al. Sep 1992
5150358 Punj et al. Sep 1992
5151897 Suzuki Sep 1992
5157657 Potter et al. Oct 1992
5163045 Caram et al. Nov 1992
5163046 Hahne et al. Nov 1992
5179556 Turner Jan 1993
5179558 Thacker et al. Jan 1993
5185743 Murayama et al. Feb 1993
5191582 Upp Mar 1993
5191652 Dias et al. Mar 1993
5193151 Jain Mar 1993
5197067 Fujimoto et al. Mar 1993
5198808 Kudo Mar 1993
5199027 Barri Mar 1993
5239539 Uchida et al. Aug 1993
5253247 Hirose et al. Oct 1993
5253248 Dravida et al. Oct 1993
5255264 Cotton et al. Oct 1993
5255266 Watanabe et al. Oct 1993
5257311 Naito et al. Oct 1993
5258979 Oomuro et al. Nov 1993
5265088 Takigawa et al. Nov 1993
5267232 Katsube et al. Nov 1993
5268897 Komine et al. Dec 1993
5271010 Miyake et al. Dec 1993
5272697 Fraser et al. Dec 1993
5274641 Shobatake et al. Dec 1993
5274768 Traw et al. Dec 1993
5280469 Taniguchi et al. Jan 1994
5280470 Buhrke et al. Jan 1994
5282201 Frank et al. Jan 1994
5283788 Morita et al. Feb 1994
5285446 Yonehara Feb 1994
5287349 Hyodo et al. Feb 1994
5287535 Sakagawa et al. Feb 1994
5289462 Ahmadi et al. Feb 1994
5289463 Mobasser Feb 1994
5289470 Chang et al. Feb 1994
5291481 Doshi et al. Mar 1994
5291482 McHarg et al. Mar 1994
5295134 Yoshimura et al. Mar 1994
5301055 Bagchi et al. Apr 1994
5301184 Uriu et al. Apr 1994
5301190 Tsukuda et al. Apr 1994
5301193 Toyofuku et al. Apr 1994
5303232 Faulk, Jr. Apr 1994
5305311 Lyles Apr 1994
5309431 Tominaga et al. May 1994
5309438 Nakajima May 1994
5311586 Bogart et al. May 1994
5313454 Bustini et al. May 1994
5313458 Suzuki May 1994
5315586 Charvillat May 1994
5319638 Lin Jun 1994
5321695 Proctor et al. Jun 1994
5323389 Bitz et al. Jun 1994
5333131 Tanabe et al. Jul 1994
5333134 Ishibashi et al. Jul 1994
5335222 Kamoi et al. Aug 1994
5335325 Frank et al. Aug 1994
5339310 Taniguchi Aug 1994
5339317 Tanaka et al. Aug 1994
5339318 Tanaka et al. Aug 1994
5341366 Soumiya et al. Aug 1994
5341373 Ishibashi et al. Aug 1994
5341376 Yamashita Aug 1994
5345229 Olnowich et al. Sep 1994
5350906 Brody et al. Sep 1994
5355372 Sengupta et al. Oct 1994
5357506 Sugawara Oct 1994
5357507 Hughes et al. Oct 1994
5357508 Le Boudec et al. Oct 1994
5357510 Norizuki et al. Oct 1994
5359600 Ueda et al. Oct 1994
5361251 Aihara et al. Nov 1994
5361372 Rege et al. Nov 1994
5363433 Isono Nov 1994
5371893 Price et al. Dec 1994
5373504 Tanaka et al. Dec 1994
5375117 Morita et al. Dec 1994
5377262 Bales et al. Dec 1994
5377327 Jain et al. Dec 1994
5379297 Glover et al. Jan 1995
5379418 Shimazaki et al. Jan 1995
5390170 Sawant et al. Feb 1995
5390174 Jugel Feb 1995
5390175 Hiller et al. Feb 1995
5392280 Zheng Feb 1995
5392402 Robrock, II Feb 1995
5394396 Yoshimura et al. Feb 1995
5394397 Yanagi et al. Feb 1995
5398235 Tsuzuki et al. Mar 1995
5400337 Munter Mar 1995
5402415 Turner Mar 1995
5412648 Fan May 1995
5414703 Sakaue et al. May 1995
5420858 Marshall et al. May 1995
5420988 Elliott May 1995
5422879 Parsons et al. Jun 1995
5425021 Derby et al. Jun 1995
5425026 Mori Jun 1995
5432713 Takeo et al. Jul 1995
5432784 Ozveren Jul 1995
5432785 Ahmed et al. Jul 1995
5432908 Heddes et al. Jul 1995
5436886 McGill Jul 1995
5436893 Barnett Jul 1995
5440547 Easki et al. Aug 1995
5444702 Burnett et al. Aug 1995
5446733 Tsuruoka Aug 1995
5446737 Cidon et al. Aug 1995
5446738 Kim et al. Aug 1995
5448559 Hayter et al. Sep 1995
5450406 Esaki et al. Sep 1995
5452296 Shimizu Sep 1995
5455820 Yamada Oct 1995
5455825 Lauer et al. Oct 1995
5457687 Newman Oct 1995
5459743 Fukuda et al. Oct 1995
5461611 Drake Jr. et al. Oct 1995
5463620 Sriram Oct 1995
5465331 Yang et al. Nov 1995
5475679 Munter Dec 1995
5479401 Bitz et al. Dec 1995
5479402 Hata et al. Dec 1995
5483526 Ben-Nun et al. Jan 1996
5485453 Wahlman et al. Jan 1996
5485455 Dobbins et al. Jan 1996
5487063 Kakuma et al. Jan 1996
5488606 Kakuma et al. Jan 1996
5491691 Shtayer et al. Feb 1996
5491694 Oliver et al. Feb 1996
5493566 Ljungberg et al. Feb 1996
5497369 Wainwright Mar 1996
5499238 Shon Mar 1996
5504741 Yamanaka et al. Apr 1996
5504742 Kakuma et al. Apr 1996
5506834 Sekihata et al. Apr 1996
5506839 Hatta Apr 1996
5506956 Cohen Apr 1996
5509001 Tachibana et al. Apr 1996
5509007 Takashima et al. Apr 1996
5513134 Cooperman et al. Apr 1996
5513178 Tanaka Apr 1996
5513180 Miyake et al. Apr 1996
5515359 Zheng May 1996
5517495 Lund et al. May 1996
5519690 Suzuka et al. May 1996
5521905 Oda et al. May 1996
5521915 Dieudonne et al. May 1996
5521916 Choudhury et al. May 1996
5521917 Watanabe et al. May 1996
5521923 Willmann et al. May 1996
5523999 Takano et al. Jun 1996
5524113 Gaddis Jun 1996
5526344 Diaz et al. Jun 1996
5528588 Bennett et al. Jun 1996
5528590 Iidaka et al. Jun 1996
5528591 Lauer Jun 1996
5530695 Dighe et al. Jun 1996
5533009 Chen Jul 1996
5533020 Byrn et al. Jul 1996
5535196 Aihara et al. Jul 1996
5535197 Cotton Jul 1996
5537394 Abe et al. Jul 1996
5541912 Choudhury et al. Jul 1996
5544168 Jeffrey et al. Aug 1996
5544169 Norizuki et al. Aug 1996
5544170 Kasahara Aug 1996
5546389 Wippenbeck et al. Aug 1996
5546391 Hochschild et al. Aug 1996
5546392 Boal et al. Aug 1996
5550821 Akiyoshi Aug 1996
5550823 Irie et al. Aug 1996
5553057 Nakayama Sep 1996
5553068 Aso et al. Sep 1996
5555243 Kakuma et al. Sep 1996
5555265 Kakuma et al. Sep 1996
5557607 Holden Sep 1996
5568479 Watanabe et al. Oct 1996
5570361 Norizuki et al. Oct 1996
5570362 Nishimura Oct 1996
5572522 Calamvokis et al. Nov 1996
5577032 Sone et al. Nov 1996
5577035 Hayter et al. Nov 1996
5583857 Soumiya et al. Dec 1996
5583858 Hanaoka Dec 1996
5583861 Holden Dec 1996
5590132 Ishibashi et al. Dec 1996
5602829 Nie et al. Feb 1997
5610913 Tomonaga et al. Mar 1997
5623405 Isono Apr 1997
5625846 Kobayakawa et al. Apr 1997
5633861 Hanson et al. May 1997
Foreign Referenced Citations (1)
Number Date Country
484943 Mar 1992 JPX
Non-Patent Literature Citations (17)
Entry
Head of Line Arbitration in ATM Swithches with Input-Output Buffering and Backpressure Control. by Hosien 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, April 1994-April 1995?
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-0325R1, 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.
Richard Bubenick et al., Leaf Initiated Join Extensions, Technical Committee, Signalling Subworking Group, ATM Forum/94-0325, Apr. 28, 1994.
Rob Coltun et al., PRP: A P-NNI Routing Protocol Proposal, ATM Forum Technical Committee, ATM.sub.-- Forum/94-0492, Apr. 28, 1994.
Richard Bubenik et al., Leaf Initiated Join Extensions, ATM Forum Technical Committee, Signalling Subworking Group, ATM Forum 94-0325, 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.
H.T. Kung and K. Chang, Receiver-Oriented Adaptive Buffer Allocation in 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.