File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: A unified analysis of hot video schedulers

TitleA unified analysis of hot video schedulers
Authors
Issue Date2002
Citation
Conference Proceedings Of The Annual Acm Symposium On Theory Of Computing, 2002, p. 179-188 How to Cite?
AbstractIn this paper we consider the notion of relative competitive analysis, which is a simple generalization of the conventional competitive analysis and extra-resource analysis for on-line algorithms. We apply this analysis to study on-line schedulers for stream merging in two different video-on-demand (VOD) systems, which are based on two common approaches, namely, piggybacking and skimming. Our new analysis, in its simplest form, reveals a 3-competitive algorithm for stream merging based on skimming as well as piggybacking. This improves all previous results [4, 8]. We also show how to obtain guarantee on the performance improvement based on adding extra resources, and more interestingly, we provide a unified methodology to compare piggybacking and skimming. We believe that our result gives a clue to system designers for choosing desirable configurations.
Persistent Identifierhttp://hdl.handle.net/10722/93127
ISSN
References

 

DC FieldValueLanguage
dc.contributor.authorChan, WTen_HK
dc.contributor.authorLam, TWen_HK
dc.contributor.authorTing, HFen_HK
dc.contributor.authorWong, WHen_HK
dc.date.accessioned2010-09-25T14:51:42Z-
dc.date.available2010-09-25T14:51:42Z-
dc.date.issued2002en_HK
dc.identifier.citationConference Proceedings Of The Annual Acm Symposium On Theory Of Computing, 2002, p. 179-188en_HK
dc.identifier.issn0734-9025en_HK
dc.identifier.urihttp://hdl.handle.net/10722/93127-
dc.description.abstractIn this paper we consider the notion of relative competitive analysis, which is a simple generalization of the conventional competitive analysis and extra-resource analysis for on-line algorithms. We apply this analysis to study on-line schedulers for stream merging in two different video-on-demand (VOD) systems, which are based on two common approaches, namely, piggybacking and skimming. Our new analysis, in its simplest form, reveals a 3-competitive algorithm for stream merging based on skimming as well as piggybacking. This improves all previous results [4, 8]. We also show how to obtain guarantee on the performance improvement based on adding extra resources, and more interestingly, we provide a unified methodology to compare piggybacking and skimming. We believe that our result gives a clue to system designers for choosing desirable configurations.en_HK
dc.languageengen_HK
dc.relation.ispartofConference Proceedings of the Annual ACM Symposium on Theory of Computingen_HK
dc.titleA unified analysis of hot video schedulersen_HK
dc.typeConference_Paperen_HK
dc.identifier.emailLam, TW:twlam@cs.hku.hken_HK
dc.identifier.emailTing, HF:hfting@cs.hku.hken_HK
dc.identifier.authorityLam, TW=rp00135en_HK
dc.identifier.authorityTing, HF=rp00177en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.scopuseid_2-s2.0-0036040196en_HK
dc.identifier.hkuros69430en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-0036040196&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.spage179en_HK
dc.identifier.epage188en_HK
dc.identifier.scopusauthoridChan, WT=7403918060en_HK
dc.identifier.scopusauthoridLam, TW=7202523165en_HK
dc.identifier.scopusauthoridTing, HF=7005654198en_HK
dc.identifier.scopusauthoridWong, WH=36847932900en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats