Unfairness of assured service and a rate adaptive marking strategy

  • Authors:
  • Seung-Joon Seok;Sung-Hyuck Lee;Seok-Min Hong;Chul-Hee Kang

  • Affiliations:
  • Department of Electronics Engineering, Korea University, Seoul, Korea;Network Protocol T.G., i-Networking Lab., Samsung Advanced Institute of Technology, Yongin-shi, Kyungki-do, Korea;Department of Electronics Engineering, Korea University, Seoul, Korea;Department of Electronics Engineering, Korea University, Seoul, Korea

  • Venue:
  • QofIS'02/ICQT'02 Proceedings of the 3rd international conference on quality of future internet services and internet charging and QoS technologies 2nd international conference on From QoS provisioning to QoS charging
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

Assured Service, which is a service model of the Internet Differentiated Services (DiffServ) architecture is not currently well implemented on the Internet, mainly because TCP employs an AIMD (Additive Increase and Multiplicative decrease) mechanism to control congestion. In this paper, we analyze the problem and describe a marking rule, called RAM (Rate Adaptive Marking), which diminishes the problem. The RAM method marks sending packets, at a source node or at an edge router, in inverse proportion to throughput gain and in proportion to the reservation rate and throughput dynamics. We also discuss methods to implement the RAM strategy. Several experiments with the ns- 2 simulator are performed to evaluate the RAM scheme.