Reduced-load equivalence and induced burstiness in GPS queues with long-tailed traffic flows
From MaRDI portal
Publication:1810751
DOI10.1023/A:1023237129453zbMATH Open1047.90008OpenAlexW2102196923MaRDI QIDQ1810751FDOQ1810751
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
Recommendations
- A reduced-load equivalence for generalised processor sharing networks with long-tailed input flows
- Asymptotic behavior of generalized processor sharing queues under subexponential assumptions
- Generalized processor sharing queues with heterogeneous traffic classes
- Impact of bursty traffic on queues
- Lévy-driven GPS queues with heavy-tailed input
Generalized Processor Sharinginduced burstinesslong-tailed trafficreduced-load equivalenceWeighted Fair Queueingworkload asymptotics
Cited In (17)
- Waiting times for \(M/M\) systems under state-dependent processor sharing
- Generalized processor sharing: Characterization of the admissible region and selection of optimal weights
- Heavy-tailed limits for medium size jobs and comparison scheduling
- Generalized processor sharing queues with heterogeneous traffic classes
- 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
- Delay Analysis of the Max-Weight Policy Under Heavy-Tailed Traffic via Fluid Approximations
- Tandem queues with subexponential service times and finite buffers
- A reduced-load equivalence for generalised processor sharing networks with long-tailed input flows
- Lévy-driven GPS queues with heavy-tailed input
- Insensitive Bounds for the Moments of the Sojourn Times in M/GI Systems Under State-Dependent Processor Sharing
- AnRG-Factorization Approach for a BMAP/M/1 Generalized Processor-Sharing Queue
- Two coupled Levy queues with independent input
- Interacting queues in heavy traffic
- Large buffer asymptotics for generalized processor sharing queues with Gaussian inputs
- Additive functionals with application to sojourn times in infinite-server and processor sharing systems
- Asymptotic behavior of generalized processor sharing queues under subexponential assumptions
This page was built for publication: Reduced-load equivalence and induced burstiness in GPS queues with long-tailed traffic flows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1810751)