{"title":"Information Freshness and System Performance Trading-off","authors":"Fatima Khattab Abu-Akleek, A. Alma'aitah","doi":"10.1109/ICICS52457.2021.9464535","DOIUrl":null,"url":null,"abstract":"In real time service’s applications that have to process user’s queries and information updates have a challenge in balancing the system performance and the information freshness where these properties are related by the response time and Age-of-Information (AOI) respectively. Such applications are fed with periodic incoming of updates and queries and have to decide to which process first. In this paper we are discussing this challenge and provide a simple algorithm for trading-off the response time and AOI. We first discuss the Query-k, Update-k and Joint(M,N) policies that already proposed in previous work then we introduce a simple algorithm for the Joint(M,N)-policy. The algorithm is working based on the output of Query-k and Update-k policies in addition to predefined threshold. Results presents the efficient balancing between response time and AOI.","PeriodicalId":421803,"journal":{"name":"2021 12th International Conference on Information and Communication Systems (ICICS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 12th International Conference on Information and Communication Systems (ICICS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICICS52457.2021.9464535","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
In real time service’s applications that have to process user’s queries and information updates have a challenge in balancing the system performance and the information freshness where these properties are related by the response time and Age-of-Information (AOI) respectively. Such applications are fed with periodic incoming of updates and queries and have to decide to which process first. In this paper we are discussing this challenge and provide a simple algorithm for trading-off the response time and AOI. We first discuss the Query-k, Update-k and Joint(M,N) policies that already proposed in previous work then we introduce a simple algorithm for the Joint(M,N)-policy. The algorithm is working based on the output of Query-k and Update-k policies in addition to predefined threshold. Results presents the efficient balancing between response time and AOI.