Sojourn time asymptotics in processor-sharing queues

DOI10.1007/s11134-006-7585-9zbMath1094.60059OpenAlexW2126566987WikidataQ56753256 ScholiaQ56753256MaRDI QIDQ2494559

Rudesindo Núñez-Queija, Bert Zwart, Sem C. Borst

Publication date: 28 June 2006

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

Full work available at URL: https://ir.cwi.nl/pub/13976

zbMATH Keywords

heavy-tailed distributionslarge deviationslight-tailed distributionsbandwidth-sharing networkstail asymtotics

Mathematics Subject Classification ID

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

Related Items (max. 100)

Markov-modulated \(\mathrm{M}/\mathrm{G}/1\)-type queue in heavy traffic and its application to time-sharing disciplines ⋮ Tail behavior of conditional sojourn times in processor-sharing queues ⋮ Sojourn time asymptotics in a parking lot network ⋮ Sojourn time asymptotics in processor sharing queues with varying service rate ⋮ Asymptotic expansions for the conditional sojourn time distribution in the \(M/M/1\)-PS queue ⋮ Asymptotic expansions for the sojourn time distribution in the \(M/G/1\)-PS queue ⋮ A survey on discriminatory processor sharing ⋮ Open problems in queueing theory inspired by datacenter computing ⋮ Delay Analysis of the Max-Weight Policy Under Heavy-Tailed Traffic via Fluid Approximations ⋮ On the sojourn of an arbitrary customer in an M/M/1 Processor Sharing Queue

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reduced load equivalence under subexponentiality
• A large-deviations analysis of the GI/GI/1 SRPT queue
• Processor-sharing queues: Some progress in analysis
• The \(M/G/1\) queue with processor sharing and its relation to a feedback queue
• Mathematical problems in the theory of processor-sharing queueing systems
• The waiting time distribution for the random order service \(M/M/1\) queue
• Insensitive bandwidth sharing in data networks
• The equivalence between processor sharing and service in random order.
• Sojourn time asymptotics in the \(M/G/1\) processor sharing queue
• Sampling at subexponential times, with queueing applications
• Queues with equally heavy sojourn time and service requirement distributions
• On stochastic bounds for monotonic processor sharing networks
• Large deviations of sojourn times in processor sharing queues
• Tail Asymptotics for the Busy Period in the GI/G/1 Queue
• Asymptotic expansions of moments of the waiting time in closed and open processor-sharing systems with multiple job classes
• Heavy-usage asymptotic expansions for the waiting time in closed processor-sharing systems with multiple classes
• The sojourn time in the GI/M/1 queue by processor sharing
• The sojourn-time distribution in the M/G/1 queue by processor sharing
• Response-Time Distribution for a Processor-Sharing System
• Preventing Large Sojourn Times Using SMART Scheduling
• SOJOURN TIME TAILS IN THE M/D/1 PROCESSOR SHARING QUEUE
• Sharing a Processor Among Many Job Classes
• The gi/m/1 processor-sharing queue and its heavy traffic analysis
• Asymptotic properties of supercritical branching processes I: The Galton-Watson process
• Applied Probability and Queues
• Insensitivity in processor-sharing networks
• Tail asymptotics for processor-sharing queues
• Analysis of A time‐shared processor
• Time-shared Systems
• Waiting Time Distributions for Processor-Sharing Systems
• An Analysis of the M/G/1 Queue Under Round-Robin Scheduling
• Large Deviation Analysis of Subexponential Waiting Times in a Processor-Sharing Queue

This page was built for publication: Sojourn time asymptotics in processor-sharing queues