| 摘要 |
<p><P>PROBLEM TO BE SOLVED: To provide a bandwidth allocation method using a RPR fair mechanism which allocates efficiently an unused and utilizable bandwidth to each node and raises a whole bandwidth utilization, and maintains assignment fairness to each node after confusion is solved in a RPR network. <P>SOLUTION: Congestion generation of the node is judged for every aging spacing. In the case of congestion generation, the amount of a first traffic which self-machine has transmitted to the ageing spacing of 1 is established as a first fair transmission rate to decrease the amount of traffic transmitted from an upper node. This fair transmission rate is stored, recording on a fair message with an identifier of the self-machine and advertising to the upper node. The amount of the 2nd traffic from the upper node decreased by this fair transmission rate between the ageing spacings of 1 is measured and stored. If the congestion is solved, the utilizable bandwidth is computed on the basis of this fair transmission rate and the amount of the 2nd traffic. The 2nd fair transmission rate by this bandwidth is established, and transmitted to the upper node. <P>COPYRIGHT: (C)2005,JPO&NCIPI</p> |
