Service differentiation and guarantees for TCP-based elastic traffic

Authors:
Nidhi Hegde;Konstantin E. Avrachenkov
Affiliations:
INRIA, Sophia Antipolis Cedex, France;INRIA, Sophia Antipolis Cedex, France
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

Citing 8
Cited 1

A generalized processor sharing approach to flow control in integrated services networks: the single-node case

IEEE/ACM Transactions on Networking (TON)
An engineering approach to computer networking: ATM networks, the Internet, and the telephone network

An engineering approach to computer networking: ATM networks, the Internet, and the telephone network
The macroscopic behavior of the TCP congestion avoidance algorithm

ACM SIGCOMM Computer Communication Review
Modeling TCP throughput: a simple model and its empirical validation

Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
On achievable service differentiation with token bucket marking for TCP

Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
A stochastic model of TCP/IP with stationary random losses

Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Differentiated Services for the Internet

Differentiated Services for the Internet
Beyond best effort: router architectures for the differentiated services of tomorrow's Internet

IEEE Communications Magazine

Priority queueing with finite buffer size and randomized push-out mechanism

Performance Evaluation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We compare buffer management policies that offer differentiated services to TCP traffic, with the goal of providing some sort of performance guarantees to a premium class of traffic. Specifically, we study the effectiveness of a scheduling policy combined with various buffer management policies on the performance of competing TCP connections. In this work we consider a stochastic model for a classbased weighted-fair-queueing scheduling policy where packets of different classes are scheduled according to their pre-assigned static weights. We consider two buffer management policies: complete partitioning, and complete sharing with pushout at various thresholds. We consider two classes of TCP traffic in our model. Our goal is to propose mechanisms with easily adjustable parameters to achieve service differentiation as required. In the numerical results we show how the scheduling and buffer policies can be used to provide some sort of performance guarantee to the higher class.