JP2001156784A - Band sharing circuit - Google Patents

Abstract

PROBLEM TO BE SOLVED: To realize impartial excess band assignment between other connections with different priority even when a connection requiring momentary simultaneous transfer of large capacity data with priority is in existence. SOLUTION: A longest assignment time interval of a connection that is classified into a class whose minimum band assignment is warranted is selected to be a setting value or below depending on the minimum band of this connection and on a time fluctuation permissible value of band fluctuation permitted for this connection.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention is used for a circuit for fairly allocating a bandwidth to each connection when one output route is shared by a plurality of connections. In particular, it is suitable for use when connections of service classes having different priorities coexist.

[0002]

2. Description of the Related Art A bandwidth sharing circuit is a circuit for fairly allocating a bandwidth to each connection when a plurality of connections share a network virtual path shaped by one output route or a single shaper. Conventional band sharing circuits, for example, as described in the literature "A study of a shared band control method that can guarantee the minimum band", Masanobu Kobayashi et al., IEICE Technical Report SSE97-92pp.99-104, 1997 WRR (weighted roundrobi) which allocates bandwidth cyclically according to a certain weight without priority
n) A shared bandwidth circuit that allocates a bandwidth to each connection according to a method (first means), or a shared bandwidth circuit having a class buffer in which a bandwidth is always allocated to a high-priority connection and only the remaining bandwidth is allocated to a low-priority connection. Only (second means) is considered.

[0003]

[0005] Here, it is desired to transfer a large amount of data instantaneously and collectively not intermittently but intermittently, and ATM Forum Traffic Management Speech.
cification 4.1 As stated in GFR (guaranteed frame rate) as described in 4.1, if there is room in the line bandwidth, traffic that uses the surplus bandwidth should be accommodated in each connection and shared. Is assumed. In this case, the first means of the prior art cannot prioritize the connection to which the instantaneous batch transfer of large-capacity data is assigned. Also, in the second means, since the connection to which the instantaneous batch transfer of large-capacity data is always given priority, if the connection sends data continuously rather than intermittently, the bandwidth for the connection accommodating the GFR traffic will be reduced. And the connection becomes unfair (hereinafter, a connection accommodating GFR traffic is referred to as a GFR connection).

As described above, in the conventional bandwidth sharing circuit, no consideration has been given to a fair bandwidth allocation when there are mixed connections for instantaneous batch transfer of large amounts of data.

The present invention has been made in such a background, and even if there is a connection that transfers large-volume data instantaneously and collectively preferentially, the minimum bandwidth of another connection of a different priority and the connection concerned It is an object of the present invention to provide a bandwidth sharing circuit that guarantees an allocated bandwidth and a longest allocation interval according to a time variation allowable amount of allocation allowed and realizes fair surplus bandwidth allocation between connections.

[0006]

SUMMARY OF THE INVENTION The present invention comprises means for allocating the same output route bandwidth to a plurality of connections having different priorities, wherein the connection comprises a predetermined allocated bandwidth or an allocated time or an allocated number of times. And a combination thereof is classified into a first class in which a surplus band is assigned with the highest priority and a second class in which assignment of a minimum band is guaranteed.

Here, a feature of the present invention is characterized in that the allocating means is configured such that the longest allocation time interval of the connection classified into the second class is the minimum bandwidth of this connection and the allocation of the allocation allowed for this connection. An assignment means for setting a value equal to or less than a set value corresponding to the time variation allowable amount is included.

[0008] Thus, even if there is a connection for transferring large-capacity data instantaneously and collectively preferentially, it is possible to realize a fair surplus bandwidth allocation among other connections of different priorities.

At this time, it is preferable that a lower limit is set for the bandwidth allocation interval to the connection classified into the second class.

The allocating means includes a cell storage means for storing incoming cells for each connection, a plurality of weight means for describing a read weight for each connection and having different weights, and a plurality of weight means. Selecting means for selecting a weight means to be used; means for reading cells from the cell storage means in a weighted round robin manner in accordance with the weight of each connection described in the weight means selected by the selecting means; Counting means for counting the number of read cells of the read connections belonging to the first class; initialization means for returning the count value of the counting means and the selection of the weight means selected by the selection means to an initial state; Wherein the counting means has a predetermined Means for transferring the count-up information to the selection means when counting up to the value, the selection means includes means for re-selecting the weight means to be used according to the count-up information, and the initialization means Means for executing the initialization with a trigger after either the lapse of a certain time after the recognition of the count-up information or the execution of the cyclic reading by the reading means for a certain number of times or the allocation of a predetermined band to the connection belonging to the second class. May be included.

Alternatively, the allocating means may include a cell storing means for storing incoming cells for each connection, and a read weight for each connection, and the weight may be reduced in a one-to-one correspondence with the cell read of the corresponding connection. Weighting means for re-adding weights when there are no cells to be read in a connection where weighting remains,
Issuing means for issuing a weight to the weighting means, and token pooling means for holding a predetermined amount of tokens to be consumed corresponding to the weighting to be added when the issuing means adds the weighting to the weighting means. A configuration comprising stacking means for stacking tokens at regular intervals in the token pool means, and means for reading cells from the cell storage means in a weighted round robin manner in accordance with the weight of each connection described in the weight means. You can also.

As described above, by providing the counting means, the token pool means, and the stacking means, it is possible to continuously allocate a band by a fixed number of cells. Further, since the weight means may be single, the circuit scale of the weight means can be reduced.

Further, the allocating means includes a cell storing means for storing incoming cells for each connection, a plurality of weighting means for describing a read weight for each connection and having different weights, and a plurality of weighting means. Selecting means for selecting a weight means to be used; input band observing means for observing that a cell arrival band of a connection belonging to the first class reaches a predetermined band, and notifying the selecting result of the observation result; Means for counting the number of times the weight means that prioritizes the connection belonging to the first class by means is selected by a predetermined observation period unit; and weighting of each connection described in the weight means selected by the selection means. A cell from the cell storage means according to A reading means and a period in which the selecting means selects the wait means which prioritizes the connection belonging to the first class by a certain period of time or by performing a cyclic reading by the reading means for a certain number of times to perform a predetermined selecting period. Elapsed time observing means for changing the weight means that is selected to exceed the time limit, the selecting means, when the count value within a predetermined observation period by the number counting means does not exceed a predetermined count value In accordance with the notification by the input band observation means, select a weight means to give priority to the connection belonging to the first class, and select the weight means until a predetermined observation period observed by the elapsed time observation means elapses. May be included.

Thus, the number of times of counting can be reduced, so that the circuit scale of the counting means can be reduced.

Further, the allocating means includes a cell storing means for storing incoming cells for each connection, a weighting means for describing a read weight for each connection, and a weighting method for each connection described in the weighting means. Means for reading cells from the cell accumulating means in a weighted round robin manner, counting means for counting the number of input cells or the number of read cells of connections belonging to the first class read by the reading means, and the counting means Initialization means for returning the count value to the initial state, and input restriction means for restricting the input according to the count value of the count means, and when the count means counts to a set predetermined value, the count is performed by the count means. Information is passed to the input restriction means. The input restriction means includes means for starting input restriction in accordance with the count-up information, and the initialization means includes means for reading out a predetermined time or a certain number of times after recognizing the count-up information. It is also possible to adopt a configuration that includes means for executing the initialization by using either a cyclic reading execution or a predetermined bandwidth allocation to the connection belonging to the second class as a trigger.

As described above, it is possible to provide a configuration in which the memory capacity of the cell storage means is reduced by providing the input restriction means.

Further, the allocating means includes a cell storing means for storing incoming cells for each connection, and a read weight for each connection, wherein the weight is reduced in one-to-one correspondence with the cell read of the corresponding connection. Weighting means for re-adding weights when there are no cells to be read out in a connection with remaining weights, issuing means for issuing weights to the weighting means, and the number of cells read out of connections belonging to the first class Alternatively, token pool means for holding tokens consumed corresponding to the number of input cells with a predetermined amount as an upper limit, stacking means for stacking tokens in the token pool means at regular intervals, and tokens held in the token pool means Input limiting means for limiting the cell input of the connection in case of shortage; It may be configured to include a means for reading a cell in the weighted round-robin fashion from the cell storing means in accordance with the connection weights listed in weight means.

Thus, it is possible to reduce the memory capacity of the selection means for selecting the weight means and the cell storage means.

The allocating means includes a cell storing means for storing incoming cells for each connection, a plurality of weighting means for describing a read weight for each connection and having different weights, and a plurality of the weighting means. Selection means for selecting the weight means to be used, and input band observation means for observing that the arrival band of the cell of the connection belonging to the first class reaches a predetermined band and notifying the observation result to the selection means, Number counting means for counting the number of times the weight means that prioritizes the connection belonging to the first class selected by the selection means in units of a predetermined observation period, and each connection described in the weight means selected by the selection means A cell from the cell storage means according to the weighting of The period in which the reading means is selected by the reading means and the weighting means which prioritizes the connection belonging to the first class by the selecting means is measured by elapse of a predetermined time or by performing the cyclic reading by the reading means a predetermined number of times, and Elapsed time observation means for changing the weight means selected when the selection period is exceeded, and execution of cyclic reading by the reading means after a certain time or a certain number of times in the predetermined observation period unit or selection by the number counting means Input limiting means for limiting the cell input of the connection when the total value of the period during which the weight means that prioritizes the connection belonging to the first class measured by the number of times is selected exceeds a predetermined value, The input restriction means includes a means for releasing the input restriction after a predetermined observation period has elapsed. It can also be configured.

As a result, the bandwidth can be allocated stepwise. In addition, the circuit size of the counting means and the memory capacity of the cell storage means can be reduced.

[0021] It is also possible to provide an issuance restriction means for restricting the issuance of the issuance means. Alternatively, a configuration may be provided that includes a weighted round robin readout restricting unit that limits the circulation of the reading unit.

Thus, for example, if the maximum bandwidth allowed for the second class of connections is 2 Mbps, the limiting means restricts the issuance of the weight at once in a minimum of 20 cell times, thereby allowing 2M since the connection interval of the connection of the class is once every 20 cells.
bps can be realized.

In addition, a configuration may be adopted in which read limiting means for limiting reading by the reading means is provided instead of the input limiting means.

As described above, by providing the read restricting means for suppressing reading instead of the input restricting means for actively discarding cells, the risk of retransmission due to discarding can be reduced.

[0025]

DESCRIPTION OF THE PREFERRED EMBODIMENTS The configuration of an embodiment of the present invention will be described with reference to FIG. FIG. 1 is a block diagram of a band sharing circuit according to an embodiment of the present invention.

The present invention is a means for assigning the same output route bandwidth to a plurality of connections having different priorities.
An R unit 4 is provided, wherein the connection has a first class in which a surplus bandwidth is assigned with the highest priority up to any one or a combination of a predetermined assigned bandwidth to be set, an assigned time, and the number of assignments, and an assignment of a minimum bandwidth. This is a band sharing circuit that is classified into a guaranteed second class.

Here, the feature of the present invention is that W
The RR unit 4 allocates the longest allocation time interval of the connection classified into the second class below a set value according to the minimum bandwidth of the connection and the allowable time variation of the allocation allowed for this connection. In the following description, the first class of connection corresponds to a connection to which instantaneous batch transfer is assigned, and is hereinafter referred to as an instantaneous batch transfer connection. The second class is the aforementioned G
Corresponds to FR connection.

(First Embodiment) A first embodiment of the present invention will be described with reference to FIG. In the first embodiment of the present invention, a plurality of cell storage units 1-1 to 1-3 for each connection, a plurality of weight units 2-1 to 2-2 for describing read weights for each connection, and a plurality of these weight units Selection section 3 for selecting weight section 2-1 or 2-2 to be used from 2-1 to 2-2
In accordance with the weight of each connection described in the weight unit 2-1 or 2-2 selected by the selection unit 3, the cells from the cell storage units 1-1 to 1-3 are WRR.
A WRR unit 4 that reads out data by the method, a counting unit 5 that counts the number of cells read out of the instantaneous batch transfer connection read by the WRR unit 4, an initial value that returns the count value of the counting unit 5 and a selection result of the selection unit 3 to an initial value. And a conversion unit 6.

When the counting unit 5 counts up to the set predetermined value, the counting unit 5 transfers the count-up information to the selecting unit 3, and the selecting unit 3 determines whether the weight unit 2-1 or 2-2 to be used is to be used. Select again. The initialization unit 6 recognizes the count-up information from the counting unit 5, and the initialization is triggered by either the lapse of a certain time or the certain number of times by the WRR unit 4 executing cyclic reading or giving a band to a GFR connection of a certain band as a trigger. Execute.

Here, one instantaneous batch transfer connection and G
Accommodates 10 FR connections, 40Mb shared bandwidth
ps, average bandwidth of instantaneous batch transfer connection is 4Mbp
The operation will be described by taking as an example the case where the number of continuous transfer blocks in S is 1000 cells and the guaranteed bandwidth of the GFR connection is 1 Mbps. Here, two weight parts 2-
Use 1 and 2-2. The weight value indicating the weight of each connection in the weight unit 2-1 is 30 for the instantaneous batch transfer connection, and 1 for the GFR connection.
And If the weight unit 2-1 is selected and if there are sufficient cells in both connections, the total value of the weights of all the connections is 40, so the instantaneous batch transfer connection: 40 Mbps * 30 [weighting] / (10 + 30 [weighting] ) = 30 Mbps GFR connection: 40 Mbps * 1 [weight] / (10 + 30 [weight]) = 1 Mbps, and the guaranteed bandwidth of the GFR connection can be guaranteed. Also, in this case, the cells of the GFR connection can be transferred at intervals of 40 cells, so the CDV (Cell Delay Variation) of the cell delay variation amount
Do not overlap.

The weight of the weight unit 2-2 is such that the instantaneous batch transfer connection is 0 and the GFR connection is 1
And If the weight unit 2-2 is selected and if there are sufficient cells in both connections, the total value of the weights of all the connections is 10, so the instantaneous batch transfer connection: 40 Mbps * 0 [weighting] / (0 + 10 [weighting] ) = 0 Mbps GFR connection: 40 Mbps * 1 [weight] / (0 + 10 [weight]) = 4 Mbps

The counting section 5 counts the conduction of 1000 cells in accordance with the continuous transfer block. Since the average bandwidth of the instantaneous batch transfer connection is 4 Mbps, assuming that data for continuous transfer blocks has been transferred, the initialization unit 6 performs initialization 106 ms after the last initialization of the count unit 5.

FIG. 2 shows a schematic diagram of a cell transmitted in this example. In FIG. 2, cells of the instantaneous batch transfer connection are black (hatched), and cells of the GFR connection are outlined. As shown in the figure, a band can be continuously allocated for a fixed number of cells.

In the first embodiment of the present invention, a plurality of weights 2-1 and 2-2 are used. However, the function of a plurality of weights is virtually realized by a single weight capable of setting a plurality of weight values. May be realized.

Further, in the first embodiment of the present invention, since the bandwidth of the GFR connection is a factor which is a factor of the shared bandwidth, the allocated cell interval can always be set to 40 cell intervals or more. If the bandwidth is not the following, for example, if the bandwidth is 0.9 Mbps, the cell interval is 4
The combination of the 0-cell interval and the 41-cell interval is a combination of intervals in such a case that the combination satisfies the time variation allowable amount of the allocation, which is the allowable value of the fluctuation of the cell allocation interval. For example, if the allowable time variation is 10 cells, the 41-cell interval is set to at most once in 10 allocations.

In this manner, the longest allocation interval of the GFR connection can be set to a value according to the setting of the minimum bandwidth of the connection and the allowable time variation.

(Second Embodiment) A band sharing circuit according to a second embodiment of the present invention will be described with reference to FIG. FIG. 3 is a block diagram of a band sharing circuit according to a second embodiment of the present invention. In the bandwidth sharing circuit according to the second embodiment of the present invention, the readout weight is described for each connection with the cell storage units 1-1 to 1-3 for each connection, and the weight is reduced one-to-one for the cell readout of the corresponding connection. A weight unit 2 for receiving a weight again when there is no cell to be read in a connection with a remaining weight, an issuing unit 7 for issuing a weight to the weight unit 2, and a weighting unit that assigns a weight to the instantaneous batch transfer connection , A token pool unit 8 for holding tokens to be consumed at the time of issuance at a predetermined amount as an upper limit, a stacking unit 9 for stacking tokens in the token pool unit 8 at regular intervals, and a connection unit for each connection described in the weight unit 2. The WRR unit 4 reads cells from the cell storage units 1-1 to 1-3 according to the weighting in a WRR manner.

Here, the operation will be described using the same example as the first embodiment of the present invention. Here, one weight unit 2 is used, and the weight of the weight unit 2 is 30 for the instantaneous batch transfer connection and 1 for the GFR connection. In the weight unit 2, if there are sufficient cells in both connections, the total value of the weights of all the connections is 40. Therefore, instantaneous batch transfer connection: 40 Mbps * 30 [weighting] / (10 + 30 [weighting]) = 30 Mbps GFR Connection: 40 Mbps * 1 [weight] / (10 + 30 [weight]) = 1 Mbps, and the guaranteed bandwidth of the GFR connection can be guaranteed.

The issuing unit 7 unconditionally issues a weight to the GFR connection, and for the instantaneous batch transfer connection, as long as the amount of tokens is present, the weight value in the weight unit 2 of the instantaneous batch transfer connection is changed. Issue only the amount used before issuance so as not to exceed the predetermined value. The token pool unit 8 has 1000 continuous transfer blocks.
Since it is a cell, it is set to 1000 cells. Since the average bandwidth is 4 Mbps, the stacking unit 9 stacks one cell every 106 μsec. In the second embodiment of the present invention, the same assignment as in the first embodiment of the present invention is possible.

Further, in the second embodiment of the present invention, since the plurality of weights 2-1 and 2-2 need not be used as in the first embodiment of the present invention, the size of the weights can be reduced. it can.

(Third Embodiment) The band sharing circuit according to the third embodiment of the present invention has the same block configuration as that of the band sharing circuit according to the second or seventh embodiment of the present invention shown in FIG. 3 or FIG. The difference between the third embodiment of the present invention and the second embodiment of the present invention is that the issuing unit 7
Issuance restriction means for restricting the issuance of the weight. Although the illustration of the issue restricting means is omitted, it is provided inside the issuing unit 7 in the third embodiment of the present invention. Assuming that the maximum bandwidth permitted by the GFR connection is 2 Mbps, the issuance restriction means restricts the issuance of the weight at least once every 20 cell times, so that the allocation interval of the GFR connection is 2 Mbps.
2M which is the maximum allowable band because it is once in 0 cells
bps can be realized.

When the allowable time variation of the allocation is set at the lower limit of the bandwidth allocation interval, the weight can be issued by permitting the early issue according to the allowable amount.

(Fourth Embodiment) The band sharing circuit according to the fourth embodiment of the present invention has the same block configuration as that of the first or sixth embodiment of the present invention as shown in FIG. 1 or FIG. The difference between the fourth embodiment of the present invention and the first or second or third embodiment of the present invention is that the fourth embodiment has a WRR restricting means for restricting the circulation of the WRR unit 4. Although the illustration of the WRR restricting means is omitted, it is provided inside the WRR unit 4 in the fourth embodiment of the present invention. The WRR limiting unit is a unit that suspends cyclic reading for the GFR connection when the number of read cells per unit time of the GFR connection exceeds a predetermined number of cells.

More specifically, one or both of the existence of a cell waiting for cyclic reading of the connection and the weighting of the connection from a weight unit indicating that the connection is currently subject to cyclic reading or both are masked for a certain period of time. Suspends reading for the connection.

For example, when the number of read cells per unit time is one, and the same setting as in the third embodiment of the present invention,
The WRR unit 4 suspends reading by masking for 20 cell times after reading. If the time variation allowance of the allocation is set at the lower limit of the band allocation interval, the unit time is set so that the number of read cells per unit time is one or more. Alternatively, the WRR restricting means can also give the lower limit of the bandwidth allocation interval by suspending the cyclic reading itself when the reading of the GFR connection exceeds a predetermined value.

(Fifth Embodiment) A band sharing circuit according to a fifth embodiment of the present invention will be described with reference to FIG. FIG. 4 is a block diagram of a band sharing circuit according to a fifth embodiment of the present invention. As shown in FIG. 4, the band sharing circuit according to the fifth embodiment of the present invention includes cell storage units 1-1 to 1-3 for each connection and connections inputted to the cell storage units 1-1 to 1-3. An input band observing unit 11 for observing an input band for each connection, and weight units 2-1 and 2- for describing a read weight for each connection.
2 and a selection unit 3 for selecting a weight unit 2-i (i is 1 or 2) to be used from the weight units 2-1 and 2-2.
And a number counting unit 15 that counts the number of times the weight unit 2-i that gives priority to the instantaneous batch transfer connection by the selection unit 3 is selected in units of a predetermined observation period, and a weight unit 2-i selected by the selection unit 3. According to the weight of each connection described, the cell storage units 1-1 to 1--1
3, a period in which the selection unit 3 selects the weight unit 2-i which gives priority to the instantaneous batch transfer connection by a WRR unit 4 or a certain number of times or cyclic reading by the WRR unit 4 a certain number of times. Waiting part 2 that is measured by execution and selected to exceed the specified observation period
-I for changing the elapsed time observation unit 10.

Here, when the count value within the predetermined observation period does not exceed the predetermined count value by the number counting unit 15, the selection unit 3 sets the weight unit 2-i that gives priority to the instantaneous batch transfer connection. Is deselected, but until the predetermined observation period observed by the elapsed time observation unit 10 elapses, the selection of the weight unit 2-i that gives priority to the instantaneous batch transfer connection is canceled, and the weight unit 2-j that does not give priority is given.
(J is 1 or 2, where j ≠ i). Also,
When the input band observing unit 11 recognizes that the input band of the instantaneous batch transfer connection exceeds the predetermined band by the observation of the input band observing unit 11, the selecting unit 3 gives the wait unit 2-i that gives priority to the instantaneous batch transfer connection within the observation time. Is continuously selected up to a selectable number of times.

Next, the operation of the fifth embodiment of the present invention will be described using the same example as the first embodiment of the present invention. Also in the fifth embodiment of the present invention, two weight portions 2-1 and 2-2 are used. In the fifth embodiment of the present invention, the predetermined observation period for selecting the weight unit 2-i that favors the instantaneous batch transfer connection is defined by the read cycle of the WRR unit 4, the observation time is 33 rotations, and the observation time is 33 rotations. It is set to 105 ms. The upper limit value of the number-of-times counting unit 15 is 3. According to this, during the observation time of 105 ms, the instantaneous batch transfer connection is continuously transferred for 30 cells × 33 rotations × 3 times, that is, only for 999 cells, and the same bandwidth as in the other embodiments of the present invention is obtained. Can be given.

In the fifth embodiment of the present invention, the observation period is set to WRR.
Although it is defined by the reading cycle of the unit 4, when it is defined by the time, it is not necessary to transfer “circular reading execution number information” from the WRR unit 4 to the elapsed time observing unit 10 in the figure.

In the fifth embodiment of the present invention, as compared with the first embodiment of the present invention, only the number of times of selection by the selector 3 can be counted without counting the number of cells of the instantaneous batch transfer connection. Therefore, as compared with the first embodiment of the present invention, there is an effect that the number of counts is reduced to reduce the scale of the count circuit.

(Sixth Embodiment) A band sharing circuit according to a sixth embodiment of the present invention will be described with reference to FIG. FIG. 5 is a block diagram of a band sharing circuit according to a sixth embodiment of the present invention. The band sharing circuit according to the sixth embodiment of the present invention includes cell storage units 1-1 to 1-3.
And a weight unit 2 for describing a read weight for each connection, and a WRR unit for reading cells from the cell storage units 1-1 to 1-3 in a weighted round robin manner in accordance with the weight of each connection described in the weight unit 2. 4
A counting unit 5 for counting the number of input cells or the number of read cells of the instantaneous batch transfer connection read by the WRR unit 4; an input limiting unit 12 for limiting input according to the count value of the counting unit 5; And an initialization unit 6 for returning the input restriction state of the input restriction unit 12 to the initial state.

Here, when the counting section 5 counts up to the set predetermined value, the count section 5 transfers the count-up information to the input limiting section 12 and the input limiting section 1.
Reference numeral 2 denotes an input restriction, and the initialization unit 6 executes the cyclic readout by the WRR unit 4 after a lapse of a predetermined time or a predetermined number of times after recognizing the count-up information by the counting unit 5 or a predetermined operation for a GFR connection of a predetermined band. The initialization is performed by using any of the bandwidth allocations as a trigger. The sixth embodiment of the present invention is different from the first embodiment of the present invention in that it has only a single wait unit 2 but limits input cells by a counting unit 5 that counts cells of an instantaneous batch transfer connection. The operation of the embodiment can be realized.

The band sharing circuit according to the sixth embodiment of the present invention requires only one weight unit 2 in comparison with the band sharing circuit according to the first embodiment of the present invention. It is possible to reduce the memory capacity of -1 to 1-3.

(Seventh Embodiment) A band sharing circuit according to a seventh embodiment of the present invention will be described with reference to FIG. FIG. 6 is a block diagram of a band sharing circuit according to a seventh embodiment of the present invention. As shown in FIG. 6, the band sharing circuit according to the seventh embodiment of the present invention, as shown in FIG. A weighting unit 2 for re-adding weights when there is no cell to be read out to a connection whose weighting has been reduced and the weighting remains, a issuing unit 7 for issuing weights to the weighting unit 2, an instantaneous batch transfer A token pool unit 8 for holding tokens consumed in accordance with the number of read cells or the number of input cells of the connection with a predetermined amount as an upper limit;
The stacking unit 9 for stacking tokens in the token pool unit 8 at regular intervals, the input limiting unit 12 for limiting the cell input of the connection when the token held by the token pool unit 8 runs short, and the weight unit 2 are described. Cell storage unit 1-1 according to the weight of each connection
1-3, and a WRR unit 4 that reads out cells from the cells in a weighted round robin manner.

The difference between the seventh embodiment of the present invention and the second embodiment of the present invention is that the token held by the token pool unit 8 is not associated with the weight value of the weight unit 2 and the number of input cells or the output of the instantaneous batch transfer connection. That is, it is associated with the number of cells. Therefore, the same operation as in the second embodiment of the present invention can be realized while the weight value of the weight unit 2 is fixed. As a result, the number of means for changing the weight value of the weight unit 2 is reduced, and the input is restricted, as in the sixth embodiment of the present invention.
-3 in memory capacity can be reduced.

(Eighth Embodiment) A bandwidth sharing circuit according to an eighth embodiment of the present invention will be described with reference to FIG. FIG. 7 is a block diagram of the bandwidth sharing circuit according to the eighth embodiment of the present invention. As shown in FIG. 7, the bandwidth sharing circuit according to the eighth embodiment of the present invention comprises cell accumulating units 1-1 to 1-3, and weighting units 2-1 and 2-2 for describing weighting of reading for each connection. 2-1 used from the weight units 2-1 and 2-2
Or an input band observing unit 1 that observes that the arrival band of the cell of the instantaneous batch transfer connection reaches a predetermined band and notifies the selecting unit 3 of the observation result.
1 and the number counting unit 15 that counts the number of times the selection unit 3 selects the weight unit 2-1 or 2-2 that gives priority to the instantaneous batch transfer connection in units of a predetermined observation period.
And a WRR unit 4 that reads cells from the cell storage units 1-1 to 1-3 in a weighted round-robin manner in accordance with the weight of each connection described in the weight unit 2-1 or 2-2 selected by the selection unit 3. An input restricting unit 12 for restricting cell input of the instantaneous batch transfer connection;
When it is recognized that the predetermined selection period has been exceeded by elapse of a certain time or measurement of the number of times of cyclic reading performed by the WRR unit 4 for a certain number of times, the weight unit 2-i selected by the selection unit 3 is changed, and within the observation time. When the selection is performed a predetermined number of times, the selection of the weight unit 2-i, which gives priority to the instantaneous batch transfer connection selected according to the notification from the input band observation unit 11, by the selection unit 3 and the input restriction unit 1
And an elapsed time observing unit 10 for starting the input restriction of 2. The stop of the selection of the weight unit 2-i by the selection unit 3 and the input restriction by the input restriction unit 12 are released in the next observation period.

In the eighth embodiment of the present invention, unlike the fifth embodiment of the present invention, the operation of the fifth embodiment of the present invention can be realized by limiting the input cells by the input band of the instantaneous batch transfer connection. In the eighth embodiment of the present invention, as in the sixth and seventh embodiments of the present invention, the memory capacity of the cell storage units 1-1 to 1-3 can be reduced as compared with the first embodiment of the present invention. . In the configuration of the eighth embodiment of the present invention, the bandwidth can be allocated stepwise. Furthermore, since the input limiting unit 12 is disposed after the input band observing unit 11 when viewed from the traveling direction of the cell, it is possible to prevent the observing operation of the input band observing unit 11 from being hindered by the limiting operation of the input limiting unit 12. be able to. Therefore, since the delay due to the observation of the change in the band can be reduced, the memory capacity of the cell storage units 1-1 to 1-3 can be further reduced as compared with the case where the input limiting unit 12 is arranged before the input band observing unit 11. can do.

Ninth Embodiment A ninth embodiment of the present invention will be described with reference to FIGS. 8, 9 and 10. FIG.
FIGS. 8, 9, and 10 are block diagrams of a band sharing circuit according to a ninth embodiment of the present invention. The band sharing circuit of the ninth embodiment of the present invention is different from the block limiting circuit 12 (FIGS. 5, 6 and 7) of the band sharing circuit of the sixth, seventh and eighth embodiments of the present invention in that: As shown in FIGS. 8, 9, and 10, a read suppressing unit 13 that suppresses reading by the WRR unit 4
It is to have. Since reading is suppressed instead of the input restricting unit 12 that actively discards cells, the risk of retransmission due to discarding is smaller than in the seventh and eighth embodiments of the present invention.

[0059]

As described above, according to the present invention,
Even if there is a connection that transfers large-capacity data instantaneously and collectively, the minimum bandwidth of other connections with different priorities and the allocated bandwidth and the longest allocation interval according to the allowable time variation of the allocation allowed for the connection It is possible to guarantee and allocate fair surplus bandwidth between connections.

[Brief description of the drawings]

FIG. 1 is a block diagram of a band sharing circuit according to a first embodiment of the present invention.

FIG. 2 is a diagram showing a cell output image by the band sharing circuit of the present invention.

FIG. 3 is a block diagram of a band sharing circuit according to a second embodiment of the present invention.

FIG. 4 is a block diagram of a band sharing circuit according to a fifth embodiment of the present invention.

FIG. 5 is a block diagram of a band sharing circuit according to a sixth embodiment of the present invention.

FIG. 6 is a block diagram of a band sharing circuit according to a seventh embodiment of the present invention.

FIG. 7 is a block diagram of a band sharing circuit according to an eighth embodiment of the present invention.

FIG. 8 is a block diagram of a band sharing circuit according to a ninth embodiment of the present invention.

FIG. 9 is a block diagram of a band sharing circuit according to a ninth embodiment of the present invention.

FIG. 10 is a block diagram of a band sharing circuit according to a ninth embodiment of the present invention.

[Explanation of symbols]

 1-1 to 1-3 Cell storage unit 2, 2-1, 2-2 Weight unit 3 Selection unit 4 WRR unit 5 Count unit 6 Initialization unit 7 Issuing unit 8 Token pool unit 9 Stacking unit 10 Elapsed time observation unit 11 Input bandwidth observation unit 12 Input restriction unit 13 Readout suppression unit 15 Number count unit

Continuation of the front page F term (reference) 5K030 HA10 KA03 KA21 LA03 LC01 LC09 LD18 LE05 LE17 MB09 MD04 9A001 BB03 BB04 CC03 DD10 HH34 JJ18 KK56 LL09

Claims (11)

[Claims] 1. A means for allocating the same output route bandwidth to a plurality of connections having different priorities, wherein said connection sets an upper limit on any of a predetermined bandwidth to be set, an allocation time, an allocation count, or a combination thereof. In a band sharing circuit classified into a first class in which the surplus band is assigned with the highest priority and a second class in which the assignment of the lowest band is guaranteed, the allocating means is classified in the second class A bandwidth sharing circuit including a allocating means for setting a maximum allocation time interval of a connection to be equal to or less than a set value according to a minimum bandwidth of the connection and a time variation allowable amount of an allocation allowed for the connection. 2. The band sharing circuit according to claim 1, wherein a lower limit is set for a band allocation interval to the connection classified into the second class. 3. The assigning means includes: a cell accumulating means for accumulating an incoming cell for each connection; a plurality of weighting means describing a readout weight for each connection and having different weights; and a plurality of weighting means. Selecting means for selecting a weight means to be used; means for reading cells from the cell storage means in a weighted round robin manner in accordance with the weight of each connection described in the weight means selected by the selecting means; Counting means for counting the number of read cells of the read connections belonging to the first class; initialization means for returning the count value of the counting means and the selection of the wait means selected by the selection means to an initial state; Wherein the counting means is set to a predetermined value. Means for transferring the count-up information to the selecting means when counting up to the value, the selecting means including means for re-selecting the weight means to be used according to the count-up information; Means for executing the initialization with a trigger after either the lapse of a certain time after the recognition of the count-up information or the execution of the cyclic reading by the reading means for a certain number of times or the allocation of a predetermined band to the connection belonging to the second class. The band sharing circuit according to claim 1, comprising: 4. The allocating means includes: a cell storing means for storing an incoming cell for each connection; and a read weight for each connection, wherein the weight is reduced in one-to-one correspondence with the cell read of the corresponding connection. Weighting means for re-adding weights when there are no cells to be read in a connection where weighting remains, issuing means for issuing weights to the weighting means, and issuing means for adding weighting to the weighting means At this time, token pool means for holding tokens to be consumed corresponding to the weights to be added up to a predetermined amount as an upper limit, stacking means for stacking tokens in the token pool means at regular time intervals, and the weight means A cell is weighted from the cell storage means according to the weight of each connection. 2. The band sharing circuit according to claim 1, further comprising: means for reading out data by a drop bin method. 5. The allocating means includes: a cell storing means for storing an incoming cell for each connection; a plurality of weighting means describing a readout weight for each connection and having different weights; and a plurality of weighting means. Selecting means for selecting a weight means to be used; input band observing means for observing that the arrival band of a cell of a connection belonging to the first class reaches a predetermined band, and notifying the selecting means of an observation result; Number counting means for counting the number of times the weight means that prioritizes the connection belonging to the first class selected by the selection means in units of a predetermined observation period, and each connection described in the weight means selected by the selection means The cells are weighted from the cell storage means according to the weighting in a round robin manner. A reading means, and a predetermined selection period which is obtained by measuring a period in which the selecting means selects a wait means which gives priority to the connection belonging to the first class by elapse of a certain time or by performing a cyclic reading by the reading means a certain number of times. Elapsed time observing means for changing the weight means that is selected to exceed the time limit, the selecting means, when the count value within a predetermined observation period by the number counting means does not exceed a predetermined count value In accordance with the notification by the input band observation means, select a weight means to give priority to the connection belonging to the first class, and select the weight means until a predetermined observation period observed by the elapsed time observation means elapses. 2. The band sharing circuit according to claim 1, further comprising means for changing the frequency band. 6. The allocating means includes: a cell storing means for storing an incoming cell for each connection; a weighting means for describing a read weight for each connection; and a weighting means for each connection described in the weighting means. Means for reading cells from the cell storage means in a weighted round robin manner; counting means for counting the number of input cells or the number of read cells of the connection belonging to the first class read by the reading means; Initialization means for returning the count value to an initial state, and input restriction means for restricting an input according to the count value of the count means. When the count means counts up to a set predetermined value, the count is performed by the count means. Up information is passed to the input restricting means. The input restriction unit includes a unit that starts input restriction according to the count-up information, and the initialization unit circulates a predetermined time after recognizing the count-up information or a predetermined number of times by the reading unit. 2. The band sharing circuit according to claim 1, further comprising means for executing initialization by using either a read execution or an allocation of a predetermined band to a connection belonging to the second class as a trigger. 7. The allocating means includes: a cell storage means for storing incoming cells for each connection; and a read weight for each connection, wherein the weight is reduced in a one-to-one correspondence with the cell read of the corresponding connection. Weighting means for re-adding the weight when there are no cells to be read in the connection with the remaining weight, issuing means for issuing a weight to the weighting means, and the number of read cells of the connection belonging to the first class Alternatively, token pool means for holding tokens consumed corresponding to the number of input cells with a predetermined amount as an upper limit, stacking means for stacking tokens in the token pool means at regular intervals, and tokens held in the token pool means Input limiting means for limiting the cell input of the connection in case of shortage; Band shared circuit of claim 1, further comprising a means for reading a cell in the weighted round-robin fashion from the cell storing means in accordance with the weighting of each connection listed in Eito means. 8. The allocating means includes: a cell storing means for storing incoming cells for each connection; a plurality of weighting means describing readout weights for each connection and having different weights; and a plurality of weighting means. Selection means for selecting weight means to be used, and input band observation means for observing that the arrival band of the cell of the connection belonging to the first class reaches a predetermined band and notifying the observation result to the selection means, A number counting means for counting the number of times the weight means giving priority to the connection belonging to the first class is selected by the selection means in a predetermined observation period unit; and each connection described in the weight means selected by the selection means Weighting cells from the cell storage means according to the weighting of A means for reading out by a formula, and a period in which the selecting means selects a wait means for giving priority to a connection belonging to the first class is measured by a predetermined time elapsed or a certain number of times by performing cyclic reading by the reading means, and An elapsed time observing means for changing the weight means selected when the selection period is exceeded, and a lapse of a certain time or a certain number of times of the cyclic reading by the reading means or the number of selections by the number counting means in the predetermined observation period unit Input limiting means for limiting the cell input of the connection when the total value of the periods during which the weight means prioritizing the connection belonging to the first class measured by the method exceeds a predetermined value, comprising: The means includes means for releasing the input restriction after a predetermined observation period has elapsed. Common-band circuit described. 9. The bandwidth sharing circuit according to claim 4, further comprising an issue restricting means for restricting the issuing of said issuing means. 10. The band sharing circuit according to claim 3, further comprising a weighted round robin readout restricting means for restricting circulation of said reading means. 11. The band sharing circuit according to claim 6, further comprising a read restricting unit that restricts reading by said reading unit instead of said input restricting unit.