On sojourn times in M/GI systems under state-dependent processor sharing

• Authors: Manfred Brandt;Andreas Brandt
• Venue: Queueing Systems: Theory and Applications
• Year: 2010

We consider a system with Poisson arrivals and i.i.d. service times. The requests are served according to the state-dependent processor-sharing discipline, where each request receives a service capacity which depends on the actual number of requests in the system. The linear systems of PDEs describing the residual and attained sojourn times coincide for this system, which provides time reversibility including sojourn times for this system, and their minimal non-negative solution gives the LST of the sojourn time V(驴) of a request with required service time 驴. For the case that the service time distribution is exponential in a neighborhood of zero, we derive a linear system of ODEs, whose minimal non-negative solution gives the LST of V(驴), and which yields linear systems of ODEs for the moments of V(驴) in the considered neighborhood of zero. Numerical results are presented for the variance of V(驴). In the case of an M/GI/2-PS system, the LST of V(驴) is given in terms of the solution of a convolution equation in the considered neighborhood of zero. For service times bounded from below, surprisingly simple expressions for the LST and variance of V(驴) in this neighborhood of zero are derived, which yield in particular the LST and variance of V(驴) in M/D/2-PS.