Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/11270
Title: Prioritized admission strategies to improve user-perceived performance in interactive VOD servers
Authors: Hamidzadeh, B
To, TPJ
Issue Date: 2001
Publisher: Kluwer Academic Publ
Source: Multimedia tools and applications, 2001, v. 13, no. 1, p. 5-34 How to cite?
Journal: Multimedia Tools and Applications 
Abstract: In the past, much emphasis has been given to the data throughput of VOD servers. In Interactive Video-on-Demand (IVOD) applications, such as digital libraries, service availability and response times are more visible to the user than the underlying data throughput. Data throughput is a measure of how efficiently resources are utilized. Higher throughput may be achieved at the expense of deteriorated user-perceived performance metrics such as probability of admission and queuing delay prior to admission. In this paper, we propose and evaluate a number of strategies to sequence the admission of pending video requests. Under different request arrival rates and buffer capacities, we measure the probability of admission, queuing delay and data throughput of each strategy. Results of our experiments show that simple hybrid strategies can improve the number of admitted requests and reduce the queuing time, without jeopardizing the data throughput. The techniques we propose are independent of the underlying disk scheduling techniques used. So, they can be employed to improve the user-perceived performance of VOD servers, in general.
URI: http://hdl.handle.net/10397/11270
ISSN: 1380-7501
DOI: 10.1023/A:1009610406858
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

3
Last Week
0
Last month
0
Citations as of Apr 28, 2017

WEB OF SCIENCETM
Citations

2
Last Week
0
Last month
0
Citations as of Apr 27, 2017

Page view(s)

25
Last Week
5
Last month
Checked on Apr 23, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.