Method and unit for control of communication

Details Method and unit for control of communication Method and unit for control of communication

2000-10-24

2004-08-03

Chin, Wellington (Department: 2664)

Multiplex communications

Data flow congestion prevention or control

Control of data admission to the network

C370S235000

Reexamination Certificate

active

06771599

ABSTRACT:

BACKGROUND OF THE INVENTION
1) Field of the Invention
The present invention relates to a communication control method and unit for use in communication systems such as an ATM network.
2) Description of the Related Art
In the recent years, in an ATM (Asynchronous Transfer Mode) network in which a packet of a fixed length (53 bytes), called “cell”, is transmitted through a plurality of connections (virtual channels), there has arisen a requirement for the realization of a service which guarantees the minimum bandwidth (MCR; Minimum Cell Rate) and limits the maximum bandwidth (PCR; Peak Cell Rate) at every connection.
For this requirement to reach satisfaction, there has been proposed a communication control device disclosed in Japanese Unexamined Patent Publication No. (HEI) 11-239151. A detailed description will be given hereinbelow of this device for a comparison with the present invention and for a abetter understanding of the invention (where a portion of the terms differ therefrom).
This device includes a buffer and a connection retrieval table. The buffer is for storing an inputted cell in the corresponding partition (storage section) in accordance with the connection identification information contained in the same cell.
The connection retrieval table is constructed with an associative memory (content addressable memory, which will be called “CAM” for short). In this connection retrieval table, not only a lower-limit throughput MCR corresponding to the minimum bandwidth to be ensured is stored according to connection, but also a result (PCR−MCR) of a subtraction of the aforesaid MCR from an upper-limit throughput PCR corresponding to the maximum bandwidth is stored for limiting the maximum bandwidth, and even a buffer flag is stored which is representative of whether or not a cell(s) exists in the buffer, according to partition, i.e., connection.
This connection retrieval table additionally contains the numbers of first and second remaining cells. The number of first remaining cells decreases by one whenever cell transmission takes place in a state where the foregoing lower-limit throughput MCR constitutes its initial value, while the number of second remaining cells decreases by one at every cell transmission after the number of first remaining cells reaches zero in a state where the aforesaid (PCR−MCR) forms its initial value. The number of first remaining cells is representative of how many cells remain to be transmitted for ensuring the minimum bandwidth, while the number of second remaining cells is indicative of how many transmittable cells remain for limiting the maximum bandwidth.
The retrieval of the above-mentioned connection retrieval table is made through the use of a CAM: retrieval facility according to the round robin control method. First, a retrieval is made on the basis of the content of the number of first remaining cells >1 and the buffer flag =1, and a cell is transmitted from the partition corresponding to the hit connection. On the other hand, if a round of all the connections is made while still hitting no connection on the basis of the aforesaid contents, then a retrieval is further done by the content of the number of second remaining cells >1 and the buffer flag =1, and a cell is sent out from the partition corresponding to the hit connection. Nevertheless, if this content also does not produce the hit on a connection, an idle cell is sent out in this case.
With the above-mentioned retrieval, until the lower-limit throughput is reached with respect to all the connections, if the cell to be transmitted exists, the transmission of cells exceeding the lower-limit throughout is inhibited, thereby ensuring the minimum bandwidth on all the connections. In addition, in the case of the connections in which the number of transmitted cells reaches the upper-limit throughput, the cell transmission from a buffer is inhibited, which can limit the maximum bandwidth.
Incidentally, the above-described Publication additionally discloses a unit in which a flag is stored in place of the number of second remaining cells to make a retrieval efficiently.
However, although the unit disclosed in the Publication can achieve the minimum bandwidth guarantee and the maximum bandwidth restriction according to connection (user), difficulty is encountered in allocating the extra-bandwidth, exceeding the lower-limit throughput for each connection, in accordance with the volume of user's contract band. That is, the extra-bandwidth before the maximum bandwidth restriction is equally used for all the connections, which signifies that difficulty is experienced in allocating the extra-bandwidth in accordance with the user's contract band volume.
SUMMARY OF THE INVENTION
In accordance with a first aspect of the present invention, there is provided a communication control method of once storing fixed-length packets in corresponding storage sections in accordance with connection information contained in the packets and of then transmitting the packets from the storage sections in succession, the method comprising the steps of setting a lower-limit throughput corresponding to a minimum bandwidth to be ensured, an upper-limit throughput corresponding to a maximum bandwidth to be limited, and at least one intermediate throughput between the lower-limit throughput and the upper-limit throughput; counting the number of packets transmitted for each of connections, and monitoring whether or not a packet to be transmit ted exists in the storage section, for each of the connections; retrieving a connection, satisfying a first condition that the number of transmitted packets does not reach the lower-limit throughput and the packet to be transmitted exists in the corresponding storage section, with first priority, and further, if no hit connection exists under the first condition; retrieving a connection satisfying a second connection that the number of transmitted packets does not reach the intermediate throughput and the packet to be transmitted exists in the corresponding storage section, and still further, if no hit connection exists under the second condition, retrieving a connection satisfying a third connection that the number of transmitted packets does not reach the upper-limit throughput and the packet to be transmitted exists in the corresponding storage section; if a hit connection is present under any one of the first to third conditions, transmitting the packet from the storage section corresponding to the hit connection and terminating one-time retrieval, while if no hit connection exists under each of the first to third conditions, terminating one-time retrieval without conducting the packet transmission from the storage section and then resuming the retrieval at the connection satisfying that the number of transmitted packets does not reach the lower-limit throughput; and during the repetition of the retrieval, stopping the packet transmission for a connection where the number of transmitted packets reaches the upper-limit throughput.
In this case, the connection retrieval is made in a predetermined sequence, and the following retrieval resumes at a connection subsequent to the hit connection. Furthermore, a control cycle of a predetermined time period is set so that the retrieval is made more-than-one times in the control cycle, and the number of packets transmitted is counted according to connection in the control cycle, and whenever the control cycle starts newly, the count value of packets transmitted is cleared, before the counting resumes.
It is also appropriate that a plurality of intermediate throughputs are set as the intermediate throughput between the lower-limit throughput and the upper-limit throughput, and in the retrieval, a connection satisfying the first condition that the number of transmitted packets does not reach the lower-limit throughput and the packet to be transmitted exists in the corresponding storage section is retrieved with first priority, and if no hit connection exists under the first condition, the connec

Affiliated with

Also associated with

Rating

Method and unit for control of communication does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Method and unit for control of communication, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and unit for control of communication will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3358337