Sojourn time distribution in a MAP/M/1 processor-sharing queue

Authors:
Hiroyuki Masuyama;Tetsuya Takine
Affiliations:
Department of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University, Kyoto 606-8501, Japan;Department of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University, Kyoto 606-8501, Japan
Venue:
Operations Research Letters
Year:
2003

Citing 4
Cited 6

Computing Poisson probabilities

Communications of the ACM
Waiting Time Distributions for Processor-Sharing Systems

Journal of the ACM (JACM)
Analysis of the M/M/1 Queue with Processor Sharing via Spectral Theory

Queueing Systems: Theory and Applications
The equivalence between processor sharing and service in random order

Operations Research Letters

Sojourn time distribution in the M/M/1 queue with discriminatory processor-sharing

Performance Evaluation
Fluid and diffusion limits for transient sojourn times of processor sharing queues with time varying rates

Queueing Systems: Theory and Applications
The processor-sharing queue with bulk arrivals and phase-type services

Performance Evaluation
Processor sharing: A survey of the mathematical theory

Automation and Remote Control
The M/G/1 processor-sharing queue with disasters

Computers & Mathematics with Applications
Exact Sojourn Time Distribution in an Online IPTV Recording System

ASMTA '08 Proceedings of the 15th international conference on Analytical and Stochastic Modeling Techniques and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper considers the sojourn time distribution in a processor-sharing queue with a Markovian arrival process and exponential service times. We show a recursive formula to compute the complementary distribution of the sojourn time in steady state. The formula is simple and numerically feasible, and enables us to control the absolute error in numerical results. Further, we discuss the impact of the arrival process on the sojourn time distribution through some numerical examples.