Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
The macroscopic behavior of the TCP congestion avoidance algorithm
ACM SIGCOMM Computer Communication Review
Relative differentiated services in the Internet: issues and mechanisms
SIGMETRICS '99 Proceedings of the 1999 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Proportional differentiated services: delay differentiation and packet scheduling
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
A control theoretic approach to active queue management
Computer Networks: The International Journal of Computer and Telecommunications Networking
An optimization-oriented view of random early detection
Computer Communications
A case for relative differentiated services and the proportional differentiation model
IEEE Network: The Magazine of Global Internetworking
Proceedings of the 2007 conference on Human interface: Part I
| Hi-index | 0.24 |
The relative differentiated service model is one of several models proposed for service differentiation in networks [IEEE Network Sept/Oct (1999) 26]. In this model, an assurance is given that 'higher classes will be better, or at least no worse than lower classes.' This paper describes a relative loss rate differentiation scheme based on RED. The scheme is used for differentially dropping packets in a FIFO queue during times of congestion. The main idea is, if packet losses are unavoidable in the FIFO queuing system, then they should be distributed among the different service classes in the queue in inverse proportion to the service price or weight assigned to each class. The simulation studies using TCP traffic show that the scheme is very effective in ensuring relative loss rate differentiation between service classes.