Statistical analysis of the generalized processor sharing scheduling discipline

Abstract

We develop bounds on the individual session backlog and delay distribution under the generalized processor sharing (GPS) scheduling discipline. This work is motivated by, and is an extension of, Parekh and Gallager's (see IEEE/ACM Trans. Networking, vol.1, no.6, p.344-357, 1993, and vol. 2, no.4, p.137-150, 1994) deterministic study of the GPS scheduling discipline with leaky-bucket token controlled sessions. Using the exponentially bounded burstiness (EBB) process model introduced by Yaron and Sidi (see IEEE/ACM Trans. Networking, vol.1, p.372-385, 1993) as a source traffic characterization, we establish results that extend the deterministic study of GPS. For a single GPS server in isolation, we present statistical bounds on the distributions of backlog and delay for each session. In the network setting, we show that networks belonging to a broad class of GPS assignments, the so-called consistent relative session treatment (CRST) GPS assignments, are stable in a stochastic sense. In particular, we establish simple bounds on the distribution of backlog and delay for each session in a rate proportional processor sharing (RPPS) GPS network with arbitrary topology. >