Cooperative adjusted RED in Diffserv network

Author

Wang, Qian ; Long, Keping ; Cheng, Shiduan ; Zhang, Runtong

Author_Institution

Nat. Key Lab of Switching Technol. & Telecommun. Networks, Beijing Univ. of Posts & Telecommun., China

Volume

2

fYear

2001

fDate

2001

Firstpage

205

Abstract

This paper presents a new implementation mechanism of random early detection (RED), cooperative adjusted RED (CARED), cooperating with marker algorithms to guarantee the fairness between different AF class services in the Diffserv network. We firstly deduce the quantitative relationship between the actual rate and the committed rate of services on the basis of the marking probability of the token-based marker, and then adjust the dropping probability of CARED to drop packets according to this relationship. This CARED mechanism can not only efficiently control the congestion according to the queue occupancy of the Diffserv network, but also commendably satisfy different quality requirements of AF class services

Keywords

Internet; packet switching; probability; queueing theory; telecommunication congestion control; AF class services; CARED; Diffserv network; IP network; NSWMPM algorithm; TCP/IP protocols; active queue management; congestion control; cooperative adjusted RED; differentiated services architecture; dropping probability; fairness guarantee; marker algorithms; marking probability; metering algorithm; packet dropping; queue occupancy; random early detection; token-based marker; Diffserv networks; Electronic mail; Helium; IP networks; Intelligent networks; Packet switching; Quality of service; Research and development; Telecommunication switching; Web and internet services;

fLanguage

English

Publisher

ieee

Conference_Titel

Info-tech and Info-net, 2001. Proceedings. ICII 2001 - Beijing. 2001 International Conferences on

Conference_Location

Beijing

Print_ISBN

0-7803-7010-4

Type

conf

DOI

10.1109/ICII.2001.983578

Filename

983578