A reliable statistical admission control strategy for interactive video-on-demand servers with interval caching

Sun Euy Kim, Chitaranjan Das

Research output: Chapter in Book/Report/Conference proceedingChapter

5 Citations (Scopus)

Abstract

An admission control algorithm is a key component of a video server that supports quality of service (QoS). Such an algorithm determines whether or not a new request can be admitted to the server without compromising the required performance of the in-service users. All prior admission control policies for video servers have focussed on improving the underlying storage system utilization such that a VOD server can accept more requests while satisfying the QoS requirements. In this paper, we examine admission control for an interactive video server that uses a resource sharing mechanism, called interval caching. The primary motivation of this work is to develop an efficient admission policy to optimize the server throughput with acceptable QoS. We analyze four admission control algorithms, called deterministic, predictive, statistical average, and reliable statistical admission control (RSAC), for an interactive video server and find that the proposed RSAC scheme is quite efficient compared to the other three schemes in terms of throughput and jitter. The RSAC policy attempts to optimize the disk and cache utilization while reserving a certain amount of disk bandwidth for streams that are evicted from the cache, and are likely to cause jitter due to unavailable disk space. We estimate this reserved disk bandwidth as a function of the average number of cached steams, which in turn indicates improvement in server capacity with interval caching. The average number of cached streams and the subsequent reserved bandwidth are computed wing a simple, yet accurate mathematical model. Extensive performance evaluation indicates that the RSAC is an attractive scheme for an interactive or non-interactive video server and can be implemented with other performance enhancement techniques.

Original languageEnglish (US)
Title of host publicationProceedings of the International Conference on Parallel Processing
Pages135-142
Number of pages8
ISBN (Electronic)0769507689
DOIs
StatePublished - Jan 1 2000

Fingerprint

Video on Demand
Video on demand
Admission Control
Caching
Access control
Video Server
Control Strategy
Servers
Server
Interval
Quality of Service
Bandwidth
Quality of service
Jitter
Control Policy
Cache
Control Algorithm
Throughput
Optimise
Resource Sharing

All Science Journal Classification (ASJC) codes

  • Software
  • Mathematics(all)
  • Hardware and Architecture

Cite this

Kim, S. E., & Das, C. (2000). A reliable statistical admission control strategy for interactive video-on-demand servers with interval caching. In Proceedings of the International Conference on Parallel Processing (pp. 135-142). [876097] https://doi.org/10.1109/ICPP.2000.876097
Kim, Sun Euy ; Das, Chitaranjan. / A reliable statistical admission control strategy for interactive video-on-demand servers with interval caching. Proceedings of the International Conference on Parallel Processing. 2000. pp. 135-142
@inbook{05a3e95608c2485aa035f9cd7ee37fc0,
title = "A reliable statistical admission control strategy for interactive video-on-demand servers with interval caching",
abstract = "An admission control algorithm is a key component of a video server that supports quality of service (QoS). Such an algorithm determines whether or not a new request can be admitted to the server without compromising the required performance of the in-service users. All prior admission control policies for video servers have focussed on improving the underlying storage system utilization such that a VOD server can accept more requests while satisfying the QoS requirements. In this paper, we examine admission control for an interactive video server that uses a resource sharing mechanism, called interval caching. The primary motivation of this work is to develop an efficient admission policy to optimize the server throughput with acceptable QoS. We analyze four admission control algorithms, called deterministic, predictive, statistical average, and reliable statistical admission control (RSAC), for an interactive video server and find that the proposed RSAC scheme is quite efficient compared to the other three schemes in terms of throughput and jitter. The RSAC policy attempts to optimize the disk and cache utilization while reserving a certain amount of disk bandwidth for streams that are evicted from the cache, and are likely to cause jitter due to unavailable disk space. We estimate this reserved disk bandwidth as a function of the average number of cached steams, which in turn indicates improvement in server capacity with interval caching. The average number of cached streams and the subsequent reserved bandwidth are computed wing a simple, yet accurate mathematical model. Extensive performance evaluation indicates that the RSAC is an attractive scheme for an interactive or non-interactive video server and can be implemented with other performance enhancement techniques.",
author = "Kim, {Sun Euy} and Chitaranjan Das",
year = "2000",
month = "1",
day = "1",
doi = "10.1109/ICPP.2000.876097",
language = "English (US)",
pages = "135--142",
booktitle = "Proceedings of the International Conference on Parallel Processing",

}

Kim, SE & Das, C 2000, A reliable statistical admission control strategy for interactive video-on-demand servers with interval caching. in Proceedings of the International Conference on Parallel Processing., 876097, pp. 135-142. https://doi.org/10.1109/ICPP.2000.876097

A reliable statistical admission control strategy for interactive video-on-demand servers with interval caching. / Kim, Sun Euy; Das, Chitaranjan.

Proceedings of the International Conference on Parallel Processing. 2000. p. 135-142 876097.

Research output: Chapter in Book/Report/Conference proceedingChapter

TY - CHAP

T1 - A reliable statistical admission control strategy for interactive video-on-demand servers with interval caching

AU - Kim, Sun Euy

AU - Das, Chitaranjan

PY - 2000/1/1

Y1 - 2000/1/1

N2 - An admission control algorithm is a key component of a video server that supports quality of service (QoS). Such an algorithm determines whether or not a new request can be admitted to the server without compromising the required performance of the in-service users. All prior admission control policies for video servers have focussed on improving the underlying storage system utilization such that a VOD server can accept more requests while satisfying the QoS requirements. In this paper, we examine admission control for an interactive video server that uses a resource sharing mechanism, called interval caching. The primary motivation of this work is to develop an efficient admission policy to optimize the server throughput with acceptable QoS. We analyze four admission control algorithms, called deterministic, predictive, statistical average, and reliable statistical admission control (RSAC), for an interactive video server and find that the proposed RSAC scheme is quite efficient compared to the other three schemes in terms of throughput and jitter. The RSAC policy attempts to optimize the disk and cache utilization while reserving a certain amount of disk bandwidth for streams that are evicted from the cache, and are likely to cause jitter due to unavailable disk space. We estimate this reserved disk bandwidth as a function of the average number of cached steams, which in turn indicates improvement in server capacity with interval caching. The average number of cached streams and the subsequent reserved bandwidth are computed wing a simple, yet accurate mathematical model. Extensive performance evaluation indicates that the RSAC is an attractive scheme for an interactive or non-interactive video server and can be implemented with other performance enhancement techniques.

AB - An admission control algorithm is a key component of a video server that supports quality of service (QoS). Such an algorithm determines whether or not a new request can be admitted to the server without compromising the required performance of the in-service users. All prior admission control policies for video servers have focussed on improving the underlying storage system utilization such that a VOD server can accept more requests while satisfying the QoS requirements. In this paper, we examine admission control for an interactive video server that uses a resource sharing mechanism, called interval caching. The primary motivation of this work is to develop an efficient admission policy to optimize the server throughput with acceptable QoS. We analyze four admission control algorithms, called deterministic, predictive, statistical average, and reliable statistical admission control (RSAC), for an interactive video server and find that the proposed RSAC scheme is quite efficient compared to the other three schemes in terms of throughput and jitter. The RSAC policy attempts to optimize the disk and cache utilization while reserving a certain amount of disk bandwidth for streams that are evicted from the cache, and are likely to cause jitter due to unavailable disk space. We estimate this reserved disk bandwidth as a function of the average number of cached steams, which in turn indicates improvement in server capacity with interval caching. The average number of cached streams and the subsequent reserved bandwidth are computed wing a simple, yet accurate mathematical model. Extensive performance evaluation indicates that the RSAC is an attractive scheme for an interactive or non-interactive video server and can be implemented with other performance enhancement techniques.

UR - http://www.scopus.com/inward/record.url?scp=2342554446&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=2342554446&partnerID=8YFLogxK

U2 - 10.1109/ICPP.2000.876097

DO - 10.1109/ICPP.2000.876097

M3 - Chapter

AN - SCOPUS:2342554446

SP - 135

EP - 142

BT - Proceedings of the International Conference on Parallel Processing

ER -

Kim SE, Das C. A reliable statistical admission control strategy for interactive video-on-demand servers with interval caching. In Proceedings of the International Conference on Parallel Processing. 2000. p. 135-142. 876097 https://doi.org/10.1109/ICPP.2000.876097