Processor-sharing queues: some progress in analysis
Queueing Systems: Theory and Applications
Queueing systems with service interruptions
Operations Research
A queue with service interruptions in an alternating random environment
Operations Research
The M/G/1 queue with processor sharing and its relation to a feedback queue
Queueing Systems: Theory and Applications
The Fourier-series method for inverting transforms of probability distributions
Queueing Systems: Theory and Applications - Numerical computations in queues
Waiting Time Distributions for Processor-Sharing Systems
Journal of the ACM (JACM)
A single server queue with service interruptions
Queueing Systems: Theory and Applications
Analysis of a single server queue with semi-Markovian service interruption
Queueing Systems: Theory and Applications
Realizing quality of service guarantees in multiservice networks
PMCCN '97 Proceedings of the IFIP TC6 / WG6.3 & WG7.3 International Conference on the Performance and Management of Complex Communication Networks
Sojourn times in non-homogeneous QBD processes with processor sharing
Sojourn times in non-homogeneous QBD processes with processor sharing
Heavy Tails: The Effect of the Service Discipline
TOOLS '02 Proceedings of the 12th International Conference on Computer Performance Evaluation, Modelling Techniques and Tools
The impact of the service discipline on delay asymptotics
Performance Evaluation - Modelling techniques and tools for computer performance evaluation
Sojourn-time approximations for a multi-server processor sharing system with priorities
Performance Evaluation
On performance bounds for the integration of elastic and adaptive streaming flows
Proceedings of the joint international conference on Measurement and modeling of computer systems
Performance Evaluation - Performance 2005
Integration of streaming services and TCP data transmission in the Internet
Performance Evaluation - Performance 2005
A sample path relation for the sojourn times in G/G/1-PS systems and its applications
Queueing Systems: Theory and Applications
On the stability of the multi-queue multi-server processor sharing with limited service
Queueing Systems: Theory and Applications
Processor sharing: A survey of the mathematical theory
Automation and Remote Control
Throughputs in processor sharing models for integrated stream and elastic traffic
Performance Evaluation
Slowdown in the M/M/1 discriminatory processor-sharing queue
Performance Evaluation
Perturbation analysis of an M/M/1 queue in a diffusion random environment
Queueing Systems: Theory and Applications
The preemptive repeat hybrid server interruption model
ASMTA'10 Proceedings of the 17th international conference on Analytical and stochastic modeling techniques and applications
Pricing and distributed QoS control for elastic network traffic
Operations Research Letters
Sojourn times in a processor sharing queue with multiple vacations
Queueing Systems: Theory and Applications
| Hi-index | 0.00 |
We study the sojourn times of customers in an M/M/1 queue with the processor sharing service discipline and a server that is subject to breakdowns. The lengths of the breakdowns have a general distribution, whereas the “on-periods” are exponentially distributed. A branching process approach leads to a decomposition of the sojourn time, in which the components are independent of each other and can be investigated separately. We derive the Laplace–Stieltjes transform of the sojourn-time distribution in steady state, and show that the expected sojourn time is not proportional to the service requirement. In the heavy-traffic limit, the sojourn time conditioned on the service requirement and scaled by the traffic load is shown to be exponentially distributed. The results can be used for the performance analysis of elastic traffic in communication networks, in particular, the ABR service class in ATM networks, and best-effort services in IP networks.