A Delay Curve with Markovian Recursion for Deadline Calculation in SCED
Lain-Chyr Hwang, Chia-Hsu Kuo, San‐Yuan Wang · 2006
In the future Internet, one essential basis is quality of service (QoS), which could be described by the service curve (SC). The SCs specified by users can be guaranteed by SCED (service curve based earliest deadline first policy), in which deadline calculation is the core. Although has provided a kind of recursion of deadline calculation and a kind of treatable SC, concave piecewise linear SC (CPLSC), however, the recursion is not feasible for general SCs and the CPLSC is not the most universal SC that is treatable. In this paper, we define a Markovian recursion that is really feasible and propose a family of delay curve (DCs), called convex piecewise linear DC (CPLDC), which is the most universal treatable curve for deadline calculation. We derive a more compact and clearer recursive relation of deadline calculation for CPLDC. The SC corresponding to CPLDC is convex piecewise linear inverted SC (CPLISC) that makes CPLSC and delayed leaky bucket SC its special cases