Batch processor sharing with hyper-exponential service time

Authors:
Natalia Osipova
Affiliations:
INRIA Sophia Antipolis, France
Venue:
Operations Research Letters
Year:
2008

Citing 6
Cited 1

Fitting mixtures of exponentials to long-tail distributions to analyze network performance models

Performance Evaluation
Sharing a Processor Among Many Job Classes

Journal of the ACM (JACM)
The M/G/1 Processor-Sharing Queue with Bulk Arrivals

Proceedings of the IFIP TC6 Task Group/WG6.4 International Workshop on Performance of Communication Systems: Modelling and Performance Evaluation of ATM Technology
Batch Arrival Processor-Sharing with Application to Multi-Level Processor-Sharing Scheduling

Queueing Systems: Theory and Applications
A stochastic model for the throughput of non-persistent TCP flows

valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
Analysis of the M/G/1 processor-sharing queue with bulk arrivals

Operations Research Letters

Sojourn times in a processor sharing queue with multiple vacations

Queueing Systems: Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the Processor Sharing queueing model with a hyper-exponential service time distribution and Poisson batch arrival process. In the case of the hyper-exponential service time distribution we find an analytical expression for the expected conditional response time function and obtain an alternative proof of its concavity with respect to the service time.