This paper contains an asymptotic analysis of a fluid model for a heavily loaded processor sharing queue. Specifically, we consider the behavior of solutions of critical fluid models as time approaches infinity. The main theorems of the paper provide sufficient conditions for a fluid model solution to converge to an invariant state and, under slightly more restrictive assumptions, provide a rate of convergence. These results are used in a related work by Gromoll for establishing a heavy traffic diffusion approximation for a processor sharing queue
We consider two identical, parallel M/M/1 queues. Both queues are fed by a Poisson arrival stream of...
We study the convergence of the M/G/1 processor-sharing, queue length process in the heavy traffic r...
We provide an approximate analysis of the transient sojourn time for a processor sharing queue with ...
Consider a single server queue with renewal arrivals and i.i.d. service times in which the server op...
In this paper, we develop a new approach to studying the asymptotic behavior of fluid model solution...
This second version improves the presentation of results in Section 3 and in Appendix C.Consider a s...
Consider a single server queue with renewal arrivals and i.i.d. service times in which the server op...
We investigate a processor sharing queue with renewal arrivals and generally distributed service tim...
Consider a single server queue with renewal arrivals and i.i.d. service times in which the server op...
We study the asymptotic behavior of solutions to a fluid model for a data communication network, whe...
We consider a processor sharing queue where the number of jobs served at any time is limited to K, w...
Motivated by applications in computer and communication systems, we consider a pro-cessor sharing qu...
Abstract. We investigate a processor sharing queue with renewal arrivals and generally distributed s...
We study the convergence of the M/G/1 processor-sharing, queue length process in the heavy traffic r...
We provide an approximate analysis of the transient sojourn time for a processor sharing queue with ...
We consider two identical, parallel M/M/1 queues. Both queues are fed by a Poisson arrival stream of...
We study the convergence of the M/G/1 processor-sharing, queue length process in the heavy traffic r...
We provide an approximate analysis of the transient sojourn time for a processor sharing queue with ...
Consider a single server queue with renewal arrivals and i.i.d. service times in which the server op...
In this paper, we develop a new approach to studying the asymptotic behavior of fluid model solution...
This second version improves the presentation of results in Section 3 and in Appendix C.Consider a s...
Consider a single server queue with renewal arrivals and i.i.d. service times in which the server op...
We investigate a processor sharing queue with renewal arrivals and generally distributed service tim...
Consider a single server queue with renewal arrivals and i.i.d. service times in which the server op...
We study the asymptotic behavior of solutions to a fluid model for a data communication network, whe...
We consider a processor sharing queue where the number of jobs served at any time is limited to K, w...
Motivated by applications in computer and communication systems, we consider a pro-cessor sharing qu...
Abstract. We investigate a processor sharing queue with renewal arrivals and generally distributed s...
We study the convergence of the M/G/1 processor-sharing, queue length process in the heavy traffic r...
We provide an approximate analysis of the transient sojourn time for a processor sharing queue with ...
We consider two identical, parallel M/M/1 queues. Both queues are fed by a Poisson arrival stream of...
We study the convergence of the M/G/1 processor-sharing, queue length process in the heavy traffic r...
We provide an approximate analysis of the transient sojourn time for a processor sharing queue with ...