Loading…
Grand scale scheduling for admission control
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 s...
Saved in:
Main Authors: | , |
---|---|
Format: | Conference Proceeding |
Language: | English |
Subjects: | |
Online Access: | Request full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
cited_by | |
---|---|
cites | |
container_end_page | 666 |
container_issue | |
container_start_page | 663 |
container_title | |
container_volume | |
creator | Wai-Kong Cheuk Daniel Pak-Kong Lun |
description | 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. |
doi_str_mv | 10.1109/ISIMP.2004.1434151 |
format | conference_proceeding |
fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_1434151</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1434151</ieee_id><sourcerecordid>1434151</sourcerecordid><originalsourceid>FETCH-LOGICAL-i105t-64c28e08bfc90b5e1e4eed05453557fdc2cec752e7002236f361ae69c2665afe3</originalsourceid><addsrcrecordid>eNotj81KAzEUhQMiKHVeQDfzAM5483OTzFKK1oEWhdZ1SZMbjUxnJKkL394Bezh8Z_fBYeyWQ8s5dA_9tt-8tQJAtVxJxZFfsKozFuZKq60xV6wq5QvmyA4Vl9fsfpXdGOri3UAzPyn8DGn8qOOUaxeOqZQ0jbWfxlOehht2Gd1QqDrvgr0_P-2WL836ddUvH9dN4oCnRisvLIE9RN_BAYmTIgqACiWiicELT96gIAMghNRRau5Id15ojS6SXLC7f28iov13TkeXf_fnT_IPhEBBYw</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Grand scale scheduling for admission control</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Wai-Kong Cheuk ; Daniel Pak-Kong Lun</creator><creatorcontrib>Wai-Kong Cheuk ; Daniel Pak-Kong Lun</creatorcontrib><description>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.</description><identifier>ISBN: 9780780386877</identifier><identifier>ISBN: 0780386876</identifier><identifier>DOI: 10.1109/ISIMP.2004.1434151</identifier><language>eng</language><publisher>IEEE</publisher><subject>Admission control ; Aggregates ; Bandwidth ; Network servers ; Quality management ; Quality of service ; Resource management ; Signal processing ; Streaming media ; Utility programs</subject><ispartof>Proceedings of 2004 International Symposium on Intelligent Multimedia, Video and Speech Processing, 2004, 2004, p.663-666</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/1434151$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,2052,4036,4037,27904,54898</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/1434151$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Wai-Kong Cheuk</creatorcontrib><creatorcontrib>Daniel Pak-Kong Lun</creatorcontrib><title>Grand scale scheduling for admission control</title><title>Proceedings of 2004 International Symposium on Intelligent Multimedia, Video and Speech Processing, 2004</title><addtitle>ISIMP</addtitle><description>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.</description><subject>Admission control</subject><subject>Aggregates</subject><subject>Bandwidth</subject><subject>Network servers</subject><subject>Quality management</subject><subject>Quality of service</subject><subject>Resource management</subject><subject>Signal processing</subject><subject>Streaming media</subject><subject>Utility programs</subject><isbn>9780780386877</isbn><isbn>0780386876</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2004</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNotj81KAzEUhQMiKHVeQDfzAM5483OTzFKK1oEWhdZ1SZMbjUxnJKkL394Bezh8Z_fBYeyWQ8s5dA_9tt-8tQJAtVxJxZFfsKozFuZKq60xV6wq5QvmyA4Vl9fsfpXdGOri3UAzPyn8DGn8qOOUaxeOqZQ0jbWfxlOehht2Gd1QqDrvgr0_P-2WL836ddUvH9dN4oCnRisvLIE9RN_BAYmTIgqACiWiicELT96gIAMghNRRau5Id15ojS6SXLC7f28iov13TkeXf_fnT_IPhEBBYw</recordid><startdate>2004</startdate><enddate>2004</enddate><creator>Wai-Kong Cheuk</creator><creator>Daniel Pak-Kong Lun</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>2004</creationdate><title>Grand scale scheduling for admission control</title><author>Wai-Kong Cheuk ; Daniel Pak-Kong Lun</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i105t-64c28e08bfc90b5e1e4eed05453557fdc2cec752e7002236f361ae69c2665afe3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2004</creationdate><topic>Admission control</topic><topic>Aggregates</topic><topic>Bandwidth</topic><topic>Network servers</topic><topic>Quality management</topic><topic>Quality of service</topic><topic>Resource management</topic><topic>Signal processing</topic><topic>Streaming media</topic><topic>Utility programs</topic><toplevel>online_resources</toplevel><creatorcontrib>Wai-Kong Cheuk</creatorcontrib><creatorcontrib>Daniel Pak-Kong Lun</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Xplore</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Wai-Kong Cheuk</au><au>Daniel Pak-Kong Lun</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Grand scale scheduling for admission control</atitle><btitle>Proceedings of 2004 International Symposium on Intelligent Multimedia, Video and Speech Processing, 2004</btitle><stitle>ISIMP</stitle><date>2004</date><risdate>2004</risdate><spage>663</spage><epage>666</epage><pages>663-666</pages><isbn>9780780386877</isbn><isbn>0780386876</isbn><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.</abstract><pub>IEEE</pub><doi>10.1109/ISIMP.2004.1434151</doi><tpages>4</tpages></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | ISBN: 9780780386877 |
ispartof | Proceedings of 2004 International Symposium on Intelligent Multimedia, Video and Speech Processing, 2004, 2004, p.663-666 |
issn | |
language | eng |
recordid | cdi_ieee_primary_1434151 |
source | IEEE Electronic Library (IEL) Conference Proceedings |
subjects | Admission control Aggregates Bandwidth Network servers Quality management Quality of service Resource management Signal processing Streaming media Utility programs |
title | Grand scale scheduling for admission control |
url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-27T12%3A59%3A01IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Grand%20scale%20scheduling%20for%20admission%20control&rft.btitle=Proceedings%20of%202004%20International%20Symposium%20on%20Intelligent%20Multimedia,%20Video%20and%20Speech%20Processing,%202004&rft.au=Wai-Kong%20Cheuk&rft.date=2004&rft.spage=663&rft.epage=666&rft.pages=663-666&rft.isbn=9780780386877&rft.isbn_list=0780386876&rft_id=info:doi/10.1109/ISIMP.2004.1434151&rft_dat=%3Cieee_6IE%3E1434151%3C/ieee_6IE%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-i105t-64c28e08bfc90b5e1e4eed05453557fdc2cec752e7002236f361ae69c2665afe3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=1434151&rfr_iscdi=true |