Exact Sojourn Time Distribution in an Online IPTV Recording System

Authors:
Tobias Hoßfeld;Kenji Leibnitz;Marie-Ange Remiche
Affiliations:
Institute of Computer Science, University of Würzburg, Würzburg, Germany 97074;Graduate School of Information Science and Technology, Osaka University, Suita, Japan 565-0871;CoDE/SMG, CP 165/15, Université Libre de Bruxelles, Bruxelles, Belgium B-1050
Venue:
ASMTA '08 Proceedings of the 15th international conference on Analytical and Stochastic Modeling Techniques and Applications
Year:
2008

Citing 5
Cited 0

On the M(n)/M(n)/s queue with impatient calls

Performance Evaluation
Sojourn Times in the M/PH/1 Processor Sharing Queue

Queueing Systems: Theory and Applications
The impact of reneging in processor sharing queues

SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
Modeling of an online TV recording service

ACM SIGMETRICS Performance Evaluation Review
Sojourn time distribution in a MAP/M/1 processor-sharing queue

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we analytically derive the sojourn time of a user accessing an online IPTV recording service. Basically, the system consists of a server (or server farm) and the bandwidth at which a user can download recorded files depends on the number of other concurrently downloading users. In particular, we consider both cases, one in which the user's download speed is limited by his own access bandwidth, whereas in the other case the server is the bottleneck and all downloading users share the server's upload capacity. Our model includes user impatience which depends on the actual download speed. A user may abort his download attempt if a threshold duration is exceeded. The file size distribution is obtained by measurements of offered files at an existing server.