Scheduling and quality differentiation in differentiated services

N/ACitations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper provides insight into the problems and possibilities related to quality differentiation, traffic mapping and scheduling in Differentiated Services. We focus on the differentiation of two important quality parameters, capacity and delay, and consider two models in detail: absolute capacity differentiation and proportional delay differentiation with delay bound. We suggest possible packet schedulers for implementing these models: DRR and our own versions of adaptive DRR and HPD where we have assigned the highest class with a delay bound. According to the simulation results provisioning and differentiation with static resource allocation methods is problematic but with some of the adaptive schedulers tunable and consistent differentiation can be achieved. Based on these observations we suggest that in Differentiated Services networks an adaptive scheduler with delay bound should be used for resource allocation. We also argue that from applications point of view it is beneficial if different traffic types are separated into their own classes before the actual resource allocation. © Springer-Verlag Berlin Heidelberg 2003.

Cite

CITATION STYLE

APA

Antila, J., & Luoma, M. (2003). Scheduling and quality differentiation in differentiated services. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2899, 119–130. https://doi.org/10.1007/978-3-540-40012-7_10

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free