Large buffer asymptotics for generalized processor sharing queues with Gaussian inputs

From MaRDI portal





The authors first obtain the large-buffer asymptotics of two Gaussian flows that share the network capacity using generalized processor sharing discipline. It is assumed that flow 1 sends on average at a rate smaller than the guaranteed rate, and for flow 2 the following cases are distinguished: i) underload and ii) overload. The logarithmic asymptotics are derived. These results are applied to the integrated Gaussian process, to fractional Brownian motion and to a Gaussian flow interacting with an on-off flow.











This page was built for publication: Large buffer asymptotics for generalized processor sharing queues with Gaussian inputs

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