{"title":"Service aggregation through rate adaptation using a single storage format","authors":"Rajesh Krishnan, Thomas D. C. Little","doi":"10.1109/NOSDAV.1997.629386","DOIUrl":null,"url":null,"abstract":"Service aggregation schemes like batching, caching and rate adaptation can enable large scale interactive multimedia services, such as movies-on-demand and popular television programming. These applications are characterized by a large user population and a high density of access. Rate adaptation is a dynamic service aggregation technique that can merge streams and reclaim resources at run-time. Existing schemes for rate adaptation are expensive since they require multiple content storage formats or special hardware, therefore, this technique has not been exploited so far. We propose a novel data placement and disk scheduling strategy which supports two different content progression rates originating from a single storage format, and that is applicable to single-disk architectures as well as to multi-disk architectures with large or small stripe-sets. The proposal leads to a feasible solution for dynamic service aggregation via rate adaptation, thereby making large scale multimedia services more economical.","PeriodicalId":401407,"journal":{"name":"Proceedings of 7th International Workshop on Network and Operating System Support for Digital Audio and Video (NOSSDAV '97)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1997-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of 7th International Workshop on Network and Operating System Support for Digital Audio and Video (NOSSDAV '97)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NOSDAV.1997.629386","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6
Abstract
Service aggregation schemes like batching, caching and rate adaptation can enable large scale interactive multimedia services, such as movies-on-demand and popular television programming. These applications are characterized by a large user population and a high density of access. Rate adaptation is a dynamic service aggregation technique that can merge streams and reclaim resources at run-time. Existing schemes for rate adaptation are expensive since they require multiple content storage formats or special hardware, therefore, this technique has not been exploited so far. We propose a novel data placement and disk scheduling strategy which supports two different content progression rates originating from a single storage format, and that is applicable to single-disk architectures as well as to multi-disk architectures with large or small stripe-sets. The proposal leads to a feasible solution for dynamic service aggregation via rate adaptation, thereby making large scale multimedia services more economical.