TRAFFIC SHAPING DEVICE

摘要

PROBLEM TO BE SOLVED: To prevent the probability of a cell rejection of another address from becoming high by grasping the comparison of the preset maximum number capable of storing cells with the number of stored cells for every address and deciding the delivery of an arriving cell to a cell buffer storage means for every address. SOLUTION: A header extraction part 302 extracts a VC from an input cell and transmits it to a permission maximum queue length read-out circuit 303 and a queue length read out table 304. The permission maximum queue length read-out circuit 303 refers to a permission maximum queue length table 305 and writes a permission maximum queue length of its VC in a permission maximum queue length register 307. The queue length read out table 304 reads a queue length of its VC from a queue length table 306 and writes it in an additional value register 311 by way of a register 308. A large and small comparator 313 transmits a decision that an output is possible to a cell buffer 301 when a queue length of the additional value register 311 is shorter than the permission maximum queue length.