Sciweavers

Share
ICC
2007
IEEE

FP/FIFO Scheduling: Deterministic Versus Probabilistic QoS Guarantees and P-Schedulability

9 years 9 months ago
FP/FIFO Scheduling: Deterministic Versus Probabilistic QoS Guarantees and P-Schedulability
Abstract—In this paper, we focus on applications with quantitative QoS (Quality of Service) requirements in their end-toend response time. Two types of quantitative QoS garantees can be delivered by a network: deterministic and probabilistic. The deterministic approach is based on a worst case analysis. The probabilistic approach uses a mathematical model to obtain the probability of the response time exceeding a given value. We assume that flows are scheduled according to non-preemptive FP/FIFO. The packet with the highest fixed priority is scheduled first. If two packets share the same fixed priority, the packet that arrives first on the node considered is scheduled first. We compare deterministic and probabilistic QoS guarantees and introduce the concept of p-schedulability: the QoS requested by all flows is met with probability p.
Leïla Azouz Saïdane, Skander Azzaz, Stev
Added 02 Jun 2010
Updated 02 Jun 2010
Type Conference
Year 2007
Where ICC
Authors Leïla Azouz Saïdane, Skander Azzaz, Steven Martin, Pascale Minet
Comments (0)
books