TWO LEVEL DYNAMIC PERMIT CREDENTIALS CONGESTION CONTROL ALGORITHM AND ITS PERFORMANCE MODEL

This paper briefly introduces the ISARITHMIC -- algorithm of congestion technique and analyzes its weakness, and presents a dynamic method to adopt two-level permit. In order to guarantee that throughput of network is of stability, this algorithm dynamically manages the permit -- length in a node and the totality of permit in the subnet. Performance (average of waiting time, optimal number of the 0-level permit) of this algorithm analysis is done, and then the corresponding mathematical model is shown in this paper. Finally, the future work is proposed.