Approximation Approach of Adaptive Rate Control (ARC) with Erlangian Telecommunication Traffics over Resilient Packet Ring (RPR) Network

摘要

In this paper an approximation method for Adaptive Rate Control (ARC) with Erlangian telecommunication traffics in Resilient Packet Ring (RPR) network has been proposed. First, the RPR network will be introduced then the necessity of Erlangian distribution for telecommunication traffic will be discussed. The traffic flow prior to the entrance of RPR network will be controlled by the window size adjustment of ARC algorithm. The algorithm per se introduces the basic regulation of appropriate window upsize or downsize. Input traffic rate, packets drop, preset size of the window and RTT are taken into account by the ARC algorithm. Simulations are employed to investigate how input Erlangian traffic rate or other parameters mentioned above affect the performance. Results before and after applying ARC are compared. In addition simulations show how the performance can be improved by the ARC algorithm. By varying Erlang means, the results indicate the improvement. Furthermore, results from simulation will be compared to those from approximation approach. The comparison indicates percentage of error in the range of 12% for utilization measurement.