On spectral properties of finite population processor shared queues

From MaRDI portal



Abstract: We consider sojourn or response times in processor-shared queues that have a finite population of potential users. Computing the response time of a tagged customer involves solving a finite system of linear ODEs. Writing the system in matrix form, we study the eigenvectors and eigenvalues in the limit as the size of the matrix becomes large. This corresponds to finite population models where the total population is Ngg1. Using asymptotic methods we reduce the eigenvalue problem to that of a standard differential equation, such as the Hermite equation. The dominant eigenvalue leads to the tail of a customer's sojourn time distribution.











This page was built for publication: On spectral properties of finite population processor shared queues

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2392788)