A reduced-load equivalence for generalised processor sharing networks with long-tailed input flows

DOI10.1023/A:1015785919268zbMath1024.90028OpenAlexW1884713233MaRDI QIDQ1605049

Miranda van Uitert, Sem C. Borst

Publication date: 11 July 2002

Published in: Queueing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1015785919268

zbMATH Keywords

regular variationgeneralised processor sharingheavy-tailed trafficweighted fair queueing

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (6)

On the stability of the multi-queue multi-server processor sharing with limited service ⋮ Large buffer asymptotics for generalized processor sharing queues with Gaussian inputs ⋮ Generalized processor sharing: Characterization of the admissible region and selection of optimal weights ⋮ A sample path relation for the sojourn times in \(G/G/1\)-PS systems and its applications ⋮ AnRG-Factorization Approach for a BMAP/M/1 Generalized Processor-Sharing Queue ⋮ Delay Analysis of the Max-Weight Policy Under Heavy-Tailed Traffic via Fluid Approximations

This page was built for publication: A reduced-load equivalence for generalised processor sharing networks with long-tailed input flows