| 摘要 |
<p>PROBLEM TO BE SOLVED: To provide a scheduler in which delivery of a cell can be carried out with a small computational quantity even on the basis of priority. SOLUTION: The scheduler comprises means (201) for determining the delivery time of a cell for each connection, a buffer memory means (202) for storing a cell in correspondence with the delivery time, means (204) for storing the combination of delivery time of a cell and identification information of a cell stored in the buffer memory as an element, specifying an element having an earliest delivery time among the stored elements and determining a cell in a buffer memory indicated by the identification information of cell of that element as a cell to be delivered, and means (205) for delivering a cell thus determined. The means (204) for determining a cell to be delivered is arranged to store the elements in a heap using the delivery time as an index, specify an element having a smallest index among the stored elements and determine a cell of earliest delivery time as a cell to be delivered.</p> |
