Scheduling with dynamic bandwidth allocation for DiffServ classes
نویسندگان
چکیده
The diverse service requirements of emerging Internet applications foster the need for flexible and scalable IP quality-of-service (QoS) schemes. Due to its simplicity and scalability, DiffServ is expected to be widely deployed across the Internet. Though DiffServ supporting scheduling algorithms for output-queueing (OQ) switches have been widely studied, there are few DiffServ scheduling algorithms for input-queueing (IQ) switches. In this paper, we propose the dynamic DiffServ scheduling (DDS) algorithm for IQ switches to provide dynamic bandwidth allocation for DiffServ classes. The basic idea of DDS is to schedule EF and AF traffic according to their minimum service rates with the reserved bandwidth and schedule AF and BE traffic fairly with the excess bandwidth. We evaluate the performance of DDS under bursty traffic arrivals and compare it with PQWRR, an existing scheduling algorithm suitable for supporting DiffServ for OQ switches. Simulations results show that DDS provides minimum bandwidth guarantees for EF and AF traffic and fair bandwidth allocation for BE traffic. DDS also achieves the delay and jitter performance for EF traffic close to that of PQWRR and the delay performance for AF traffic better than that of PQWRR at high loads. Using comparatortree based arbitration components, it is feasible to implement DDS in hardware at high speed.
منابع مشابه
An Adaptive Scheduling Scheme for Fair Bandwidth Allocation
Class-based service differentiation is provided in DiffServ networks. However, this differentiation will be disordered under dynamic traffic loads due to the fixed weighted scheduling. An adaptive weighted scheduling scheme is proposed in this paper to achieve fair bandwidth allocation among different service classes. In this scheme, the number of active flows and the subscribed bandwidth are e...
متن کاملDynamic fair bandwidth allocation for DiffServ classes
The Assured Forwarding Per Hop Behavior standardized by the IETF Differentiated Services working group provides four class-based differentiated IP services. In this service, however, unexpected service degradation may occur and differentiation among classes may be disordered if the network is designed to minimize over-provisioning or is under-provisioned. We therefore developed a packet schedul...
متن کاملScheduling Architectures for DiffServ Networks with Input Queuing Switches
Due to its simplicity and scalability, the differentiated services (DiffServ) model is expected to be widely deployed across wired and wireless networks. Though DiffServ supporting scheduling algorithms for output-queuing (OQ) switches have been widely studied, there are few DiffServ scheduling algorithms for input-queuing (IQ) switches in the literature. In this paper, we propose two DiffServ ...
متن کاملHarmonic Proportional Bandwidth Allocation for Service Differentiation on Streaming Servers
Recent advance of real-time audio/video transcoding technology enables streaming servers to manage the constrained network-I/O bandwidth available to the Internet at a fine-grained level. In this article, we propose a bandwidth allocation mechanism for differentiated services (DiffServ) on the streaming servers. It aims to deliver high bit rate streams to high priority requests without overcomp...
متن کاملA CBQ-Based Dynamic Resource Allocation Mechanism for Diffserv Routers
Class Based Queueing (CBQ) is a link-sharing and resource management mechanism for packet networks. The weights of CBQ control the way with which the available bandwidth at the output interface of the router is distributed among the different classes of the input traffic. CBQ also disposes of rules for bandwidth borrowing based on a hierarchy of classes. In [1], we proposed a dynamic, self-tuni...
متن کامل