Adaptive rate control (ARC) with erlangian traffics over resilient packet ring (RPR) network

  • Authors:
  • Surasee Prahmkaew;Chanintorn Jittawiriyanukoon

  • Affiliations:
  • Department of Telecommunications Science, Faculty of Science and Technology, Assumption University, Bangkok, Thailand;Department of Telecommunications Science, Faculty of Science and Technology, Assumption University, Bangkok, Thailand

  • Venue:
  • EHAC'06 Proceedings of the 5th WSEAS International Conference on Electronics, Hardware, Wireless and Optical Communications
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper an Adaptive Rate Control (ARC) with Erlangian traffics in Resilient Packet Ring (RPR) network has been proposed. First, the RPR network will be introduced then the necessity of Erlangian distribution for traffic will be discussed. The traffic flow prior to the entrance of RPR network will be controlled by the window size adjustment in the 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.