Reduced-load equivalence and induced burstiness in GPS queues with long-tailed traffic flows
From MaRDI portal
Publication:1810751
DOI10.1023/A:1023237129453zbMath1047.90008OpenAlexW2102196923MaRDI QIDQ1810751
Publication date: 9 June 2003
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1023237129453
Generalized Processor Sharinginduced burstinesslong-tailed trafficreduced-load equivalenceWeighted Fair Queueingworkload asymptotics
Related Items (16)
Asymptotic behavior of generalized processor sharing queues under subexponential assumptions ⋮ Heavy-tailed limits for medium size jobs and comparison scheduling ⋮ Large buffer asymptotics for generalized processor sharing queues with Gaussian inputs ⋮ Lévy-driven GPS queues with heavy-tailed input ⋮ Tandem queues with subexponential service times and finite buffers ⋮ Additive functionals with application to sojourn times in infinite-server and processor sharing systems ⋮ Generalized processor sharing: Characterization of the admissible region and selection of optimal weights ⋮ Insensitive Bounds for the Moments of the Sojourn Times in M/GI Systems Under State-Dependent Processor Sharing ⋮ Interacting queues in heavy traffic ⋮ On sojourn times in \(M/GI\) systems under state-dependent processor sharing ⋮ 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 ⋮ Waiting times for \(M/M\) systems under state-dependent processor sharing ⋮ Generalized processor sharing queues with heterogeneous traffic classes ⋮ Two coupled Levy queues with independent input
This page was built for publication: Reduced-load equivalence and induced burstiness in GPS queues with long-tailed traffic flows
