Scheduling for Proportional Differentiated Services on the Internet

Proportional Differentiated Services can be provisioned in terms of bandwidth, delay, or packet loss. Several studies contributed schedulers and packet droppers that achieved proportional bandwidth, delay, or loss differentiation. However, all these schemes differentiated in terms of only one of the three metrics. A simple, unified, scalable, and robust scheme to simultaneously control all three metrics was felt important. By controlling just delay and packet loss, proportional differentiation can be achieved in terms of all three metrics. A robust adaptive scheduler for proportional delay differentiation services is presented. Proportional services are further policed by a class based packet dropper. The combination of the adaptive scheduler and the packet dropper treats different traffic classes proportionally in terms of all three metrics. Simulation experiments show that regardless of the network traffic characteristics, our scheme can effectively differentiate services in terms of bandwidth, delay, and loss simultaneously

Implementation of IP Proportional Differentiation with Waiting-Time Priority and Proportional Loss Rate dropper in Linux

The proportional Diffserv (PDS) model is a model for providing service differentiation in IP. It ensures that a class of service obtains a performanc- e (in terms of delay or loss rate) proportional to the performance obtained by an other class, according to a specific coefficient. The WTP and PLR schedulers provide proportional differentiation. They have not been widely tested today because commercials routers do not implement them. In this report we present an implementation in the Linux operating system of these schedulers and show experimental results we obtained with them

A Fair and Efficient Packet Scheduling Scheme for IEEE 802.16 Broadband Wireless Access Systems

This paper proposes a fair and efficient QoS scheduling scheme for IEEE 802.16 BWA systems that satisfies both throughput and delay guarantee to various real and non-real time applications. The proposed QoS scheduling scheme is compared with an existing QoS scheduling scheme proposed in literature in recent past. Simulation results show that the proposed scheduling scheme can provide a tight QoS guarantee in terms of delay, delay violation rate and throughput for all types of traffic as defined in the WiMAX standard, thereby maintaining the fairness and helps to eliminate starvation of lower priority class services. Bandwidth utilization of the system and fairness index of the resources are also encountered to validate the QoS provided by our proposed scheduling scheme

Theories and Models for Internet Quality of Service

We survey recent advances in theories and models for Internet Quality of Service (QoS). We start with the theory of network calculus, which lays the foundation for support of deterministic performance guarantees in networks, and illustrate its applications to integrated services, differentiated services, and streaming media playback delays. We also present mechanisms and architecture for scalable support of guaranteed services in the Internet, based on the concept of a stateless core. Methods for scalable control operations are also briefly discussed. We then turn our attention to statistical performance guarantees, and describe several new probabilistic results that can be used for a statistical dimensioning of differentiated services. Lastly, we review recent proposals and results in supporting performance guarantees in a best effort context. These include models for elastic throughput guarantees based on TCP performance modeling, techniques for some quality of service differentiation without access control, and methods that allow an application to control the performance it receives, in the absence of network support

Advances in Internet Quality of Service

We describe recent advances in theories and architecture that support performance guarantees needed for quality of service networks. We start with deterministic computations and give applications to integrated services, differentiated services, and playback delays. We review the methods used for obtaining a scalable integrated services support, based on the concept of a stateless core. New probabilistic results that can be used for a statistical dimensioning of differentiated services are explained; some are based on classical queuing theory, while others capitalize on the deterministic results. Then we discuss performance guarantees in a best effort context; we review: methods to provide some quality of service in a pure best effort environment; methods to provide some quality of service differentiation without access control, and methods that allow an application to control the performance it receives, in the absence of network support

Final report on the evaluation of RRM/CRRM algorithms

Deliverable public del projecte EVERESTThis deliverable provides a definition and a complete evaluation of the RRM/CRRM algorithms selected in D11 and D15, and evolved and refined on an iterative process. The evaluation will be carried out by means of simulations using the simulators provided at D07, and D14.Preprin

Heart-like fair queuing algorithms (HLFQA)

We propose a new family of fair, work conserving traffic scheduling mechanisms that imitate the behavior of the human heart in the cardiovascular system. The algorithms have MAX (where MAX is the maximum packet size) fairness and O(log N) complexity and thus compare favorably with existing algorithms. The algorithms are simple enough to be implemented in hardwar