Friedrich-Alexander-Universität UnivisSucheDeutsch FAU-Logo
Techn. Fakultät Willkommen am Department Informatik FAU-Logo
Logo IMMD
Lehrstuhl für Informatik 4
 DA
 SA

Department Informatik  >  Informatik 4  > Pubs
Essafi, Lassaad ; Bolch, Gunter ; de Meer, Hermann :
Dynamic Priority Scheduling for Proportional Delay Differentiated Services.
Erlangen: FAU. 2001
TR-I4-01-03.- Interner Bericht. 20 Seiten.
 

Abstract:
Recent results on the proportional differentiation model show that waiting time priority scheduling can be applied to implement proportional delay differentiatied services reasonably well under limited conditions. While earlier research focused on heavy load conditions only, more recent results provide insights into waiting time priority scheduling under moderate load conditions also, but the applicability of the algorithm has been limited to a two-service-class solution for numerical reasons. In this paper, in contrast, a dynamic adjustment of a waiting time priority scheduler is suggested to meet the differentiation requirements for any finite number of traffic classes. Our newly introduced approach is based on genetic algorithms. The dynamically optimized scheduling parameters can be determined with high accuracy. We apply an interpolation function to yield a continuum of parameters rather than discrete values and propose a simple look-up table for a dynamic adjustment of the scheduling parameters. We also focus on feasibility and implementation issues related to the suggested algorithm. Suitability of other time-dependent priority functions for proportional delay differentiation is also investigated.

  Contact