Fair Stateless Aggregate Traffic Marking Using Active Queue Management Techniques

Authors:
A. Das;D. Dutta;Ahmed Helmy
Affiliations:
-;-;-
Venue:
MMNS '02 Proceedings of the 5th IFIP/IEEE International Conference on Management of Multimedia Networks and Services: Management of Multimedia on the Internet
Year:
2002

Citing 6
Cited 2

Analysis and simulation of a fair queueing algorithm

SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
Random early detection gateways for congestion avoidance

IEEE/ACM Transactions on Networking (TON)
Dynamics of random early detection

SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Core-stateless fair queueing: achieving approximately fair bandwidth allocations in high speed networks

Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Computer networks: a systems approach

Computer networks: a systems approach
ItswTCM: a new aggregate marker to improve fairness in DiffServ

Computer Communications

Fair and efficient dynamic bandwidth allocation for multi-application networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
A lightweight marker with partial state information for DiffServ networks

Computer Networks: The International Journal of Computer and Telecommunications Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

The differentiated services architecture promises to provide QoS guarantees through scalable service differentiation among multimedia and best-effort flows in the Internet. Traffic marking is an important component of this Diffserv framework. In this paper, we propose two new stateless, scalable and fair aggregate markers for TCP aggregates and UDP multimedia aggregates. We leverage stateless Active Queue Management (AQM) algorithms to design markers that ensure fair and efficient token distribution among individual flows of an aggregate. We present the Probabilistic Aggregate Marker (PAM), that uses the token bucket burst size to probabilistically mark incoming packets to achieve TCP-friendly and fair marking, and the Stateless Aggregate Fair Marker (F-SAM) that approximates fair queueing techniques to isolate flows while marking packets of the aggregate. Our simulation results show that our marking strategies show upto 30% improvement over other commonly used markers while marking flow aggregates. When applied to aggregate TCP flows consisting of long-lived flows(elephants) and short lived web flows(mice), our F-SAM marker prevents any bias against short flows and helps the mice to win the war against elephants.