Abstract
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) [9], in which deadline calculation is the core. Although [9] has provided a kind of recursion of deadline calculation and a kind of treatable SC, Concave Piecewise Linear SC (?PLSC), however, the recursion is not feasible for general SCs and the ?PLSC 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 (?PLDC), which is the most universal treatable curve for deadline calculation. We derive a more compact and clearer recursive relation of deadline calculation for ?PLDC. The SC corresponding to ?PLDC is Convex Piecewise Linear Inverted SC (?PLISC) that makes ?PLSC [9] and delayed leaky bucket SC [8] its special cases.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
