Congestion processing mode and congestion processing circuit in frame relay exchange apparatus

• US 5,446,733 A
• Filed: 02/04/1994
• Issued: 08/29/1995
• Est. Priority Date: 03/22/1993
• Status: Expired due to Fees

• Current Assignee: Fujitsu Limited
• Original Assignee: Fujitsu Limited
• Inventors: Tsuruoka, Tetsumei
• Primary Examiner(s): Chin, Wellington
• Application Number:
  US08/191,816
• Time in Patent Office: 571 Days
• Field of Search: 370/13, 370/17, 370/60, 370/60.1, 370/94.1, 370/94.2, 370/67, 371/20.1
• US Class Current: 370/232
• CPC Class Codes: H04L 12/2854 Wide area networks, e.g. public data networks

Abstract

A frame relay exchange apparatus which accommodates a plurality of subscriber lines and relay lines and transmits the frames received from these lines to a destination line, constituted so as to measure the amount of communication data for every PVC line along with an elapsed time and so as to calculate the limiting coefficient α varying in accordance with the degree of the queue length of the transmission queue. When the measured amount of communication data exceeds the upper limit value of the terms of subscription of communication of the respective subscribing PVC lines, that upper limit value is changed to a reference value limited by the limiting coefficient α, and then a frame discard operation and advance notification are performed. By this, the PVC performing communication within the range of the terms of subscription of communication is protected from unjust limitation from another PVC performing communication exceeding this, while utilizing the resources inside the switching network to the maximum level.

Claims

1. A congestion processing mode in a frame relay exchange apparatus which accommodates a plurality of subscriber lines and relay lines and transmits frames received from these lines to destination lines, wherein

an amount of communication data of each assigned connection is individually measured along with an elapsed time;

at a point of time when each of said frames received from said subscriber lines and relay lines is subjected to switching processing in said frame relay exchange apparatus, a coefficient for limiting the amount of communication data, and determined in accordance with the magnitude of the load of a network resource utilized by a connection to which the related frame belongs, is calculated along with an elapsed time;

based on the aforesaid measured amount of communication data, said limiting coefficient is multiplied with the upper limit value of an acceptable amount of communication data for each assigned connection detected to perform a communication exceeding the upper limit value of the acceptable amount of communication data which is determined in advance for each assigned connection, and it is decided whether to discard said frame belonging to the related assigned connection or give notification that it exists in the congested state based on that limited upper limit value.

2. A congestion processing mode in a frame relay exchange apparatus as set forth in claim 1, wherein said upper limit value of said acceptable amount of communication data determined in advance for every assigned connection is determined by an excessive burst amount (B_e) and, further, the amounts of communication data of said frames transferred onto each assigned connection within a constant period are cumulatively added, whereby the amount of communication data for every assigned connection is measured.

3. A congestion processing mode in a frame relay exchange apparatus as set forth in claim 2, wherein two different types of a first upper limit value and second upper limit value are set as said upper limit values of said acceptable amount of communication data determined in advance for every assigned connection, said first upper limit value is determined by said excessive burst amount, and said second upper limit value is determined by the committed burst amount (B_c).

4. A congestion processing mode in a frame relay exchange apparatus as set forth in claim 1, wherein said upper limit value of said acceptable amount of communication data determined in advance for every aforesaid assigned connection is determined using the excessive information rate as the criterion and, at the same time, the amount of communication data for every assigned connection is measured using the difference between the cumulative amount of communication data cumulatively added every time when the aforesaid frame arrives and the virtual amount of communication data deemed to have been transmitted through every aforesaid assigned connection along with an elapsed time.

5. A congestion processing mode in a frame relay exchange apparatus as set forth in claim 4, wherein two different types of the first upper limit value and the second upper limit value are set as the aforesaid upper limit values of the aforesaid acceptable amount of communication data determined in advance for every aforesaid assigned connection, said first upper limit value is determined using the aforesaid excessive information rate as the criterion, and said second upper limit value is determined using the committed information rate as the criterion.

6. A congestion processing mode in a frame relay exchange apparatus as set forth in claim 1, wherein said network resource is the destination line of said frame, and, as said limiting coefficient, use is made of a value respectively set large or small in accordance with the degree of the queue length of the transmission queue provided in that line.

7. A congestion processing mode in a frame relay exchange apparatus as set forth in claim 1, wherein said network resource is the destination line of said frame, and, as said limiting coefficient, use is made of a value respectively set large or small in accordance with the degree of the queue length of the transmission queue set in that line, and further set to a different value in accordance with the transmission rate of that line.

8. A congestion processing circuit in a frame relay exchange apparatus which accommodates a plurality of subscriber lines and relay lines and transmits frames received from these lines to destination lines, wherein

the aforesaid frame relay exchange apparatus comprises a plurality of line accommodation units corresponding to said subscriber lines and relay lines and a common bus inter-connecting these line accommodation units;

each said line accommodation unit includes a bus transmission unit outputting the frames to the aforesaid common bus, a bus receiving unit receiving as its input the aforesaid frames from said common bus, a receiving buffer which temporarily stores the aforesaid frames received from a corresponding aforesaid line and outputs the same to said bus transmission unit, and a transmission buffer which temporarily stores said frames input via said bus receiving unit and transmits the same to the corresponding aforesaid line; and

wherein said congestion processing circuit comprises a utilization measuring unit which monitors said frame output from said receiving buffer, individually measures the amount of communication data for each assigned connection along with an elapsed time, calculates said amount of communication data taking a limiting coefficient set in accordance with the magnitude of the transmission load of the aforesaid line accommodation unit corresponding to the destination line of said frame into consideration, and controls the transmission of the aforesaid frame from said bus transmission unit in accordance with that calculated amount of communication data; and

a load condition decision unit which monitors the amount of communication data of the aforesaid frame input and output to and from said transmission buffer, generates said limiting coefficients, and supplies that generated limiting coefficient via the aforesaid common bus to said utilization measuring unit mounted in another one of the line accommodation units which unit is to be connected as the destination line with the related line accommodation unit.

9. A congestion processing circuit as set forth in claim 8, wherein said load condition decision unit holds various types of said limiting coefficients corresponding to the amount of communication data stored in the said transmission buffer as tables.

10. A congestion processing circuit as set forth in claim 8, wherein the aforesaid utilization measuring unit includes

utilization-information tables allotted for every aforesaid assigned connection, holding the use condition where each said assigned connection utilizes the related frame relay switching network,

a timer means which is arranged at the input and output of the aforesaid receiving buffer for observing the aforesaid elapsed time which is one of the types of information held in the aforesaid utilization-information table;

and

a subtracter which calculates the difference between the arrival time of the aforesaid frame arriving immediately before this time held in the aforesaid utilization-information tables and the arrival time of the aforesaid frame which now arrives, observed by said timer means, and

when the aforesaid frame is output from the aforesaid receiving buffer, the assigned connection identifier attached to said frame is detected to select a corresponding table from among the aforesaid plurality of utilization-information tables.

11. A congestion processing circuit as set forth in claim 8, wherein provision is further made of a second utilization measuring unit identical to the aforesaid utilization measuring unit;

said second utilization measuring unit decides that the related assigned connection is in the congestion state based on the aforesaid amount of communication data taking the second limiting coefficient applying a weaker limitation than that of the aforesaid limiting coefficient into consideration, and marks that congestion notification in the transmission and reception frames passing through the related line accommodation unit.

12. A congestion processing circuit as set forth in claim 11, wherein a common utilization measuring unit is mounted which includes the aforesaid utilization measuring unit and is commonly used via the aforesaid common bus by a plurality of aforesaid line accommodation units.

13. A congestion processing circuit as set forth in claim 12, wherein an identifier conversion table is provided for converting an assigned connection identifier inside each aforesaid line accommodation unit, which table reconverts each said converted assigned connection identifier to mutually different set-up connection identifiers so that the assigned connection identifiers of the reception frames input to said frame relay exchange apparatus do not coincide with each other, and access to the aforesaid common utilization measuring unit is carried out by said converted identifier.

14. A congestion processing circuit as set forth in claim 11, wherein a second common utilization measuring unit is mounted which includes both the aforesaid utilization measuring unit and the aforesaid second utilization measuring unit and is commonly used via the aforesaid common bus by a plurality of aforesaid line accommodation units.

15. A congestion processing circuit as set forth in claim 13, wherein an identifier conversion table is provided for converting an assigned connection identifier inside each aforesaid line accommodation unit, which table reconverts each said converted assigned connection identifier to mutually different assigned connection identifiers so that the assigned connection identifiers of the reception frames input to said frame relay exchange apparatus do not coincide with each other, and access to the aforesaid second common utilization measuring unit is carried out by said converted identifier.

16. A congestion processing circuit as set forth in claim 11, wherein the computation at the aforesaid second utilization measuring unit for performing the marking of the aforesaid congestion notification with respect to each the aforesaid frame is executed at the point of time when the related frame is output from the aforesaid transmission buffer.