Fair Stateless Aggregate Traffic Marking Using Active Queue Management Techniques
نویسندگان
چکیده
In heterogeneous networks such as today’s Internet, the differentiated services architecture promises to provide QoS guarantees through scalable service differentiation. Traffic marking is an important component of this framework. In this paper, we propose two new aggregate markers that are stateless, scalable and fair. We leverage stateless Active Queue Management (AQM) algorithms to enable fair and efficient token distribution among individual flows of an aggregate. The first marker, Probabilistic Aggregate Marker (PAM), uses the Token Bucket burst size to probabilistically mark incoming packets to ensure TCP-friendly and proportionally fair marking. The second marker, Stateless Aggregate Fair Marker (F-SAM) approximates fair queueing techniques to isolate flows while marking packets of the aggregate. It distributes tokens evenly among the flows without maintaining per-flow state. Our simulation results show that our marking strategies show upto 30% improvement over other commonly used markers while marking flow aggregates. These improvements are in terms of better average throughput and fairness indices, in scenarios containing heterogeneous traffic consisting of TCP (both long lived elephants and short lived mice) and misbehaving UDP flows. As a bonus, F-SAM helps the mice to win the war against elephants.
منابع مشابه
Fair Stateless Aggregate Marking Techniques for Differentiated Services Networks
In heterogeneous networks such as today’s Internet, the differentiated services architecture for providing scalable service differentiation, has proved to be a practical and easily deployable method for providing Quality-of-Services. In this paper, we focus on the issue of packet marking in diffserv networks. We specifically look at developing fair aggregate markers which do not need to maintai...
متن کاملA stateless active queue management scheme for approximating fair bandwidth allocation
We investigate the problem of providing a fair bandwidth allocation to each of flows that share the outgoing link of a congested router. The buffer at the outgoing link is a simple FIFO, shared by packets belonging to the flows. We devise a simple packet dropping scheme, called CHOKe, that discriminates against the flows which submit more packets/sec than is allowed by their fair share. By doin...
متن کاملA Stateless Active Queue Management Scheme for Approximating Fair Bandwidth Allocation and Stabilized Buffer Occupation
We investigate the problem of providing a fair bandwidth allocation to each of flows that share the outgoing link of a congested router. The buffer at the outgoing link is a simple FIFO, shared by packets belonging to the flows. We devise a simple packet dropping scheme, called CHOKe, that discriminates against the flows which submit more packets/sec than is allowed by their fair share. By doin...
متن کاملPreferential Bandwidth Allocation for Short Flows with Active Queue Management
Several fair queueing mechanisms based on stateless core (SCORE)/dynamic packet state (DPS) architecture have been proposed to address the scalability problem of stateful architectures. However, most of these mechanisms indiscriminatingly label every packet in edge routers while only a small fraction of the packets that come from fast flows will be dropped by core routers. Moreover, these mecha...
متن کاملComparative Analysis of Congestion Control Algorithms Using ns-2
In order to curtail the escalating packet loss rates caused by an exponential increase in network traffic, active queue management techniques such as Random Early Detection (RED) have come into picture. Flow Random Early Drop (FRED) keeps state based on instantaneous queue occupancy of a given flow. FRED protects fragile flows by deterministically accepting flows from low bandwidth connections ...
متن کامل