{"title":"Multi-criteria Content Adaptation Service Selection Broker","authors":"M. F. M. Fudzee, J. Abawajy, M. M. Deris","doi":"10.1109/CCGRID.2010.128","DOIUrl":null,"url":null,"abstract":"In this paper, we propose a service-oriented content adaptation framework and an approach to the Content Adaptation Service Selection (CASS) problem. In particular, the problem is how to assign adaptation tasks (e.g., transcoding, video summarization, etc) together with respective content segments to appropriate adaptation services. Current systems tend to be mostly centralized suffering from single point failures. The proposed algorithm consists of a greedy and single objective assignment function that is constructed on top of an adaptation path tree. The performance of the proposed service selection framework is studied in terms of efficiency of service selection execution under various conditions. The results indicate that the proposed policy performs substantially better than the baseline approach.","PeriodicalId":444485,"journal":{"name":"2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing","volume":"26 4","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCGRID.2010.128","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 14
Abstract
In this paper, we propose a service-oriented content adaptation framework and an approach to the Content Adaptation Service Selection (CASS) problem. In particular, the problem is how to assign adaptation tasks (e.g., transcoding, video summarization, etc) together with respective content segments to appropriate adaptation services. Current systems tend to be mostly centralized suffering from single point failures. The proposed algorithm consists of a greedy and single objective assignment function that is constructed on top of an adaptation path tree. The performance of the proposed service selection framework is studied in terms of efficiency of service selection execution under various conditions. The results indicate that the proposed policy performs substantially better than the baseline approach.