CA2138695C - Congestion control method in atm network - Google Patents
Congestion control method in atm network Download PDFInfo
- Publication number
- CA2138695C CA2138695C CA 2138695 CA2138695A CA2138695C CA 2138695 C CA2138695 C CA 2138695C CA 2138695 CA2138695 CA 2138695 CA 2138695 A CA2138695 A CA 2138695A CA 2138695 C CA2138695 C CA 2138695C
- Authority
- CA
- Canada
- Prior art keywords
- threshold value
- node
- rate
- queue length
- information block
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L25/00—Baseband systems
- H04L25/02—Details ; arrangements for supplying electrical power along data transmission lines
- H04L25/05—Electric or magnetic storage of signals before transmitting or retransmitting for changing the transmission rate
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/54—Store-and-forward switching systems
- H04L12/56—Packet switching systems
- H04L12/5601—Transfer mode dependent, e.g. ATM
- H04L12/5602—Bandwidth control in ATM Networks, e.g. leaky bucket
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L49/00—Packet switching elements
- H04L49/30—Peripheral units, e.g. input or output ports
- H04L49/3081—ATM peripheral units, e.g. policing, insertion or extraction
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q11/00—Selecting arrangements for multiplex systems
- H04Q11/04—Selecting arrangements for multiplex systems for time-division multiplexing
- H04Q11/0428—Integrated services digital network, i.e. systems for transmission of different types of digitised signals, e.g. speech, data, telecentral, television signals
- H04Q11/0478—Provisions for broadband connections
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/54—Store-and-forward switching systems
- H04L12/56—Packet switching systems
- H04L12/5601—Transfer mode dependent, e.g. ATM
- H04L2012/5614—User Network Interface
- H04L2012/5616—Terminal equipment, e.g. codecs, synch.
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/54—Store-and-forward switching systems
- H04L12/56—Packet switching systems
- H04L12/5601—Transfer mode dependent, e.g. ATM
- H04L2012/5619—Network Node Interface, e.g. tandem connections, transit switching
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/54—Store-and-forward switching systems
- H04L12/56—Packet switching systems
- H04L12/5601—Transfer mode dependent, e.g. ATM
- H04L2012/5629—Admission control
- H04L2012/5631—Resource management and allocation
- H04L2012/5632—Bandwidth allocation
- H04L2012/5635—Backpressure, e.g. for ABR
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/54—Store-and-forward switching systems
- H04L12/56—Packet switching systems
- H04L12/5601—Transfer mode dependent, e.g. ATM
- H04L2012/5629—Admission control
- H04L2012/5631—Resource management and allocation
- H04L2012/5636—Monitoring or policing, e.g. compliance with allocated rate, corrective actions
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/54—Store-and-forward switching systems
- H04L12/56—Packet switching systems
- H04L12/5601—Transfer mode dependent, e.g. ATM
- H04L2012/5678—Traffic aspects, e.g. arbitration, load balancing, smoothing, buffer management
- H04L2012/568—Load balancing, smoothing or shaping
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/54—Store-and-forward switching systems
- H04L12/56—Packet switching systems
- H04L12/5601—Transfer mode dependent, e.g. ATM
- H04L2012/5678—Traffic aspects, e.g. arbitration, load balancing, smoothing, buffer management
- H04L2012/5681—Buffer or queue management
- H04L2012/5682—Threshold; Watermark
Abstract
In the congestion control method, when a queue length of a node in a virtual channel set up in an ATM network is a first threshold or more, a source terminal in the virtual channel is instructed to decrease a transmission rate. When the queue length of a node is a second threshold or more which is greater than the first threshold, there is halted the transmission of data cells from the preceding nodes or source terminals to the bottleneck node.
In a method of decreasing the transmission rate, congestion data is added to the header of a data cell passing through a node where the data cell queue is the first threshold or more, and the destination terminal which has received the data cell containing the congestion data transmits a rate decreasing control cell to the source terminal through the network. Receiving the rate decreasing control cell, the source terminal lowers the transmission rate. In another way, in a node where a cell queue length is the first threshold or more, a rate decreasing control cell is generated and transmitted to the source terminal.
In a method of decreasing the transmission rate, congestion data is added to the header of a data cell passing through a node where the data cell queue is the first threshold or more, and the destination terminal which has received the data cell containing the congestion data transmits a rate decreasing control cell to the source terminal through the network. Receiving the rate decreasing control cell, the source terminal lowers the transmission rate. In another way, in a node where a cell queue length is the first threshold or more, a rate decreasing control cell is generated and transmitted to the source terminal.
Description
CONGESTION CONTROL METHOD IN ATM NETWORK
1. Field of the Invention The present invention relates to an asynchronous transfer mode (ATM) network system, and more specifically to a congestion control method executed on the basis of the length of a queue in each node in the ATM network.
1. Field of the Invention The present invention relates to an asynchronous transfer mode (ATM) network system, and more specifically to a congestion control method executed on the basis of the length of a queue in each node in the ATM network.
2. Description of the Prior Art Several congestion control systems have been proposed, including FECN (Forward Explicit Congestion Notification) and BECK (Backward Explicit Congestion Notification). The congestion control of these systems is performed with monitoring the length of a node queue at all times . When the length of a queue exceeds a preset threshold in a node, a source lowers its transmission rate by decreasing the window size. Such a congestion control is disclosed by Aboul-Magd et al., in the paper "Incorporating Congestion Feedback in B-ISDN Traffic Management Strategy", International Switching Symposium, October 1992, Vol. 2.
In the FECN system, a bottleneck node writes congestion information onto the header of a data packet passing through the node, and a destination terminal which has received that data -2- ~ 2'f38695 packet sends a con~:.rol packet indicative of congestion back to a source terminal. Receiving the control packet from the destination terminal through the network, the source terminal lowers the transmission rate of data packets.
In the BECN system, a node which detects congestion therein transmits a control packet indicative of the congestion back to a preceding node which in turn transfers the control packet to a further preceding node a.nd then to the source terminal.
Receiving the control packet, the source terminal lowers the transmission rate of data packets. For this, a reference is disclosed by Newman in "Backward Explicit Congestion Notification for .ATM Local Area Network", in IEEE Global Telecommunications Conference (GLOBECOM) Houston, Texas, 1993, vol.2, pp 719-723.
Another congestion control mechanism is known as a backpressure method disclosed in "Flight of the FALCON" (IEEE
Communica Lions riagaa in=_: F eb . 199 3 ) by J . L . Boudec a t a1 . The backpressure method is tp S2nd back a backpressure control cell f rom a bottleneck node ~~o a preceding node to temporar i ly stop the cell transmi scion t~~ the bottleneck node, so that ATM- cel 1 s ' are pr evented f rocn being discarded due to buf f er overt 1 ow in the bottleneck node.
The conventional con~~estion control mechanisms, however, have the foil owinc3 disadvantages . In the FECN and BECN methods described above, after receiving a control packet indicative of congestion, the source terminal lowers its transmission rate.
Therefore, it suf:Eers from a difficulty that, when there is a A
__. .....~.__..._....~..~. ~._.__ _ ______ substantial transmission delay between the source and the destination, some data packets are discarded owing to buffer overflow until the control packet indicative of congestion reaches the source terminal.
Further, these systems, which reduce the number of transmission data packets by controlling a window size, require control in a higher rank layer capable of treating the window.
In the backpressure method, a node in a congestion state instructs a preceding node to halt transmission, so that congestion is produced also in the preceding node and hence there is a possibility that there might be produced such successive transmission halt states . For this, even data cells not transmitted to the node where the congestion state is first produced are stopped, resulting in a severely reduced throughput of the network. Particularly, in a ring network, there is a possibility that a deadlock might occur where no data cell can come into or go out the network.
To solve the problems with the prior art, it is an object of the present invention to provide a congestion method capable of preventing any ATM cell from being lost due to buffer overflow in a node and of achieving high availability of the ATM network.
It is another object of the present invention to provide a congestion control method capable of improving a network throughput and availability.
- 3a -Accordingly, the present invention provides a congestion control method in a network wherein information blocks are asynchronously transferred through a plurality of channels, each channel being set up between a source terminal and a destination terminal via a plurality of nodes, the terminals and the nodes each being a stage in a channel, the method comprising the steps of: at each one node of the plurality of nodes;(a) monitoring a queue length of information blocks to be transferred from the one node, where the queue length is a number of information blocks stored at the one node;(b) comparing the queue length with a first threshold value and a second threshold value, the first threshold value being smaller than the second threshold value;(c) comparing the queue length with a third threshold value which is smaller than the second threshold value but larger than the first threshold value;(d) stopping a preceding stage in the channel from transmitting information blocks to the one node when the queue length is larger than the second threshold value;(e) restarting the preceding stage transmitting information blocks to each one node when the queue length is reduced from more than the second threshold value to less than the third threshold value; and at the source terminal,(f) decreasing a rate of information block transmission on at least one of said channels from a first transmission rate to a second transmission rate, when at least one of the plurality of nodes on said at least one channel has a queue length larger than the first threshold value, and transmitting information blocks at the second transmission rate.
- 3b -The present invention further provides a network system wherein information blocks are asynchronously transferred through a plurality of channels, each channel being set up between a source terminal and a destination terminal via a plurality of nodes, the terminals and the nodes each being a stage in a channel, the network system comprising: (a) a plurality of nodes; (b) a source terminal; (c) a destination terminal; (d) each one node of the plurality of nodes comprises: monitoring means for monitoring a queue length of information blocks to be transferred from the one node, where the queue length is the number of information blocks stored at the one node; first comparing means for comparing the queue length with a first threshold value and a second threshold value, the first threshold value being smaller than the second threshold value; second comparing means for comparing the queue length with a third threshold value which is smaller than the second threshold value but larger than the first threshold value; addition means for adding congestion notification data to information blocks passing through the one node and directed to the destination terminal when the queue length is larger than the first threshold value;
stopping means for stopping a preceding stage from transmitting information blocks to the one node when the queue length is larger than the second threshold value; and restarting means for restarting the preceding stage transmitting information blocks to the one node when the queue length is reduced from more than the second threshold value to less than the third threshold value; (e) the destination - 3c -terminal comprises: transmission means for transmitting a rate decreasing information block to the source, terminal, the rate decreasing information block being formed based on the congestion notification data, and (f) the source terminal comprises: decreasing means for decreasing the rate of information block transmission on at least one of the said channels from a first transmission rate to a second transmission rate in response to the rate decreasing information block, whereby information blocks are transmitted at the second transmission rate.
In the FECN system, a bottleneck node writes congestion information onto the header of a data packet passing through the node, and a destination terminal which has received that data -2- ~ 2'f38695 packet sends a con~:.rol packet indicative of congestion back to a source terminal. Receiving the control packet from the destination terminal through the network, the source terminal lowers the transmission rate of data packets.
In the BECN system, a node which detects congestion therein transmits a control packet indicative of the congestion back to a preceding node which in turn transfers the control packet to a further preceding node a.nd then to the source terminal.
Receiving the control packet, the source terminal lowers the transmission rate of data packets. For this, a reference is disclosed by Newman in "Backward Explicit Congestion Notification for .ATM Local Area Network", in IEEE Global Telecommunications Conference (GLOBECOM) Houston, Texas, 1993, vol.2, pp 719-723.
Another congestion control mechanism is known as a backpressure method disclosed in "Flight of the FALCON" (IEEE
Communica Lions riagaa in=_: F eb . 199 3 ) by J . L . Boudec a t a1 . The backpressure method is tp S2nd back a backpressure control cell f rom a bottleneck node ~~o a preceding node to temporar i ly stop the cell transmi scion t~~ the bottleneck node, so that ATM- cel 1 s ' are pr evented f rocn being discarded due to buf f er overt 1 ow in the bottleneck node.
The conventional con~~estion control mechanisms, however, have the foil owinc3 disadvantages . In the FECN and BECN methods described above, after receiving a control packet indicative of congestion, the source terminal lowers its transmission rate.
Therefore, it suf:Eers from a difficulty that, when there is a A
__. .....~.__..._....~..~. ~._.__ _ ______ substantial transmission delay between the source and the destination, some data packets are discarded owing to buffer overflow until the control packet indicative of congestion reaches the source terminal.
Further, these systems, which reduce the number of transmission data packets by controlling a window size, require control in a higher rank layer capable of treating the window.
In the backpressure method, a node in a congestion state instructs a preceding node to halt transmission, so that congestion is produced also in the preceding node and hence there is a possibility that there might be produced such successive transmission halt states . For this, even data cells not transmitted to the node where the congestion state is first produced are stopped, resulting in a severely reduced throughput of the network. Particularly, in a ring network, there is a possibility that a deadlock might occur where no data cell can come into or go out the network.
To solve the problems with the prior art, it is an object of the present invention to provide a congestion method capable of preventing any ATM cell from being lost due to buffer overflow in a node and of achieving high availability of the ATM network.
It is another object of the present invention to provide a congestion control method capable of improving a network throughput and availability.
- 3a -Accordingly, the present invention provides a congestion control method in a network wherein information blocks are asynchronously transferred through a plurality of channels, each channel being set up between a source terminal and a destination terminal via a plurality of nodes, the terminals and the nodes each being a stage in a channel, the method comprising the steps of: at each one node of the plurality of nodes;(a) monitoring a queue length of information blocks to be transferred from the one node, where the queue length is a number of information blocks stored at the one node;(b) comparing the queue length with a first threshold value and a second threshold value, the first threshold value being smaller than the second threshold value;(c) comparing the queue length with a third threshold value which is smaller than the second threshold value but larger than the first threshold value;(d) stopping a preceding stage in the channel from transmitting information blocks to the one node when the queue length is larger than the second threshold value;(e) restarting the preceding stage transmitting information blocks to each one node when the queue length is reduced from more than the second threshold value to less than the third threshold value; and at the source terminal,(f) decreasing a rate of information block transmission on at least one of said channels from a first transmission rate to a second transmission rate, when at least one of the plurality of nodes on said at least one channel has a queue length larger than the first threshold value, and transmitting information blocks at the second transmission rate.
- 3b -The present invention further provides a network system wherein information blocks are asynchronously transferred through a plurality of channels, each channel being set up between a source terminal and a destination terminal via a plurality of nodes, the terminals and the nodes each being a stage in a channel, the network system comprising: (a) a plurality of nodes; (b) a source terminal; (c) a destination terminal; (d) each one node of the plurality of nodes comprises: monitoring means for monitoring a queue length of information blocks to be transferred from the one node, where the queue length is the number of information blocks stored at the one node; first comparing means for comparing the queue length with a first threshold value and a second threshold value, the first threshold value being smaller than the second threshold value; second comparing means for comparing the queue length with a third threshold value which is smaller than the second threshold value but larger than the first threshold value; addition means for adding congestion notification data to information blocks passing through the one node and directed to the destination terminal when the queue length is larger than the first threshold value;
stopping means for stopping a preceding stage from transmitting information blocks to the one node when the queue length is larger than the second threshold value; and restarting means for restarting the preceding stage transmitting information blocks to the one node when the queue length is reduced from more than the second threshold value to less than the third threshold value; (e) the destination - 3c -terminal comprises: transmission means for transmitting a rate decreasing information block to the source, terminal, the rate decreasing information block being formed based on the congestion notification data, and (f) the source terminal comprises: decreasing means for decreasing the rate of information block transmission on at least one of the said channels from a first transmission rate to a second transmission rate in response to the rate decreasing information block, whereby information blocks are transmitted at the second transmission rate.
In accordance with the congestion control method of the present invention, when a queue length of a node in a virtual channel set up in an ATM network is a first threshold or more, a source terminal in the virtual channel is instructed to decrease a transmission rate. When the queue length is a second threshold or more which is greater than the first threshold, there is halted the transmission of data cells from the preceding nodes or source terminals to the bottleneck node .
The method of decreasing the transmission rate of the source terminal comprises two ways. In the first way, congestion data is added to the header of a data cell passing through a node where the data cell queue is the first threshold or more, and the destination terminal which has received the data cell containing the congestion data transmits a rate decreasing control cell to the source terminal through the network. Receiving the rate decreasing control cell, the source terminal lowers the transmission rate. It is herein desirable for preventing the traffic of control cells from being increased to regulating the transmission timing of control cells in the rate of one time within a predetermined filter time.
In the second way, in a node where a cell queue length is the first threshold or more, a rate decreasing control cell is generated and transmitted to the source terminal. Receiving the rate decreasing control cell, the source terminal decreases the transmission rate of data cells.
In accordance with the present invention, the first threshold indicates that congestion begins to be produced in the network, and the transmission rate of the source terminal is decreased for each channel including a node where the congestion is produced.
When the congestion is nevertheless increased and exceeds a second threshold, transmission from preceding nodes to that node is instructed to be temporarily halted. Accordingly, even when a transmission delay through the network is greater, there is sharply reduced the possibility that some data packets were discarded owing to buffer overflow. Additionally, since the transmission rate of the source terminal is decreased before the transmission is halted, there is sharply reduced the possibility that the transmission becomes impossible as in the prior art when the transmission is halted.
The above and other objects, features and advantages of the present invention will become more apparent from the following description when taken in conjunction with the accompanying 2i38~9~
The method of decreasing the transmission rate of the source terminal comprises two ways. In the first way, congestion data is added to the header of a data cell passing through a node where the data cell queue is the first threshold or more, and the destination terminal which has received the data cell containing the congestion data transmits a rate decreasing control cell to the source terminal through the network. Receiving the rate decreasing control cell, the source terminal lowers the transmission rate. It is herein desirable for preventing the traffic of control cells from being increased to regulating the transmission timing of control cells in the rate of one time within a predetermined filter time.
In the second way, in a node where a cell queue length is the first threshold or more, a rate decreasing control cell is generated and transmitted to the source terminal. Receiving the rate decreasing control cell, the source terminal decreases the transmission rate of data cells.
In accordance with the present invention, the first threshold indicates that congestion begins to be produced in the network, and the transmission rate of the source terminal is decreased for each channel including a node where the congestion is produced.
When the congestion is nevertheless increased and exceeds a second threshold, transmission from preceding nodes to that node is instructed to be temporarily halted. Accordingly, even when a transmission delay through the network is greater, there is sharply reduced the possibility that some data packets were discarded owing to buffer overflow. Additionally, since the transmission rate of the source terminal is decreased before the transmission is halted, there is sharply reduced the possibility that the transmission becomes impossible as in the prior art when the transmission is halted.
The above and other objects, features and advantages of the present invention will become more apparent from the following description when taken in conjunction with the accompanying 2i38~9~
drawings in which~~referred embodiments of the present invention are shown by way oi: illustrative examples.
FIG. 1 is a schematic block diagram illustrating an arrangement of a node in an ATM network according to a first embodiment of the~~resent invention;
FIG. 2 is a partial block diagram illustrating an arrangement of a source termin;~l in the ATM network of FIG. 1;
FIG. 3 is a partial block diagram illustrating an arrangement of a destination terminal in the ATM network of FIG. 1;
FIG. 4 is a diagrammatic view illustrating a format of an ATM
cell;
FIG. 5 is a diagrammatic view illustrating thresholds preset in a buffer of a node in F:IG. 1;
FIG. 6 is a flow chart illustrating a congestion control method according -to the f first embodiment of the present invention;
FIG. 7 is a schematic block diagram illustrating a decrease operation of a transmi:~sion rate in the first embodiment;
FIG. 8 is a schematic block diagram illustrating a halt operation of the transmission in the first embodiment;
FIG. 9 is a timing chart illustrating a transmission timing of a control cell in a destination terminal;
FIG. 10 is a schematic block diagram illustrating a node in the ATM network according to a second embodiment of the present invention;
FIG. 11 is a diagrammatic view illustrating thresholds preset in a buffer of the node in FIG. 10;
FIG. 12 is a flow chart illustrating a congestion control method according to the second embodiment of the present invention; and FIG. 13 is a schematic block diagram illustrating a decrease operation of a transmission rate in the second embodiment.
It is assumed that a virtual channel (VC) is set up between a source terminal 101 and a destination terminal 104 for data transfer as illustrated in FIG. 1. The virtual channel is formed through a plurality of ATM nodes in an ATM network, but in the present embodiment two nodes 102 and 103 thereamong are illustrated in FIG. ~.. For simplicity of the drawing, there are omitted other nodes t:o which the nodes 102 and 103 are connected through respective kinks , and there are further omitted o ther devices such as a cell recEaption processing unit and switches in the node .
All nodes in the= ATM network have the same circuit construction. Describing the node 102 as an example, a buffer 201 of the r_c~de 102 stores data cells which are received from preceding nodes or source terminals ar_d are waiting to be trans~nitteci to following nodes or ctestir_a~ion terminals.
The buffer 201 represents buffers associated with data cell queues in the node 102, which may be a common buffer, or plurality of input buffers or output buffers depending upon the arrangement of a node. IIl the following description, the bu_fer 201 is to store dat=: cel 1 a transmi tted through the v i rtu l channel set uo betw~aen a source terminal 101 and a destir:?tion teri:~lnal 1~~. Th° Clatc C°11S are L.ranS~T~ltted frO~T:
th°_ b'.:_fe= 2~1 2C to the following none 103 by a cell transmi tter 202 .
A queue length c~f the buffer 201 is monitored by a conges Lion detector 203 . The c:onges tion detector 203 generates a congesti on detection signal by comp<:ring the queue length to four thresholds TH1 - TH4 previously set as described later. Based on the 25 congestion detection signal, a congestion notification data A
_ g _ write controller 204 writes congestion notification (CN) data onto the header o:E a dai=a. cell passing the cell transmitter 202.
A backpressure controller 205 transmits a backpressure control cell indicative of temporal transmission halt to the preceding nodes or the source terminals based on the congestion detection signal.
A traffic controller 206, as receiving a backpressure control cell from the fol:Lowing node 103, outputs to the cell transmitter 202 a control signal of temporarily halting the data cell transmission to the node 103. A control cell transfer controller 207 transfers a control cell received from the following node 103 to the preceding node o:r the source terminal 101 in the virtual channel.
As illustrated in FI(3. 2, the source terminal 101 includes a cell generator 401 and a cell transmitter 402. The cell generator 401 generates data cells to be transmitted and outputs them to the cell i~ransm:itter 402 which in turn transmits the data cells to the ATM network. A control cell receiver 403 receives from the ATM network the control cell transmitted by the destination terminal 104, and outputs the control information of the control cell to a transmission rate controller 404.
According to the control information, the transmission rate controller 404 controls the cell transmitter 402 such that the cell transmission. rate is decreased or increased. A traffic controller 405, as receiving the backpressure control cell from 23.38695 the following node, outputs to the cell transmitter 402 a control signal of temporarily halting the cell transmission.
As illustrated in FIG. 3, the destination terminal 104 is comprised of a cell receiver 501 for receiving data cells and a congestion notification data extractor 502 for extracting congestion notification (CN) data from the header of a received cell. Inputting the CN data, a congestion state detector 503 detects a node queue state indicating congestion or congestion recovery between the source terminal 101 and the destination terminal 104, and outputa a detection signal to a control cell generator 504. According to the detection signal indicative of the node queue state, the control cell generator 504 generates a control cell conveying control information indicative of a decrease or an increase of transmission rate and transmits back the control cell to the source terminal 101.
Referring to F'IG. 4, a format of an ATM cell is illustrated.
CN data which indicates any of congestion or congestion recovery in each node is written onto a PT( Payload Type ) field. A value indicative of the congestion recovery is initially written onto the PT field.
AS illustrated in FIG. 5, four thresholds TH1 - TH4 for a queue length are previously set in a buffer in each node. The threshold TH1 has a value for judging the congestion recovery, the threshold TH2 for judging the congestion, the threshold TH3 for judging restart of the transmission, and the threshold TH4 .~._ 2I38~95 for judging halt of the transmission. These thresholds satisfy the following relation: TH1 =< TH2 < TH3 =< TH4.
Referring to F'IG. 6, an operation of each node in the present embodiment will beg described. It is herein noted that a control flow of FIG. 6 is a subroutine of a main control flow (not shown) in each node, which is repeatedly executed at predetermined intervals.
In a certain node, the congestion detector checks whether or not a queue length Q of data cells stored in the buffer is smaller than the threshold TH2 ( Step 5601 ) . If the queue length Q is not smaller than the threshold TH2, the congestion detector determines that the node :is in a congestion state, and the CN
data ' 1' indicative of congestion is written onto the PT field of the header of a data cel l passing through the node ( S602 ) .
Subsequently, the congestion detector checks whether or not the queue length ~~ is srnaller than the threshold TH4 (5603) . If the queue length Q is not smaller than the threshold TH4, it is judged to be excessive congestion, and a transmission halt (backpressure) control cell is transmitted to preceding nodes or the source terminals ( 5604 ) , and the control is returned to the main control flow.
If the queue length Q is smaller than the threshold TH4 (YES
in step S603), it is checked whether or not the transmission is on halt ( 5605 ) . I f the 1=ransmission is on halt, it is further checked whether or not the queue length Q is smaller than the threshold TH3 (5606) . If the queue length Q is smaller than the threshold TH3, a transmission restart control cell is transmitted to the preceding nodes for releasing on-halt transmission ( S607 ) . If the transmission is not on halt ( NO in 5605 ) , the control is returned to the main control f low in the state where the processing in step S602 is continued and is started from the step 5601 in the next timing. If the queue length Q is not smaller than the threshold TH3 (NO in step S606), the control is returned to the main control flow with the transmission being kept on halt.
If the queue length Q is smaller than the threshold TH2 (YES
in step 5601 ) , it is checked whether or not the queue length Q is smaller than the threshold TH1 (S608) . If the queue length Q is smaller than the threshold TH1, the congestion is judged to expire, and CN data ' 0' indicative of congestion recovery is written onto the PT field of the header of a passing data cell ( 5609 ) . Unless the queue length Q is smaller than the threshold TH1, the congestion is judged not to be recovered, and the control is returned to the main control flow as it is.
Referring to FIG. 7, the operation of the network system is illustrated when the queue length Q of the buffer 201 in the node 102 is smaller than the threshold TH1, and the queue length Q of the buffer 301 in the following node 103 is equal to or greater than the threshold TH2 but is smaller than the threshold TH4.
Since the node 102 is in a state without congestion, data cells z~3ss~~
to be transmitted by the cell transmitter 202 are transferred to the node 103 with the CN' data in the cell header being kept at an initial value, that is, congestion recovery ' 0' ( YES in the step 5601 and NO in the step S608 in FIG. 6 ) .
In the node 10 3 , the' gueue length Q exceeds the threshold TH2, so that the CN data. write controller 304 writes CN data ' 1' indicative of congestion onto the PT f field of the header of a data cell 1001 to be transmitted by the cell transmitter 302, and transfers it to tree destination terminal 104.
In the destination terminal 104, the CN data extractor 502 extracts the CN data from the header of the received data cell 1001.
If the congestion state detector 503 determines that the value of the CN data is ' 1' , a control cell generator 504 transmits to the source terminal 101 a control cell 1002 having control information which is to decrease the transmission rate. It is herein noted that the transmission timing of the control cell 1002 may be limited by a. predetermined filter time T, as described later. The control cell 1002 is transmitted to the source terminal 101 through the control cell transfer controllers 307 and 207 in the nodes 103 and 102.
In the source terminal 101, after receiving from the destination terminal 104 the control cell which instructs the transmission rate to be decreased, the transmission rate controller 404 controls t:he cell transmitter 402 to lower the 21~869~
transmission rate of data cells.
As the congestion o:f the node 103 is moderated to permit the queue length Q to be smaller than the threshold TH1, the CN data write controller 304 writes CN data ' 0' indicative of congestion recovery into the header of a data cell to be transmitted ( S609 in FIG. 6 ) , and transmii~s it to the destination terminal 104 .
Receiving such a data cell, the destination terminal 104 transmits a control cell which instructs the transmission rate to be increased to the scource terminal 101. According to the control cell, the source terminal 101 increases the transmission rate of data cells.
Referring to l~ IG. 8, the operation is illustrated when the queue length Q becomes c~r~eater than the threshold TH4. With the congestion state, the congestion detector 303 in the node 103 instructs the bacl;pressure controller 305 to transmit all preceding nodes connected to the node 103 a backpressure control cell 1003 which instructs the transmission to be temporarily halted (5601 - 5604 in fIG. 6) .
Receiving the backpressure control cell 1003, the traffic controller 206 in the node 102 which is one of the preceding nodes controls thca cell transmitter 202 such that the transmission of the data cells to the node 103 is temporarily halted. In other preceding nodes (not illustrated), the data cell transmission to the node 103 is likewise halted.
Once the queuE~ lengt=h Q of the node 103 is decreased to the threshold TH3, the backpressure controller 305 transmits a transmission restart control cell to all preceding nodes (5607 in FIG. 6) . Hereby, thE~ traffic controller 206 in the node 102 controls the cell transmitter 202 such that the cell transmission to the node 103 is restarted.
Referring to EIG. 9, there is illustrated transmission timing of a control cell which instructs the destination terminal to change the transmission rate. Filter time T is previously set in the control cell generator 504 in the destination terminal 104.
The destination terminal 104, even if it continuously receives congestion notification cells or congestion recovery cells, does not transmit a rai:.e change control cell until the filter time T
elapses after transmitting a previous rate change control cell.
The destination terminal 104 transmits the rate change control cell to the sourcE~ terminal 101 in response to a congestion notification cell or a congestion recovery cell received after the lapse of the filter time T. As understood from FIG. 9, the destination terminal 104, even if many cells each containing congestion notification data are received during the filter time T1, transmits the rate decrease control cell 1002 only for the first cell 1001. Thereafter, it does not transmit any rate change control cell even if cells come over until the filter time T1 elapses . The cLestination terminal 104 transmits the transmission rate decrease control cell 1002 to the source terminal 101 once the data cell 1001 comes into in a filter time .-- , 2138695 T2 following the filter time T1. Thereafter, it does not transmit any rate change control cell for cells which come over until the filter time T2 elapses whatever those cells are. Upon receipt of a data cell indicative of the congestion recovery in another f filter time T3 , the destination terminal 104 transmits a rate increase control cell for the received data cell to the source terminal lc)1. Thereafter, it does not transmit any rate change cell even 9.f dates cells come over until the filter time T3 elapses.
Referring to FIG. 10, a second embodiment of the present invention is illu:~trate~d" As in the first embodiment illustrated in FIG. 1, a virtual channel for data transfer is assumed to be established between the source terminal 101 and the destination terminal 104. Although the virtual terminal is formed through a plurality of ATM nodes in the ATM network, two nodes 110 and 111 among those are herein illustrated. For simplicity of the drawing, there arE~ omitted other nodes connected with the nodes 110 and 111 through links, and are also omitted other components such as a cell reception processor and switches in the ATM node .
The nodes in the ATM network have the same circuit arrangement. Described the node 110 as an example, a buffer 211 of the node 110 stores data cells which are received from preceding nodes oz- the ~;ource terminals and are waiting to be transmitted to fo7_lowing nodes or the destination terminals . The buffer 211 represents buffers associated with a data cell queue 2138fi95 in the node 110, which may be a common buffer, input buffers or output buffers . The buffer 211 is assumed in the following description to store dai~a cells transferred through the virtual channel established between the source terminal 101 and the destination terminal 104" Data cells are read out from the buffer 211 and are transferred from the transmitter 212 to the following node 11:L .
A queue length of the buffer 211 is monitored by the congestion detector 21:3. The congestion detector 213 generates a congestion detection signal by comparing the queue length to four thresholds TH10 - TH40 set in advance. The control cell generator 214 transmits a. rate change control cell to the source terminal 101 according t_o the congestion detection signal. A
backpressure controller 215 transmits a backpressure control cell indicative of: temporary transmission halt to previous nodes or the source terminals according to the congestion detection signal.
Receiving the backpressure control cell from the following node 111, a traffic controller 216 outputs a control signal of temporarily halting the data cell transmission to the cell transmitter 212. A control cell transfer controller 217, receiving a rate change control cell from the following node 111, transfers the rate change control cell to the source terminal 101 through the control cell. generator 214.
As illustrated in FI:G. 11, four thresholds TH10 - TH40 of the _._. 2138695 buffer are previously determined in each node. The threshold TH10 has a value for judging congestion recovery, the threshold TH20 a value for judging congestion, the threshold TH30 for judging transmission restart, and the threshold TH40 for judging transmission halt. These thresholds satisfy the following relationship: TH10 =< TH20 < TH30 =< TH40.
Referring to F:fG. 12, an operation of each node in the present embodiment will be described. It is noted that a control flow illustrated in FIG. 12 is a subroutine of a main flow (not shown) in each node, which is repeatedly executed at predetermined intervals.
In a certain node, true congestion detector checks whether or not the queue length Q of data cells stored in the buffer is smaller than the triresho:Ld TH20 in step 5701. If the queue length Q is not smaller than the threshold TH20, the congestion detector judges thE~ node to be in a congestion state, specifies the source terminal from the header of a data cell passing through the node (:>702 ) , and further transmits a control cell for instructing the source terminal to decrease its transmission rate from the control cell generator to the source terminal (S703).
Subsequently, the congestion detector checks whether or not the queue length Q is smaller than the threshold TH40 ( S704 ) . If the queue length Q is not smaller than the threshold TH40, the congestion detector judges that excessive congestion occurs and the backpressure controller transmits a transmission halt (or backpressure) control ce:l1 to all preceding nodes or source terminals (5705).
If the queue 7_ength Q is smaller than the threshold TH40 (YES
in step 5704 ) , it is checked whether or not the transmission is on halt ( 5706 ) .
If the transmission i.s on halt, it is further checked whether or not the queue length Q is smaller than the threshold TH30 ( S707 ) . If the queue length Q is smaller than the threshold TH30, a transmission re;st:art control cell is transmitted to all preceding nodes in order to release the transmiss ion halt ( 5708 ) .
If the transmission is on halt (NO in step 5706), the control is returned to the main control flow with the processing in step 5703 being contin,aed and is started in the next timing from step 5701. If the queue length Q is not smaller than the threshold TH30 (NO in step ~~707 ) , the control is returned to the main control flow with the transmission being kept on halt.
If the queue :Length Q is smaller than the threshold TH20 (YES
in step 5701 ) , it is checked whether or not the queue length Q is smaller than the i:.hreshold TH10 (S709) . If the queue length Q is smaller than the i~hreshold TH10, the congestion is decided to be relieved and the source terminal is specified from the header of a data cell passing through the node ( 5710 ) , and a transmission increase control cell is transmitted from the control cell generator to the source terminal ( 5711 ) .
.._. 213895 Referring to F'IG. 13, an operation of the network system is illustrated where a queue length of the buffer 211 in the node 110 is smaller than the threshold TH10 and a queue length of the buffer 311 in the following node 111 is greater than the threshold TH20 but. is smaller than the threshold TH40. Since the node 110 is in no congestion state, data cells are transferred from the cell transmitter 212 to the following node 111. In the node 111, the queue length Q exceeds the threshold TH20, so that the control cell generator 314 generates a rate decreasing control cell 2002 and sends it back to the preceding node 110 ( 5703 in FIG. 12 ) . The <:ontrol cell 2002 is transferred to the source terminal 101 through the preceding node 110, and the rate controller 404 in the source terminal 101 controls the cell transmitter 402 such that the transmission rate of data cells is decreased. It is noted Therein that data cells 2001 stored in the buffer 311 continue to be transferred to the destination terminal 104.
When the congestion of the node 111 is relieved so that the queue length Q is ;smaller than the threshold TH10, the control cell generator 314 transmits a rate increasing control cell 2002 to the preceding node 110 ( S711 in FIG. 12 ) . The control cell 2002 is transferred to the source terminal 101 through the preceding node 110, and the rate controller 404 in the source terminal 101 controls the cell transmitter 402 such that the transmission rate of they data cell is increased to the predetermined rate.
For the .transmission halt when the queue length Q in the node 111 exceeds the threshold TH40 and for the transmission restart when the queue length becomes less than the threshold TH30.
description thereof is omitted because their operations are identical to those in the first embodiment.
FIG. 1 is a schematic block diagram illustrating an arrangement of a node in an ATM network according to a first embodiment of the~~resent invention;
FIG. 2 is a partial block diagram illustrating an arrangement of a source termin;~l in the ATM network of FIG. 1;
FIG. 3 is a partial block diagram illustrating an arrangement of a destination terminal in the ATM network of FIG. 1;
FIG. 4 is a diagrammatic view illustrating a format of an ATM
cell;
FIG. 5 is a diagrammatic view illustrating thresholds preset in a buffer of a node in F:IG. 1;
FIG. 6 is a flow chart illustrating a congestion control method according -to the f first embodiment of the present invention;
FIG. 7 is a schematic block diagram illustrating a decrease operation of a transmi:~sion rate in the first embodiment;
FIG. 8 is a schematic block diagram illustrating a halt operation of the transmission in the first embodiment;
FIG. 9 is a timing chart illustrating a transmission timing of a control cell in a destination terminal;
FIG. 10 is a schematic block diagram illustrating a node in the ATM network according to a second embodiment of the present invention;
FIG. 11 is a diagrammatic view illustrating thresholds preset in a buffer of the node in FIG. 10;
FIG. 12 is a flow chart illustrating a congestion control method according to the second embodiment of the present invention; and FIG. 13 is a schematic block diagram illustrating a decrease operation of a transmission rate in the second embodiment.
It is assumed that a virtual channel (VC) is set up between a source terminal 101 and a destination terminal 104 for data transfer as illustrated in FIG. 1. The virtual channel is formed through a plurality of ATM nodes in an ATM network, but in the present embodiment two nodes 102 and 103 thereamong are illustrated in FIG. ~.. For simplicity of the drawing, there are omitted other nodes t:o which the nodes 102 and 103 are connected through respective kinks , and there are further omitted o ther devices such as a cell recEaption processing unit and switches in the node .
All nodes in the= ATM network have the same circuit construction. Describing the node 102 as an example, a buffer 201 of the r_c~de 102 stores data cells which are received from preceding nodes or source terminals ar_d are waiting to be trans~nitteci to following nodes or ctestir_a~ion terminals.
The buffer 201 represents buffers associated with data cell queues in the node 102, which may be a common buffer, or plurality of input buffers or output buffers depending upon the arrangement of a node. IIl the following description, the bu_fer 201 is to store dat=: cel 1 a transmi tted through the v i rtu l channel set uo betw~aen a source terminal 101 and a destir:?tion teri:~lnal 1~~. Th° Clatc C°11S are L.ranS~T~ltted frO~T:
th°_ b'.:_fe= 2~1 2C to the following none 103 by a cell transmi tter 202 .
A queue length c~f the buffer 201 is monitored by a conges Lion detector 203 . The c:onges tion detector 203 generates a congesti on detection signal by comp<:ring the queue length to four thresholds TH1 - TH4 previously set as described later. Based on the 25 congestion detection signal, a congestion notification data A
_ g _ write controller 204 writes congestion notification (CN) data onto the header o:E a dai=a. cell passing the cell transmitter 202.
A backpressure controller 205 transmits a backpressure control cell indicative of temporal transmission halt to the preceding nodes or the source terminals based on the congestion detection signal.
A traffic controller 206, as receiving a backpressure control cell from the fol:Lowing node 103, outputs to the cell transmitter 202 a control signal of temporarily halting the data cell transmission to the node 103. A control cell transfer controller 207 transfers a control cell received from the following node 103 to the preceding node o:r the source terminal 101 in the virtual channel.
As illustrated in FI(3. 2, the source terminal 101 includes a cell generator 401 and a cell transmitter 402. The cell generator 401 generates data cells to be transmitted and outputs them to the cell i~ransm:itter 402 which in turn transmits the data cells to the ATM network. A control cell receiver 403 receives from the ATM network the control cell transmitted by the destination terminal 104, and outputs the control information of the control cell to a transmission rate controller 404.
According to the control information, the transmission rate controller 404 controls the cell transmitter 402 such that the cell transmission. rate is decreased or increased. A traffic controller 405, as receiving the backpressure control cell from 23.38695 the following node, outputs to the cell transmitter 402 a control signal of temporarily halting the cell transmission.
As illustrated in FIG. 3, the destination terminal 104 is comprised of a cell receiver 501 for receiving data cells and a congestion notification data extractor 502 for extracting congestion notification (CN) data from the header of a received cell. Inputting the CN data, a congestion state detector 503 detects a node queue state indicating congestion or congestion recovery between the source terminal 101 and the destination terminal 104, and outputa a detection signal to a control cell generator 504. According to the detection signal indicative of the node queue state, the control cell generator 504 generates a control cell conveying control information indicative of a decrease or an increase of transmission rate and transmits back the control cell to the source terminal 101.
Referring to F'IG. 4, a format of an ATM cell is illustrated.
CN data which indicates any of congestion or congestion recovery in each node is written onto a PT( Payload Type ) field. A value indicative of the congestion recovery is initially written onto the PT field.
AS illustrated in FIG. 5, four thresholds TH1 - TH4 for a queue length are previously set in a buffer in each node. The threshold TH1 has a value for judging the congestion recovery, the threshold TH2 for judging the congestion, the threshold TH3 for judging restart of the transmission, and the threshold TH4 .~._ 2I38~95 for judging halt of the transmission. These thresholds satisfy the following relation: TH1 =< TH2 < TH3 =< TH4.
Referring to F'IG. 6, an operation of each node in the present embodiment will beg described. It is herein noted that a control flow of FIG. 6 is a subroutine of a main control flow (not shown) in each node, which is repeatedly executed at predetermined intervals.
In a certain node, the congestion detector checks whether or not a queue length Q of data cells stored in the buffer is smaller than the threshold TH2 ( Step 5601 ) . If the queue length Q is not smaller than the threshold TH2, the congestion detector determines that the node :is in a congestion state, and the CN
data ' 1' indicative of congestion is written onto the PT field of the header of a data cel l passing through the node ( S602 ) .
Subsequently, the congestion detector checks whether or not the queue length ~~ is srnaller than the threshold TH4 (5603) . If the queue length Q is not smaller than the threshold TH4, it is judged to be excessive congestion, and a transmission halt (backpressure) control cell is transmitted to preceding nodes or the source terminals ( 5604 ) , and the control is returned to the main control flow.
If the queue length Q is smaller than the threshold TH4 (YES
in step S603), it is checked whether or not the transmission is on halt ( 5605 ) . I f the 1=ransmission is on halt, it is further checked whether or not the queue length Q is smaller than the threshold TH3 (5606) . If the queue length Q is smaller than the threshold TH3, a transmission restart control cell is transmitted to the preceding nodes for releasing on-halt transmission ( S607 ) . If the transmission is not on halt ( NO in 5605 ) , the control is returned to the main control f low in the state where the processing in step S602 is continued and is started from the step 5601 in the next timing. If the queue length Q is not smaller than the threshold TH3 (NO in step S606), the control is returned to the main control flow with the transmission being kept on halt.
If the queue length Q is smaller than the threshold TH2 (YES
in step 5601 ) , it is checked whether or not the queue length Q is smaller than the threshold TH1 (S608) . If the queue length Q is smaller than the threshold TH1, the congestion is judged to expire, and CN data ' 0' indicative of congestion recovery is written onto the PT field of the header of a passing data cell ( 5609 ) . Unless the queue length Q is smaller than the threshold TH1, the congestion is judged not to be recovered, and the control is returned to the main control flow as it is.
Referring to FIG. 7, the operation of the network system is illustrated when the queue length Q of the buffer 201 in the node 102 is smaller than the threshold TH1, and the queue length Q of the buffer 301 in the following node 103 is equal to or greater than the threshold TH2 but is smaller than the threshold TH4.
Since the node 102 is in a state without congestion, data cells z~3ss~~
to be transmitted by the cell transmitter 202 are transferred to the node 103 with the CN' data in the cell header being kept at an initial value, that is, congestion recovery ' 0' ( YES in the step 5601 and NO in the step S608 in FIG. 6 ) .
In the node 10 3 , the' gueue length Q exceeds the threshold TH2, so that the CN data. write controller 304 writes CN data ' 1' indicative of congestion onto the PT f field of the header of a data cell 1001 to be transmitted by the cell transmitter 302, and transfers it to tree destination terminal 104.
In the destination terminal 104, the CN data extractor 502 extracts the CN data from the header of the received data cell 1001.
If the congestion state detector 503 determines that the value of the CN data is ' 1' , a control cell generator 504 transmits to the source terminal 101 a control cell 1002 having control information which is to decrease the transmission rate. It is herein noted that the transmission timing of the control cell 1002 may be limited by a. predetermined filter time T, as described later. The control cell 1002 is transmitted to the source terminal 101 through the control cell transfer controllers 307 and 207 in the nodes 103 and 102.
In the source terminal 101, after receiving from the destination terminal 104 the control cell which instructs the transmission rate to be decreased, the transmission rate controller 404 controls t:he cell transmitter 402 to lower the 21~869~
transmission rate of data cells.
As the congestion o:f the node 103 is moderated to permit the queue length Q to be smaller than the threshold TH1, the CN data write controller 304 writes CN data ' 0' indicative of congestion recovery into the header of a data cell to be transmitted ( S609 in FIG. 6 ) , and transmii~s it to the destination terminal 104 .
Receiving such a data cell, the destination terminal 104 transmits a control cell which instructs the transmission rate to be increased to the scource terminal 101. According to the control cell, the source terminal 101 increases the transmission rate of data cells.
Referring to l~ IG. 8, the operation is illustrated when the queue length Q becomes c~r~eater than the threshold TH4. With the congestion state, the congestion detector 303 in the node 103 instructs the bacl;pressure controller 305 to transmit all preceding nodes connected to the node 103 a backpressure control cell 1003 which instructs the transmission to be temporarily halted (5601 - 5604 in fIG. 6) .
Receiving the backpressure control cell 1003, the traffic controller 206 in the node 102 which is one of the preceding nodes controls thca cell transmitter 202 such that the transmission of the data cells to the node 103 is temporarily halted. In other preceding nodes (not illustrated), the data cell transmission to the node 103 is likewise halted.
Once the queuE~ lengt=h Q of the node 103 is decreased to the threshold TH3, the backpressure controller 305 transmits a transmission restart control cell to all preceding nodes (5607 in FIG. 6) . Hereby, thE~ traffic controller 206 in the node 102 controls the cell transmitter 202 such that the cell transmission to the node 103 is restarted.
Referring to EIG. 9, there is illustrated transmission timing of a control cell which instructs the destination terminal to change the transmission rate. Filter time T is previously set in the control cell generator 504 in the destination terminal 104.
The destination terminal 104, even if it continuously receives congestion notification cells or congestion recovery cells, does not transmit a rai:.e change control cell until the filter time T
elapses after transmitting a previous rate change control cell.
The destination terminal 104 transmits the rate change control cell to the sourcE~ terminal 101 in response to a congestion notification cell or a congestion recovery cell received after the lapse of the filter time T. As understood from FIG. 9, the destination terminal 104, even if many cells each containing congestion notification data are received during the filter time T1, transmits the rate decrease control cell 1002 only for the first cell 1001. Thereafter, it does not transmit any rate change control cell even if cells come over until the filter time T1 elapses . The cLestination terminal 104 transmits the transmission rate decrease control cell 1002 to the source terminal 101 once the data cell 1001 comes into in a filter time .-- , 2138695 T2 following the filter time T1. Thereafter, it does not transmit any rate change control cell for cells which come over until the filter time T2 elapses whatever those cells are. Upon receipt of a data cell indicative of the congestion recovery in another f filter time T3 , the destination terminal 104 transmits a rate increase control cell for the received data cell to the source terminal lc)1. Thereafter, it does not transmit any rate change cell even 9.f dates cells come over until the filter time T3 elapses.
Referring to FIG. 10, a second embodiment of the present invention is illu:~trate~d" As in the first embodiment illustrated in FIG. 1, a virtual channel for data transfer is assumed to be established between the source terminal 101 and the destination terminal 104. Although the virtual terminal is formed through a plurality of ATM nodes in the ATM network, two nodes 110 and 111 among those are herein illustrated. For simplicity of the drawing, there arE~ omitted other nodes connected with the nodes 110 and 111 through links, and are also omitted other components such as a cell reception processor and switches in the ATM node .
The nodes in the ATM network have the same circuit arrangement. Described the node 110 as an example, a buffer 211 of the node 110 stores data cells which are received from preceding nodes oz- the ~;ource terminals and are waiting to be transmitted to fo7_lowing nodes or the destination terminals . The buffer 211 represents buffers associated with a data cell queue 2138fi95 in the node 110, which may be a common buffer, input buffers or output buffers . The buffer 211 is assumed in the following description to store dai~a cells transferred through the virtual channel established between the source terminal 101 and the destination terminal 104" Data cells are read out from the buffer 211 and are transferred from the transmitter 212 to the following node 11:L .
A queue length of the buffer 211 is monitored by the congestion detector 21:3. The congestion detector 213 generates a congestion detection signal by comparing the queue length to four thresholds TH10 - TH40 set in advance. The control cell generator 214 transmits a. rate change control cell to the source terminal 101 according t_o the congestion detection signal. A
backpressure controller 215 transmits a backpressure control cell indicative of: temporary transmission halt to previous nodes or the source terminals according to the congestion detection signal.
Receiving the backpressure control cell from the following node 111, a traffic controller 216 outputs a control signal of temporarily halting the data cell transmission to the cell transmitter 212. A control cell transfer controller 217, receiving a rate change control cell from the following node 111, transfers the rate change control cell to the source terminal 101 through the control cell. generator 214.
As illustrated in FI:G. 11, four thresholds TH10 - TH40 of the _._. 2138695 buffer are previously determined in each node. The threshold TH10 has a value for judging congestion recovery, the threshold TH20 a value for judging congestion, the threshold TH30 for judging transmission restart, and the threshold TH40 for judging transmission halt. These thresholds satisfy the following relationship: TH10 =< TH20 < TH30 =< TH40.
Referring to F:fG. 12, an operation of each node in the present embodiment will be described. It is noted that a control flow illustrated in FIG. 12 is a subroutine of a main flow (not shown) in each node, which is repeatedly executed at predetermined intervals.
In a certain node, true congestion detector checks whether or not the queue length Q of data cells stored in the buffer is smaller than the triresho:Ld TH20 in step 5701. If the queue length Q is not smaller than the threshold TH20, the congestion detector judges thE~ node to be in a congestion state, specifies the source terminal from the header of a data cell passing through the node (:>702 ) , and further transmits a control cell for instructing the source terminal to decrease its transmission rate from the control cell generator to the source terminal (S703).
Subsequently, the congestion detector checks whether or not the queue length Q is smaller than the threshold TH40 ( S704 ) . If the queue length Q is not smaller than the threshold TH40, the congestion detector judges that excessive congestion occurs and the backpressure controller transmits a transmission halt (or backpressure) control ce:l1 to all preceding nodes or source terminals (5705).
If the queue 7_ength Q is smaller than the threshold TH40 (YES
in step 5704 ) , it is checked whether or not the transmission is on halt ( 5706 ) .
If the transmission i.s on halt, it is further checked whether or not the queue length Q is smaller than the threshold TH30 ( S707 ) . If the queue length Q is smaller than the threshold TH30, a transmission re;st:art control cell is transmitted to all preceding nodes in order to release the transmiss ion halt ( 5708 ) .
If the transmission is on halt (NO in step 5706), the control is returned to the main control flow with the processing in step 5703 being contin,aed and is started in the next timing from step 5701. If the queue length Q is not smaller than the threshold TH30 (NO in step ~~707 ) , the control is returned to the main control flow with the transmission being kept on halt.
If the queue :Length Q is smaller than the threshold TH20 (YES
in step 5701 ) , it is checked whether or not the queue length Q is smaller than the i:.hreshold TH10 (S709) . If the queue length Q is smaller than the i~hreshold TH10, the congestion is decided to be relieved and the source terminal is specified from the header of a data cell passing through the node ( 5710 ) , and a transmission increase control cell is transmitted from the control cell generator to the source terminal ( 5711 ) .
.._. 213895 Referring to F'IG. 13, an operation of the network system is illustrated where a queue length of the buffer 211 in the node 110 is smaller than the threshold TH10 and a queue length of the buffer 311 in the following node 111 is greater than the threshold TH20 but. is smaller than the threshold TH40. Since the node 110 is in no congestion state, data cells are transferred from the cell transmitter 212 to the following node 111. In the node 111, the queue length Q exceeds the threshold TH20, so that the control cell generator 314 generates a rate decreasing control cell 2002 and sends it back to the preceding node 110 ( 5703 in FIG. 12 ) . The <:ontrol cell 2002 is transferred to the source terminal 101 through the preceding node 110, and the rate controller 404 in the source terminal 101 controls the cell transmitter 402 such that the transmission rate of data cells is decreased. It is noted Therein that data cells 2001 stored in the buffer 311 continue to be transferred to the destination terminal 104.
When the congestion of the node 111 is relieved so that the queue length Q is ;smaller than the threshold TH10, the control cell generator 314 transmits a rate increasing control cell 2002 to the preceding node 110 ( S711 in FIG. 12 ) . The control cell 2002 is transferred to the source terminal 101 through the preceding node 110, and the rate controller 404 in the source terminal 101 controls the cell transmitter 402 such that the transmission rate of they data cell is increased to the predetermined rate.
For the .transmission halt when the queue length Q in the node 111 exceeds the threshold TH40 and for the transmission restart when the queue length becomes less than the threshold TH30.
description thereof is omitted because their operations are identical to those in the first embodiment.
Claims (17)
1. A congestion control method in a network wherein information blocks are asynchronously transferred through a plurality of channels, each channel being set up between a source terminal and a destination terminal via a plurality of nodes, the terminals and the nodes each being a stage in a channel, the method comprising the steps of:
at each one node of the plurality of nodes;
(a) monitoring a queue length of information blocks to be transferred from the one node, where the queue length is a number of information blocks stored at the one node;
(b) comparing the queue length with a first threshold value and a second threshold value, the first threshold value being smaller than the second threshold value;
(c) comparing the queue length with a third threshold value which is smaller than the second threshold value but larger than the first threshold value;
(d) stopping a preceding stage in the channel from transmitting information blocks to the one node when the queue length is larger than the second threshold value;
(e) restarting the preceding stage transmitting information blocks to each one node when the queue length is reduced from more than the second threshold value to less than the third threshold value; and at the source terminal, (f) decreasing a rate of information block transmission on at least one of said channels from a first transmission rate to a second transmission rate, when at least one of the plurality of nodes on said at least one channel has a queue length larger than the first threshold value, and transmitting information blocks at the second transmission rate.
at each one node of the plurality of nodes;
(a) monitoring a queue length of information blocks to be transferred from the one node, where the queue length is a number of information blocks stored at the one node;
(b) comparing the queue length with a first threshold value and a second threshold value, the first threshold value being smaller than the second threshold value;
(c) comparing the queue length with a third threshold value which is smaller than the second threshold value but larger than the first threshold value;
(d) stopping a preceding stage in the channel from transmitting information blocks to the one node when the queue length is larger than the second threshold value;
(e) restarting the preceding stage transmitting information blocks to each one node when the queue length is reduced from more than the second threshold value to less than the third threshold value; and at the source terminal, (f) decreasing a rate of information block transmission on at least one of said channels from a first transmission rate to a second transmission rate, when at least one of the plurality of nodes on said at least one channel has a queue length larger than the first threshold value, and transmitting information blocks at the second transmission rate.
2. The congestion control method according to claim 1, further comprising the steps of:
at the one node, (g) adding congestion notification data to information blocks passing through the one node and directed to the destination terminal when the queue length is larger than the first threshold value;
at the destination terminal, (h) transmitting a rate decreasing information block to the source terminal, the rate decreasing information block being formed based on the congestion notification data; and (i) performing step (f) in response to the rate decreasing information block.
at the one node, (g) adding congestion notification data to information blocks passing through the one node and directed to the destination terminal when the queue length is larger than the first threshold value;
at the destination terminal, (h) transmitting a rate decreasing information block to the source terminal, the rate decreasing information block being formed based on the congestion notification data; and (i) performing step (f) in response to the rate decreasing information block.
3. The congestion control method according to claim 2, wherein, in step (h), the rate decreasing information block is transmitted once every predetermined time period.
4. The congestion control method according to claim 2 or 3, further comprising the steps of:
at each one node, (j) comparing the queue length with a minimum threshold value which is smaller than the first threshold value;
(k) adding congestion recovery notification data to information blocks passing through the one node and directed to the destination terminal when the queue length is smaller than the minimum threshold value;
at the destination terminal, (l) transmitting a rate increasing information block to the source terminal, the rate increasing information block being formed based on the congestion recovery notification data; and at the source terminal, (m) increasing the rate of information block transmission in response to the rate increasing information block.
at each one node, (j) comparing the queue length with a minimum threshold value which is smaller than the first threshold value;
(k) adding congestion recovery notification data to information blocks passing through the one node and directed to the destination terminal when the queue length is smaller than the minimum threshold value;
at the destination terminal, (l) transmitting a rate increasing information block to the source terminal, the rate increasing information block being formed based on the congestion recovery notification data; and at the source terminal, (m) increasing the rate of information block transmission in response to the rate increasing information block.
5. The congestion control method according to claim 4, wherein, in step (1), the rate increasing information block is transmitted once every predetermined time period.
6. The congestion control method according to claim 1, further comprising the steps of:
at each one node, transmitting a rate decreasing information block to the source terminal when the queue length is larger than the first threshold value; and at the source terminal, performing step (f) in response to rate decreasing information block.
at each one node, transmitting a rate decreasing information block to the source terminal when the queue length is larger than the first threshold value; and at the source terminal, performing step (f) in response to rate decreasing information block.
7. The congestion control method according to claim 1 or 6, further comprising the steps of:
at each one node, comparing the queue length with a minimum threshold value which is smaller than the first threshold value;
transmitting a rate increasing information block to the source terminal when the queue length is smaller than the minimum threshold value; and at the source terminal, increasing the rate of information block transmission in response to the rate increasing information block.
at each one node, comparing the queue length with a minimum threshold value which is smaller than the first threshold value;
transmitting a rate increasing information block to the source terminal when the queue length is smaller than the minimum threshold value; and at the source terminal, increasing the rate of information block transmission in response to the rate increasing information block.
8. The congestion control method according to claim 1, wherein the preceding stage is the source terminal or a prior node adjacent to the one node through the channel.
9. A network system wherein information blocks are asynchronously transferred through a plurality of channels, each channel being set up between a source terminal and a destination terminal via a plurality of nodes, the terminals and the nodes each being a stage in a channel, the network system comprising:
(a) a plurality of nodes;
(b) a source terminal;
(c) a destination terminal;
(d) each one node of the plurality of nodes comprises:
monitoring means for monitoring a queue length of information blocks to be transferred from the one node, where the queue length is the number of information blocks stored at the one node;
first comparing means for comparing the queue length with a first threshold value and a second threshold value, the first threshold value being smaller than the second threshold value;
second comparing means for comparing the queue length with a third threshold value which is smaller than the second threshold value but larger than the first threshold value;
addition means for adding congestion notification data to information blocks passing through the one node and directed to the destination terminal when the queue length is larger than the first threshold value;
stopping means for stopping a preceding stage from transmitting information blocks to the one node when the queue length is larger than the second threshold value; and restarting means for restarting the preceding stage transmitting information blocks to the one node when the queue length is reduced from more than the second threshold value to less than the third threshold value.
(e) the destination terminal comprises:
transmission means for transmitting a rate decreasing information block to the source terminal, the rate decreasing information block being formed based on the congestion notification data, and (f) the source terminal comprises:
decreasing means for decreasing the rate of information block transmission on at least one of the said channels from a first transmission rate to a second transmission rate in response to the rate decreasing information block, whereby information blocks are transmitted at the second transmission rate.
(a) a plurality of nodes;
(b) a source terminal;
(c) a destination terminal;
(d) each one node of the plurality of nodes comprises:
monitoring means for monitoring a queue length of information blocks to be transferred from the one node, where the queue length is the number of information blocks stored at the one node;
first comparing means for comparing the queue length with a first threshold value and a second threshold value, the first threshold value being smaller than the second threshold value;
second comparing means for comparing the queue length with a third threshold value which is smaller than the second threshold value but larger than the first threshold value;
addition means for adding congestion notification data to information blocks passing through the one node and directed to the destination terminal when the queue length is larger than the first threshold value;
stopping means for stopping a preceding stage from transmitting information blocks to the one node when the queue length is larger than the second threshold value; and restarting means for restarting the preceding stage transmitting information blocks to the one node when the queue length is reduced from more than the second threshold value to less than the third threshold value.
(e) the destination terminal comprises:
transmission means for transmitting a rate decreasing information block to the source terminal, the rate decreasing information block being formed based on the congestion notification data, and (f) the source terminal comprises:
decreasing means for decreasing the rate of information block transmission on at least one of the said channels from a first transmission rate to a second transmission rate in response to the rate decreasing information block, whereby information blocks are transmitted at the second transmission rate.
10. The network system according to claim 9, wherein the destination terminal transmits the rate decreasing information block once every predetermined time period.
11. The network system according to claim 9, wherein:
each one node further comprises:
third comparing means for comparing the queue length with a minimum threshold value which is smaller than the first threshold value; and second addition means for adding congestion recovery notification data to information blocks passing through the one node directed to the destination terminal when the queue length is smaller than the minimum threshold value;
the destination terminal further comprises:
second transmission means for transmitting a rate increasing information block to the course terminal, the rate increasing information block being formed based on the congestion recovery notification data; and the source terminal further comprises:
increasing means for increasing the rate of information block transmission in response to the rate increasing information block.
each one node further comprises:
third comparing means for comparing the queue length with a minimum threshold value which is smaller than the first threshold value; and second addition means for adding congestion recovery notification data to information blocks passing through the one node directed to the destination terminal when the queue length is smaller than the minimum threshold value;
the destination terminal further comprises:
second transmission means for transmitting a rate increasing information block to the course terminal, the rate increasing information block being formed based on the congestion recovery notification data; and the source terminal further comprises:
increasing means for increasing the rate of information block transmission in response to the rate increasing information block.
12. The network system according to claim 9 or 10 or 11, wherein the destination terminal transmits the rate decreasing information block once every predetermined time period.
13. The network system according to claim 9 or 10 or 11, wherein the destination terminal transmits the rate increasing information block once every predetermined time period.
14. The network system according to claim 9, wherein the preceding stage is the source terminal or a prior node adjacent to the one node through the channel.
15. A network system wherein information blocks are asynchronously transferred through a plurality of channels, each channel being set up between a source terminal and a destination terminal via a plurality of nodes, the terminals and the nodes each being a stage in a channel, the network system comprising:
(e) a plurality of nodes;
(f) a source terminal;
(g) a destination terminal;
(h) each one node of the plurality of nodes comprises:
monitoring means for monitoring a queue length of information blocks to be transferred from the one node, where the queue length is the number of information blocks stored at the one node;
first comparing means for comparing the queue length with a first threshold value and a second threshold value, the first threshold value being smaller than the second threshold value;
second comparing means for comparing the queue length with a third threshold value which is smaller than the second threshold value but larger than the first threshold value;
transmission means for transmitting a rate decreasing information block to the source terminal when the queue length is larger than the first threshold value;
and stopping means for stopping a preceding stage in the channel from transmitting information blocks to the one node when the queue length is larger than the second threshold value; and restarting means for restarting the preceding stage transmitting information blocks to the one node when the queue length is reduced from more than the second threshold value to less than the third threshold value; and (e) the source terminal comprises:
decreasing means for decreasing the rate of information block transmission on at least one of the said channels from a first transmission rate to a second transmission rate, in response to the rate decreasing information block, whereby information blocks are transmitted at the second transmission rate.
(e) a plurality of nodes;
(f) a source terminal;
(g) a destination terminal;
(h) each one node of the plurality of nodes comprises:
monitoring means for monitoring a queue length of information blocks to be transferred from the one node, where the queue length is the number of information blocks stored at the one node;
first comparing means for comparing the queue length with a first threshold value and a second threshold value, the first threshold value being smaller than the second threshold value;
second comparing means for comparing the queue length with a third threshold value which is smaller than the second threshold value but larger than the first threshold value;
transmission means for transmitting a rate decreasing information block to the source terminal when the queue length is larger than the first threshold value;
and stopping means for stopping a preceding stage in the channel from transmitting information blocks to the one node when the queue length is larger than the second threshold value; and restarting means for restarting the preceding stage transmitting information blocks to the one node when the queue length is reduced from more than the second threshold value to less than the third threshold value; and (e) the source terminal comprises:
decreasing means for decreasing the rate of information block transmission on at least one of the said channels from a first transmission rate to a second transmission rate, in response to the rate decreasing information block, whereby information blocks are transmitted at the second transmission rate.
16. The network system according to claim 15, wherein:
each one node further comprises:
second comparing means for comparing the queue length with a minimum threshold value which is smaller than the first threshold value; and second transmission means for transmitting a rate increasing information block to the source terminal when the queue length is smaller than the minimum threshold value, and the source terminal further comprises:
second increasing means for increasing the rate of information block transmission in response to the rate increasing information block.
each one node further comprises:
second comparing means for comparing the queue length with a minimum threshold value which is smaller than the first threshold value; and second transmission means for transmitting a rate increasing information block to the source terminal when the queue length is smaller than the minimum threshold value, and the source terminal further comprises:
second increasing means for increasing the rate of information block transmission in response to the rate increasing information block.
17. The network system according to claim 15, wherein the preceding stage is the source terminal or a prior node adjacent to the one node through the channel.
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| JP5-324989 | 1993-12-22 | ||
| JP32498993A JP2639335B2 (en) | 1993-12-22 | 1993-12-22 | Congestion control method in ATM network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CA2138695A1 CA2138695A1 (en) | 1995-06-23 |
| CA2138695C true CA2138695C (en) | 2000-05-16 |
Family
ID=18171893
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CA 2138695 Expired - Fee Related CA2138695C (en) | 1993-12-22 | 1994-12-21 | Congestion control method in atm network |
Country Status (5)
| Country | Link |
|---|---|
| US (1) | US5719853A (en) |
| EP (1) | EP0661851B1 (en) |
| JP (1) | JP2639335B2 (en) |
| CA (1) | CA2138695C (en) |
| DE (1) | DE69430183T2 (en) |
Families Citing this family (96)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| GB9511319D0 (en) * | 1995-06-05 | 1995-08-02 | Gen Datacomm Adv Res | Controlling the flow of ATM cells in an ATM network |
| KR0147136B1 (en) * | 1995-11-04 | 1998-08-17 | 양승택 | Equipment and method for congestion control in atm network |
| US6075768A (en) * | 1995-11-09 | 2000-06-13 | At&T Corporation | Fair bandwidth sharing for video traffic sources using distributed feedback control |
| DE19544976A1 (en) * | 1995-12-01 | 1997-06-05 | Siemens Ag | Device and method for communication between transmitting and / or receiving stations and a switching station |
| GB2308959A (en) * | 1995-12-29 | 1997-07-09 | Ericsson Telefon Ab L M | Data switching apparatus with fair queuing |
| US6463036B2 (en) | 1996-01-11 | 2002-10-08 | Hitachi, Ltd. | ATM communication apparatus and method of controlling congestion in a communication network using the ATM communication apparatus |
| FI103545B (en) * | 1996-02-14 | 1999-07-15 | Nokia Telecommunications Oy | Manipulation of the ATM cell header field |
| JP3686493B2 (en) | 1996-03-07 | 2005-08-24 | 富士通株式会社 | Feedback control method and apparatus in ATM switch |
| US5935213A (en) * | 1996-05-02 | 1999-08-10 | Fore Systems, Inc. | System and method for generating explicit rate value information for flow control in ATAM network |
| US5946347A (en) * | 1996-05-31 | 1999-08-31 | Diamond Multimedia Systems Inc. | Low latency transport of signals in an error correcting data modem |
| JP2814993B2 (en) * | 1996-06-28 | 1998-10-27 | 日本電気株式会社 | ATM cell continuity test method |
| US5936940A (en) * | 1996-08-22 | 1999-08-10 | International Business Machines Corporation | Adaptive rate-based congestion control in packet networks |
| US6128278A (en) * | 1996-08-30 | 2000-10-03 | Mmc Networks, Inc. | Cell queuing in ATM switches |
| US5901147A (en) * | 1996-08-30 | 1999-05-04 | Mmc Networks, Inc. | Apparatus and methods to change thresholds to control congestion in ATM switches |
| KR0175597B1 (en) * | 1996-09-04 | 1999-04-01 | 한국전자통신연구원 | Low probability connection call registration methdo by the messsage of incomplete call finish reason in atm switching system |
| JP3123447B2 (en) * | 1996-11-13 | 2001-01-09 | 日本電気株式会社 | Switch control circuit of ATM exchange |
| US5991265A (en) * | 1996-12-02 | 1999-11-23 | Conexant Systems, Inc. | Asynchronous transfer mode system and method |
| US6201789B1 (en) * | 1996-12-30 | 2001-03-13 | Compaq Computer Corporation | Network switch with dynamic backpressure per port |
| US6026075A (en) * | 1997-02-25 | 2000-02-15 | International Business Machines Corporation | Flow control mechanism |
| US5991266A (en) * | 1997-03-19 | 1999-11-23 | Mitsubishi Electric Information Technology Center America, Inc. (Ita) | Queue length based ABR flow control system |
| US5940369A (en) * | 1997-03-26 | 1999-08-17 | Lucent Technologies Inc. | Asynchronous transfer mode and media access protocol interoperability apparatus and method |
| US6014367A (en) * | 1997-04-25 | 2000-01-11 | Mmc Networks, Inc | Method for weighted fair queuing for ATM cell scheduling |
| US6041059A (en) * | 1997-04-25 | 2000-03-21 | Mmc Networks, Inc. | Time-wheel ATM cell scheduling |
| SE510170C2 (en) * | 1997-05-16 | 1999-04-26 | Ericsson Telefon Ab L M | Method and apparatus for controlling data packet flow by back pressure message |
| EP0884874A1 (en) * | 1997-06-13 | 1998-12-16 | International Business Machines Corporation | Method for adapting committed information rate over frame relay switched network |
| US6408005B1 (en) | 1997-09-05 | 2002-06-18 | Nec Usa, Inc. | Dynamic rate control scheduler for ATM networks |
| US6324165B1 (en) * | 1997-09-05 | 2001-11-27 | Nec Usa, Inc. | Large capacity, multiclass core ATM switch architecture |
| JP2959539B2 (en) | 1997-10-01 | 1999-10-06 | 日本電気株式会社 | Buffer control method and device |
| JPH11177619A (en) * | 1997-12-15 | 1999-07-02 | Nec Corp | Terminal side congestion control method for frame relay network |
| US6389019B1 (en) * | 1998-03-18 | 2002-05-14 | Nec Usa, Inc. | Time-based scheduler architecture and method for ATM networks |
| US6307860B1 (en) | 1998-04-03 | 2001-10-23 | Mmc Networks, Inc. | Systems and methods for data transformation and transfer in networks |
| US6330584B1 (en) | 1998-04-03 | 2001-12-11 | Mmc Networks, Inc. | Systems and methods for multi-tasking, resource sharing and execution of computer instructions |
| US7055151B1 (en) * | 1998-04-03 | 2006-05-30 | Applied Micro Circuits Corporation | Systems and methods for multi-tasking, resource sharing and execution of computer instructions |
| US6570850B1 (en) * | 1998-04-23 | 2003-05-27 | Giganet, Inc. | System and method for regulating message flow in a digital data network |
| CA2237208A1 (en) * | 1998-05-08 | 1999-11-08 | Northern Telecom Limited | Congestion notification from router |
| US6792500B1 (en) * | 1998-07-08 | 2004-09-14 | Broadcom Corporation | Apparatus and method for managing memory defects |
| US6657961B1 (en) * | 1998-08-18 | 2003-12-02 | Efficient Networks, Inc. | System and method for enhanced end station to end station data flow control |
| US6614757B1 (en) * | 1998-11-23 | 2003-09-02 | 3Com Corporation | Method of local flow control in an asynchronous transfer mode network utilizing PNNI routing protocol |
| US7369496B1 (en) * | 1998-12-02 | 2008-05-06 | Notel Networks Limited | Flow control of frame based data over a synchronous digital network |
| US6542469B1 (en) | 1998-12-10 | 2003-04-01 | Sprint Communications Company, L.P. | Communications network system and method for routing based on disjoint pairs of path |
| US7023800B1 (en) * | 1999-06-01 | 2006-04-04 | Microsoft Corporation | Congestion avoidance within aggregate channels |
| US7369498B1 (en) * | 1999-12-13 | 2008-05-06 | Nokia Corporation | Congestion control method for a packet-switched network |
| KR20010058256A (en) * | 1999-12-27 | 2001-07-05 | 오길록 | Method of Network Throughput Improvements Using Packet Discarding Algorithm with Two Thresholds |
| US6675211B1 (en) * | 2000-01-21 | 2004-01-06 | At&T Wireless Services, Inc. | System and method for adjusting the traffic carried by a network |
| US6721797B1 (en) | 2000-05-16 | 2004-04-13 | Lucent Technologies Inc. | Partial back pressure (PBP) transmission technique for ATM-PON using rate controllers to reduce a maximum output rate from a peak rate to a controlled rate |
| AU2001263439A1 (en) * | 2000-05-31 | 2001-12-11 | Fujitsu Network Communications, Inc. | Method and apparatus for generating explicit rate flow control indicator signals |
| US6466541B1 (en) | 2000-05-31 | 2002-10-15 | Fujitsu Network Communications, Inc. | Cell pacing on a network link employing a rate-based flow control protocol with underlying credit-based flow control mechanisms |
| US6452903B1 (en) | 2000-05-31 | 2002-09-17 | Fujitsu Network Communications, Inc. | Network switch supporting rate-based and credit-based flow control mechanisms on a link-by-link basis |
| EP1182875A3 (en) * | 2000-07-06 | 2003-11-26 | Matsushita Electric Industrial Co., Ltd. | Streaming method and corresponding system |
| US6839321B1 (en) | 2000-07-18 | 2005-01-04 | Alcatel | Domain based congestion management |
| AU2001277773A1 (en) * | 2000-09-22 | 2002-04-02 | Matsushita Electric Industrial Co., Ltd. | Data transmitting/receiving method, transmitting device, receiving device, transmitting/receiving system, and program |
| US6987732B2 (en) * | 2000-12-15 | 2006-01-17 | Tellabs San Jose, Inc. | Apparatus and methods for scheduling packets in a broadband data stream |
| US6990073B1 (en) * | 2001-03-28 | 2006-01-24 | Lsi Logic Corporation | Data packet congestion management technique |
| EP1249972A1 (en) * | 2001-04-09 | 2002-10-16 | Telefonaktiebolaget L M Ericsson (Publ) | Method of controlling a queue buffer |
| JP3882187B2 (en) * | 2001-04-19 | 2007-02-14 | 日本電気株式会社 | Flow control system and method |
| US6983153B2 (en) * | 2001-06-07 | 2006-01-03 | Qualcomm Incorporated | Method and apparatus for congestion control in a wireless communication system |
| JP4573470B2 (en) * | 2001-06-08 | 2010-11-04 | 富士通株式会社 | Transmission apparatus and flow control method thereof |
| US7072299B2 (en) * | 2001-08-20 | 2006-07-04 | International Business Machines Corporation | Credit-based receiver using selected transmit rates and storage thresholds for preventing under flow and over flow-methods, apparatus and program products |
| AU2002326752A1 (en) | 2001-08-24 | 2003-03-10 | Intel Corporation (A Delaware Corporation) (A Delawware Corporation) | A general input/output architecture protocol and related methods to manage data integrity |
| US9836424B2 (en) * | 2001-08-24 | 2017-12-05 | Intel Corporation | General input/output architecture, protocol and related methods to implement flow control |
| US7394764B2 (en) * | 2001-12-14 | 2008-07-01 | Sasken Communication Technologies Limited | Technique for improving transmission control protocol performance in lossy networks |
| US7474616B2 (en) * | 2002-02-19 | 2009-01-06 | Intel Corporation | Congestion indication for flow control |
| JP2004112113A (en) * | 2002-09-13 | 2004-04-08 | Matsushita Electric Ind Co Ltd | Method and apparatus for adaptively controlling real-time communication, method of measuring for continuous erasure of receiving report packet, apparatus for dynamically deciding sending interval of receiving report packet, data receiver and data delivering apparatus |
| US7319674B2 (en) | 2003-07-24 | 2008-01-15 | Cisco Technology, Inc. | System and method for exchanging awareness information in a network environment |
| US7774506B2 (en) * | 2003-08-19 | 2010-08-10 | Cisco Technology, Inc. | Systems and methods for alleviating client over-subscription in ring networks |
| CN1324862C (en) * | 2004-01-06 | 2007-07-04 | 北京邮电大学 | Method for regulating congest window in communication network |
| US7668141B2 (en) * | 2004-07-06 | 2010-02-23 | Motorola, Inc. | Method and apparatus for managing packet data loss in a wireless network |
| US7548562B2 (en) * | 2004-12-14 | 2009-06-16 | Agilent Technologies, Inc. | High speed acquisition system that allows capture from a packet network and streams the data to a storage medium |
| CN100450078C (en) * | 2005-01-17 | 2009-01-07 | 华为技术有限公司 | Method and system of handling queue QoS |
| US20060203730A1 (en) * | 2005-03-14 | 2006-09-14 | Zur Uri E | Method and system for reducing end station latency in response to network congestion |
| US20070097864A1 (en) * | 2005-11-01 | 2007-05-03 | Cisco Technology, Inc. | Data communication flow control |
| US20070237074A1 (en) * | 2006-04-06 | 2007-10-11 | Curry David S | Configuration of congestion thresholds for a network traffic management system |
| CN100550852C (en) | 2007-01-18 | 2009-10-14 | 华为技术有限公司 | A kind of method and device thereof of realizing mass port backpressure |
| KR100875739B1 (en) * | 2007-02-12 | 2008-12-26 | 삼성전자주식회사 | Apparatus and method for packet buffer management in IP network system |
| US9270580B1 (en) | 2009-08-28 | 2016-02-23 | Brocade Communications Systems, Inc. | Method and system for traffic isolation in a network |
| US8885657B2 (en) * | 2009-11-06 | 2014-11-11 | Brocade Communications Systems, Inc. | Automatic switch port selection |
| US8891368B2 (en) * | 2009-11-06 | 2014-11-18 | Brocade Communications Systems, Inc. | Presentation of a selected port |
| US9391849B2 (en) * | 2009-11-06 | 2016-07-12 | Brocade Communications Systems, Inc. | Back pressure remediation |
| US8593964B1 (en) | 2009-11-06 | 2013-11-26 | Brocade Communications Systems, Inc. | Method and system for traffic management |
| JP5498889B2 (en) * | 2010-08-06 | 2014-05-21 | アラクサラネットワークス株式会社 | Packet relay apparatus and congestion control method |
| JP5601193B2 (en) * | 2010-12-22 | 2014-10-08 | 富士通株式会社 | Network relay system, network relay device, congestion state notification method, and program |
| US8897135B2 (en) * | 2012-02-10 | 2014-11-25 | Cisco Technology, Inc. | Recursive load balancing in a loop-free routing topology using routing arcs |
| US9059915B2 (en) | 2012-08-31 | 2015-06-16 | Cisco Technology, Inc. | Multicast replication skip |
| US8958329B2 (en) * | 2012-11-20 | 2015-02-17 | Cisco Technology, Inc. | Fabric load balancing |
| US10122645B2 (en) | 2012-12-07 | 2018-11-06 | Cisco Technology, Inc. | Output queue latency behavior for input queue based device |
| US9628406B2 (en) | 2013-03-13 | 2017-04-18 | Cisco Technology, Inc. | Intra switch transport protocol |
| US9860185B2 (en) | 2013-03-14 | 2018-01-02 | Cisco Technology, Inc. | Intra switch transport protocol |
| US9444748B2 (en) * | 2013-03-15 | 2016-09-13 | International Business Machines Corporation | Scalable flow and congestion control with OpenFlow |
| US9769073B2 (en) * | 2013-04-25 | 2017-09-19 | City University Of Hong Kong | System and method for transmitting data in a network |
| US9350664B2 (en) * | 2013-04-25 | 2016-05-24 | City University Of Hong Kong | System and method for transmitting data in a network |
| US9226292B2 (en) * | 2013-07-17 | 2015-12-29 | Cisco Technology, Inc. | Resilient forwarding of packets in an ARC chain topology network |
| US20160239230A1 (en) * | 2013-08-28 | 2016-08-18 | Hitachi, Ltd. | Storage system and method for controlling storage system |
| CN105227482B (en) * | 2015-09-07 | 2018-07-10 | 北京百度网讯科技有限公司 | Method for limiting speed and device based on TCP connection |
| US10833998B2 (en) * | 2017-01-12 | 2020-11-10 | Marvell Israel (M.I.S.L) Ltd. | Method and apparatus for flow control |
| CN113098785B (en) * | 2021-03-31 | 2022-05-27 | 新华三信息安全技术有限公司 | Message processing method and device |
| CN113132930B (en) * | 2021-04-16 | 2023-04-18 | 芯翼信息科技(南京)有限公司 | Internet of things control method, system, equipment and storage medium |
Family Cites Families (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2860661B2 (en) * | 1989-03-14 | 1999-02-24 | 国際電信電話 株式会社 | ATM switch |
| US5253248A (en) * | 1990-07-03 | 1993-10-12 | At&T Bell Laboratories | Congestion control for connectionless traffic in data networks via alternate routing |
| JPH04309038A (en) * | 1991-04-05 | 1992-10-30 | Mitsubishi Electric Corp | Congestion control system in packet exchange network |
| AU647267B2 (en) * | 1991-05-07 | 1994-03-17 | Fujitsu Limited | Switching node in label multiplexing type switching network |
| US5367523A (en) * | 1993-08-26 | 1994-11-22 | International Business Machines Corporation | Adaptive rate-based congestion and flow control in packet communications networks |
| US5457687A (en) * | 1993-09-02 | 1995-10-10 | Network Equipment Technologies, Inc. | Method and apparatus for backward explicit congestion notification (BECN) in an ATM network |
-
1993
- 1993-12-22 JP JP32498993A patent/JP2639335B2/en not_active Expired - Lifetime
-
1994
- 1994-12-21 DE DE1994630183 patent/DE69430183T2/en not_active Expired - Lifetime
- 1994-12-21 EP EP19940120315 patent/EP0661851B1/en not_active Expired - Lifetime
- 1994-12-21 CA CA 2138695 patent/CA2138695C/en not_active Expired - Fee Related
-
1996
- 1996-04-29 US US08/636,274 patent/US5719853A/en not_active Expired - Lifetime
Also Published As
| Publication number | Publication date |
|---|---|
| EP0661851A3 (en) | 1995-12-27 |
| DE69430183D1 (en) | 2002-04-25 |
| EP0661851B1 (en) | 2002-03-20 |
| US5719853A (en) | 1998-02-17 |
| JPH07183886A (en) | 1995-07-21 |
| CA2138695A1 (en) | 1995-06-23 |
| JP2639335B2 (en) | 1997-08-13 |
| DE69430183T2 (en) | 2002-07-18 |
| EP0661851A2 (en) | 1995-07-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CA2138695C (en) | Congestion control method in atm network | |
| EP0907300B1 (en) | Buffer controller incorporated in asynchronous transfer mode network for changing transmission cell rate depending on duration of congestion | |
| US5936939A (en) | Digital network including early packet discard mechanism with adjustable threshold | |
| Yang et al. | A taxonomy for congestion control algorithms in packet switching networks | |
| US6741553B1 (en) | Method and system for protecting virtual traffic in a communications network | |
| US5319638A (en) | Link-by-link congestion control for packet transmission systems | |
| US5377327A (en) | Congestion avoidance scheme for computer networks | |
| EP1467525B1 (en) | A method of controlling flow of the ethernet data in a synchronous data hierarchy transmission network | |
| EP0688481B1 (en) | Device and method for atm end system cell flow regulation | |
| US5193151A (en) | Delay-based congestion avoidance in computer networks | |
| CA1227555A (en) | Adaptive preferential flow control for packet switching system | |
| US5737311A (en) | Failure detection method in a communication channel with several routes | |
| JPH0662042A (en) | Improvement regarding data transmission system | |
| EP0800294A1 (en) | Method to control data flow rate, queuing network node and packet switching network | |
| US5787073A (en) | ATM cell rate control with transmission priority given to control cells for quick response to network congestion | |
| KR19990063521A (en) | Frame relay-ATM interface circuit and its operation method | |
| Ohsaki et al. | Analysis of rate-based congestion control algorithms for ATM networks. 1. Steady state analysis | |
| JPH11239163A (en) | Inter-lan flow control method and switch | |
| Chu et al. | On‐board closed‐loop congestion control for satellite‐based packet‐switching networks | |
| Liu et al. | Nested threshold cell discarding with dedicated buffers and fuzzy scheduling | |
| KR0146764B1 (en) | Equipment and method for control of abr service by managing buffer using multi stage critical value | |
| Palais et al. | Multichannel buffer insertion ring LAN | |
| JP3203610B2 (en) | Cell flow control device | |
| Tufail et al. | ABR congestion control schemes and the multicast problem | |
| Bhardwaj et al. | ISDN frame relay and its congestion control |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| EEER | Examination request | ||
| MKLA | Lapsed |