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

In this paper, we focus on applications with quantitative QoS (quality of service) requirements in their end-to- end response time. Two types of quantitative QoS guarantees 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.

[1]  Jean-Yves Le Boudec,et al.  Network Calculus: A Theory of Deterministic Queuing Systems for the Internet , 2001 .

[2]  Marco Spuri,et al.  Holistic Analysis for Deadline Scheduled Real-Time Distributed Systems , 1996 .

[3]  Hideaki Takagi,et al.  Queueing analysis: a foundation of performance evaluation , 1993 .

[4]  Sanjoy K. Baruah,et al.  Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor , 1990, Real-Time Systems.

[5]  Rada Y. Chirkova,et al.  Queuing Systems , 2018, Encyclopedia of Database Systems.

[6]  Daniel O. Awduche,et al.  Requirements for Traffic Engineering Over MPLS , 1999, RFC.

[7]  John A. Clark,et al.  Holistic schedulability analysis for distributed hard real-time systems , 1994, Microprocess. Microprogramming.

[8]  Steven C. Martin,et al.  Maîtrise de la dimension temporelle de la qualité de service dans les réseaux , 2004 .

[9]  Alan Burns,et al.  Analysis of hard real-time communications , 1995, Real-Time Systems.

[10]  Alexandre Proutière,et al.  Statistical performance guarantees for streaming flows using expedited forwarding , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[11]  Pascale Minet,et al.  Worst case end-to-end response times of flows scheduled with FP/FIFO , 2006, International Conference on Networking, International Conference on Systems and International Conference on Mobile Communications and Learning Technologies (ICNICONSMCL'06).

[12]  Robert B. Cooper,et al.  Queueing systems, volume II: computer applications : By Leonard Kleinrock. Wiley-Interscience, New York, 1976, xx + 549 pp. , 1977 .

[13]  Yutaka Takahashi,et al.  Queueing analysis: A foundation of performance evaluation, volume 1: Vacation and priority systems, Part 1: by H. Takagi. Elsevier Science Publishers, Amsterdam, The Netherlands, April 1991. ISBN: 0-444-88910-8 , 1993 .