{"title":"On-Demand Real-Time Information Dissemination: A General Approach with Fairness, Productivity and Urgency","authors":"Chih-Lin Hu","doi":"10.1109/AINA.2007.102","DOIUrl":null,"url":null,"abstract":"Modern real-time information dissemination services generate data dynamically and process data requests on demand. Such data or requests are usually valid or useful subject to temporal conditions. This paper devises an efficient on-demand time-critical data broadcast scheme by considering request urgency, service productivity and access fairness, to maintain quality of service and performance. The experimental studies show the proposed scheduling approach is able to achieve low request deadline miss rate and mean access time simultaneously. Its performance is superior to classical EDF and MRF and further better than SIN-k and RxW methods by simply tuning parameters.","PeriodicalId":361109,"journal":{"name":"21st International Conference on Advanced Information Networking and Applications (AINA '07)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"21st International Conference on Advanced Information Networking and Applications (AINA '07)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AINA.2007.102","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10
Abstract
Modern real-time information dissemination services generate data dynamically and process data requests on demand. Such data or requests are usually valid or useful subject to temporal conditions. This paper devises an efficient on-demand time-critical data broadcast scheme by considering request urgency, service productivity and access fairness, to maintain quality of service and performance. The experimental studies show the proposed scheduling approach is able to achieve low request deadline miss rate and mean access time simultaneously. Its performance is superior to classical EDF and MRF and further better than SIN-k and RxW methods by simply tuning parameters.