Efficient Admission Control for EDF Schedulers

         Victor Firoiu, Jim Kurose, Don Towsley


                         ABSTRACT


In this paper we present algorithms for flow admission control at an
EDF link scheduler when the flows are characterized by peak rate,
average rate and burst size.  We show that the algorithms have very
low computational complexity and are easily applicable in
practice. The complexity can be further decreased by introducing the
notion of flex classes. We evaluate the penalty in efficiency that the
classes incur to the EDF scheduler. We find that this efficiency
degradation can be made arbitrarily small and is acceptable even for a
small number of classes.