| 摘要 |
<p>PROBLEM TO BE SOLVED: To provide guarantee on the three types of impartiality on the distribution of capacity, service time and resources by giving service to packets in such a way that they always exceed the minimum preservation quantity of allocated quantity xi (t) and they adapt to the same value at that time for all flows in minimum preservation quantity activity. SOLUTION: Service is given to the packets in queues 101 -10n in such a way that the relation of the time (t) of the partΔxi (t) of allocated quantity xi (t) exceeding minimum preservation quantity ri at the part ei (t) of real number quantityλi (t) exceeding minimum preservation quantity ri at an output link S becomes equal to the same value k (t) at time (t) on all active flows Fli. Thus, guaranteed quantity corresponding to minimum preservation quantity ri can be obtained, guaranteed service time can be obtained and the balance of a loss can be guaranteed.</p> |
