Method and apparatus for discarding frames in a communications device

Information

  • Patent Grant
  • 5822540
  • Patent Number
    5,822,540
  • Date Filed
    Thursday, July 18, 1996
    28 years ago
  • Date Issued
    Tuesday, October 13, 1998
    26 years ago
Abstract
The invention comprises a method and apparatus for discarding frames in a communications device. In accordance with the method of the invention, a plurality of cells are received representing a plurality of frames wherein each cell comprises a data portion and a header portion including a cell loss priority indicator. At least some of the cells are stored in a buffer. It is determined if the number of cells in the buffer exceeds a first threshold when a first cell including an end of file marker is received. A series of cells received between the first cell and a second cell are discarded if the first threshold was exceeded in the determining step and if the cell loss priority indicator for a cell in the series of cells is set to a first state. The second cell comprises a cell including an end of file marker.
Description

RELATED APPLICATIONS
This application claims the benefit of U.S. provisional application Ser. No. 60/001,498, filed Jul. 19, 1995.
TECHNICAL FIELD OF THE INVENTION
This invention relates generally to telecommunications and more specifically to a method and apparatus for discarding frames in a communications device.
BACKGROUND OF THE INVENTION
Communication networks employing asynchronous transfer mode (ATM) cells for communication often are interfaced to devices employing various communications protocols. Because a number of existing communications networks employ communications protocols other than ATM, ATM communications networks are often interfaced to existing communications networks. Examples of communications networks include the telephone network, ISDN networks, frame relay networks, ethernet networks, and/or token ring networks. Some existing communication networks that are interfaced to ATM communication networks use frames of information to communicate. When frames are transported through an ATM communications network, the frames are typically broken up into a series of ATM cells wherein the end of a frame is indicated by information in the header of the ATM cell.
To relieve congestion in an ATM communications network, it is sometimes desirable to discard ATM cells at a switching node in the network due to congestion in either that switching node or in the communications network in general. Discarding cells that are pieces of frames traveling through the ATM communications network, however, can cause bandwidth to be used inefficiently. If a single ATM cell that is a piece of a frame comprised of a larger number of ATM cells is discarded, then the entire frame of ATM cells will need to be resent through the communications network. If other ATM cells in this frame are allowed to pass through the network after a cell of the frame has been discarded, then the bandwidth used to transmit the non-discarded cells through the ATM communications network will essentially be wasted. Discarding frames in a congested switching node or network may also be problematic as certain frames may be more important than other frames.
SUMMARY OF THE INVENTION
The invention comprises a method and apparatus for discarding frames in a communications network using a series of cells for communication. The invention allows frames to be assigned different priorities such that frames having different priorities may be discarded at different levels of congestion. One aspect of the invention is a method for discarding frames in a communications device. A plurality of cells are received representing a plurality of frames wherein each cell comprises a data portion and a header portion including a cell loss priority indicator. At least some of the cells are stored in a buffer. When a first cell including an end of frame marker is received, it is determined if the number of cells in the buffer exceeds a first threshold. If the first threshold was exceeded, then a series of cells received between the first cell and a second cell is discarded if the cell loss priority indicator for a cell in that series of cells is set to a first state. The second cell comprises a cell including an end of frame marker.
The invention has several important technical advantages. The invention allows more efficient use of bandwidth in an ATM communications network as an entire frame comprising a series of cells is discarded when congestion occurs, rather than only discarding a portion of the frame. In addition, even if the network becomes congested during the transmission of a frame, the cells in that frame will remain undiscarded unless an overrun condition is detected or the buffer pool limit is exceeded. The invention allows cells of a frame to be marked with multiple priority levels using header information of the ATM cells. This feature of the invention allows frames to be discarded at varying levels of congestion depending upon their priority. A lower priority frame will be discarded at a lower level of congestion. The invention may therefore increase the throughput of high priority frames.
With prioritized frame discard, frames may be marked as high priority when they use bandwidth below the committed information rate of the frame based communications network and as low priority when they use bandwidth above the committed information rate of the frame based communications network. An ATM communications network employing the present invention may then first discard frames that were sent above the committed information rate, providing a fairer distribution of bandwidth among users of the frame based communications network. Also, prioritized frame discarding may be used as an input filter in a communications network where the end stations are not flow controlled.





BRIEF DESCRIPTION OF THE DRAWINGS
For a more complete understanding of the present invention and the advantages thereof, reference is now made to the following descriptions taken in conjunction with the accompanying drawings in which:
FIG. 1 illustrates a block diagram of a communications device constructed in accordance with the teachings of the invention; and
FIG. 2 illustrates a flow chart describing the steps of discarding frames in accordance with the invention.





DETAILED DESCRIPTION OF THE INVENTION
The preferred embodiment of the present invention and its advantages are best understood by referring to FIGS. 1 through 2 of the drawings, like numerals being used for like and corresponding parts of the various drawings.
FIG. 1 illustrates a communications device 10 constructed in accordance with the teachings of the invention. In this embodiment, communications device 10 comprises a switching node in an ATM communications network. Communications device 10 could be any type of communications device in a communications network employing a series of cells to pass frames of information through the communications network.
Communications device 10 comprises a series of input processors 12 coupled to a switch fabric 14. Each input processor 12 is connected to one or more sources of input data. Input processor 12 processes the input data, discards cells as necessary, and passes non-discarded cells to switch fabric 14. Input processor 12 may also convert varying types of data into a series of ATM cells.
Input processor 12 further comprises processor 16, queue pointers 18, and buffer memory 20. Input processor 12 comprises an application specific integrated circuit (ASIC) but could also be any type of electronic circuitry operable to perform the functions described below.
Processor 16 controls the discarding of cells in communications device 10. Cells received by input processor 12 that are not discarded by processor 16 are stored in queues in buffer memory 20. In this example, each virtual connection is associated with its own queue in buffer memory 20. Pointers stored in queue pointer memory 18 are used to keep track of the front and back of each queue in buffer memory 20. Each queue associated with a virtual connection may also be referred to as a buffer. Input processor 16 determines a maximum size for a queue associated with a specific virtual connection and stored in buffer memory 20. In addition, processor 16 may assign a buffer associated with a virtual connection to a pool of buffers associated with other virtual connections. Thus, processor 16 may also place a limit on the maximum number of cells that may be contained in a buffer pool besides limiting the number of cells that may be contained in an individual buffer.
Processor 16 also maintains counters reflecting the number of cells in a particular buffer associated with a virtual connection. If multiple buffers are associated with a virtual connection, then processor 16 may maintain a counter for each of the multiple buffers. Processor 16 uses the buffer counters to monitor congestion and discard frames if congestion exceeds certain thresholds.
In this embodiment, processor 16 maintains two levels of priority for frames and two congestion thresholds corresponding to those levels of priority. Processor 16 could maintain a greater or a lesser number of priority levels without departing from the scope of the invention. In this example, lower priority frames are discarded after a lower threshold of congestion is encountered while higher priority frames are discarded after a higher level of congestion is encountered.
This embodiment uses the cell loss priority bit in the header of ATM cells making up a frame to determine the priority of a frame. When the cell loss priority bit has a value of zero, then the frame is considered to be a high priority frame. When the cell loss priority bit is set to one, then the frame is considered to be a low priority frame. This embodiment uses the cell loss priority bit of the first cell of the frame to make a determination of whether a frame should be discarded. Ordinarily, the cell loss priority bit of each cell in a frame will have the same value. Other header information could be used to indicate priority without departing from the scope of the invention.
To make efficient use of bandwidth, processor 16 checks for congestion at frame boundaries. If a cell has an end of frame indicator, then processor 16 checks to determine whether either the low congestion threshold or high congestion threshold has been exceeded. If the low congestion threshold has been exceeded, then a state variable is set to indicate that any subsequent frames having low priority (cell loss priority bit equals one) are to be discarded. If the high congestion threshold has been exceeded, then a state variable is set to indicate that any subsequent frame should be discarded. In either case, the end of frame cell is not discarded. If neither congestion threshold was exceeded at a frame boundary, then the state variables are set to a non-discard state so that the subsequent frame will not be discarded.
In this embodiment, only user data cells, which are not end of frame cells, are discarded. Due to their importance to system operation, other cells, such as OAM cells, are not discarded unless the pool space has been exceeded or an overrun condition is present as described below. Processor 16 determines whether or not a cell contains user data or other data using the payload type indicator for the cell. The payload type indicator appears in the header of the ATM cell.
If the check at the end of a frame reveals that the high congestion threshold has been exceeded, then all of the cells in the subsequent frame are discarded, with the exception of the end of frame cell, and processor 16 again determines the state of congestion at the end of the discarded frame. If it was determined at the end of a frame that the low congestion threshold has been exceeded and the cell loss priority bit of the first cell of the next frame is set to one, then all of the cells in that frame are discarded and processor 16 will again check the level of congestion at the end of the discarded frame.
Processor 16 may also discard portions of frames when congestion has become so critical that either a buffer overrun has occurred or the number of cells in a buffer pool has reached the pool limit associated with that buffer pool.
Processor 16 causes cells in discarded frames to be discarded before they are placed in buffer memory 20. This aspect of the invention allows easier manipulation of the queue pointers stored in queue pointer memory 18 as rearranging of the queues is unnecessary.
More detailed operation of the invention can best be understood by referring to FIG. 2. FIG. 2 illustrates a flow chart describing the method by which input processor 12 of FIG. 1 discards frames. The method illustrated in FIG. 2 employs two state variables to determine whether or not to discard frames. The first state variable, discard frame state, is set when the level of congestion has reached a point at which all frames should be discarded and cleared otherwise. The second state variable, discard CLP1 frame state, is set when the level of congestion is high enough to discard frames having a cell loss priority equal to one (low priority). This variable is cleared otherwise.
The method begins in step 22 with initialization. Initially, the state variables are cleared in step 22. In step 24, a cell is received. Then, in step 26 it is determined if the cell is user data or an end of frame cell, if the cell loss priority is equal to one, and if the discard CLP1 frame state is set. A cell is considered to be user data when its payload type indicator equals 0 or 2. A cell is considered to be an end of frame cell when its payload type indicator is equal to 1 or 3. The payload type indicator appears in the header of the ATM cell. If all of the conditions are met in step 26, then the current frame is to be discarded as it has a cell loss priority equal to 1, the level of congestion is sufficiently high to discard frames of that type, and the frame contains user data. Thus, the discard frame state variable is set in step 28. Following step 28 or if all the conditions were not met in step 26, the procedure continues in step 30. Note that step 26 depends upon the state of the discard CLP1 frame state variable which is only altered when processing an end of frame cell at the frame boundary.
In step 30, it is determined whether the cell has an end of frame marker. If not, then the process continues in step 44. If so, then a frame boundary has been reached and the congestion in the network should be examined. Accordingly, the process continues in step 32 where it is determined whether the buffer has reached the high congestion threshold. If so, then the discard frame state variable is set in step 42 and the procedure continues in step 44. If not, then the discard frame state variable is cleared in step 34 in case the variable was set for the previous frame. Then, in step 36, it is determined whether the buffer has reached the low congestion threshold. If not, then the discard CLP1 frame state variable is cleared in step 38 in case it had been set for the previous frame. If the low congestion threshold has been reached, then the discard CLP1 frame state variable is set in step 40.
Next, in step 44, it is determined whether the pool limit has been exceeded or a buffer overrun condition has occurred. In this embodiment, several virtual connections may share a buffer pool. If the limit of this buffer pool is exceeded, then the current cell should be discarded immediately in step 46 as there is no place to put the cell. Similarly, if a buffer overrun has occurred, the cell should also be discarded in step 46 even though such a discard may occur in the middle of a frame. After step 46, the process continues in step 48 where it is determined if the cell is user data or an end of frame cell. If not, then the procedure returns to step 24 to receive the next cell. If so, then the discard frame state is set in step 50. Setting the discard frame state in step 50 will cause the rest of the frame from which the cell was discarded in step 46 to also be discarded. Because one cell of the frame was already discarded, the rest should also be discarded to avoid wasting bandwidth. As above, the end of frame cell will still be sent if the buffer overrun condition or pool limit overrun condition is no longer present when the end of frame cell is received.
Returning to step 44 if neither condition was met, then the procedure continues in step 52. In step 52 it is determined whether the discard frame state variable is set and whether the current cell contains user data. If not, then the procedure returns to step 24 to process the next cell. If so, then the current cell is discarded in step 54 and the procedure then loops back to step 24.
The process in FIG. 2 thus checks for congestion at frame boundaries as each end of frame cell is received. If the level of congestion exceeds the predetermined threshold appropriate for the following frame, then the cells of the following frame with the exception of the end of frame cell are discarded. This process thus utilizes network bandwidth more efficiently and allows prioritized discarding of frames.
Although the present invention has been described in detail, it should be understood that various changes, substitutions, and alterations can be made hereto without departing from the spirit and scope of the invention as defined by the appended claims.
Claims
  • 1. A method for discarding frames in a communications device, comprising:
  • receiving a plurality of cells representing a plurality of frames, each cell comprising a data portion and a header portion, the header portion including a cell loss priority indicator;
  • storing at least some of the cells in a buffer;
  • determining if the number of cells in the buffer exceeds a first threshold when a first cell having an end of frame marker corresponding to a first frame is received; and
  • discarding a series of cells received between the first cell and a second cell if the first threshold was exceeded and if the cell loss priority indicator for a cell in the series of cells is set to a first state, wherein the second cell has an end of frame marker corresponding to a subsequent frame in relation to the first frame.
  • wherein each of the plurality of frames is assigned one of plural, different priorities and wherein the frames are discarded at different levels of congestion within the buffer, based upon the different priorities.
  • 2. The method of claim 1, wherein the discarded series of cells include each cell in the subsequent frame received after the first frame with the exception of the second cell.
  • 3. The method of claim 1, further comprises:
  • determining if the number of cells in the buffer exceeds a second threshold when the first cell is received;
  • discarding a series of cells received between the first cell and the second cell if the second threshold was exceeded.
  • 4. The method of claim 3, further comprises:
  • discarding a cell if the number of cells in the buffer exceeds an overrun threshold.
  • 5. The method of claim 4, wherein the buffer is a member of a buffer pool, the method further comprising:
  • discarding a cell if the number of cells in the buffer pool exceeds a buffer pool limit.
  • 6. The method of claim 5, further comprising a step of:
  • discarding all cells corresponding to a frame that is associated with the cell exceeding the buffer pool limit.
  • 7. The method of claim 1, further comprising:
  • discarding a cell if the number of cells in the buffer exceeds an overrun threshold.
  • 8. The method of claim 1, wherein the buffer is a member of a buffer pool, the method further comprising:
  • discarding a cell if the number of cells in the buffer pool exceeds a buffer pool limit.
  • 9. The method of claim 1, wherein the cells comprise asynchronous transfer mode cells.
  • 10. A communications device, comprising:
  • a switch fabric; and
  • an input processor coupled to the switch fabric and operable to
  • receive a plurality of cells representing a plurality of frames, each cell comprising a data portion and a header portion, the header portion including a cell loss priority indicator, the input processor having a buffer operable to store at least some of the cells, the input processor operable to generate a first discard signal if the number of cells in the buffer exceeds a first threshold when a first cell having an end of file marker corresponding to a first frame is received, and the input processor operable to discard a series of cells received between the first cell and a second cell in response to generation of the first discard signal and if the cell loss priority indicator for a cell in the series of cells between the first cell and the second cell is set to a first state, wherein the second cell has an end of frame marker corresponding to a subsequent frame in relation to the first frame.
  • 11. The communications device of claim 10, wherein the input processor comprises an application specific integrated circuit.
  • 12. The communications device of claim 10, wherein the cells comprise asynchronous transfer mode cells.
  • 13. The communications device of claim 10, wherein the discarded series of cells include each cell in the subsequent frame received after the first frame with the exception of the second cell.
  • 14. The communications device of claim 10, wherein the input processor is operable to generate a second discard signal if the number of cells in the buffer exceeds a second threshold when the first cell is received; the input processor operable to discard a series of cells received between the first cell and the second cell in response to generation of the second discard signal.
  • 15. The communications device of claim 14, wherein the input processor is operable to
  • discard a cell if the number of cells in the buffer exceeds an overrun threshold.
  • 16. The communications device of claim 15, wherein the buffer is a member of a buffer pool, the input processor is operable to
  • discard a cell if the number of cells in the buffer pool exceeds a buffer pool limit.
  • 17. The communications device of claim 16, wherein the input processor is operable to discard all cells corresponding to a frame associated with the cell exceeding the buffer pool limit.
  • 18. The communications device of claim 10, wherein the input processor is operable to discard a cell if the number of cells in the buffer exceeds an overrun threshold.
  • 19. The communications device of claim 10, wherein the buffer is a member of a buffer pool, the input processor is operable to discard a cell if the number of cells in the buffer pool exceeds a buffer pool limit.
US Referenced Citations (269)
Number Name Date Kind
3804991 Hammond et al. Apr 1974
3974343 Cheney et al. Aug 1976
4069399 Barrett et al. Jan 1978
4084228 Dufond et al. Apr 1978
4240143 Bessemer et al. Dec 1980
4603382 Cole et al. Jul 1986
4715030 Koch et al. Dec 1987
4727537 Nichols Feb 1988
4737953 Koch et al. Apr 1988
4748658 Gopal et al. May 1988
4769810 Eckberg, Jr. et al. Sep 1988
4769811 Eckberg, Jr. et al. Sep 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
4872157 Hemmady et al. Oct 1989
4872159 Hemmady et al. Oct 1989
4872160 Hemmady et al. Oct 1989
4872197 Pemmaraju Oct 1989
4878216 Yunoki Oct 1989
4893302 Hemmady et al. Jan 1990
4893307 McKay et al. Jan 1990
4894824 Hemmady et al. Jan 1990
4897833 Kent et al. Jan 1990
4897841 Gang, Jr. Jan 1990
4899333 Roediger Feb 1990
4920531 Isone et al. Apr 1990
4922503 Leone May 1990
4933938 Sheehy Jun 1990
4942574 Zalle Jul 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
5014192 Mansfield et al. May 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
5093827 Franklin et al. Mar 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 Mahne 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 a.l. Mar 1993
5198808 Kudo Mar 1993
5199072 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 Proctor et al. Apr 1994
5305311 Lyles Apr 1994
5309431 Tominaga et al. May 1994
5309438 Wakajima 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 Faulk, Jr. 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
5341483 Frank et al. 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
5363497 Baker et al. Nov 1994
5365514 Hershey et al. Nov 1994
5369570 Parad 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
5418942 Krawchuk 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
5426635 Mitra et al. 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
5448621 Knudson Sep 1995
5450406 Esaki et al. Sep 1995
5452296 Shimizu Sep 1995
5454299 Thessin et al. Oct 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
5463629 Ko Oct 1995
5463775 DeWitt et al. Oct 1995
5465331 Yang et al. Nov 1995
5465365 Winterbottom Nov 1995
5469003 Kean Nov 1995
5473608 Gagne et al. Dec 1995
5475679 Munter Dec 1995
5479401 Bitz et al. Dec 1995
5479402 Hara 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 Katuma 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
5511070 Lyles 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
5519689 Kim 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 Digne et al. Jun 1996
5533009 Chen Jul 1996
5533020 Byrne 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
5555265 Kakuma et al. Sep 1996
5555324 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 Iomonaga 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 Switches with Input-Output Buffering and Backpressure Control. By Hosein F. Badran and H. T. Mouftah, Globecom '91, pp. 0347-0351.
An Ascom Timeplex White Paper, Meeting Critical Requirements with Scalable Enterprise Networking Solutions Based on a Unified ATM Foundation, pp. 1-12, Apr. 1994 Apr. 1995?.
Douglas H. Hunt, ATM Traffic Management-Another Perspective, Business Communications Reiew, Jul. 1994.
Richard Bubenik et al., Leaf Initiated Join Extensions, Technical Committee, Signalling Subworking Group, ATM Forum/94-0325R1, Jul. 1, 1994. Dated Jul. 18-21, 1994.
Douglas H. Hunt et al., Flow Controlled Virtual Connections Proposal for ATM Traffic Management (Revision R2) Traffic Management Subworking Group, ATM Forum/94-0632R2, Aug. 1994. Dated Sep. 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 Forum/94-0168R1, Apr. 28, 1994, Dated: May 10-13, 1994.
Douglas H. Hunt et al., Action Item Status for Credit-Based FCVC Proposal, ATM Forum Technical Committee Traffic Management Subworking Group, ATM Forum/94-0439, Apr. 28, 1994. Dated: May 10-13, 1994.
Timothy P. Donahue et al., Arguments in Favor of Continuing Phase 1 as the Initial ATM Forum P-NIJI Routing Protocol Implementation, ATM Forum Technical Committee, ATM Forum/94-0460, Apr. 28, 1994. Dated: May 10-13, 1994.
Richard Bubenick et al., Leaf Initiated Join Extensions, Technical Committee, Signalling Subworking Group, ATM Forum/94-0325, Apr. 28, 1994. Dated: May 10-13, 1994 (large font).
Rob Coltun et al., PRP: A P-NNI Routing Protocol Proposal, ATM Forum Technical Committee, ATM Forum/94-0492, Apr. 28, 1994. Dated: May 10-13, 1994.
Richard Bubenik et al., Leaf Initiated Join Extensions, ATM Forum Technical Committee, Signalling Subworking, Group, ATM Forum 94-0325, Apr. 28, 1994. Dated: May 10-13, 1994 (small font).
Richard Bubenik et al., Requirements For Phase 2 Signaling Protocol, ATM Forum Technical Committee, Signalling Subworking Group, ATM Forum 94-1078, Jan. 1, 1994. Dated: Jan. 17-20, 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 Multiplexins, Proceedings of ACM SIGCOM M'94 Symposium on Communications Architectures, Protocols and Applications, Aug. 31-Sep. 2, 1994, pp. 1-14.
SITA, ATM RFP: C-Overall Technical Requirements, Sep. 1994.