The SCED service discipline with O(1) complexity for deadline calculation

Abstract

In order for a service discipline to be used for guaranteed service networks at very high speed, its overall implementation must be scalable while it provides as wide a network schedulability region as possible. Front this point of view, GPS-based service disciplines provide a narrow network schedulability region while EDF-based disciplines stiffer front the implementation complexities of rate-controllers and admission control. Alternatively, although service disciplines based oil service-curves can provide a wider network schedulability region than GPS-based and EDF-based disciplines, they may have even worse implementation complexities than EDF-based disciplines. In this paper, we propose to employ a service discipline based oil our specific service-curves. We show that our service discipline has comparable implementation complexity to CPS-based disciplines while providing the same wide network schedulability region that EDF-based disciplines can provide. In fact, this service discipline is ail SCED service discipline proposed in [14]. However, our specific service-curves provide the SCED service discipline with the same network schedulability region that EDF-based disciplines can provide, 0(1) complexity for deadline calculation, and O(N) complexity for admission control where N is the number of sessions.