Please use this identifier to cite or link to this item:
Title: Grand scale scheduling for admission control
Authors: Cheuk, WK
Lun, DPK 
Keywords: Bandwidth allocation
Quality of service
Resource allocation
Telecommunication congestion control
Video servers
Video streaming
Issue Date: 2004
Source: Proceedings of the International Symposium on Intelligent Multimedia, Video and Speech Processing (ISIMP’2004), Hong Kong, 20-22 Oct. 2004, p. 663-666 How to cite?
Abstract: Admission control and resource scheduling govern and manage the usage of resource within a video streaming proxy server coping to strive for a better quality of service. Such resources include network bandwidth, disk bandwidth, processing power and memory. Inside the proxy server, these usages are scheduled during admission control upon new request acceptance. Scheduling schemes such as constant-data-length (CDL) and constant-time-length (CTL) seeking to improve these resources' utilization have been proposed. However they focused mainly on an individual requirement alone and this leads to inefficiency. In this paper, through an analysis of the relationship of resource utilization between individual schedules and their aggregate, we can determine the worst case requirements. Based on this relationship, we propose the grand scale scheduling which can provide a substantial utilization improvement.
ISBN: 0-7803-8687-6
DOI: 10.1109/ISIMP.2004.1434151
Appears in Collections:Conference Paper

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

Page view(s)

Last Week
Last month
Citations as of Jul 10, 2018

Google ScholarTM



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