JP3906231B2 - Packet transfer device - Google Patents

Description

  The present invention relates to a cell multiplexing device and a cell buffer device in an ATM communication network, for example.

  In addition, since a plurality of cell multiplexers are stacked in the cell switch, the configuration of the cell multiplexer of the present invention can be applied to the cell switch as a configuration corresponding to one output port of the cell switch. is there.

  The cell buffer device of the present invention is applicable not only to cells but also to general buffer devices.

  Furthermore, the present invention can be applied not only to an ATM communication network but also to a packet switching network.

  Currently, research on ATM (Asynchronous Transfer Mode) communication systems is being actively conducted by researchers of communication technologies around the world. In the ATM communication method, information is exchanged by a fixed-length packet called a cell. In the ATM communication system, cell switching by hardware in the switch node enables high-speed cell exchange, and the information transfer capability per unit time can exceed that of an existing communication network.

  In the ATM communication system, a plurality of connections (Virtual Connection: VC) can be logically set in one physical transmission line by identification information called VPI (Virtual PathIdentifier) and VCI (Virtual ChannelIdentifier) in the header of the cell. . In each switch node in the network, a route is determined in advance for each VC, and the switch node obtains an outgoing route to output a cell from the connection identifiers VPI and VCI of the cell. Since the VPI and VCI are uniquely assigned in the physical transmission path between the switch nodes, the switch node has the ability to rewrite the values of the VPI and VCI of the passing cell.

  Until now, VCs whose quality is guaranteed in ATM networks have been centered on CBR (Con-stant Bit Rate) connections or VBR (Variable Bit Rates) connections. A CBR connection is a VC that transmits traffic that is known in advance with a constant cell transmission rate (also referred to as a cell rate or bandwidth; the number of transmission cells per unit time), and a VBR connection is a cell transmission rate that is not constant. In this VC, the traffic characteristics such as the maximum value (peak rate) and the average value (average rate) are known in advance.

  Basically, when a plurality of VCs are multiplexed on a single physical transmission line while maintaining sufficient quality, the sum of the peak rates of all VCs should be less than or equal to the bandwidth of the physical transmission line. . This method is called peak rate allocation. When only the CBR connection is assigned the peak rate, sufficiently high utilization efficiency of the physical transmission path can be achieved. In the case of the VBR connection, the use efficiency of the physical transmission path cannot be increased by the peak rate allocation. Therefore, a technique for increasing the utilization efficiency while maintaining the quality by using the statistical multiplexing effect is being studied from the known traffic characteristics.

  However, when considering ATM communication between computers, the nature of traffic such as an average rate cannot be predicted in advance, and the burst property that a large number of cells are transmitted instantaneously but not transmitted when not transmitted. There is a nature called. For this reason, it is difficult to improve the network utilization efficiency while guaranteeing the quality as in CBR and VBR. In other words, if the quality of data transferred between computers is guaranteed by peak rate allocation or the like, the use efficiency of the network is remarkably reduced. If the statistical multiplexing effect such as VBR is used, the traffic burstiness is increased. If a large number of cells arrive at the output port of the switch at the same time and the buffer amount of the cell switch is not sufficient, cell discard due to buffer overflow occurs. In addition, when cell discard occurs, retransmission occurs in units of packets made up of a plurality of cells, thereby reducing the effective throughput.

  Therefore, in recent years, a service class called ABR (Available Bit Rate) has been proposed in which flow control is performed between a terminal and a switch node to guarantee cell transfer quality (particularly quality related to cell discard) and to improve network utilization efficiency. Study is progressing. The ABR connection requests that the switch node greets the transmitting terminal to send a cell before the occurrence of the cell congestion when the switch node through which the ABR connection is likely to be congested. Traffic control information to the terminal is mainly performed using cells called RM cells (resource management cells). There is a non-negligible delay time in traffic control from a switch node to a transmission terminal in ABR. Therefore, it is necessary to mount a large-capacity buffer in the cell switch so that the cell is not discarded until the traffic control works effectively.

  As another service class of CBR, VBR, and ABR, there is a service class called UBR (Unspecified Bit Rate). This class does not require detailed declaration of the traffic characteristics output by the terminal to the network. Instead, the network is a class of so-called Best Effort service that makes no guarantees about its transfer quality.

  As described above, since the data between computers has a burst property, it is considered that a large capacity cell buffer must be installed in the cell switch in order to satisfy the cell discard rate of the UBR connection. ing.

  Fortunately, for traffic between computers, there are many cases in which the requirements regarding the transfer delay time and delay fluctuation are not as strict as those of CBR and VBR. Although a cell transmission delay time and delay fluctuation are increased by mounting a buffer with a large capacity in a cell switch, it is considered that there are many applications that can tolerate this.

  Particularly in the case of ABR and UBR services, it is considered that a means for avoiding network congestion is required. As one of the congestion avoiding means, there is a method called EFCI (Explicit Forward Connection Indication). There is an EFCI bit in the cell header that writes the congestion experience of the cell, and the cell switch in the network marks the EFCI according to the congestion status. The terminal can avoid congestion by using the information.

  Next, inter-VC fair queuing will be described.

  First, the fair queuing between VCs required for fault tolerance in the ABR service will be described.

  The ABR service is established when the transmitting terminal controls cell transmission according to traffic control information from the network. If a certain terminal breaks down (or deliberately) and ignores traffic control information from the network, it may be difficult to escape from network congestion.

  Such a problem can be solved by performing fair queuing between VCs in a cell multiplexing apparatus or cell switch to realize fair cell multiplexing scheduling between VCs and fair buffer allocation between VCs. By performing fair queuing between VCs, the interaction between VCs can be minimized, and even if there is a VC that ignores traffic control information, only that VC can be congested and the impact on other VCs can be reduced. Because.

  Also, fair queuing between VCs is required for fairness in UBR service.

  FIG. 48 shows an example of unfair bandwidth allocation in the UBR service. In this example, there are four terminals A, B, C, and D in the network, and one file server, each of which is a cell switch (or cell multiplexer) X, Y, Z and links 1, 2, 3, 4, 5, 6, 7.

  Here, assuming that each cell switch multiplexes cells regardless of the number of VCs set as input links, each cell switch treats input ports equally. For example, when the cells from link 2 and link 3 are multiplexed to link 1, cell switch X treats both links equally. Each is given a bandwidth of 0.5.

  Considering the same, the bandwidth finally given to each terminal is 0.5 for terminal A, and 0.125 for terminals C and D, the smallest. If it is ideal that all terminals have equal access to the file server, this is far from ideal.

  Furthermore, when the network is congested, the network transmits EFCI information so as to reduce the bandwidth to the terminal. At this time, if there are terminals in the network that faithfully follow the EFCI information and terminals that are ignored, only the terminals that are faithful to the EFCI suppress cell transmission. Therefore, a terminal that ignores the EFCI uses an unreasonably large amount of bandwidth resources. There is also a problem that it will be secured.

  These problems are due to the cell switch treating each input link equally, ignoring the number of VCs multiplexed on the input link. When the cell switch performs fair queuing between VCs and distributes bandwidth according to the number of VCs, each terminal can access the file server fairly.

  Next, a cell multiplexing apparatus that performs priority control between classes will be described.

  FIG. 49 shows a configuration of a conventional cell multiplexing apparatus that performs priority control between classes.

  FIG. 49 shows a cell multiplexing apparatus that multiplexes cells input from N input ports into one output port.

  The output buffer stores cells for each class in a cell storage unit for each internal class, and the cell selection unit selects and outputs cells to the output port according to the priority of the class.

  A back pressure signal is generated by comparing the number of cells stored in each storage unit of the output buffer with a threshold value. The input buffer is also provided with a cell storage unit for each class, and transfers cells to the output buffer in accordance with the class priority from the classes permitted to be output by the back pressure signal.

  In this configuration, since it is necessary to provide a plurality of cell storage units for each class in the output buffer, there is a drawback that it becomes difficult to realize the output buffer when the number of classes increases. In particular, the input speed of the output buffer must be N times the speed of the input port (N is the number of input ports). If the number of classes and the number of input ports is large, such complex functions cannot be realized. It was difficult.

  Considering FIG. 49 as a part related to each output port of the cell switch, the same problem exists for a cell switch having a buffer at the input port.

  Next, the cell multiplexing apparatus will be described.

  Problems of the cell multiplexing apparatus having an input buffer as shown in FIG. 50 will be described.

  FIG. 50 shows a cell multiplexing apparatus that multiplexes cells input from N input ports into one output port.

  The output buffer temporarily accumulates cells from the input port and outputs cells according to the speed of the output port.

  A back pressure signal is generated by comparing the number of cells stored in the output buffer with a threshold value. The input buffer has one queue corresponding to the output port, and transfers cells to the output buffer only when output is permitted by the back pressure signal.

  Since such a cell multiplexing apparatus treats each input buffer fairly regardless of the number of set VCs, there is a problem in fault tolerance in the ABR service and fairness in the UBR service.

  If FIG. 50 is considered as a part related to each output port of the cell switch, the same problem exists also in the cell switch having a buffer at the input port.

  Next, inter-VC fair queuing will be described.

  FIG. 51 shows the configuration of a FIFO for each VC, which is a method for realizing fair queuing between VCs.

  51 notifies the buffer pointer management unit of cell connection identification information input from the input link, obtains a write pointer indicating the cell write position from the buffer pointer management unit, temporarily stores the cell in the cell buffer, This is a cell buffer device that reads a cell from a cell buffer based on a read pointer indicating a read cell from a buffer pointer management unit and outputs the cell to an output link. The buffer pointer management unit manages a buffer pointer indicating the position of the accumulated cell on the cell buffer.

  The buffer pointer management unit manages the buffer pointer for each VC using the VC table. FIG. 51 shows a management method using a widely known pointer chain.

  When a cell is input, one buffer pointer is taken out from the head of the empty chain as a write pointer, and is attached to the end of the VC chain corresponding to the input cell. When outputting a cell, the VC storing the cell is selected fairly, and the leading buffer pointer is read out and taken out as a pointer. Round robin is known as a method for selecting a VC fairly at the time of cell output.

  In order to select a VC by round robin, it is necessary to search on the VC table in order from the next to the previously output VC whether there is a cell stored in the buffer. In the case of a large number of searches, it is necessary to perform almost all the VCs in one cell cycle, but the number of VCs to be set may reach several thousand or more, which is difficult to realize. Next, queue length monitoring will be described.

  FIG. 52 shows an example of a change in the queue length of the input buffer in the cell multiplexing apparatus having the input buffer as shown in FIG.

  The horizontal axis represents time, the vertical axis represents the queue length of the input buffer, and the bottom represents the back pressure signal. When the back pressure signal indicates output prohibition (Tup), the output throughput from the input buffer is zero, so the queue length increases at the buffer input rate (Ri). When the back pressure signal indicates that output is possible, the output throughput from the input buffer is maximum and the normal queue length decreases.

  In this way, the queue length vibrates in synchronization with the back pressure signal. Conventionally, when a cell arrives at a buffer, if the queue length exceeds a threshold value, the input cell is not accepted but discarded, and if not, it is widely accepted. This method has no problem with a normal buffer, but becomes a problem when the output of the buffer is controlled by the back pressure signal in this way. The maximum value of the queue length is determined by the input rate (R i) and the time (Tup) when the back pressure signal instructs to inhibit output. In particular, the output inhibition time (Tup) of the back pressure signal is determined for other input buffers. This is because it is greatly influenced by input traffic and the like.

  In the case of a buffer device controlled by a back pressure signal, simply discarding cells by comparing them with the queue length and threshold value makes it difficult to stably discard cells because the cell discards are sensitively affected by external conditions. Met. The same problem exists when judging congestion from the queue length.

  Next, a cell buffer device that performs priority control will be described.

  FIG. 53 shows the configuration of a cell buffer device that performs priority control.

  There is a class 1 cell storage unit that temporarily stores low-priority cells with respect to delay, and a class 2 cell storage unit that temporarily stores high-priority cells. Each output is multiplexed by a class multiplexing FIFO. Is done. The class management unit inputs the class 2 cell storage unit cell number Na and the class multiplexed FIFO cell number Nb, and gives a transfer instruction to one of the classes. Upon receiving the transfer instruction, the class cell storage unit transfers only one cell to the class multiplexing FIFO.

  In order to improve the priority control performance of this cell buffer device, it is necessary to reduce the number of cells stored in the class multiplexing FIFO. However, in order not to reduce the throughput, the class multiplexing FIFO is not emptied. It is necessary to instruct transfer so that (= no underflow). Furthermore, when either one of the cell storage units is empty, if there is an instruction for transfer to the empty cell storage unit (referred to as an empty instruction), an underflow may occur. Therefore, it is necessary to give a transfer instruction to the cell storage unit in which the storage cell exists.

From the above policy, the condition for the class management unit to instruct the transfer to the class 2 cell storage unit is as follows:
(Nb ≦ 1) and (Na > 1). The transfer instruction to the class 1 cell storage unit is
(Nb.ltoreq.1) and (Na == 0).

  Here, transmission of cell number information from the cell storage unit for each class or class multiplexing FIFO to the class management unit, transmission of transfer instruction information from the class management unit to the class cell storage unit, and cell storage for each class Consider a case where there is a delay time in cell transfer from the cell to the cell multiplexing FIFO. Conventionally, the following problems existed at this time.

  Due to these delay times, the class manager cannot accurately determine whether or not the class multiplexed FIFO underflows. Therefore, the number of cells in the class multiplexing FIFO is set as a condition for preventing underflow by comparing with a larger threshold value corresponding to the delay time. As a result, the average queue length of the class multiplexing FIFO is increased and the performance of priority control is lowered.

  In addition, it is impossible to accurately determine that the class 2 cell storage unit is empty due to a delay in transmission of the high priority class 2 cell storage unit information. Therefore, if it is empty but it is not empty, it will give an error, and it will give an empty instruction, or if it is not empty, it will be empty, and the class 1 cell with low priority will take precedence over the class 2 cell with high priority. I was giving instructions to output. As a result, there is a problem that the throughput of the cell buffer device is lowered and the performance of the priority control function is lowered.

  The problems with the cell buffer device performing priority control in FIG. 53 have been described above. This problem can occur not only in cell buffer devices that perform such priority control, but also in various cell buffer devices.

  In other words, in the cell buffer device in which the management unit instructs the transfer of cells between a plurality of buffers, the transmission of buffer information to the management unit, the transmission of transfer instruction information from the management unit to the buffer, and the transmission of cells between buffers are delayed. When time exists, there is a problem that the performance and throughput of the cell buffer device are lowered.

  As described above, the conventional cell multiplexing apparatus has the following first and second problems.

  First, since it is necessary to provide a plurality of cell storage units for each class in the output buffer, there is a drawback that it becomes difficult to realize the output buffer when the number of classes increases. In particular, the input speed of the output buffer must be N times the speed of the input port (N is the number of input ports). If the number of classes and the number of input ports is large, such complex functions cannot be realized. It was difficult.

  Next, since each input buffer is treated fairly regardless of the set number of VCs, there is a problem in fault tolerance in the ABR service and fairness in the UBR service.

  Further, the conventional cell buffer device has the following third and fourth problems.

  First, in order to select a VC by round robin, it is necessary to sequentially search the VC table for whether or not there is a cell accumulated in the buffer from the next output VC. In the case of a large number of searches, it is necessary to perform almost all the VCs in one cell cycle, but the number of VCs to be set may reach several thousand or more, which is difficult to realize.

  On the other hand, in recent years, an algorithm as described in Non-Patent Document 1 has been proposed. Since the algorithm called DRR proposed in this document manages VCs that store cells using the concept of active lists, it is not necessary to search the VC table when cells are output. Therefore, even if the number of VCs to be set increases, selection of cells to be output for fair VC queuing can be realized at high speed. However, in this DRR algorithm, since packets are classified and stored for each VC, an amount of packets corresponding to the weight value set for each VC is output at a time, and the burstiness of the output traffic is extremely high. There was a drawback that it would be expensive.

  Next, in the case of a buffer device controlled by a back pressure signal, the method of determining cell discard simply by comparing the queue length with a threshold value is sensitive to cell discard due to external conditions. Disposal was difficult. The same problem exists when judging congestion from the queue length.

Furthermore, the cell buffer device in which the management unit instructs cell transfer between a plurality of buffers has the following fifth problem. That is, if there is a delay time in the transmission of buffer information to the management unit, the transmission of transfer instruction information from the management unit to the buffer, and the transmission of cells between buffers, the performance and throughput of the cell buffer device will be reduced. There was a problem.
"Efficient Fair Queueing Defect Round Robin" (pp.231-242, ACM SIGCOMM '95, August 1995)

  The present invention has been made in view of the above points, and an object of the present invention is to provide a cell multiplexing apparatus in which the queue length monitoring result is not easily affected by external conditions, and stable queue length monitoring is easy. Is to provide.

  Another object of the present invention is to transmit buffer information to the management unit, transmit transfer instruction information from the management unit to the buffer, and transfer cells between buffers when the management unit instructs transfer of cells between a plurality of buffers. It is an object of the present invention to provide a cell multiplexing apparatus in which performance and throughput do not decrease even when there is a delay time in transmission.

  The packet transfer apparatus according to the present invention (Claims 1 to 3) is configured by connecting a plurality of buffers that temporarily store input packets in series, and the buffer connected to the previous stage is a buffer connected to the subsequent stage. The packet transfer apparatus outputs a packet in accordance with the packet output enable / disable state determined according to the accumulation state of the packet in the buffer in the subsequent stage, and the buffer in the previous stage outputs the packet to the buffer in the subsequent stage By monitoring the accumulation status of the buffer connected to the previous stage when the packet is first input to the previous stage buffer after changing from the enabled state to the output prohibited state, the accumulation status (packet amount) of each buffer is monitored. The monitoring result is not easily affected by external conditions, and stable queue length monitoring is easy.For example, the amount of accumulated packets monitored falls below a predetermined threshold. If there is an error, the congestion condition is judged, and when the monitored accumulated packet amount exceeds the predetermined threshold, discarding the input packet according to the exceeded amount is affected by external conditions. It can be done stably without any problems.

  The packet transfer apparatus according to the present invention (claims 4 to 6) includes at least one buffer for temporarily storing input packets, and packet transfer (input to the buffer or output from the buffer) of the buffer. And a control means for controlling the buffer, the control means for the buffer based on a packet transfer instruction history for the buffer and a packet storage status of the buffer. By performing the packet transfer instruction, the transfer instruction history is used to determine the transfer instruction, and the accumulated number of packets notified from the buffer is corrected to the accumulated number of times when the transfer instruction acts on the buffer. Therefore, performance degradation due to the delay time is reduced.

  According to the packet transfer apparatus that takes into account the back pressure signal of the present invention (eighth embodiment (claim 1)), the monitoring result of the queue length is hardly affected by the external condition, and stable monitoring of the queue length is easy. It is.

  Further, according to the packet transfer apparatus (the ninth embodiment (claims 2, 3, 4, 5)) that corrects the cell number information in consideration of the delay of the present invention, the transfer instruction is determined when the transfer instruction is determined. Thus, the number of cells transmitted from the buffer is corrected to the number of cells at the time when the transfer instruction acts on the buffer, so that there is little deterioration in performance due to the delay time.

  Embodiments of the present invention will be described below with reference to the drawings.

0. Definition of Terms Hereinafter, terms used for describing the embodiments of the present invention will be defined.

  (1) A packet is a concept including a fixed-length cell, and can be understood as a superordinate concept of a cell. In the following description, a packet is not limited to a variable length or a fixed length. Further, even when the description is limited to the cell, it is merely for the purpose of simplifying the description and is not particularly limited thereto.

  (2) Difference between packet (cell) multiplexer and packet (cell) buffer device: Packet buffer device: one or more input ports, one or more output ports, and one or more buffers. A device that temporarily stores input packets in a buffer as needed and outputs them to an output port. In particular, a packet buffer device that outputs a packet to an output port corresponding to a destination is called a packet switch.

  Packet multiplexer: A packet multiplexer that has a single packet output port is called a packet multiplexer (multiple packet multiplexers with a common input port when the packet buffer is divided into output ports) Can be seen as a stack of devices). In the following description, the description of the packet multiplexing device can be easily applied to the packet buffer device.

  (3) Packet transfer device: Includes both a packet buffer device and a packet multiplexing device which is a kind thereof. Also, in the following description, the case where a multiplexing device or a buffer device is described as an example is not particularly limited to this, and can be widely applied as a packet transfer device.

1. Inter-class priority control (first embodiment, second embodiment)
First, an embodiment of a cell multiplexing apparatus that performs priority control between classes according to the present invention will be described.

  1.1 First Embodiment FIG. 1 shows a configuration example of a cell multiplexing apparatus that performs priority control between classes according to a first embodiment.

  The cell multiplexer of FIG. 1 is provided corresponding to each of the input ports # 1 to #N, and a plurality of input buffers 10 that temporarily store cells input from the input ports # 1 to #N, An output buffer 11 that multiplexes cells output from the input buffer 10 and outputs them to an output port, and a class management unit 12 that manages all the input buffers are provided.

  The input buffer 10 includes a class cell storage unit 13 (class 1 cell storage unit 13a, class 2 cell storage unit 13b, class 3 cell storage unit 13c) that stores input cells for each class (class 1 to class 3). A class multiplexing FIFO 14 that multiplexes cells output from the cell storage unit 13 and outputs them to the output buffer 11 is provided.

  The class management unit 12 obtains the number of cell storage units for each class of the cell storage unit 13 and the number of class multiplexed FIFO cells of the class multiplexed FIFO 14, determines a transfer class instruction from a predetermined algorithm, Broadcast to the input buffer 10.

  The cell storage unit 13 of the class designated by the transfer class instruction broadcasted to the input buffer 10 transfers the cell to the class multiplexing FIFO 14, and the class multiplexing FIFO 14 backs up according to the congestion state in the output buffer 11. The cell is output to the output buffer 11 according to the control of the pressure signal.

  The cell storage unit 13 for each class is usually composed of a FIFO (First In First Out) memory.

  Although FIG. 1 shows the case of three classes (class 1 to class 3), the first embodiment works effectively regardless of the number of classes.

  Further, when FIG. 1 is considered to be a part related to each output port of the cell switch, the first embodiment can be applied to the cell switch.

  The output buffer 11 shown in FIG. 1 is composed of a single-stage FIFO 15. However, the output buffer 11 may take any form as long as it can guarantee that the cells of the class multiplexed FIFO 14 can be output to the output port within a finite time in any situation.

  For example, the configuration may be such that the cell of the class multiplexed FIFO 14 is arbitrated and output to the output port without having any buffer. Further, for example, the configuration shown in FIG. 3 or FIG.

  The output buffer 16 shown in FIG. 3 has a plurality of FIFO stages (two stages in FIG. 3), and a back pressure signal is connected to the preceding FIFO.

  That is, in the output buffer 16 of FIG. 3, input links # 1 to #N provided corresponding to the respective outputs of the input buffer 10 are connected to a plurality of FIFOs 18 on the input side (previous stage). The back pressure signal output from the subsequent FIFO 19 in accordance with the congestion state is connected to each of the plurality of FIFOs 18 in the preceding stage, and is connected to each of the FIFOs 18 in the preceding stage. A back pressure signal output from each according to the congestion state is connected to each of the plurality of class multiplexing FIFOs 14.

  The output buffer 17 shown in FIG. 4 has a plurality of FIFOs (two stages in FIG. 4), as in FIG. The difference from FIG. 3 is that the queue length information of a plurality of FIFOs 18 on the input side (or the queue length information of all FIFOs) may be transferred to the back pressure generation unit 20, and the back pressure generation unit 20 A pressure signal is generated and broadcast to all input links.

  For example, all the queue lengths are summed and compared with a threshold value, and if the threshold value is exceeded, input to the output buffer is prohibited by the back pressure signal. The back pressure generation unit 20 may exist in the class management unit 12.

  According to the cell multiplexing apparatus that performs priority control between classes according to the first embodiment, it is not necessary to identify a class in an output buffer that requires high throughput, and therefore it can be easily realized. The input buffer needs to manage cells for each class. However, since the throughput required for the input buffer is low, implementation is easy.

  The configuration of the cell multiplexing apparatus in FIG. 1 will be described in more detail.

  The number of cell storage units by class input to the class management unit 12 may be the sum of the number of cell storage units by class of all input buffers 10 for each class. Further, the number of class multiplexed FIFO cells may be the sum of all the input buffers 10.

  The total calculation may be performed inside the class management unit 12 or may be performed outside the class management unit 12.

  In the cell number information, the class management unit 12 determines a relatively small threshold value and magnitude. Whether the threshold value is a fixed value or a dynamically changing value depends on the algorithm of the class management unit 12. If the threshold value is a fixed value, the comparison result is used instead of the number of cells. You may input into a class management part. Alternatively, if any value greater than a certain value does not affect the processing of the class management unit 12, the value greater than that value may be encoded and input into one code. For example, with 4 bits, the number of cells is (0000) = 0, (0001) = 1, (0010) = 2, (0011) = 3,..., (1101) = 13, (1110) = 14, (1111) = The encoding may be performed in 16 stages of 15 or more. Thereby, there is an advantage that the input information to the class management unit 12 can be compressed and the mounting becomes easy.

  By handling the total number of cells, the implementation of the class management unit 12 can be simplified. Since the transfer class instruction also broadcasts the same information to all input buffers, the class manager does not need to recognize each input buffer individually. Therefore, there is an advantage that even if the number of input ports increases, the essential difficulty of mounting does not change.

  The algorithm by which the class manager 12 determines the transfer instruction is, for example, as follows.

  1. Based on the number of class multiplexed FIFO cells, it is determined whether the class multiplexed FIFO does not underflow, and a transfer instruction is issued so as not to underflow only when it is determined that there is a possibility of underflow. Underflow refers to a state in which the number of class multiplexed FIFO cells becomes zero, and the cells in the cell storage unit for each class that should originally be output cannot be output effectively.

  2. Based on the number of cells per class, the class in which cells are stored in the input buffer 10 is determined as a transfer instruction candidate.

  3. When the transfer instruction can be performed, the class having the highest priority among the classes that are candidates for the transfer instruction is obtained, and the transfer of the class is instructed.

  The class management unit 12 issues a transfer class instruction without directly considering the state of the output buffer and the back pressure signal. For this reason, the cell transfer throughput according to the transfer class instruction may exceed the cell output throughput from the input buffer 10, and the class multiplexing FIFO 14 is prepared to temporarily absorb the difference. By knowing the number of class multiplexed FIFO cells, the class management unit 12 controls so that the cell transfer throughput according to the transfer class instruction does not continuously exceed the cell output throughput from the input buffer 10 for a long time.

  The class management unit 12 knows the number of cells (the number of transfer cells for each class) obtained by summing the cells actually transferred from the cell storage unit 13 for each class to the class multiplexing FIFO 14 in all the input buffers 10, so that more detailed inter-class Priority control can be performed.

  In this case, the algorithm by which the class management unit 12 determines the transfer instruction is, for example, as follows.

  1. Based on the number of cells in the class multiplexed FIFO, it is determined whether the class multiplexed FIFO does not underflow, and a transfer instruction is issued so as not to underflow only when it is determined that there is a possibility of underflow. Underflow refers to a state in which the number of class multiplexed FIFO cells becomes zero and the cells of the class-by-class cell storage unit 13 that should originally be output cannot be output effectively.

  2. Based on the number of cells in each class cell storage unit, a class in which cells are stored in the input buffer is determined as a transfer instruction candidate.

  3. A class that obtains a throughput that is equal to or higher than a predetermined throughput for each class, based on the number of transfer cells for each class, lowers the priority for instructing transfer according to the degree. Or, it is not set as a transfer instruction candidate.

  4). From the number of transfer cells for each class, a class that obtains only a throughput equal to or lower than the throughput predetermined for each class increases the priority for instructing transfer according to the degree.

  5. When the transfer instruction can be performed, the class having the highest priority among the classes that are candidates for the transfer instruction is obtained, and the transfer of the class is instructed.

1.2 Second Embodiment Next, a second embodiment will be described.

  FIG. 2 shows another configuration example of the cell multiplexing apparatus that performs priority control between classes according to the second embodiment.

  The cell multiplexing apparatus of FIG. 2 is provided corresponding to each of the input ports # 1 to #N, and a plurality of input buffers 100 for temporarily storing cells input from the input ports # 1 to #N; An output buffer 111 that multiplexes cells output from the input buffer 100 and outputs them to an output port, and a class management unit 112 that manages all the input buffers 100 are provided.

  The input buffer 100 stores the input cells for each class (class 1 to class 3), for each class, cell storage unit 113 (class 1 cell storage unit 113a, class 2 cell storage unit 113b, class 3 cell storage unit 113c). And a class multiplexing FIFO 114 that multiplexes the cells output from the cell storage unit 113 and outputs the multiplexed data to the output buffer 111.

  The class management unit 112 obtains the number of cells in each cell storage unit 113 and the number of cells in the output buffer of the cell storage unit 113, determines a transfer class instruction from a predetermined algorithm, and broadcasts it to all the input buffers 100. To do.

  The cell storage unit 113 of the class designated by the transfer class instruction broadcast to the input buffer 100 transfers the cell to the class multiplexing FIFO 114, and the class multiplexing FIFO 114 backs up according to the congestion state in the output buffer 111. The cell is output to the output buffer 111 according to the control of the pressure signal.

  The cell storage unit 113 for each class is usually composed of a FIFO.

  FIG. 2 shows the case of three classes (class 1 to class 3), but the second embodiment works effectively regardless of the number of classes.

  If FIG. 2 is considered as a part regarding each output port of the cell switch, the second embodiment can be applied also to the cell switch.

  The output buffer 111 of FIG. 2 may take any form as long as it can guarantee that the cell of the class multiplexed FIFO can be output to the output port within a finite time in any situation.

  For example, the configuration shown in FIG. 4 may be used.

  In this case, the back pressure generation unit 20 may exist in the class management unit 112. The number Nm of cells in the output buffer is added by the back pressure generation unit 20 and output to the class management unit 112 in FIG.

  According to the cell multiplexing apparatus that performs priority control between classes according to the second embodiment, since it is not necessary to identify a class in an output buffer that requires high throughput, it can be easily realized. The input buffer 100 needs to manage cells for each class, but is easy to implement because the throughput required for the input buffer 100 is low.

  The configuration of the cell multiplexing apparatus in FIG. 2 will be described in further detail.

  The number of cell storage units per class input to the class management unit 112 may be the sum of the number of cell storage cells per class of all the input buffers 100 for each class.

  The total calculation may be performed inside the class management unit 112 or may be performed outside the class management unit 112.

  In the cell number information, the class management unit 112 determines a relatively small threshold value and magnitude. Whether the threshold value is a fixed value or a dynamically changing value depends on the algorithm of the class management unit 112. If the threshold value is a fixed value, the comparison result is used instead of the number of cells. You may input into the class management part 112. FIG. Alternatively, if any value above a certain value does not affect the processing of the class management unit 112, the value above that value may be encoded into a single code and input. For example, with 4 bits, the number of cells is (0000) = 0, (0001) = 1, (0010) = 2, (0011) = 3,..., (1101) = 13, (1110) = 14, (1111) = The encoding may be performed in 16 stages of 15 or more. Thereby, there is an advantage that the input information to the class management unit can be compressed, and the mounting becomes easy.

  By handling the total number of cells, the implementation of the class management unit 112 can be simplified. Since the transfer class instruction also broadcasts the same information to all the input buffers 100, the class management unit 112 does not need to recognize the input buffers 100 individually. Therefore, there is an advantage that even if the number of input ports is increased, the essential difficulty of mounting does not change.

  For example, the class management unit 112 determines the transfer instruction as follows.

  1. Based on the number of cells in the output buffer 111, it is determined whether the output buffer 111 does not underflow, and only when it is determined that there is a possibility of underflow, a transfer instruction is given so as not to underflow. Underflow refers to a state in which the number of output buffer cells becomes zero and the cells in the class-by-class cell storage unit 113 that should originally be output cannot be effectively output.

  2. Based on the number of cells in each class cell storage unit, a class in which cells are stored in the input buffer 100 is determined as a transfer instruction candidate.

  3. When the transfer instruction can be performed, the class having the highest priority among the classes that are candidates for the transfer instruction is obtained, and the transfer of the class is instructed.

  The class management unit 112 issues a transfer class instruction by directly considering the state of the output buffer 111. Therefore, if a sufficient buffer amount is prepared for the output buffer 111, the back pressure signal does not suppress the cell output from the input buffer, and the class multiplexing FIFO 114 is basically unnecessary. By knowing the number of cells in the output buffer, the class management unit 112 controls the cell transfer throughput according to the transfer class instruction so as not to exceed the cell output throughput from the output buffer 111 continuously for a long time.

  Thus, the back pressure signal to the input buffer 100 and the class multiplexing FIFO 114 are basically unnecessary, but they work effectively when the buffer amount of the output buffer 111 is not sufficient. If these are not provided, the buffer amount of the output buffer 111 can be reduced as compared with the case without them.

  The class management unit 112 knows the number of cells (the number of transferred cells for each class) obtained by totaling the cells actually transferred from the class-by-class cell storage unit 113 to the class multiplexing FIFO 114 in all the input buffers. Priority control can be performed.

  In this case, the algorithm by which the class management unit 112 determines the transfer instruction is, for example, as follows.

  1. Based on the number of cells in the output buffer 111, it is determined whether the output buffer 111 does not underflow, and only when it is determined that there is a possibility of underflow, a transfer instruction is given so as not to underflow. Underflow refers to a state in which the number of output buffer cells becomes zero and the cells in the class-by-class cell storage unit 113 that should originally be output cannot be effectively output.

  2. Based on the number of cells in each class cell storage unit, a class in which cells are stored in the input buffer 100 is determined as a transfer instruction candidate.

  3. A class that obtains a throughput that is equal to or higher than a predetermined throughput for each class, based on the number of transfer cells for each class, lowers the priority for instructing transfer according to the degree. Or, it is not set as a transfer instruction candidate.

  4). From the number of transfer cells for each class, a class that obtains only a throughput equal to or lower than the throughput predetermined for each class increases the priority for instructing transfer according to the degree.

  5. When the transfer instruction can be performed, the class having the highest priority among the classes that are candidates for the transfer instruction is obtained, and the transfer of the class is instructed.

1.3 Advantages of Cell Multiplexing Device According to First and Second Embodiments As described above, according to the cell multiplexing device that performs the priority control between classes of the first and second embodiments. Since there is no need to identify a class in an output buffer that requires high throughput, there is an advantage that it can be easily realized even when the number of input ports is large.

2. Fair queuing (third to seventh embodiments)
Next, an embodiment of a cell multiplexing apparatus that performs inter-VC fair queuing according to the present invention will be described.

2.1 Third Embodiment (Output Buffer Type Cell Multiplexer)
FIG. 5 shows a configuration example of a cell multiplexing apparatus that performs fair VC queuing according to the third embodiment.

  The cell multiplexing apparatus of FIG. 5 is called an output buffer type and is provided corresponding to each of the input ports # 1 to #N. The cell input from the input ports # 1 to #N is multiplied by the number of input ports N times. A plurality of speed conversion circuits 200 for speed conversion to the above speed, and an output buffer 201 for temporarily accumulating cells output from the speed conversion circuit 200 and outputting them to an output port.

  The output buffer 201 selects and outputs a cell output from each of a VC separation unit 201a that separates input cells for each VC, a plurality of FIFOs 201b for each VC provided for each VC, and a plurality of FIFOs 201b for each VC. A cell selection unit 201c that outputs to a port is provided.

  The per-VC FIFO 201b must have a large capacity in order to obtain a sufficiently good cell discard rate. In addition, due to the non-blocking condition, the input speed of the per-VC FIFO 201b must be N times the input port. When the input port speed is high or the number of input ports is large, a high-speed and large-capacity memory that satisfies such a throughput is not cheap, and a complex queue for each VC while satisfying such a throughput. Management is also difficult.

2.2 Fourth Embodiment (Cell Multiplexer Using the Concept of “Kago”)
Next, a fourth embodiment will be described.

  FIG. 6 shows a configuration example of a cell multiplexing apparatus using a concept called a basket according to the fourth embodiment.

  The cell multiplexing apparatus shown in FIG. 6 is provided corresponding to each of the input ports # 1 to #N, and includes a plurality of input buffers 210 that temporarily store cells input from the input ports # 1 to #N. And an output buffer 211 that multiplexes the cells output from each input buffer 210 and outputs them to an output port, and controls the cell output of each input buffer 210 by a back pressure signal according to the congestion state in the output buffer 211.

  This cell multiplexing apparatus includes a basket management unit 212 that manages an output-permitted cell set.

  Among the cells stored in the input buffer 210, a set of cells permitted to be output (output permitted cell set) is called a basket. A cell to be output from the input buffer 210 is selected from the basket 213.

  The basket management unit 212 inputs the number of cells included in the basket 213, determines a cell transfer instruction to the basket 213 by a predetermined algorithm, and broadcasts it to all the input buffers 210.

  The input buffer 210 adds a set 214 of cells to be output by the same time among the cells stored in the input buffer 210 other than the cell determined as the cage 213 according to the cell transfer instruction.

  If FIG. 6 is considered as a part regarding each output port of the cell switch, the fourth embodiment can be applied also to the cell switch.

  The output buffer 211 in FIG. 6 may take any form as long as it can guarantee that a car cell can be output to the output port within a finite time in any situation.

  For example, a configuration may be employed in which the cell of the basket 213 is arbitrated and output to the output port without having any buffer. Further, for example, the configuration shown in FIG. 3 or 4 may be used.

  In FIG. 4, the back pressure generation unit 20 may exist in the basket management unit 212.

  According to the cell multiplexing apparatus that performs inter-VC fair queuing according to the fourth embodiment, an output buffer that requires high throughput has a simple configuration and can be easily realized. The input buffer needs to manage cells by a cage, but since the throughput required for the input buffer is low, it is easy to implement.

  The configuration of the cell multiplexing apparatus in FIG. 6 will be described in further detail.

  The number of cells in the car that is input to the car management unit 212 may be the sum of the number of cells in the car of all the input buffers 210.

  The total calculation may be performed inside the basket management unit 212 or may be performed outside the basket management unit 212.

  The number-of-cells information is determined by the basket management unit 212 as a relatively small threshold value and magnitude. Whether the threshold value is a fixed value or a dynamically changing value depends on the algorithm of the basket management unit 212. If the threshold value is a fixed value, the comparison result is used instead of the number of cells. You may input into the basket management part 212. FIG. Alternatively, if any value above a certain value does not affect the processing of the basket management unit 212, the value above that value may be encoded and input into one code. For example, with 4 bits, the number of cells is (0000) = 0, (0001) = 1, (0010) = 2, (0011) = 3,..., (1101) = 13, (1110) = 14, (1111) = The encoding may be performed in 16 stages of 15 or more. Thereby, there is an advantage that the input information to the basket management unit 212 can be compressed and the mounting becomes easy.

  By handling the total number of cells, the implementation of the basket management unit 212 can be simplified. Since the cell transfer instruction to the car also broadcasts the same information to all the input buffers 210, the car management unit 212 does not need to recognize the input buffers 210 individually. Therefore, there is an advantage that even if the number of input ports is increased, the essential difficulty of mounting does not change.

  An example of an algorithm for determining the cell transfer instruction to the basket 213 by the basket management unit 212 is as follows.

  That is, it is determined whether or not the number of cells in the basket 213 does not underflow based on the number of cells in the basket Nk, and a transfer instruction is issued so as not to underflow only when it is determined that there is a possibility of underflow. The underflow is a state in which the number of cells in the basket Nk becomes zero, and the cells of the input buffer 210 that should originally be output cannot be output effectively.

  The input buffer 210 adds the cell set 214 to be output by the same time to the car 213 in response to the cell transfer instruction to the car 213. For example, when performing inter-VC fair queuing weighted by the value Nx set for each VC, the cells to be output by the same time are cells not included in the basket 213 in each input buffer 210 for each VC. The oldest Nx cells are collected.

  Since the transfer instruction is broadcast to all the input buffers 210, cells enter the basket 213 fairly between the VCs through the plurality of input buffers 210. By transferring the cells of the basket 213 to the output buffer 211 in preference to the cells outside the basket 213, it is possible to transfer the cells to the output buffer 211 fairly between the VCs through the plurality of input buffers 210.

  If the output buffer 211 is configured to be able to output cells input from the basket 213 within a certain period of time, the cells transferred to the basket 213 fairly between VCs have a delay fluctuation of that time, Output from the output port.

  FIG. 6 shows, as an example, a state where two, one, and three VCs are queued in the input buffers 210 of the input ports # 1, # 2, and #N, respectively. When all VCs have the same weight, if VC fair queuing is performed, the output from each input buffer 210 needs to be a ratio of 2 to 1: 3. In the cell multiplexing apparatus of this embodiment, the number of cells in the basket 213 is 2: 1 to 3 in each input buffer according to a cell transfer instruction from the basket management unit 212 to the basket 213 that is broadcast to all the input buffers 210. As a result, the output from the output buffer also becomes a ratio of 2 to 1: 3.

  There are two methods for inputting cells into the basket 213. Here, a case will be described as an example where the oldest Nx cells (values set for each VC) are placed in the basket for each VC when transfer is instructed.

  One method is a method in which a cell input to the input buffer 210 does not enter the car 213 at first, even if the condition for entering the car 213 is satisfied. A cell is transferred to the car 213 only when cell transfer is instructed by the car management unit 212. As a result, the number of cells in the car is reduced except when the car management unit 212 instructs cell transfer.

  Another method is a method in which a cell input to the input buffer 210 is inserted into the cage 213 from the beginning when the condition for entering the cage 213 is satisfied. In other words, the VC that has transferred Nx cells to the basket 213 at the time of the transfer instruction cannot enter the cell into the basket 213 until the next transfer instruction is issued, but does not transfer any cells to the basket 213 at the time of the transfer instruction. VCs having less than Nx transfer cells or Nx transfer cells can input 213 into the basket without instructing transfer until Nx. As a result, the number of cells in the car may increase between transfer instructions, but decreases when almost all active VCs have transferred Nx cells. Note that this embodiment works effectively in either method.

  The determination of the congestion state of the cell multiplexing apparatus of the fourth embodiment may be performed by monitoring information that varies depending on traffic for each VC by a predetermined method. Based on this congestion determination, the traffic control information may be notified to the terminal for each VC.

  The fluctuating information to be monitored is, for example, the number of stored cells, the relationship between the number of input cells per fixed time and the target value, and the relationship between the time input by a certain number of cells and the target value. A VC having a large number of accumulated cells, a VC having a large number of input cells per fixed time far from the target value, and a short VC having a time of inputting a certain number of cells far from the target value are determined to be a congested VC.

  The traffic control information can be notified to the terminal by marking the EFCI in the header of the congested VC cell or rewriting the passing RM cell.

2.3 Fifth Embodiment (Another Embodiment of Cell Multiplexing Device Using the Concept of “Kago”)
Next, a fifth embodiment will be described.

  FIG. 7 shows another configuration example of the cell multiplexing apparatus using the concept called the basket according to the fifth embodiment.

  The cell multiplexing apparatus shown in FIG. 7 is provided corresponding to each of the input ports # 1 to #N, and a plurality of input buffers 220 that temporarily store cells input from the input ports # 1 to #N. And an output buffer 221 that multiplexes the cells output from the input buffer 220 and outputs them to the output port, and controls the cell output of the input buffer 220 by the back pressure signal according to the congestion state in the output buffer 221.

  This cell multiplexing apparatus includes a basket management unit 222 that manages an output-permitted cell set.

  Of the cells stored in the input buffer 220, a set of cells permitted to be output (output permitted cell set) is called a basket. A cell to be output from the input buffer is selected from the basket 223.

  The basket management unit 222 inputs the number of cells in the output buffer, determines a cell transfer instruction to the basket 223 from a predetermined algorithm, and broadcasts it to all the input buffers 220.

  In response to the cell transfer instruction, the input buffer 220 adds to the car 223 a set of cells 224 to be output by the same time among the cells stored in the input buffer 220 other than the car 223.

  If FIG. 7 is considered as a part related to each output port of the cell switch, this embodiment can be applied to the cell switch.

  The output buffer 221 shown in FIG. 7 may take any form as long as it can guarantee that the cells of the basket 223 can be output to the output port within a finite time in any situation.

  For example, the configuration shown in FIG. 4 may be used. In this case, the back pressure generation unit 20 may exist in the basket management unit 222. The number of cells in the output buffer is added by the back pressure generation unit 20 and output to the basket management unit 222.

  According to the cell multiplexing apparatus that performs inter-VC fair queuing according to the fifth embodiment, an output buffer that requires high throughput has a simple configuration and can be easily realized. The input buffer needs to manage cells by a cage, but since the throughput required for the input buffer is low, it is easy to implement.

  The configuration of the cell multiplexing apparatus in FIG. 7 will be described in further detail.

  For the cell number information, the basket management unit 222 determines a relatively small threshold value and magnitude. Whether the threshold value is a fixed value or a dynamically changing value depends on the algorithm of the basket management unit 222. If the threshold value is a fixed value, the comparison result is used instead of the number of cells. You may input into the basket management part 222. FIG. Alternatively, if any value greater than a certain value does not affect the processing of the basket management unit 222, the value greater than that value may be encoded into a single code and input. For example, with 4 bits, the number of cells is (0000) = 0, (0001) = 1, (0010) = 2, (0011) = 3,..., (1101) = 13, (1110) = 14, (1111) = The encoding may be performed in 16 stages of 15 or more. Accordingly, there is an advantage that the input information to the basket management unit 222 can be compressed and the mounting becomes easy.

  An example of the algorithm used by the basket management unit 222 to determine a cell transfer instruction to the basket 223 is as follows.

  That is, it is determined whether or not the number of cells in the output buffer 221 does not underflow based on the number of cells in the output buffer, and a transfer instruction is issued so as not to underflow only when it is determined that there is a possibility of underflow. Underflow refers to a state in which the number of cells in the output buffer becomes zero, and the cells of the input buffer 220 that should originally be output cannot be effectively output.

  The input buffer 220 adds a set of cells 224 to be output by the same time to the car 223 in response to a cell transfer instruction to the car 223. For example, when performing inter-VC fair queuing weighted by a value Nx set for each VC, a set of cells to be output by the same time is a cell not included in the basket 223 in each input buffer. The oldest Nx cells are collected every time.

  Since the transfer instruction is broadcast to all the input buffers, cells enter the basket 223 fairly between the VCs through the plurality of input buffers. By transferring the cells of the cage 223 to the output buffer 221 with priority over the cells outside the cage, the cells can be transferred to the output buffer 221 fairly between the VCs through the plurality of input buffers 220. If the output buffer 221 is configured to be able to output a cell input from the car 223 in any time within a certain time, the cell transferred to the car 223 fairly between VCs has a delay fluctuation of that time, Output from the output port.

  FIG. 7 shows, as an example, a state where two, one, and three VCs are queued in the input buffers 220 of the input ports # 1, # 2, and #N, respectively. When all VCs have the same weight, if the fair VC queuing is performed, the output from each input buffer 220 needs to be a ratio of 2 to 1: 3.

  In the cell multiplexing apparatus of FIG. 7, the number of cells in the car is a ratio of 2 to 1: 3 in each input buffer according to the cell transfer instruction sent to the car 223 from the car management unit 222 to all the input buffers 220. As a result, the output from the output buffer 221 also has a ratio of 2 to 1: 3.

  There are two methods for inputting cells into the basket 223. Here, a case will be described as an example where the oldest Nx cells (values set for each VC) are placed in the basket for each VC when transfer is instructed.

  One method is a method in which a cell input to the input buffer 220 does not enter the cage at first even if the condition for entering the cage 223 is satisfied. A cell is transferred to the car 223 only when cell transfer is instructed by the car management unit 222. As a result, the number of cells in the basket decreases except when the basket management unit 222 instructs cell transfer.

  As another method, there is a method in which a cell input to the input buffer 220 is inserted into the cage 223 from the beginning when the condition for entering the cage 223 is satisfied. That is, the VC that has transferred Nx cells to the basket 223 at the time of the transfer instruction cannot enter the cell into the basket 223 until the next transfer instruction is issued, but does not transfer any cells to the basket 223 at the time of the transfer instruction. The VC or the VC whose number of transfer cells is less than Nx can input the input cell into the car 223 until there is no transfer instruction until Nx. As a result, the number of cells in the car may increase between transfer instructions, but decreases when almost all active VCs have transferred Nx cells. Note that this embodiment works effectively in either method.

  The determination of the congestion state of the cell multiplexing apparatus of the fifth embodiment may be performed by monitoring information that varies depending on traffic for each VC by a predetermined method. Then, the cell multiplexing apparatus may notify the traffic control information to the terminal for each VC based on this congestion determination.

  The fluctuating information to be monitored is, for example, the number of stored cells, the relationship between the number of input cells per fixed time and the target value, and the relationship between the time input by a certain number of cells and the target value. A VC having a large number of accumulated cells, a VC having a large number of input cells per fixed time far from the target value, and a short VC having a time of inputting a certain number of cells far from the target value are determined to be a congested VC.

  The traffic control information can be notified to the terminal by marking the EFCI in the header of the congested VC cell or rewriting the passing RM cell.

2.4 Advantages of Cell Multiplexing Apparatus According to Fourth and Fifth Embodiments As described above, cells using the concept of the output permitted cell set (cage) according to the fourth to fifth embodiments. According to the multiplexing apparatus, since the output throughput of each input buffer is adjusted by controlling the cells to be included in the output permitted cell set, it is possible to perform fair queuing between VCs, fault tolerance in ABR service, and UBR. It is possible to achieve fairness in services.

2.5 Sixth Embodiment (Cell Buffer Device Using Cell Group FIFO)
Next, an embodiment of a cell buffer device that performs fair VC queuing according to the present invention will be described.

  FIG. 8 shows a configuration example of a cell buffer device using a cell group FIFO according to the sixth embodiment.

  8 notifies the buffer pointer management unit 230 of the connection identification information of the cell input from the input link, obtains a write pointer indicating the cell write position from the buffer pointer management unit 230, and temporarily stores the cell in the cell buffer 231. This is a cell buffer device that accumulates and reads cells from the cell buffer 231 based on a read pointer indicating a read cell from the buffer pointer management unit 230 and outputs it to an output link.

  The buffer pointer management unit 230 manages a buffer pointer indicating the position of the accumulated cell on the cell buffer 231.

  The buffer pointer management unit 230 includes a cell group FIFO 232a for FIFO management of a plurality of cell groups as a set of buffer pointers, an output waiting cell group FIFO 232b, a cell group selection unit 233, and an empty buffer pointer management unit 234.

  At the time of cell input, the buffer pointer management unit 230 obtains an empty buffer pointer from the empty buffer pointer management unit 234 and uses it as the write pointer, and the cell group selection unit 233 sets the write pointer from the connection identification information to the head of the cell group FIFO 232a. The cell group is instructed so as to enter the number determined in accordance with the predetermined weight for each VC in order from the cell group, and the cell group FIFO 232a inputs the write pointer to the instructed cell group in accordance with the cell group instruction.

  At the time of cell output, the cell group is output from the head of the cell group FIFO 232a, and a buffer pointer is further output from the cell group as the read pointer, and the read pointer is returned to the empty buffer pointer management unit 234.

  FIG. 8 shows a configuration in the case where there is a possibility that a plurality of cell groups are output from the cell group FIFO 232a and waiting for output. The cell groups output from the cell group FIFO 232a are input to the output waiting cell group FIFO 232b.

  The cell group of the output waiting cell group FIFO 232b is a cell group whose output is permitted by some management unit outside the cell buffer 231. For example, it corresponds to the car 231 in FIG.

  The read pointer is a buffer pointer output from the head cell group of the output waiting cell group FIFO 232b.

  For example, all VCs have the same weight. The cell of the first cell group of the cell group FIFO 232a is the cell at the head of the queue (except for the cells in the output waiting cell group FIFO 232b) when considering the queue of each VC. The cell in the second cell group from the top of the cell group FIFO 232a is the second cell in the queue of each VC. The same applies to the cells in the third and subsequent cell groups. When these cells are output, the cells are output in order from the first cell group of the cell group FIFO 232a, so that they are output fairly between VCs.

  When a VC cell that has not arrived at all until this time arrives at this buffer device, it is input to the first cell group of the cell group FIFO 232a, and has priority over the second and subsequent cells of the other VC queues. Is output.

  As described above, according to the cell buffer device of the sixth embodiment, it is possible to perform fair queuing between VCs while searching for cells as in the conventional example shown in FIG. There is an advantage that no operation is required.

  As a method for realizing the cell group FIFO 232a of the cell buffer device according to the sixth embodiment, for example, a pointer chain method or a ring buffer method may be considered.

2.6 Seventh Embodiment (Another Embodiment of Cell Buffer Device Using Cell Group FIFO)
Next, a seventh embodiment will be described.

  FIG. 9 shows another configuration example of the cell buffer device using the cell group FIFO according to the seventh embodiment.

  FIG. 9 notifies the buffer pointer management unit 240 of cell connection identification information input from the input link, obtains a write pointer indicating the cell write position from the buffer pointer management unit 240, and temporarily stores the cell in the cell buffer 241. This is a cell buffer device that accumulates and reads cells from the cell buffer 241 based on a read pointer indicating a read cell from the buffer pointer management unit 240 and outputs it to the output link.

  The buffer pointer management unit 240 manages a buffer pointer indicating the position of the accumulated cell on the cell buffer 241.

  The buffer pointer management unit 240 includes a cell group FIFO 242 that performs FIFO management of a cell group that is a set of buffer pointers, a cell group selection unit 243, and an empty buffer pointer management unit 244.

  At the time of cell input, the buffer pointer management unit 240 obtains an empty buffer pointer from the empty buffer pointer management unit 244 and uses it as the write pointer, and the cell group selection unit 243 sets the write pointer based on the connection identification information to the head of the cell group FIFO 242. The cell group is instructed so as to enter the number determined in accordance with the predetermined weight for each VC in order from the cell group, and the cell group FIFO 242 inputs the write pointer to the instructed cell group according to the cell group instruction.

  At the time of cell output, a buffer pointer is output from the first cell group of the cell group FIFO 242 to be used as the read pointer, and the read pointer is returned to the empty buffer pointer management unit 244.

  In FIG. 9, the cell group waiting for output in the cell group FIFO 242 is shown as an output waiting cell group FIFO 242b.

  The cell group of the output waiting cell group FIFO 242b is a cell group whose output is permitted by some management unit outside the cell buffer 241. For example, it corresponds to the basket of FIG.

  The read pointer is a buffer pointer output from the head cell group of the output waiting cell group FIFO 242b.

  For example, all VCs have the same weight. The cell of the head cell group of the cell group FIFO 242 (that is, the cell group in the output waiting cell group FIFO 242b) is the head cell of the queue when considering the queue of each VC. The cell in the second cell group from the top of the cell group FIFO 242 is the second cell in the queue of each VC. The same applies to the cells in the third and subsequent cell groups. When these cells are output, the cells are output in order from the first cell group of the cell group FIFO 242, so that they are output fairly between VCs.

  When a VC cell that has never arrived at this time arrives at this buffer device, it is input to the first cell group of the cell group FIFO 242 and has priority over the second and subsequent cells of the other VC queues. Is output.

  As described above, according to the cell buffer device of the seventh embodiment, a search can be performed as in the conventional example shown in FIG. 51 at the time of cell input and output while being able to perform queuing fairly between VCs. There is an advantage that no operation is required.

  As a method for realizing the cell group FIFO 242 of the cell buffer device according to the seventh embodiment, for example, a pointer chain method or a ring buffer method may be considered.

2.7 Data Structure Used in Cell Buffer Device According to Sixth Embodiment Next, a data structure used in the cell buffer device (see FIG. 8) according to the sixth embodiment will be described.

  10 and 11 show an example of the data structure when the buffer device described in FIG. 8 is realized by the pointer chain method.

  Broadly divided, as shown in FIG. 10, a VC table 250, a cell group FIFO 232a, an output waiting cell group FIFO 232b, an empty buffer pointer chain 251, and an empty cell group chain 252 as shown in FIG.

  The cell group FIFO 232a has cell group FIFO management data 253 for managing the cell group FIFO 232a, and the output waiting cell group FIFO 232b has output waiting cell group FIFO management data 254 for managing it.

  The cell group and empty buffer pointer chain 251 are buffer pointer chains, and the cell group FIFO 232 a and empty cell group chain 252 are chains of cell group management data 255.

  The output waiting cell group FIFO 232b has a list of pointers (Ptr1, Ptr2, Ptr3,...) Pointing to the cell group in the output waiting cell group FIFO management data 254.

  The cell group FIFO 232a and the output waiting cell group FIFO 232b may be of a ring buffer system.

  When a cell is input, it must be determined to which cell group the write pointer extracted from the empty buffer pointer chain 251 is input. Therefore, first, the corresponding area of the VC table 250 is read. In the VC table 250, Nx is the weight of the VC, Nc is the work variable, Qlen is the number of cells stored in the VC, and Ptr is a pointer to the end of the cell group in which the cells of the VC are stored.

  First, Qlen is checked to see if the VC cell is currently stored in the buffer device. If Qlen is zero, it is put in the first cell group of the cell group FIFO 232a. Even when Qlen is 1 or more, if Ptr indicates a cell group in the output waiting cell group FIFO 232b, the cell group is inserted into the first cell group of the cell group FIFO 232a.

  In other cases, 1.0 is added to Nc and compared with Nx, and if Nx is larger, it is put in the cell group pointed to by Ptr, otherwise it is put in the cell group next to the cell group pointed to by Ptr. Put in.

Here, a procedure for updating Nc when a cell is input will be described. As described above, when a buffer pointer is input to the first cell group of the cell group FIFO 232a for the VC for the first time, Nc: = 1.0. In other cases, Nc is updated to Nc: = Nc + 1.0. As a result, if Nx > Nc, a buffer pointer is inserted into the cell group. On the other hand, if Nx <Nc, the buffer pointer is inserted into the cell group next to the cell group FIFO 232a and at the same time, Nc: = Nc−Nx is rewritten (that is, 0 <Nc < Nx).

If it is necessary to put a buffer pointer in the cell group next to the last cell group of the cell group FIFO 232a, the cell group management data 255 is taken out from the head of the empty cell group chain 252 and put at the end of the cell group FIFO 232a. What is necessary is just to put a buffer pointer in a cell group. In the output waiting cell group FIFO management data 254, pointers Ptr1, Ptr2, Ptr3,... Pointing to the cell groups are shift registers. The cell group indicated by Ptr1 is the head of the FIFO, and the buffer pointer output from this cell group serves as a read pointer. The read pointer is input at the end of the empty buffer pointer chain 251. When the buffer pointer of the cell group indicated by Ptr1 becomes empty, the cell group is input at the end of the empty cell group chain 252. Then, the pointer Ptr (n) is shifted to Ptr (n−1) for all n > 2, and the buffer pointer is output from the cell group indicated by the new Ptr1.

  As described above, it is necessary to determine whether or not Ptr in the VC table 250 indicates a cell group waiting for output when a cell is input. Therefore, the output waiting cell group FIFO management data 254 needs to be configured so that it can be easily searched.

  When a cell group is newly transferred from the cell group FIFO 232a to the output waiting cell group FIFO 232b, the number of cell groups in the output waiting cell group FIFO management data 254 is incremented (m), and Ptr (m) becomes the cell group. The cell group output from the FIFO 232a is pointed to.

  Note that the cell buffer device according to the sixth embodiment can be easily applied to an input buffer using the concept of a cage as shown in FIGS. In this case, the output waiting cell group FIFO 232b corresponds to the basket. The present invention can also be applied to the output buffer shown in FIG.

2.8 Data Structure Used in Cell Buffer Device According to Seventh Embodiment Next, a data structure used in the cell buffer device according to the seventh embodiment (see FIG. 9) will be described.

  12 and 13 show an example of the data structure when the buffer device described in FIG. 9 is realized by the pointer chain method.

  Broadly divided, as shown in FIG. 12, a VC table 260, a cell group FIFO 242, an empty buffer pointer chain 261, and an empty cell group chain 262 as shown in FIG.

  The cell group FIFO 242 includes an output waiting cell group FIFO 242b, and includes cell group FIFO management data 263 for managing the cell group FIFO 242 and output waiting cell group FIFO management data 264 for managing the output waiting cell group FIFO 242b.

  The cell group and empty buffer pointer chain 261 are buffer pointer chains, and the cell group FIFO 242 and empty cell group chain 262 are chains of cell group management data 265.

  The output waiting cell group FIFO 242b is several cell groups at the head of the cell group FIFO 242. That is, in FIG. 12, the cell group FIFO 242 from the cell group pointed to by the head pointer of the cell group FIFO management data 263 to the cell group pointed to by the tail pointer of the output queue cell group FIFO management data 264 is the output queue cell group FIFO 242.

  The cell group FIFO 242 and the output waiting cell group FIFO 242b may be of a ring buffer system.

  When a cell is input, it must be determined to which cell group the write pointer extracted from the empty buffer pointer chain 261 is input. Therefore, first, the corresponding area of the VC table 260 is read. In the VC table 260, Nx is the weight of the VC, Nc is a work variable, Qlen is the number of cells stored in the VC, and Ptr is a pointer to the end of the cell group in which the cells of the VC are stored.

  First, Qlen is checked to see if the VC cell is currently stored in the buffer device. If Qlen is zero, it is put in the first cell group of the cell group FIFO 242.

  In other cases, 1.0 is added to Nc and compared with Nx, and if Nx is larger, it is put in the cell group pointed to by Ptr, otherwise it is put in the cell group next to the cell group pointed to by Ptr. Put in.

Here, a procedure for updating Nc when a cell is input will be described. As described above, when the buffer pointer is input to the first cell group of the cell group FIFO 242 for the VC for the first time, Nc: = 1.0. In other cases, Nc is updated to Nc: = Nc + 1.0. As a result, if Nx > Nc, a buffer pointer is inserted into the cell group. Conversely, if Nx <Nc, the buffer pointer is inserted into the cell group next to the cell group FIFO 242, and at the same time, Nc: = Nc−Nx is rewritten (that is, 0 <Nc < Nx).

  When a cell is input, if the cell group is not in the cell group FIFO 242, if it is necessary to put a buffer pointer in the cell group next to the last cell group of the cell group FIFO 242, the start of the empty cell group chain 262 The cell group management data 265 is taken out, put at the end of the cell group FIFO 242, and a buffer pointer is put into the cell group.

  The output waiting cell group FIFO management data 264 has a pointer indicating the end of the output waiting cell group FIFO 242b. The head is the same as the head cell group of the cell group FIFO management data 263.

  A buffer pointer is output from the head cell group of the output waiting cell group FIFO 242b (the same cell group as the head of the cell group FIFO), and this buffer pointer becomes a read pointer. The read pointer is input at the end of the empty buffer pointer chain 261.

  When the buffer pointer of the head cell group of the cell group FIFO 242 becomes empty, the cell group management data 265 is output from the cell group FIFO 242 and input to the end of the empty cell group chain 262.

  When a cell group is newly transferred to the output waiting cell group FIFO 242b, the pointer indicating the end of the output waiting cell group FIFO management data 264 is changed to indicate the next cell group on the cell group FIFO 242.

  Note that the cell buffer device according to the seventh embodiment can be easily applied to an input buffer using the concept of a cage as shown in FIGS. In this case, the output waiting cell group FIFO 242b corresponds to the basket. The present invention can also be applied to the output buffer shown in FIG.

2.9 Advantages of Cell Buffer Device According to Sixth and Seventh Embodiments As described above, according to the cell buffer device that performs fair VC queuing according to the sixth to seventh embodiments, VC The processing for searching the table is not necessary, and therefore, it can be easily realized without depending on the upper limit of the number of settable VCs.

2.10 Inter-flow Weighted Fair Queuing The cell buffer apparatus that performs the above-described fair VC inter-queuing has been described by taking as an example the case of handling cells that are fixed-length packets. A packet buffer apparatus capable of simultaneously handling packets of different lengths can output the input packets fairly based on the weights determined for each flow as described below.

  The flow here is a set of packets identified by a certain standard as shown in the following example.

  A so-called flow in the IP network (identified by a combination of source address, source report, destination address, destination port), or VCC or VPC in the ATM network.

  Differences in IP network service classes (guaranted, controlled-load, best-effort, etc.) or ATM network service categories (CBR, VBR, ABR, etc.).

・ Protocol differences (TCP / IP, DECnet, SNA, AppleTalk, etc.)
・ Application differences (ftp, telnet, etc.)
・ Different organizations sharing the same bucket buffer device (by company, etc.)
By treating these as different flows in the packet buffer device of the present invention, traffic can be separated from each other.

  First, general inter-flow weighted fair queuing will be described with reference to FIG. The purpose of this packet buffer device is to output packets stored in the device fairly according to the weight of the flow. The operation is easy to understand when considering a FIFO for each flow as shown in FIG. In the figure, there are three flow queues (FIFOs) of flow 1, flow 2, and flow 3, and packets of various lengths are stored in each queue. The number attached to the packet in the figure is the length of the packet in bytes.

  Processing when a packet is input to the packet buffer device is to determine a flow to which the input packet belongs and store it in a queue for each flow.

  On the other hand, it is necessary to output packets fairly between flows, and it is important to output packets in which queue and in which order. One method will be described in accordance with the situation of FIG. In order to simplify the description, the weights of the flows are assumed to be the same here. Here, the unit of fairness is assumed to be 500 bytes.

  First, a packet of 500 bytes in total including a packet having a length of 300 bytes and a packet having a length of 200 bytes is output from the head of the queue of flow 1. Next, two packets having a length of 250 bytes from the head of the queue of flow 2 are output in succession. Then, one packet having a length of 500 bytes is output from the head of the flow 3 queue. When outputting in this way, one packet of the length of each flow byte is output at this point. With such an output, it can be said that the packets are output evenly because at this point, packets of equal 500 bytes are output from each flow. Subsequently, it is sufficient to repeat outputting packets of 500 bytes from each flow in order from flow 1 again. In this way, packets are output fairly between flows.

  Although the above method is fair in units of 500 bytes, it is not always fair in smaller units. However, it is known that strict fairness requires a very large processing capacity for the packet buffer device, and as a practical problem, it is often judged that the above-mentioned degree of fairness is sufficient.

  In the above description, the number of flows is three. However, when the packet buffer device handles an enormous number of flows, how to search for a flow in which packets are accumulated in a queue, The issue is whether to output. The present invention solves this problem using the concept of packet groups.

  In the present invention, the queues of all flows are divided into fixed lengths as in Z, A, B, C, and D in FIG. At this time, attention is paid to that a fair packet output can be realized by outputting a packet in units of each delimiter. In the present invention, packets are grouped and managed for each of these breaks. Each group is called a packet group. A packet group includes a plurality of flow packets. As for the output of the packet, the packet of the packet group Z closest to the output side is output first, and then the packet of the packet group A is output. Further, by outputting the packets of the packet group in order of B, C, and D, the packet buffer device of the present invention can output the packets fairly between the flows.

  By the way, looking at the flow 3 of the break B in FIG. 14, a 350-byte packet is accumulated after a 400-byte packet. In the figure, the maximum number of packets belonging to the same delimiter is 500 bytes. Therefore, both a 400-byte packet and a 350-byte packet that are not divided in the packet buffer device cannot be delimited and put into B. On the other hand, if a 350-byte packet that has arrived at the packet buffer device later is not included in break B, a gap of 100 bytes will occur in break B. The handling of such a case will be described later.

  The concept of the packet group of the present invention has been described above.

  Next, an example of the packet buffer device of the present invention will be described more specifically with reference to FIG.

  The constituent elements of the present invention include a packet group, a packet group FIFO, a flow table, and an output waiting packet group.

  The packet group is a group of accumulated packets as described above. In FIG. 15, A, B, C, and D are packet groups. Packets belonging to each packet group are ordered, and the packet group has a FIFO structure.

  In the present invention, as shown in FIG. 15, a packet group which is a FIFO of a packet is further managed by the FIFO. This FIFO of the packet group is called a packet group FIFO.

  The flow table stores information for each flow. In the flow table, Nx is a set value of the weight of the flow, Nc is a work variable, an accumulated amount is a total amount of accumulated packets of the flow, and Ptr is a pointer to a packet group to which a packet arriving at the end of the flow belongs. The accumulation amount has the purpose of indicating whether or not the packet buffer device is accumulating packets for the flow. For example, the accumulation amount is accumulated for each flow by adding the input packet length when inputting the packet and subtracting the output packet length when outputting the packet. Holds the total number of bytes in the packet.

  The output waiting packet group is a packet group output from the packet group FIFO (packet group Z in the figure). When outputting a packet from the packet buffer device, a packet belonging to the output waiting packet group is output.

  If a packet is entered, it must be determined to which packet group it will be placed.

  First, it is checked whether or not the packet of the flow is currently stored in the buffer device. By referring to the accumulated amount of the flow in the flow table from the flow identification information, it can be determined whether it is zero or not. If it is not currently stored, the input packet is put into the first packet group (packet group A in FIG. 15) of the packet group FIFO.

  Even if the accumulation amount is larger than zero, if Ptr points to the output waiting packet group (packet group Z in FIG. 15), the input packet is also put into the first packet group A of the packet group FIFO.

  In other cases, it is determined by the input packet length and Nx, Nc, Ptr.

  Nx of each flow indicates the average amount of packets managed by one packet group for the flow. Nx is set to a value larger than the maximum packet length of the flow.

  Nc indicates the remaining amount that the flow can enter the packet group indicated by Ptr by calculating Nx-Nc. If Nx−Nc ≧ (input packet length), the input packet is put into the packet group pointed to by Ptr. Conversely, if Nx−Nc <(input packet length), the packet targeted by Ptr on the packet group FIFO Put the input packet in the next packet group of the group.

  When the packet group is determined, the values of Nc and Ptr are updated next. If the first packet of the flow is put in the first packet group of the packet group FIFO, Nc: = (input packet length). In other cases, first, Nc: = Nc + (input packet length), and if Nx <Nc, the result is further rewritten as Nc: = Nc−Nx (that is, 0 <Nc ≦ Nx). Ptr writes a pointer to the packet group containing the input packet.

  In the present invention, one packet is not managed by two packet groups. Therefore, when the length of the input packet exceeds Nx−Nc, the input packet is put into the next packet group without being put into the packet group pointed to by Ptr. However, in calculating Nc, one packet is divided into two packet groups. That is, Nc: = Nc + (input packet length), and if there is a portion exceeding Nx, that Nc-Nx is set as Nc of the next packet group. By this algorithm, on average, Nx packets belong to one packet group.

  The packet input operation will be specifically described with reference to FIG. FIG. 15 shows a scene in which a packet having a length of 250 bytes arrives at the packet buffer device in the flow 1. At this time, Ptr of the flow 1 indicates the packet group B. In updating the flow table, Nc is set to Nc: = Nc + (input packet length) = 200 + 250 = 450 according to the above procedure. Since this value is less than or equal to Nx, this input packet is put into the packet group B pointed to by Ptr.

  If the input packet length of flow 1 is 350 instead of 250, Nc: = 200 + 350 = 550, which exceeds Nx. Therefore, Nc: = Nc−Nx = 550−500 = 50 is updated, and this input packet is put into the packet group C next to the packet group B. Ptr is changed to packet group C.

  The packet group FIFO is a first-in first-out queue, and the number of queued packet groups can be increased as necessary. For example, assuming that a packet having a packet length of 400 arrives in flow 2 in FIG. 15, an empty packet group (packet group E) is added next to packet group D, and an input packet is put into the packet group E. become.

  As described above, the processing at the time of packet input may be performed by changing the corresponding part of the flow table, putting the packet into the packet group, and adding an empty packet group to the packet group FIFO if necessary. It is possible to perform processing at the time of input without searching the flow table across a plurality of flows, and the complexity of processing does not change even if the number of flows increases.

  On the other hand, the processing required when outputting a packet is even simpler. That is, a packet may be output from the output waiting packet group. If necessary, a packet group is output from the packet group FIFO before that. These processes are also possible without searching the flow table across a plurality of flows, and the complexity of the process does not change even if the number of flows increases.

  As described above, the weight Nx of each flow indicates the average amount of packets per packet group for the flow. Since the packet buffer device of the present invention outputs packets in units of packet groups, the output sleep of each flow is proportional to Nx.

  According to this packet buffer device, it is possible to realize a weighted and fair packet buffer device that can easily handle variable-length packets without depending on the upper limit of the number of flows that can be set, without requiring processing for searching a flow table. it can.

  Each packet group of the present invention manages packets in the order of arrival. In other words, the output order of packets belonging to the same packet group is in the order of arrival through all the flows. This property has an effect of reducing packet delay fluctuation.

  Further, the packet buffer device of the present invention can realize the selection of output cells for fair queuing between VCs at a high speed even when the number of VCs increases as compared with the algorithm called DRR described in the prior art. Even if the value increases, the burstiness of output traffic does not increase. The burstiness does not increase in the present invention because when an input packet is distributed and managed to a plurality of sets (packet groups), the packets are managed independently of the flow (VC) in one set, and This is because when outputting from a set (packet group), it is output regardless of the flow (VC).

3. Queue monitoring considering back pressure (eighth embodiment)
Next, a cell buffer device that performs queue monitoring in consideration of back pressure according to an eighth embodiment of the present invention will be described.

  FIG. 16 shows an example of a change in the queue length in the input buffer as described in the first, second, fourth, and fifth embodiments, for example.

  The cell buffer device according to the eighth embodiment is a cell buffer device that is controlled in two states of output enabling and output prohibiting by a back pressure signal, and the back pressure signal has changed from output enabling to output prohibiting. From the time until the next change from possible output to prohibited output, only the number of stored cells at the time of the first cell input is monitored.

  The purpose of monitoring is determination of congestion, determination of discard of input cells to prevent monopolization of the buffer area when a plurality of queues share one buffer area, and the like.

  FIG. 17 shows a configuration example of a cell buffer device having a queue monitoring unit taking back pressure into consideration. In FIG. 17, the cell buffer device includes a plurality of queues Qi (i = 1 to N), a queue table storage unit 280, a back pressure identifier (BPID) storage unit 281 and a queue monitoring unit 282.

  Qlen i of the queue table stored in the queue table storage unit 280 is the number of accumulated cells in the queue, Cnti is a congestion determination variable (initial value zero), and BPIDt i is a back pressure identifier (BPID) at the time of the last cell input. .

  When the cell enters the queue, the input cell information is transferred to the queue monitoring unit 282. BPID is incremented as shown in FIG. 16 when the back pressure signal changes from output enable to output disable. The queue monitoring unit 282 monitors the queue length based on the algorithm shown in FIG.

  FIG. 18 shows an example of a buffer queue length monitoring algorithm in consideration of back pressure. This shows an example in which the queue length is monitored to determine the presence or absence of congestion.

  When a cell is input to the queue Qi and the cell input process is started, first, Qleni is incremented (step S1).

  Next, it is determined whether or not the queue length should be monitored by comparing BPID and BPIDt i (step S2). That is, monitoring is performed when the queue length that fluctuates due to the back pressure signal becomes shorter.

If BPID ≠ BPIDt i, the queue length should be monitored, and it is first determined whether Cnti > 1 (step S3). At this time, if Cnti > 1, it is determined that the state is congested until just before, and Qlen i is compared with a value (Qth−H) having a hysteresis in the threshold value Qth for determining whether or not the state is congested (step S11). S4).

On the other hand, if Cnti > 1 is not satisfied, Qlen i> Qth is determined (step S5). When the queue length Qlen i is compared with Qth−H or Qth in step S4 and step S5, these threshold values are exceeded (that is, when Qlen i> Qth−H or Qlen i> Qth. ), Cnti: = Qlen i −Qth + H is performed (step S6, step S7), otherwise Cnti: = 0 is set (step S8, step S9). Further, the process proceeds to step S10.

  If BPID == BPIDt i in step S2, the queue length should not be monitored, and the process directly proceeds to step S10.

In step S10, Cnti > 1 is determined. If so, it is in a congested state, and the process proceeds to step S11, where “1” is subtracted from Cnti (Cnti: = Cnti−1), and the input cell is discarded (step S12). Subtract (Qlen i: = Qlen i −1). If Cnti > 1 is not satisfied (step S10), it is not a congestion state.

  Finally, the value of BPID is substituted into BPIDt i to update BPIDt i (step S13).

  As described above, according to the flowchart shown in FIG. 18, the accumulation at the time of the first cell input from when the back pressure signal changes from output possible to output prohibition until the next time when output possible changes to output prohibition. Only the number is monitored.

H represents a parameter relating to hysteresis. Hysteresis has the effect of reducing the vibration of determination results such as cell discard and congestion that are performed by monitoring the queue length. If 0 < H <Qth and hysteresis is not required, set to zero.

  In FIG. 18, the threshold value Qth and the hysteresis parameter H show the case where the same value is used for all the queues, but different values may be set for each queue.

  Here, a method for determining the threshold value Qth will be described. First, consider a buffer that is not controlled by a backpressure signal. The buffer is input at a constant rate Ri and output at a constant rate R0. When Ri> R0, the buffer amount Qth necessary to prevent discarding for the time tT even if this load (Ri-RO) is applied is obtained by Qth = (Ri-RO) * tT.

On the other hand, in the eighth embodiment, as shown in FIG. 16, the input rate is constant at Ri, but the output rate from the input buffer is zero for the Tup time (output inhibition time from the input buffer). , Tdn time (time available for output from the input buffer) is Re. Assuming that changes in Tup and Tdn are small, the buffer amount Qth necessary to prevent discarding for the time tT even when this load is applied is as follows.

It becomes. Here, the average output rate R′0 from the output port is

  Therefore, Qth = (Ri-R'O) * tT, and the cell buffer device of the eighth embodiment sets the same threshold as that in the case of a simple buffer device without back pressure. By doing so, it is considered that almost the same effect can be obtained.

  Note that the same algorithm can be applied even when cell discard determination is performed instead of determining the congestion state.

  As described above, according to the cell buffer device considering the back pressure signal according to the eighth embodiment, the monitoring result of the queue length is hardly affected by the external condition, and the stable monitoring of the queue length is easy. is there.

4). Correction of cell number information in consideration of delay (9th embodiment)
Next, an embodiment of a cell buffer device for correcting cell number information according to the present invention will be described.

4.1 Ninth Embodiment (Cell Buffer Device Considering Delay)
FIG. 19 shows the configuration of a cell buffer device considering delay according to the ninth embodiment.

  The cell buffer device shown in FIG. 19 is roughly divided into a cell buffer network 300 in which one or more cell buffers B (Ba, Bb,...) Are connected in a plurality of stages (two stages in FIG. 19), and each cell buffer. The management unit 301 inputs the number of B cells and instructs the cell buffer B to transfer.

  The management unit 301 stores a transfer instruction history 302 and uses the transfer instruction history 302 when determining a new transfer instruction.

  The management unit 301 transmits a transfer instruction acting on the cell buffer B from the time when the cell buffer B transmits the number of cells to the management unit 301 until a time when the transfer instruction determined by the management unit acts on the cell buffer B. Is determined from the transfer instruction history 302, and the transfer instruction is determined from the number of transfer instructions and the number of cells.

  FIG. 20 is a diagram for explaining the principle of correcting the cell number information in the cell buffer device considering delay according to the present invention.

  Cells input from the input links # 1 and # 2 are temporarily stored in the cell buffers Ba1 and Ba2 in the previous stage, respectively. The cell is transferred to the cell buffer Bb according to the transfer instruction of the management unit 301, and the cell buffer Bb outputs the cell to the output link.

  Ba2 cell number Na2 and Bb cell number Nb are transmitted to management unit 301, and a transfer instruction is output to Ba1 and Ba2.

  Now, the cell number information arrives at the management unit 301 from Ba2, determines the transfer instruction from the information, instructs the transfer to Ba2, and sets the delay time until the number of cells of Ba2 changes according to this transfer instruction to D cells. Let it be a period. Further, the cell number information arrives at the management section from Bb, determines the transfer instruction from the information, instructs the transfer to Ba1 and Ba2, and the cell is transferred from Ba1 or Ba2 to Bb by this transfer instruction, and the cell of Bb The delay time until the number changes is also assumed to be the same D cell period for the sake of simplicity.

  Here, FIG. 20 shows a cell buffer device for performing priority control in which cell buffers Ba1 and Ba2 correspond to the class 1 cell storage unit and class 2 cell storage unit in FIG. 53, and cell buffer Bb corresponds to a cell multiplexing FIFO. Think. The cell transfer policy between the cell buffers Ba1, Ba2, and Bb is the same as that shown in FIG. That is, it is necessary to reduce the number of Bb storage cells, but a transfer instruction is made so as not to empty (= underflow) Bb. Further, the transfer instruction is performed so as not to give an empty instruction (the transfer instruction is issued to Ba2 only when a storage cell exists in Ba2).

  Assume that the cell number information Na2 output from Ba2 at time t2 arrives at the management unit 301, the management unit 301 issues a transfer instruction at time t3, and a cell is output from Ba2 at time t4 according to the transfer instruction. The information that the management unit 301 wants to know is the number of cells of Ba2 at time t4 when the transfer instruction actually acts on Ba2. This time is indicated by a white circle in FIG.

  Assuming that Ba2 has received a transfer instruction Ma2 times from time t2 to time t4 (= D cell period), Ba2 has output Ma2 cells during this time, and the number of cells of Ba2 at time t4 is Na2-Ma2. (When no cell is input to Ba2).

  Normally, since the transmission delay of the transfer instruction from the management unit 301 to Ba2 is constant, the transfer instruction number Ma2 received by Ba2 is determined by the management unit 301 between t1 and t3 such that t4−t2 = D = t3−t1. It is equal to the number of output transfer instructions. Therefore, by knowing the transfer instruction count Ma2 from the transfer instruction history 302, the number of cells decreased by Ba2 from time t2 to t4 can be accurately obtained.

  The same applies to Bb, and the amount of increase in the number of Bb cells from time t2 to t4 (the amount of increase due to transfer cells from Ba2) can be accurately obtained.

  The management unit 301 cannot know the number of cells input to Ba2 from time t2 to t4. In order not to give an empty instruction to Ba2, the number of Ba2 cells may be estimated slightly. Therefore, it is assumed that the cell input from the input link to Ba2 was not from time t2 to t4.

  Further, the management unit 301 cannot know the cell output from Bb from time t2 to time t4. In order to prevent Bb from underflowing, it is necessary to estimate the number of Bb cells slightly. Accordingly, it is assumed that the cell output from Bb is always output from time t2 to time t4 (it is assumed that the cell is D because it is a D cell period). Furthermore, it is assumed that the input cell from Ba1 is also zero.

  In summary, assuming that the corrected Na2 and Nb are N'a2 and N'b, respectively, N'a2 = Na2 + 0-Ma2N'b = Nb + Ma2-D. Therefore, the condition for the management unit 301 to give a transfer instruction to Ba2 is given by (N′b ≦ Th) and (N′a> 0).

  The transfer instruction to Ba1 is performed under the conditions of (N′b ≦ Th) and (N′a ≦ 0). Th is normally “1”. By correcting the number of cells as described above, transfer can be instructed while reducing underflow and empty instructions.

4.2 Method for Correcting Number of Cells in General Buffer Network Next, a method for correcting the number of cells in a general buffer network will be described.

  FIG. 21 is used to explain the basic principle. 21R> 1 includes the cell buffer network 300 and the management unit 301 as described above. The cell buffer network 300 includes a focused cell buffer Bx. The cell buffer Bx may physically be a plurality of buffers. The management unit obtains cell number information from the cell buffer Bx and gives a transfer instruction. First, terms used to describe the present invention are defined.

4.2.1. Definition of Terms Unless otherwise specified, the time is a relative time with the current time being zero, and is incremented by 1 every time the cell period elapses. Such a definition of time can be converted into other representation methods and is general. In addition, a period from a certain time t1 to a certain time t2 may be expressed as p, which is expressed as p = [t1, t2). This period p includes time t1, and does not include t2.

  The number of cells stored in the cell buffer Bx is represented by Nx. Nx is the number of storage cells that have arrived at the management unit 301 at the current time (t = 0).

The transfer instruction output from the management unit 301 to the cell buffer Bx at time t (t < 0) is represented by Ix (t). When transfer is instructed, Ix (t) = 1, and when transfer is not instructed, Ix (t) = 0.

The number of HOL cells in the cell buffer Bx that has arrived at the management unit 301 at time t (t < 0) is represented by Hx (t).

  The number of HOL cells is the number of cells that may be transferred from the cell buffer at a time by one transfer instruction. In particular, the HOL cell number information Hx that has arrived at the management unit 301 at the current time is represented as Hx (0).

The management unit 301 of the present invention stores the number of HOL cells Hx (t) in the cell buffer Bx obtained at time t (t < 0) and the transfer instruction Ix (t) output to the cell buffer Bx by itself.

The number of times the management unit has instructed transfer to the cell buffer Bx during a certain period p is represented as Smx (p). When p = [t1, t2), it is also expressed as Mx [t1, t2). That means

  FIG. 23 is a time chart showing the flow of cell number information from the cell buffer Bx to the management unit 301 and the flow of transfer instructions from the management unit 301 to the cell buffer Bx.

  As shown in this figure, times tf, tt, and th are determined. It is assumed that the number Nx of accumulated cells in the cell buffer Bx at the time tf and the number of HOL cells Hx in the cell buffer Bx at the time th are the latest information that the management unit 301 can directly know about the cell buffer Bx at the current time. At this time, it is assumed that the management unit 301 wants to predict the number of cells stored in the cell buffer Bx at time tt.

  Times t1, t3, and t2 are determined for times tf, tt, and th. The time at which the transfer instruction output from the management unit 301 at time t1 reaches the cell buffer Bx is denoted by tf, and the time at which the transfer instruction output by the management unit 301 at time t2 arrives at the cell buffer Bx is denoted by tt. Similarly, let th be the time at which the transfer instruction output by the management unit 301 at time t3 reaches the cell buffer Bx.

It is assumed that the times t1, t2, and t3 are past times from the current time. That is, t1 <t2 < 0 and t3 < 0.

4.2.2. Basic Principle Here, the basic principle of the present invention will be described. The management unit 301 of the present invention predicts a change in the number of stored cells from the transfer instruction history. When it is desired to obtain the number of accumulated cells at time tt for the cell buffer Bx described above, the number of accumulated cells Nx at time tf in the past was transferred according to the transfer instruction during this period using the transfer instruction history. Predict and correct the number of cells. The correction is based on the fact that the number of cells transferred by one transfer instruction is 1 or more. In particular, the number of cells transferred by the first transfer instruction after time th is based on being equal to or greater than the number of HOL cells Hx.

  4.2.3. Three functions, f (), g (), and Sc () used for correction are determined from the basic principle of three or more functions. These functions are used to determine how much the cell buffer Bx changes due to transfer of a cell according to a transfer instruction from time tf to time tt. It can be classified into three cases depending on what value th is compared with tf and tt, and different functions are applied.

(1) Function f ()
The function f () is used when th = tf <tt. A time chart at this time is shown in FIG. Let p1 [t1, t2). When Hx ≠ 0 and Smx (p1) ≠ 0, it is considered that Hx cell transfer is performed in the first transfer instruction in the period p1, and one cell is transferred in subsequent transfer instructions. The function f () for calculating the number of cells in the cell buffer Bx that changes from time tf to time tt can be obtained as follows using Hx and the number of transfer instructions Smx (p1) in the period p1 as arguments.

(2) Function g ()
The function g () is used when th <tf <tt. A time chart at this time is shown in FIG. p1 = [t1, t2) and p2 = [t3, t1).

In this case, it is necessary to distinguish between cases depending on whether or not the first transfer instruction arriving after time th is output from the management unit 301 in the period p2. Since no transfer instruction is output from the management unit 301 in the period p2, the value of Hx can be used in the period p1. The function g () for calculating the number of cells in the cell buffer Bx that changes from the time tf to the time tt is as follows with the transfer instruction counts Smx (p1) and Smx (p2) of Hx and periods p1 and p2 as arguments: Can be sought.

(3) Function Sc ()
The function Sc () is used when tf <tt = th. A time chart at this time is shown in FIG. Let p1 = [t1, t2). The latest number of stored cells that can be known by the management unit 301 is the value at the time tf. In this case, regarding the number of HOL cells, information for all periods from the time tf to the time tt has already arrived at the management unit 301. ing.

If the number of HOL cells at the time when the transfer instruction arrives at the cell buffer Bx is known, the number of cells to be transferred can also be known. Therefore, the function Sc () for calculating the number of cells in the cell buffer that changes from time tf to time tt is: Using Ix (t) and Hx (t) and using the period p1 as an argument, it can be obtained as follows.

  The method of correcting the number of cells as described above can be easily applied to, for example, a cell multiplexing apparatus that performs priority control between classes as shown in FIG.

  Further, for example, the cell number correction method can be easily applied to a cell multiplexing apparatus that performs inter-VC fair queuing as shown in FIG.

4.3 Advantages of Cell Buffer Device According to Ninth Embodiment As described above, according to the ninth embodiment, a cell buffer having a delay between the cell buffer and a management unit that manages the cell buffer. The apparatus uses the history of transfer instructions when determining the transfer instruction, and corrects the number of cells transmitted from the cell buffer to the number of cells at the time when the transfer instruction acts on the cell buffer. There is little deterioration in performance.

5. Cell switch (tenth embodiment)
5.1 Tenth Embodiment (Cell Switch)
Next, as a tenth embodiment, a cell switch in which the cell multiplexing device and the cell buffer device according to the present invention described so far are combined will be described.

  FIG. 25 shows a plurality of input buffers IB that temporarily store cells input from a plurality of input ports #i (i = 1 to N) and output them according to back pressure, and a back that corresponds to an internal congestion state. The cell switch 400 includes a back pressure cell switch 400 that outputs a pressure signal, and a basket management unit KM that transfers information between the input buffer IB.

  The cells handled in this configuration example generally have two priorities, a high priority cell and a low priority cell, and the low priority class is divided into a plurality of classes. Normally, a cell that transmits real-time information such as CBR and VBR is a high-priority cell, and a cell that transmits non-real-time information such as ABR and UBR is a low-priority cell.

  First, a cell switch with back pressure will be described.

  The features of the basket switch are the input buffer IB and the basket management unit KM. The cell switch 400 with back pressure only needs to be able to output an input cell within a predetermined time, and its architecture is not limited to that shown below. For example, the ATM switch shown in the IEICE Technical Report SSE93-6 “ATM Switch with Expandable Buffer Capacity: XATOM” may be used.

  The back-pressured cell switch 400 shown in FIG. 25 will be described as an example. It consists of a first stage unit switch SE1, a second stage unit switch SE2, and an output buffer OB. SE1 and SE2 are connected in a two-stage delta network via a parallel link, and the cell output from SE2 is transferred to OB and output to the output port. To do. Between SE1 and OB, it operates at k times speed. The value of k is determined so that the cell switch is non-blocking. For example, when SE1 and SE2 are 8 inputs and 8 outputs, k = 2 may be used when 16 inputs and 16 outputs are used as a whole.

  The cell switch 400 with back pressure in FIG. 25 is configured to handle two levels of priority, a high priority cell and a low priority cell.

  Focusing only on the replacement of the low-priority cells, the basic configuration is almost the same as that shown in the 1995 IEICE General Conference B-589 “A method for expanding the buffer capacity of an ATM two-stage switch network”. The low priority cell is exchanged and copied in SE1 and SE2.

  When the low-priority cell is congested by OB, the cell output to the output port of the IB is suppressed using the low-pressure cell back pressure signal. This back pressure signal basically prevents the OB and SE2 buffers from overflowing. However, these buffers may overflow due to the influence of the multicast cell. In preparation for this, an overflow back pressure signal for low priority cells is output from OB to SE2, and an emergency back pressure signal for low priority cells is output from SE2. Output to IB. Since IB accumulates low priority cells, SE2 and OB are not discarded.

  Instead of outputting the low-priority cell overflow backpressure signal to SE2, the OB may output this to the IB as a low-priority cell emergency backpressure signal. In this case, SE2 does not need to output a low priority cell emergency backpressure signal. However, as described above, the output of the low-priority cell emergency backpressure signal from SE2 has an advantage that the buffer sharing effect in SE2 can be effectively utilized.

  The high priority cell is exchanged and copied at SE1 and SE2 in the same manner as the low priority cell. For high priority cells, there is no backpressure signal from the cell switch with backpressure to the IB. The OB controls the cell output of SE2 by a high-priority cell back pressure signal reflecting the congestion of the high-priority cell. The IB does not accumulate high priority cells. If there is no empty buffer in SE2, it may be discarded.

  Next, the output buffer will be described.

  FIG. 26 shows a configuration example of the output buffer OB of the basket switch.

  The cells transferred from SE2 to OB are identified in priority by the identification unit 410, and are placed in a queue corresponding to each priority. The cells of each queue are selected according to the priority by the selection unit 411 and output to the output port. When the queue length of the low-priority cell exceeds a certain threshold, the OB stops the output of the IB low-priority cell to the OB using the low-priority cell back pressure signal. When the queue length of the high priority cell exceeds a certain threshold, the output of the high priority cell of SE2 to the OB is stopped using the back pressure signal for the high priority cell. In preparation for the case where the queue length of the low-priority cell continues to increase due to the influence of the multicast cell of the low-priority cell, the output of the SE2 low-priority cell to the OB is stopped using the low-priority cell overflow backpressure signal.

  Next, the unit switch will be described.

  FIG. 27 shows a configuration example of the first stage unit switch SE1 used for the basket switch. SE1 is a generally well-known switch LSI. With respect to the cell input from the input link, the identification section 415 identifies the cell header, performs a predetermined exchange process, and outputs it to the output link. Since the entire switch operates at k times speed, the number of cells stored in the internal cell buffer does not increase. This is known in the 1994 IEICE Autumn Conference B-439 “Examination of Switch Networks with Parallel Links”.

  FIG. 28 shows a configuration example of the second stage unit switch SE2 used for the basket switch. In SE2, the internal queue is a queue for each priority for each output link. The output of the queue for each priority is selected by the selection unit 421. When a high priority cell exists, the high priority cell is output to the output link regardless of the presence or absence of the low priority cell. However, when the high-priority cell back pressure signal input to the selection unit 421 instructs to prohibit the output of the high-priority cell, the low-priority cell may be output without outputting the high-priority cell. . The output of the low priority cell may be prohibited by the overflow back pressure signal for the low priority cell.

  SE2 can efficiently use the buffer in SE2 by sharing a physical buffer area among a plurality of priorities and a plurality of output links. The buffer status management unit 422 monitors the queue length for each queue, the result of summing the queue lengths for all output links for each priority, and the like.

  For example, the high priority cell queue has a threshold value for each queue, and when the threshold value is exceeded, the input cell of the queue is discarded. The low-priority cell queue monitors the total of all queue lengths, and if the threshold value is exceeded, informs the IB to prohibit the input of low-priority cells by a low-priority cell emergency backpressure signal.

  SE1 may use the same unit switch as SE2.

  In the cell switch 400 with back pressure in FIG. 25, cells are exchanged by the two-stage unit switches SE1 and SE2, but only one internal path is defined for each pair of input port and output port. Therefore, each unit switch does not need a complicated route selection algorithm when exchanging while copying the cell while looking at the cell header. If the number of output ports is about 32 or less, it is possible to easily add output port bitmap information to the cell header. SE1 and SE2 exchange cells based on the bitmap information.

  Next, the input buffer IB will be described.

  FIG. 29 shows a configuration example of the input buffer IB of the cage switch.

  The high priority cell input to the IB is preferentially output to SE1 for both unicast and multicast. Therefore, the cell delay fluctuation of the high priority cell is very small. There is no buffer for high priority cells in the IB.

  A feature of the present invention resides in a method for processing low priority cells. Hereinafter, only the low priority cell will be described.

  In FIG. 29, the input buffer IB mainly includes a plurality of output port unicast cell management units 430 that temporarily store input unicast cells for each output port of the cell, and temporarily inputs input multicast cells. A multicast cell management unit 431 that stores data in the network, and an output port selection scheduler 432 that selects the cells of these management units and outputs them from the input buffer.

  The unicast cell management unit 430 for each output port outputs the input cells from a plurality of unicast cell management units 433 for each class that temporarily store the input cells for each class of the cells and the unicast cell management unit 433 for each class. It has a class multiplexing FIFO 434 for multiplexing cells.

  The multicast cell management unit 431 includes a plurality of class-specific multicast cell management units 435 that temporarily store input cells for each class of the cell, and a class that multiplexes cells output from the class-specific multicast cell management unit 435 It has a multiplexed FIFO 436.

  Cells output from the class multiplexing FIFOs 434 and 436 of the unicast cell management unit 430 and the multicast cell management unit 431 for each output port are selected by the output port selection scheduler 432 and output from the input buffer IB.

  The output port selection scheduler 432 selects a cell in consideration of an external low pressure cell back pressure signal and a low priority cell emergency back pressure signal.

  The unicast cell management unit 433 for each class manages a queue (cage 440) that manages a set of cells that are permitted to be output from the basket management unit KM, among the accumulated cells, and other cells. And a queue (front basket 441) called a front basket.

  The cells that have entered the front basket 441 are managed in units called unit baskets. In FIG. 29, a vertical row in the front car 441 and the car 440 indicates a unit car. The input cell is managed fairly between VCs (CG) for each unit basket. The cell of the front car 441 is transferred to the car 440 in units of unit car according to an instruction from the car management unit KM.

  The cells of the basket 440 are transferred in units of cells and multiplexed by the class multiplexing FIFO 434 according to an instruction from the basket management unit KM.

  The operation of the multicast cell management unit 435 for each class will be described later.

  By sharing the cell buffer among all the output ports of the IB and the queues of all classes, it is possible to effectively use a finite buffer amount.

  In order for a cell that has arrived at the IB to be output from the IB, it is necessary for the IB to notify the KM that the cell has arrived and to instruct the output from the IB. Therefore, if there is a delay in information transmission between the IB and the KM, the cell output from the IB is delayed by the delay time. However, since the delay time is considered to be about several cell cycles, the influence on the traffic characteristics is considered to be small.

  In order to preferentially control the unicast cell for each output port, the IB has a unicast cell management unit for each class 433 and a class multiplexing FIFO 434 for each output port. The same method as the priority control described in the cell multiplexing apparatus of FIG. 1 is used.

  Although FIG. 1 shows a cell multiplexing apparatus, the cage switch is a cell switch and IB is an input buffer of the cell switch. Therefore, a plurality of class multiplexing FIFOs exist in one IB corresponding to all output ports, and the cells are selected by the output port selection scheduler 434 and output to SE1.

  The cell-by-class cell storage unit 13 of the cell multiplexing device of FIG. 1 corresponds to the IB-by-class unicast cell management unit 433 of FIG. 29, and the class multiplexing FIFO 14 of the cell multiplexing device of FIG. This corresponds to the IB class multiplexing FIFO 434.

  The class management unit 12 of the cell multiplexing apparatus in FIG. 1 corresponds to the KM in FIG. Priority control can be performed when the basket management unit KM instructs the transfer of cells from the unicast cell management unit 433 for each class to the class multiplexing FIFO 434.

  Multicast cell priority control will be described later.

  In order to perform fair queuing between VCs for each class of unicast cells, the unicast cell management unit 433 for each class has a front basket 441 and a basket 440. Basically, the same method as the inter-VC fair queuing described in the cell multiplexing apparatus of FIG. 6 is used.

  FIG. 6 shows a cell multiplexing apparatus and no class, but IB is an input buffer of a cell switch and also has a class. For each IB, the front basket 441 and the basket 440 exist corresponding to all output ports and all classes, and the cells are multiplexed by the class multiplexing FIFO 434 and then selected by the output port selection scheduler 432 to the SE1. Is output.

  6 corresponds to the basket 440 of the IB of FIG. 29, and the cell set 214 to be output by the same time of the cell multiplexer of FIG. 6 is the unit of the IB of FIG. It corresponds to a basket. The basket management unit 12 of the cell multiplexing apparatus in FIG. 6 corresponds to the basket management unit KM in FIG. The inter-VC fair queuing can be performed by the basket management unit KM instructing the transfer of the unit basket from the front car 441 to the car 440 in FIG.

  Inter-VC fair queuing of multicast cells will be described later.

  There is a front basket 441 and a basket 440 in the unicast cell management unit 433 for each class to perform unicast cell queuing between VCs in the IB. The same method as that described in the data structure example using the pointer chain of the cell group FIFO 232a in FIG. 10 is used.

  The cell group FIFO 232a in FIG. 10 corresponds to the IB front basket 441 in FIG. 29, and the output waiting cell group FIFO 232b in FIG. 10 corresponds to the IB basket 440 in FIG. The cell group in FIG. 10 corresponds to the unit basket of IB in FIG.

  Next, the queuing process of the input buffer IB will be described with reference to FIG.

  The cell is first accumulated in the front car 441 and then transferred to the car 440 in units of unit car. The cell of the cage 440 is output from the cage 440 in units of cells. The basket management unit KM gives instructions for each opportunity.

  In this configuration example, all VCs belong to a certain connection group (CG). By having the concept of a connection group, a plurality of VCs can share one resource (bandwidth or cell buffer). For example, when only one VC is charged for communication between two distant users, it is possible to give a degree of freedom to set a plurality of VCs between the two users. Alternatively, it is possible to prevent two users from setting a large number of VCs to obtain an unreasonably large band in a network that allocates a fair band according to the number of VCs.

  The VC table and the CG table are used to determine in which unit car the cell is placed in the front car 441.

  The connection group identifier (for example, CG5) can be known from the connection identifier (for example, VC4) of the input cell using the VC table. A value determined for each CG can be known from the connection group identifier using the CG table. The values for each CG in this configuration example are Nx, Nc, Ptr, Qlen, Cnt1, Cnt2, Cnt3, and BPIDt.

  Nx, Nc, Ptr, and Qlen have been described in the data structure example by the pointer chain of the cell group FIFO in FIG. Nx is the weight of the CG, Nc is the work variable, Qlen is the number of cells stored in the CG, and Ptr is a pointer to the end of the unit basket in which the CG cells are stored.

  On the other hand, Qlen, Cnt1, Cnt2, Cnt3, and BPIDt have been described in the cell buffer device having the back pressure consideration queue monitoring unit shown in FIGS.

  Qlen is the number of cells stored in the CG, Cnt1 is the number of cells to be discarded, and BPIDt is a back pressure identifier at the time of the last cell input. There are variables Cnt2 and Cnt3 having the same function as Cnt1 in order to perform finer queue monitoring. Each queue length monitoring threshold is different. Cnt2 is the number of cells to be discarded for a cell whose CLP (Cell Loss Priority) bit in the cell header has a low priority (CLP = 1), and Cnt3 is used to determine whether there is congestion in this queue length monitoring. The value to use for. The information on whether or not congestion is used, for example, to determine whether or not to mark EFCI in the cell header and whether to mark the congestion indication bit of the RM cell.

  It is possible to set not to perform fair queuing between VCs in a certain class. In that case, the Nx of the CG to which the VC belongs may be set to a sufficiently large value.

  Now, the cell switch with back pressure shown in FIG. 25 has a relatively low cycle for repeating the output prohibition and the output prohibition for the low-priority cell back pressure signal due to the influence of the delay time of cell transmission from IB to OB. large. Accordingly, when the queue length Qlen for each CG of the IB is observed, the oscillation repeats mainly as shown in FIG. 14 in synchronization with the low priority cell back pressure signal. As described above, the back pressure-considered queue length monitoring algorithm described with reference to FIGS. 1515 and 16 is suitable for monitoring the queue length that is vibrated by the back pressure signal.

  Regarding the total number of cells in the entire class of cells stored in the front car 441 and the car 440, the input cell is discarded or the EFCI is marked by monitoring the queue length considering the back pressure, and the buffer of some classes is IB. It is possible to prevent monopolizing most of the territory.

  FIG. 31 shows an example of an interface with the basket management unit KM of the input buffer IB used for the basket switch.

  Information for each output port as shown below is input from the KM to each output port.

-Number of ABR input cells-Instruction class-Transfer instruction of unit basket from previous basket to basket (transfer instruction T1 in FIG. 31)
-Cell transfer instruction from the basket to the class multiplexing FIFO (transfer instruction T2 in FIG. 3131)
The number of ABR input cells is transferred to the ABR processing unit 450. The ABR processing unit 450 can monitor the traffic flowing into the output port paired with the IB by knowing the number of ABR input cells. The information is used to rewrite the payload of the RM cell that passes through the IB.

  When the KM is instructed to transfer a cell from the basket 440 to the class multiplexing FIFO 434, the IB takes out one cell from the unicast basket 440 of the indicated class and transfers it to the class multiplexing FIFO 434. When there is a unit basket transfer instruction from the front car 441 to the car 440, the IB takes out one unit car from the front car 441 of the instruction class unicast and transfers it to the car 440, and takes out one cell from the car 440 and performs class multiplexing. Transfer to the generalized FIFO 434.

  By limiting the unit basket transfer instruction only to the transfer instruction of the cell of the class, the amount of information of the transfer instruction can be reduced and mounting can be performed more easily.

  The number of cells in the front basket 441, the basket 440, and the class multiplexing FIFO 434 in the IB changes when a cell is input to the IB, when the KM issues a transfer instruction, or when a cell is output from the IB. Accordingly, cell number information is output to the KM accordingly. Information that one IB outputs to the KM is as follows.

For each input port, for input cells (only one output port in case of unicast),
・ Presence / absence of input cell and class For each output port, the transfer instruction class
-Number of previous basket cells (after transfer) (CE1 in FIG. 31)
-Number of kago cells (after transfer) (CE2 in FIG. 31)
-Number of cells transferred to class multiplexing FIFO (CE3 in FIG. 31)
For each output port, only unicast,
Number of class multiplexed FIFO cells (CE4 in FIG. 31)
This will be described with reference to FIG. Input cell information is transmitted from the IB to the KM as the presence and class of the input cell. In addition, the number of previous basket cells of unicast and multicast is added, and the class selected by the class selection unit L5 in the transfer instruction class is transmitted as the number of previous basket cells. Furthermore, the number of unicast and multicast basket cells is added, and the number selected by the instruction class in the class selection unit L6 is transmitted as the number of basket cells. Then, unicast and multicast are added to the number of cells moved from the basket to the class multiplexing FIFO 434 according to the transfer instruction, and the class selection unit L7 selects and transmits the selected class. The number of class multiplexed FIFO cells is transmitted to KM only for unicast. The number of multicast class multiplexed FIFO cells is used as a back pressure signal for controlling the cell output from the multicast cell management unit 435 for each class.

  Since the output of the multicast class multiplexing FIFO 436 is controlled by back pressure signals from a plurality of output buffers OB, the output port of the cell switch may underflow even if the number of class multiplexed FIFO cells is not zero. There is. In this configuration example, the number of unicast class multiplexed FIFO cells is not added so that the unicast cell does not underflow under the influence.

  Here, multicast cell priority control and inter-VC fair queuing will be described.

  Consider a multicast VC from the viewpoint of throughput. In general, considering the state of a cell switch at a certain point in time, the plurality of output ports include a congested output port and an output port with a low load. That is, the throughput that the VC can use varies depending on the output port. Multicast VCs simultaneously output the same throughput from one input port to multiple output ports, so the throughput that the multicast VC can obtain is the throughput of the most congested output port among the output destinations. Is good. Therefore, when outputting a multicast cell from the IB, it is desirable to output at the throughput of the most congested output port.

  The IB can know the throughput per VC (CG) given to a certain class of a certain output port from the frequency of the unit basket transfer instruction from the previous car 441 to the car 440. Further, the IB can know the throughput given to a certain class of a certain output port from the frequency of the cell transfer instruction from the basket 440 to the class multiplexing FIFO 434. Further, the IB can know the throughput given to a certain output port from the frequency of the low pressure cell back pressure signal. These transfer instructions and back pressure signals are given to each output port.

  In order to output at the throughput of the most congested output port, the multicast cell may be transferred when these signals indicate or permit all the output ports of the cell. Instructions or permissions to multiple output ports need not be simultaneous.

  When managing low-priority multicast VCs in IB, it is desirable to manage them for each class and for each output port pattern. In general, however, the number of combinations is large, and the number of output ports during communication is also large. Such an implementation is not realistic. In the cage switch as shown in FIG. 25, all multicast connections are managed only for each class, and are not managed for each output port pattern. A certain amount of HOL (Head Of Line) blocking occurs.

  FIG. 32 is a diagram for explaining the class-by-class multicast cell management unit 435. This management unit holds and manages the output port table, the VC fair queue, the number of unit basket cells, the number of basket cells, and the number of output permitted cells.

  Whereas the per-class unicast cell management unit 433 manages cells in the previous car and the car, the per-class multicast cell management unit 435 manages cells only by the inter-VC fair queue 460 corresponding to the previous car. However, the multicast cell management unit 435 for each class according to the present invention performs cell management similar to unicast using the concept of the previous car and the car in the calculation of management.

  The class-specific multicast cell management unit 435 inputs the following information for each output port.

-Unit basket transfer instruction from the previous basket to the basket-Cell transfer instruction from the basket to the class multiplexing FIFO The following information is output for each output port.

-Number of previous basket cells-Number of basket cells-Number of transfer cells The inter-VC fair queue 460 is a FIFO of unit baskets. The number of cells input to the inter-VC fair queue 460 can be input up to a predetermined number in one unit basket for each VC (CG). This configuration is the same as that of the unicast front basket described in FIG. A back pressure signal is input from the class multiplexing FIFO 436, and cell output from the inter-VC fair queue 460 is prohibited depending on the situation.

  The output port table stores the number of previous basket cells and a pointer to the head unit basket for each output port. The number of previous baskets is the total number of unit baskets, and the head unit basket is a pointer to the head unit basket of the previous basket in calculation.

  The number of unit basket cells stores data for each output port corresponding to the unit basket of the VC fair queue 460. Basically, the number of cells for each output port of the multicast cell stored in the corresponding unit basket is stored. For example, five cells are stored in the top unit basket of the inter-VC fair queue 460 of FIG. Of these, there are 3 cells to be output to port # 1 and port #N, and 2 cells to be output to port # 1 and port # 2. Therefore, 5 for port # 1 and 5 for port # 2 2, 3 is stored in port #N.

  The number of basket cells is the calculated number of basket cells. The number of output-permitted cells is the number of cells permitted to be output in calculation.

  When a unit basket transfer is instructed to a certain output port, the number of unit basket cells of the head unit basket of that output port is added to the number of basket cells, and the number of unit basket cells is made zero. Further, 1 is subtracted from the number of basket cells of the output port, and 1 is added to the number of cells permitted to output. Then, the pointer of the head unit basket in the output port table is advanced by one to the next unit basket in the inter-VC fairness queue 460. The number of transfer cells at this time is one cell.

  By advancing the pointer of the head unit basket, the pointer moves away from the head unit basket of the inter-VC fairness queue 460. An upper limit is set for this distance, and when the distance is reached, control is performed so that the unit basket transfer instruction is ignored and the pointer cannot be advanced. This has an effect of preventing the difference between the time when the unit basket transfer is instructed and the time when the cell is actually output from being increased.

  When cell transfer is instructed to a certain output port from the KM, 1 is subtracted from the number of basket cells of that output port, and 1 is added to the number of output-permitted cells. The number of transfer cells at this time is one cell.

  When the back pressure signal from the class multiplexing FIFO 436 permits output, the cell can be output from the inter-VC fair queue 460. At that time, the number of output-permitted cells is subtracted by 1 for all the output ports of the cell. If there is an output port with the number of output-permitted cells being zero, subtraction cannot be performed, so that cell cannot be output yet.

  The number of output-permitted cells is increased by a unit basket transfer instruction and a cell transfer instruction. When the number of output-permitted cells of a certain output port exceeds a certain value, the number of the previous and the number of basket cells output from the multicast cell management unit 435 for each class is set to zero for the output port, and the unit basket transfer instruction and Ignore cell transfer instructions. This has the effect of ignoring transfer instructions exceeding the transfer throughput of the actual cell.

  Next, with reference to FIGS. 33 to 39, the operation of the multicast cell management unit for each class will be described.

  FIG. 3333 shows the operation when the KM instructs the output port # 1 to transfer the unit basket from the state of FIG. The number of unit basket cells of the head unit basket of port # 1 is added to the number of basket cells to make the number of unit basket cells zero. Further, 1 is subtracted from the number of basket cells of port # 1, and 1 is added to the number of cells whose output is permitted. The number of cells transferred to the KM is 1 cell for the output port # 1.

  The pointer of the head unit basket in the output port table is advanced by one to the next unit basket of the VC fair queue 460.

  Furthermore, FIG. 34 shows the operation when the KM instructs the output port # 1 to transfer a cell. 1 is subtracted from the number of basket cells in port # 1, and 1 is added to the number of cells whose output has been permitted. The number of cells transferred to the KM is 1 cell for the output port # 1.

  The output ports of the first cell of the inter-VC fair queue 460 in FIG. 34 are # 1 and #N. The number of output-permitted cells is not zero (= 2) for the output port # 1, but since the output port #N is zero, no cells can be output yet.

  The operation when the cell arrives is shown in FIG. The output ports of the arrived cells are # 1 and #N. It is also assumed that this cell is a VC cell that has not been stored in the inter-VC fair queue 460 until now. In this case, the cell is input to the top unit basket of the inter-VC fair queue 460.

  When a cell is input, the number of unit basket cells of all output ports of the cell is incremented by one. The unit basket to be added is determined for each output port. Basically, 1 is added to the unit basket in which the cell is input, but if the first unit basket in the output port table is behind the unit basket in which the cell is input, the unit basket cell pointed to by the first unit basket in the output port table Add 1 to the number. Accordingly, in FIG. 35, for the output port # 1, 1 is added to the number of unit basket cells of the second unit basket pointed to by the first unit basket. For the output port #N, 1 is added to the number of unit basket cells of the first unit basket that is the unit basket into which cells are input.

  Further, FIG. 3636 shows the operation when a cell arrives. The output ports of newly arrived cells are # 1 and # 2. This cell is a VC cell currently stored in the inter-VC fair queue 460. In the case of FIG. 36> 6, a new unit basket is provided at the end of the inter-VC fair queue 460, and this cell is input to the unit basket.

  Further, FIG. 37 shows an operation when the KM is instructed to transfer the unit basket to the output port #N. The number of unit basket cells of the head unit basket of port #N is added to the number of basket cells to make the number of unit basket cells zero. Further, 1 is subtracted from the number of cargo cells of port #N, and 1 is added to the number of output-permitted cells. The number of cells transferred to KM is 1 for output port #N. The pointer of the head unit basket in the output port table is advanced by one to the next unit basket of the VC fair queue 460.

  Since the output ports of the leading cells of the inter-VC fair queue 460 are # 1 and #N, and the number of output-permitted cells of # 1 and #N is 1 or more (specifically 2 and 1), respectively. If the class multiplexing FIFO 436 permits, the cell can be output.

  FIG. 38 shows a state when cells are output. The number of output permitted cells corresponding to the output port of the output cell is subtracted by one.

  FIG. 39 shows a state in which unit baskets and basket transfers are instructed continuously as described above, and a total of 6 cells are output. The head unit basket of the inter-VC fair queue 460 becomes empty at this point, and the unit basket and the number of unit basket cells disappear. Inevitably, the head unit basket in the output port table does not point to this lost unit basket. Next, the output port selection scheduler 432 will be described with reference to FIG.

  The cell selection unit 470 selects a unicast output waiting cell and a multicast output waiting cell for each output port, which are input to the output port selection scheduler 432, and outputs them from the output port selection scheduler 432. Cells that are candidates for selection by the cell selection unit 470 are allowed cells among the output waiting cells.

  The output of the unicast cell is permitted by the unicast cell output permission signal output from the unicast cell output permission signal generation unit 471.

  The unicast cell output permission signal generation unit 471 receives the back pressure signal and the emergency back pressure signal.

  The back pressure signal is for each output port. In addition, the back pressure signal corresponding to the emergency back pressure signal is determined in advance. In the case of FIG. 25, the emergency back pressure signal is output from SE2, and corresponds to the back pressure signal from the output buffer OB connected to the output link of SE2.

  When the back pressure signal indicates prohibition of output, the unicast cell output permission signal does not permit the output of the cell at the output port. When the emergency back pressure signal indicates that output is prohibited, it is assumed that all back pressure signals corresponding to the emergency back pressure signal indicate that output is prohibited, and output is not permitted.

  The multicast cell is permitted to be output by the multicast cell output permission signal output from the multicast cell output permission signal generation unit 472.

  The multicast cell output permission signal generation unit 472 receives the unicast cell output permission signal and the output port information of the first cell of the multicast cell class multiplexing FIFO 436.

  The multicast cell output permission signal generation unit 472 monitors whether all (not necessarily simultaneously) the output ports of the multicast cell are permitted. If any output port is not permitted, the multicast cell output permission signal is prohibited. When all the output ports of the multicast cell are permitted, the output of the multicast cell is permitted during the time when the unicast cell output permission signal of the last permitted output port indicates that output is possible. If the multicast cell is not selected by the cell selection unit 470 within the time, and if the multicast cell is selected and output by the cell selection unit 470 and the output port information of a new multicast cell arrives, it is output again from the beginning. Monitor whether all ports are allowed.

  The cell selection unit 470 selects the output waiting cell thus permitted to output in a fair manner.

  As described above, the multicast cell is output even if all the back pressure signals of the output port do not permit the output at the same time. That is, at the time of output of the multicast cell, some back pressure signals at the output port of the cell may indicate output prohibition. Even in such a situation, the low-priority cell emergency back pressure signal works effectively so that the SE2 buffer does not overflow.

  In the above configuration, when the output of the low priority cell emergency back pressure signal indicates prohibition, the output of both the unicast cell and the multicast cell for the corresponding output port is prohibited. As another configuration, the multicast cell output permission signal generation unit 472 may perform a process of canceling permission when a low priority cell emergency backpressure signal instructs prohibition of output even if a certain output port is permitted once. . In addition, when the low priority emergency back pressure signal indicates that output is prohibited, the output of all low priority multicast cells may be prohibited.

  The input buffer IB of the present invention performs back pressure consideration queue monitoring described with reference to FIG. This monitoring is performed based on the value of the back pressure identifier updated by the back pressure signal. The back pressure identifier for each output port of the unicast cell is updated by the unicast cell output permission signal of the output port selection scheduler 432, and the back pressure identifier of the multicast cell is updated by the multicast cell output permission signal of the output port selection scheduler 432.

  Next, with reference to FIG. 41, the basket management unit KM used for the basket switch shown in FIG. 25 will be described.

  FIG. 41 shows a configuration example of the basket management unit KM.

KM for each output port
-Total number of ABR input cells.

  -For each class, the total number of previous basket cells, the total number of basket cells, and the number of transferred cells.

  • Total number of class multiplexed FIFO cells.

  And a transfer instruction history management unit 480 and a class selection scheduler 481 for each output port.

  The total number of ABR input cells is the total number of input cells of all IBs for each output port for the ABR class. Integration is performed within a certain period of time, and transmitted to the IB paired with the output port for each cycle. If the total number of ABR input cells exceeds a certain threshold before reaching a predetermined fixed time, a configuration may be used in which the IB is notified interruptively.

  The total number of previous basket cells is obtained by adding the total number of cells input to the previous basket based on the presence / absence of cells input to the IB and the class information. In addition, the number of previous baskets in the class to which KM has instructed transfer is updated with the sum of all IBs. The class is stored in the transfer instruction history management unit 480 of the KM.

  The total number of basket cells is updated with the total number of basket cells of all classes for which the KM has instructed transfer. The transfer instruction history management unit 480 of the KM stores the class instructing the transfer.

  The number of transfer cells is updated by adding the number of transfer cells to the class multiplexed FIFO of the class to which KM has instructed transfer for all IBs. The transfer instruction history management unit 480 of the KM stores the class instructing the transfer.

  The total number of class multiplexed FIFO cells is updated by adding the number of class multiplexed FIFO cells for all IBs.

  The class selection scheduler 381 issues a transfer instruction to the IB based on information such as the total number of previous basket cells, the total number of basket cells, the total number of transfer cells, and the total number of class multiplexed FIFO cells. The history of past transfer instructions is stored in the transfer instruction history management unit 480, and the class selection scheduler 481 corrects the cell number information using the history.

  42, 43, and 44 show an example of a scheduling algorithm executed by the class selection scheduler 481 of the basket management unit KM. This algorithm performs priority control based on priority while limiting the maximum bandwidth of a class and guaranteeing the minimum bandwidth.

  As a global variable, there is a variable now indicating the current time. For each class i, a parameter Dxi that gives the upper limit of the minimum bandwidth 1 / Di and the output duty time Tdi and Tdi, and a parameter Uxi that gives the lower limit of the maximum bandwidth 1 / Ui and the output inhibition time Tui and Tui are set (FIG. 42). Step S100).

For each class i, output is when the current time now is Tdi < now, and output is prohibited when the current time now is now <Tui. Further, when the current time now is Tui < now <Tdi, the output should be performed according to the priority order. The upper limit value of Tdi is determined, and Tdi < now + Dxi. Further, Tui has a lower limit value, and now-Uxi < Tui. However, Uxi > 0 and Dxi > Di.

  In the initial setting, now is set to zero, Tdi is set to Di-Ui for each class i, and Tu is set to now, that is, zero (step S101 in FIG. 42).

  This algorithm performs the following processing for each cell period.

First, the process when the class becomes active is performed. Specifically, when a cell arrives at class i where there is no cell, Tdi is updated to the larger of now and Tdi,
Tui is updated to the larger of now and Tui (step S102 in FIG. 43).

  Next, it is determined whether or not the cell can be transferred (step S103 in FIG. 43). If so, transfer class selection and transfer class instruction are performed (step S104 in FIG. 43).

  The transfer class selection is the following process.

Within each class i where there are cells to be transferred,
1. If there is a class satisfying Tdi < now, the class having the largest now-Tdi is selected (if it is the same value, it is determined by the priority).

2. Without tdi <class has become now selects the highest class of priority among the classes that satisfy Tui <now <Tdi.

  If the selected class is j, the process proceeds to step S105 in FIG. 44, and the following transfer class instruction process is performed.

  1. Instruct transfer of class j.

  2. Update Tuj to max (Tuj, now-Uxj).

  3. Update Tdj to Tdj + Dj.

  4). Updated Tuj to Tuj + Uj.

  5. Tdj is updated to min (Tdj, now + Dxj).

  Finally, after performing the transfer cell flow rate monitoring process (step S106 in FIG. 44), the value of “now” is incremented (step S107 in FIG. 44), and the process for each cell cycle is completed.

  The transfer cell flow rate monitor process in step S106 of FIG. 44 performs the following process for class j when the number of transfer cells of class j is xj.

  1. Update Tuj to max (Tuj, now-Uxj).

  2. Update Tdj to Tdj + (xj -1) Dj.

  3. Update Tuj to Tuj + (xj-1) Uj.

  4). Tdj is updated to min (Tdj, now + Dxj).

  The determination in step S103 in FIG. 43 as to whether or not to instruct transfer of cells is made based on whether or not the total number of class multiplexed FIFO cells is equal to or less than a certain threshold value. A certain threshold is usually “1”. The total number of class multiplexed FIFO cells is a value corrected by the transfer instruction history of the transfer instruction history management unit 480.

  In step S104 in FIG. 43, whether or not there is a cell to be transferred to the class is determined by determining that either the total number of previous basket cells or the total number of basket cells is not zero. The total number of previous basket cells and the total number of basket cells are values corrected by the transfer instruction history of the transfer instruction history management unit 480.

  The transfer instruction is a cell transfer instruction from the basket 440 to the class multiplexing FIFO 434 (transfer instruction T2 in FIG. 31). At this time, whether or not to instruct the transfer of the unit basket from the previous basket to the basket at the same time is determined by determining whether the total number of previous basket cells is not zero and whether the total number of basket cells is equal to or less than a certain threshold value. . A certain threshold is usually 1. The total number of previous basket cells and the total number of basket cells are values corrected by the transfer instruction history of the transfer instruction history management unit 480.

  This algorithm can bring the minimum guaranteed bandwidth closer to zero by setting Di to a large number. For example, if Di of all classes is set to a large number, priority control of all classes can be performed with complete priority.

  Further, by using one of the classes as an IC (Idle Cell) class having the lowest priority but the minimum guaranteed bandwidth, the usage rate of the output port can be controlled. The IB inserts an idle cell into the class multiplexing FIFO when there is an IC class transfer instruction (only one IB is required).

  The idle cell is exchanged towards the output port of the cell switch like the other cells, where it is replaced with the Unassigned Cell. The KM may perform scheduling assuming that the IC class always has a cell to be transferred.

  Incidentally, in the algorithms shown in FIGS. 42 to 44, for the sake of simplicity of explanation, it is assumed that variables that represent time such as variables now, Tdi, and Tui do not have upper limits. At the time of implementation, these variables are expressed by a register having a finite bit length, so that the same time appears cyclically after a long time. In order to operate the algorithm normally, the following may be performed. Let these cycles be Max. Max needs to be large enough.

At this time, the calculation such as x: = f (x) is replaced with x: = f (x) mod Max. In other words, take modulo with Max. Also, the comparison operation of y < z is
(Z < y-Max / 2) or ((y < z) and (z < y + Max / 2))
Replace with and compare.

For example, the calculation now: = now + 1 is
replace with now: = (now + 1) mod Max

The comparison operation Tdi < now is
(Now < Tdi-Max / 2) or ((Tdi < now) and (now < Tdi + Max / 2)) may be replaced and compared.

  It is necessary to periodically monitor the time variable and adjust it so that it is not too far from Max / 2 or more as needed. However, by increasing Max, the monitoring cycle can be extended. Easy to implement.

  Further, as the other class selection scheduling, the following is effective.

  As already described, the cell buffer device that has performed inter-VC fair queuing according to the weight set for each CG (each VC) writes the weight to the CG table (FIG. 30) of the input buffer IB or Nx of the VC table. .

  Here, it is explained that the weight for each VC set in the class can be multiplied by a coefficient by using the class selection scheduling together.

  There are class A and class B, and the weight Nxa of a certain VC set to class A is set to Nxb. At this time, when there are output waiting cells in both classes, the number of unit basket transfer instructions is scheduled to be the ratio of Ra to Rb in class X and class Y by class selection scheduling. It is possible to multiply the coefficient by × Ra and Nxb × Rb. The same applies to three or more classes. For example, SCFQ (Self-Clocked Fair Queuing) is known as an algorithm for performing scheduling so as to obtain a desired ratio.

  A specific example will be described. For example, assume that weights are set to 1.24, 3.72, 2.18, 934, 562, 1370, and 4360 for seven VCs from VC1 to VC7, respectively. VC1 and 2 are set in class A, and Nx is 1.24 and 3.72, respectively. VC3 is set for class B, and Nx is 2.18. VC4 and 5 are set in class C, and Nx is set to 9.34 and 5.62, respectively. VC6 and 7 are set in class D, and Nx is set to 1.37 and 4.36, respectively. If class selection scheduling is performed so that the number of unit basket transfer instructions is in a ratio of class A: class B: class C: class D = 1: 1: 100: 1000 between classes in which output waiting cells exist, Cells are multiplexed to the output port with weights 1.24: 3.72: 2.18: 934: 562: 1370: 4360. This method has an effect of avoiding the phenomenon that the cell delay fluctuation of the inter-VC fair queuing increases when a large numerical value is set as the value of Nx.

  In the class selection scheduling algorithm as shown in FIGS. 42 to 44, the transfer cell flow rate of each class is monitored. It is possible to perform hierarchical class selection scheduling using this.

  When there is a class group Ga consisting of classes A1, A2, A3,... And a class group Gb consisting of other classes B1, B2, B3,. Is set as Ra vs. Rb, and class selection scheduling is performed. The same applies when the class group is 3 or more. Class selection scheduling within each class group and selection scheduling between class groups are independent.

  As a result, the surplus bandwidth between certain class groups is used only by the classes in the class group, and it can be prevented that another class group can be used. Another class group can use this surplus bandwidth only when there is no output waiting cell of a certain class group. This kind of hierarchical class selection scheduling. For example, an application such as assigning a class group for each company can be considered.

5.2 Cell Number Correction Method for Cell Switch that Performs Priority Control and Inter-VC Fair Queuing Next, a cell switch (cage switch) that performs priority control and inter-VC fair queuing (FIG. 25, FIG. 29, FIG. 31R> 1) ) Will be described with reference to FIG. 45 R> 5.

  As for the principle of correction, in the case of the cage switch described with reference to FIGS. 19, 20, etc., it is possible to improve the performance of priority control and the throughput of the output port by correcting the number of cells by the same method.

  As an application example of the cell number correction method of the present invention, the present invention is applied to the car switch shown in FIG. In the basket switch, when the management unit 301 instructs transfer to the front basket (Bpi) of class i, the cells of the front basket of the class are transferred to the basket (Bki), and a part thereof is a class multiplexed FIFO (Bm ). When the management unit 301 instructs transfer from the class i basket to the class multiplexing FIFO, the cell of the class basket is transferred to the class multiplexing FIFO.

  As shown in FIG. 45, the cell number information and delay time of each cell buffer are determined.

  Hpi is the number of HOLs transferred from the previous basket to the basket by the transfer instruction Ipi, and Hpmi is the number of HOL cells transferred from the previous basket to the class multiplexing FIFO by the transfer instruction Ipi.

Here, as an example, consider the case where the values of the delay times are equal. That is, DOp = DIk = DOk = DIm = Dipm = D and DTpm = DTkm. Further, p = [− D, 0). At this time, the number of cells before the class i and the modified number of cells (N′pi, N′ki) of the cage and the number of modified cells (N′m) of the class multiplexing FIFO can be calculated as follows.

5.3 Continuation of Explanation of Cell Switch According to Tenth Embodiment FIG. 46 shows a connection example between the input buffer IB of the car switch and the car management unit KM.

  Here, for example, the number of classes is 62 classes, and the cell switch size is 16 inputs and 16 outputs.

  The class number is coded in {0, 1, 2,..., 60, 61, UC, IC} and 6 bits.

  Class UC indicates an unassigned cell, IC indicates an idle cell, and usage thereof will be described below.

  The previous number of basket cells, the number of basket cells, and the number of class multiplexed FIFO cells are coded as {0, 1, 2,..., 13, 14, 15 or more} and 4 bits.

  The transfer information from the input buffer IB to the basket management unit KM is shown below.

(1) Input cell For each output port, for the input cell (in the case of unicast, output only for one output port),
・ Presence / absence of input cell and class: 6 bits (If there is no input cell, class UC is transmitted)
(3) Transfer instruction class For transfer instruction class for each output port,
-Number of previous basket cells after transfer ... 4 bits-Number of basket cells after transfer ... 4 bits-Number of transfer cells to class multiplexed FIFO ... 2 bits (maximum 2 unicast and multicast cells are transferred)
(4) Class multiplexing FIFO Only unicast for each output port.
Number of class multiplexed FIFO cells: When 4 bits are combined, information on one output port is 20 bits.

  The transfer information broadcast from the basket management unit KM to all the input buffers IB is shown below.

(2) For each output port,
・ Transfer instruction of unit basket from the previous basket to the basket (for the following classes): 1 bit ・ Transfer instruction of cells from the basket to the class multiplexing FIFO and instruction class: 6 bits (Specify the UC class if there is no transfer instruction) When the IC class is specified, the IB transfers (inserts) an idle cell, which is exchanged and transferred to the output port in the same manner as other classes of cells, and is replaced with an Unassigned Cell when output from the cell switch. It is a cell for adjustment.)
In total, the information about one output port is 7 bits.

  The KM transmits the next signal to the corresponding IB for each output port for ABR traffic control.

(5) Number of ABR input cells destined for each output port among all IB input cells ... 5 bits (in the case of a cell switch with 16 inputs and 16 outputs)
Information about one output port is 5 bits.

  FIG. 46 shows a configuration example in which the basket management unit KM is realized by two LSIs. One of the two LSIs manages output ports # 1 to # 8, and the other manages output ports # 9 to # 16.

  Since the transfer information from the IB to the KM (the above (1), (3) and (4)) is 20 bits per output port, it is 160 bits for 8 ports. If parallel transmission is performed using two pairs of high-speed differential transmission, a transmission rate of 80 bits per cell period is sufficient.

  Broadcast information from the KM to the IB (the above-mentioned (2)) is 7 bits per output port, so it is 56 bits for 8 ports. If a normal transmission driver is used to perform 8 parallel transmissions, a transmission rate of 7 bits per cell period is sufficient.

  The information for the ABR traffic control from the KM to the IB (the above (5)) is 5 bits per output port.

  Even considering a cell switch with a cell transmission rate of 622 Mbps, these transmission rates are sufficiently realizable with current technology.

  The IB transmits the cell number information to the KM from the LSB (least significant digit), thereby reducing the circuit scale for adding the number of cells. This is because the adder circuit can add information on the number of cells transmitted from all IBs in order from the lower digit (for each class for each output port). More specifically, the addition circuit can calculate the sum of the digits of the input digit and the carry from the lower digits calculated so far, and obtain the value of that digit of the addition result. In addition, it holds the carry for the next digit calculation.

  Among the signals from IB to KM is the number of class multiplexed FIFO cells. When the cell switch with back pressure can output the number of accumulated cells per output port (number of cells in the output buffer OB in FIG. 25), the KM stores the number of accumulated cells per output port instead of the number of class multiplexed FIFO cells. May be used.

  This has the same effect as the cell multiplexing apparatus that performs priority control between classes in FIG. 2 and the cell multiplexing apparatus that performs fair VC queuing in FIG.

  FIG. 47 shows a path of information for realizing the ABR service.

  FIG. 47 particularly shows a part where the ABR class cell input from port # 1 to port #N is exchange-multiplexed to port #i by the cell switch 400 with back pressure. Actually, all the output ports have the same configuration as #i in this figure.

  The ABR service is a service class in which, if there is a band that can be used at the output port of the cell switch, the band is distributed and used fairly by the ABR class VC. An RM cell transmitted from the receiving terminal to the transmitting terminal is used for traffic control.

  The cell switch 400 knows the bandwidth that the ABR can use at the output port #i, and performs traffic control on the transmitting terminal by knowing the ratio (or difference) between the bandwidth and the input traffic of the current ABR. Can do. The current ABR traffic can be known from the sum of the number of input cells destined for port #i for each fixed period shown in FIG. An input band is obtained from the number of input cells, and if this exceeds the usable band of ABR at the output port, it is overloaded. Therefore, an instruction to reduce the VC band may be written in the RM cell input to port #i. Conversely, if the input band obtained from the number of input cells destined for port #i is less than the band where the ABR can be used at the output port, the load is low. An instruction to increase the bandwidth may be written. By knowing the ratio or difference between the input band and the output band, the degree of overload and low load can be known, and fine control can be performed.

  This process reduces the probability of congestion, but if the congestion is detected by monitoring the queue length in the IB, the traffic can be controlled more safely by marking the EFCI or rewriting the RM cell. Is possible. In particular, in the case of multicast, there is a possibility of overload even if the input bandwidth is smaller than the output bandwidth. In this case, traffic control by queue length monitoring becomes important.

  As described above, since the cage switch according to the tenth embodiment performs fair queuing between VCs, it is possible to achieve fair bandwidth distribution among VCs even in traffic control based on queue length monitoring.

The figure which showed the structural example of the cell multiplexing apparatus which performs the priority control between the classes which concern on the 1st Embodiment of this invention. The figure which showed the other structural example of the cell multiplexing apparatus which performs the priority control between the classes which concern on the 2nd Embodiment of this invention. The figure which showed the other structural example of the output buffer. The figure which showed the further another structural example of the output buffer. The figure which showed the structural example of the output buffer type | mold cell multiplexing apparatus provided with FIFO per VC which concerns on the 3rd Embodiment of this invention. The figure which showed the structural example of the cell multiplexing apparatus which concerns on the 4th Embodiment of this invention: The fair queuing between VCs. The figure which showed the structural example of the cell multiplexing apparatus which performs the VC fair queuing which concerns on the 5th Embodiment of this invention. The figure which showed the structural example of the cell buffer apparatus using the cell group FIFO which concerns on the 6th Embodiment of this invention. The figure which showed the structural example of the cell buffer apparatus using the cell group FIFO which concerns on the 7th Embodiment of this invention. The figure for demonstrating the example of a data structure by the pointer chain of the cell group FIFO which concerns on 6th Embodiment. It is a figure for demonstrating the example of a data structure by the pointer chain of the cell group FIFO which concerns on 6th Embodiment, and has shown the structure of the empty cell group chain. The figure for demonstrating the example of a data structure by the pointer chain of the cell group FIFO which concerns on 7th Embodiment. It is a figure for demonstrating the example of a data structure by the pointer chain of the cell group FIFO which concerns on 7th Embodiment, and has shown the structure of the empty cell group chain. The figure for demonstrating the fair queuing between flows using a packet group. The figure for demonstrating operation | movement of the packet buffer apparatus using the fair queuing between flows using a packet group. It is a figure explaining back pressure consideration cue monitoring concerning an 8th embodiment of the present invention. The figure which showed the structural example of the cell buffer apparatus which has a back pressure consideration queue monitoring part which concerns on 8th Embodiment. The flowchart which showed the back pressure consideration queue monitoring algorithm which concerns on 8th Embodiment. The figure which showed the structural example of the cell buffer apparatus which considered the delay based on the 9th Embodiment of this invention. The figure for demonstrating the basic principle of the correction method of the cell number information which considered delay. The figure for demonstrating the other basic principle of the cell number correction method. The figure for demonstrating the basic function f () used for the cell number correction method of FIG. The figure for demonstrating the basic function g () used for the cell number correction method of FIG. The figure for demonstrating basic function Sc () used for the cell number correction method of FIG. The figure which showed the example of a whole structure of the basket switch which concerns on the 10th Embodiment of this invention. FIG. 26 is a diagram illustrating a configuration example of an output buffer in FIG. 25. The figure which showed the structural example of the 1st step | paragraph unit switch of FIG. The figure which showed the structural example of the 2nd stage unit switch of FIG. The figure which showed the structural example of the input buffer of FIG. The figure for demonstrating the queuing process of an input buffer. The figure which showed the interface with the basket management part of the input buffer of FIG. The figure for demonstrating operation | movement of the multicast cell management part for every class of FIG. The figure for demonstrating operation | movement of the multicast cell management part for every class of FIG. The figure for demonstrating operation | movement of the multicast cell management part for every class of FIG. The figure for demonstrating operation | movement of the multicast cell management part for every class of FIG. The figure for demonstrating operation | movement of the multicast cell management part for every class of FIG. The figure for demonstrating operation | movement of the multicast cell management part for every class of FIG. The figure for demonstrating operation | movement of the multicast cell management part for every class of FIG. The figure for demonstrating operation | movement of the multicast cell management part for every class of FIG. The figure which showed the structural example of the output port selection scheduler of FIG. The figure which showed the structural example of the basket management part of FIG. The flowchart which showed the specific example of the scheduling algorithm which restrict | limits the maximum band and guarantees the minimum band performed with the class selection scheduler of the basket management part of FIG. The flowchart which showed the specific example of the scheduling algorithm which restrict | limits the maximum band and guarantees the minimum band performed with the class selection scheduler of the basket management part of FIG. The flowchart which showed the specific example of the scheduling algorithm which restrict | limits the maximum band and guarantees the minimum band performed with the class selection scheduler of the basket management part of FIG. The figure for demonstrating operation | movement of the cage switch which is an application example of the correction method of cell number information. The figure which showed the specific example of the connection of the input buffer of FIG. 25, and the basket management part. The figure which showed the specific example of the path | route of the information for ABR service. The figure for demonstrating unfair band allocation in the conventional UBR service. The figure for demonstrating the structure of the cell multiplexing apparatus which performs the priority control between the conventional classes. The figure for demonstrating the structure of the cell multiplexing apparatus with the conventional input buffer. The figure for demonstrating the structure of the cell buffer apparatus which needs the search of the conventional VC table. The figure for demonstrating the change of the queue length of an input buffer in the cell multiplexing apparatus with the conventional input buffer as shown in FIG. The figure for demonstrating the structure of the cell multiplexing apparatus which performs the conventional priority control.

Explanation of symbols

  DESCRIPTION OF SYMBOLS 10 ... Input buffer, 11 ... Output buffer, 12 ... Class management part, 212, 222 ... Basket management part, 230, 240 ... Buffer pointer management part, 282 ... Queue monitoring part, 302 ... Transfer instruction history, KM ... Basket management part 400: Cell switch with back pressure.

Claims (4)

A plurality of buffers that temporarily store input packets are connected in series, and the buffer connected in the previous stage is directed toward the buffer connected in the subsequent stage in accordance with the accumulation status of the packets in the buffer in the subsequent stage. A packet transfer device that outputs a packet in accordance with a packet output / prohibited state determined by
Means for monitoring the accumulation state of the buffer connected to the preceding stage when the packet is first input to the preceding buffer after the preceding buffer changes from the state in which the packet can be output to the succeeding buffer to the output prohibited state. A packet transfer apparatus comprising: 2. The packet transfer apparatus according to claim 1, further comprising means for determining that the preceding-stage buffer is in a congested state according to the monitored accumulation status. 2. The packet transfer apparatus according to claim 1, further comprising means for discarding an input packet in accordance with the monitored storage status. At least one buffer for temporarily storing input packets;
A packet transfer apparatus comprising: a packet transfer instruction history for the buffer; and a control unit that performs a packet transfer instruction to the buffer based on a packet storage state of the buffer ;
The control means includes
Transfer of packets acting on the buffer based on a history of the transfer instructions from when the buffer notifies the control unit of packet accumulation status until the corresponding packet transfer instruction is applied to the buffer Determine the number of instructions, modify the buffer packet storage status based on the determined transfer instruction count, and transfer the packet to the buffer based on the corrected packet storage status A packet transfer apparatus that performs an instruction.

Images