Queues with equally heavy sojourn time and service requirement distributions

DOI10.1023/A:1020905810996zbMath1013.90036OpenAlexW1545142097MaRDI QIDQ1854727

Rudesindo Núñez-Queija

Publication date: 27 January 2003

Published in: Annals of Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

telecommunicationsprocessor sharingshortest remaining processing timeforeground-background processor sharingintermediate regular variationqueues with heavy tails

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Queues and service in operations research (90B22)

Related Items (9)

Diffusion limits for shortest remaining processing time queues ⋮ Fluid Limits for Multiple-Input Shortest Remaining Processing Time Queues ⋮ ASYMPTOTIC PROPERTIES OF SOJOURN TIMES IN MULTICLASS TIME-SHARED SYSTEMS ⋮ Diffusion limits for shortest remaining processing time queues under nonstandard spatial scaling ⋮ Large deviations of sojourn times in processor sharing queues ⋮ Sojourn time asymptotics in processor-sharing queues ⋮ Delay Analysis of the Max-Weight Policy Under Heavy-Tailed Traffic via Fluid Approximations ⋮ Local edge minimality of SRPT networks with shared resources ⋮ Heavy traffic analysis for single-server SRPT and LRPT queues via EDF diffusion limits

This page was built for publication: Queues with equally heavy sojourn time and service requirement distributions