Approximate sojourn time distribution of a discriminatory processor sharing queue with impatient customers
type: Item
instance of: scholarly article
title: Approximate sojourn time distribution of a discriminatory processor sharing queue with impatient customers
zbMATH Open document ID: 1403.90242
author: Sunggon Kim
published in: Mathematical Methods of Operations Research
publication date: 2018-07-13T00:00:00Z
Mathematics Subject Classification ID: 90B22
Mathematics Subject Classification ID: 60G15
zbMATH DE Number: 6903638
zbMATH Keywords: discriminatory processor sharing
zbMATH Keywords: impatient customers
zbMATH Keywords: sojourn time distribution
zbMATH Keywords: time scale decomposition method
describes a project that uses: invLT
MaRDI profile type: Publication
full work available at URL: s00186-017-0623-z
OpenAlex ID: W2768274186
cites work: Discriminatory processor sharing queues with stationary ergodic service times and the performance of TCP in overload
cites work: A survey on discriminatory processor sharing
cites work: A decomposition theorem and related results for the discriminatory processor sharing queue
cites work: Congestion at flow level and the impact of user behaviour.
cites work: Processor-shared buffers with reneging
cites work: Laplace transform inversions using optimal contours in the complex plane
cites work: Sharing a Processor Among Many Job Classes
cites work: Tail asymptotics for processor-sharing queues
cites work: Q3611747
cites work: The Differential Equations of Birth-and-Death Processes, and the Stieltjes Moment Problem
cites work: Approximate queue length distribution of a discriminatory processor sharing queue with impatient customers
cites work: Time-shared Systems
cites work: Some Properties of Continued Fractions with Applications in Markov Processes
cites work: Direct Solutions of M/G/1 Processor-Sharing Models
cites work: Q3713599
DOI: 10.1007/S00186-017-0623-Z
description: scientific article; zbMATH DE number 6903638