Pub Date : 2018-02-01DOI: 10.1016/j.peva.2017.09.008
N. Dijk, S. V. Brummelen, R. Boucherie
{"title":"Uniformization: Basics, extensions and applications","authors":"N. Dijk, S. V. Brummelen, R. Boucherie","doi":"10.1016/j.peva.2017.09.008","DOIUrl":"https://doi.org/10.1016/j.peva.2017.09.008","url":null,"abstract":"","PeriodicalId":19766,"journal":{"name":"Perform. Evaluation","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76740717","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2017-08-01DOI: 10.4108/eai.25-10-2016.2266632
Vaggelis G. Douros, S. Elayoubi, E. Altman, Y. Hayel
We consider a scenario where an Internet Service Provider (ISP) serves users that choose digital content among M Content Providers (CP). In the status quo, these users pay both access fees to the ISP and content fees to each chosen CP; however, neither the ISP nor the CPs share their profit. We revisit this model by introducing a different business model where the ISP and the CP may have motivation to collaborate in the framework of caching. The key idea is that the ISP deploys a cache for a CP provided that they share both the deployment cost and the additional profit that arises due to caching. Under the prism of coalitional games, our contributions include the application of the Shap-ley value for a fair splitting of the profit, the stability analysis of the coalition and the derivation of closed-form formulas for the optimal caching policy. Our model captures not only the case of non-overlapping contents among the CPs, but also the more challenging case of overlapping contents; for the latter case, a non-cooperative game among the CPs is introduced and analyzed to capture the negative externality on the demand of a particular CP when caches for other CPs are deployed.
{"title":"Caching games between Content Providers and Internet Service Providers","authors":"Vaggelis G. Douros, S. Elayoubi, E. Altman, Y. Hayel","doi":"10.4108/eai.25-10-2016.2266632","DOIUrl":"https://doi.org/10.4108/eai.25-10-2016.2266632","url":null,"abstract":"We consider a scenario where an Internet Service Provider (ISP) serves users that choose digital content among M Content Providers (CP). In the status quo, these users pay both access fees to the ISP and content fees to each chosen CP; however, neither the ISP nor the CPs share their profit. We revisit this model by introducing a different business model where the ISP and the CP may have motivation to collaborate in the framework of caching. The key idea is that the ISP deploys a cache for a CP provided that they share both the deployment cost and the additional profit that arises due to caching. Under the prism of coalitional games, our contributions include the application of the Shap-ley value for a fair splitting of the profit, the stability analysis of the coalition and the derivation of closed-form formulas for the optimal caching policy. Our model captures not only the case of non-overlapping contents among the CPs, but also the more challenging case of overlapping contents; for the latter case, a non-cooperative game among the CPs is introduced and analyzed to capture the negative externality on the demand of a particular CP when caches for other CPs are deployed.","PeriodicalId":19766,"journal":{"name":"Perform. Evaluation","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82997825","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-04-01DOI: 10.1016/j.peva.2015.12.001
A. Khlass, T. Bonald, S. Elayoubi
{"title":"Performance evaluation of intra-site coordination schemes in cellular networks","authors":"A. Khlass, T. Bonald, S. Elayoubi","doi":"10.1016/j.peva.2015.12.001","DOIUrl":"https://doi.org/10.1016/j.peva.2015.12.001","url":null,"abstract":"","PeriodicalId":19766,"journal":{"name":"Perform. Evaluation","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74321388","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-02-01DOI: 10.1016/j.peva.2015.12.003
Thomas Begin, B. Baynat, I. G. Lassous, Thiago Abreu
{"title":"Performance analysis of multi-hop flows in IEEE 802.11 networks: A flexible and accurate modeling framework","authors":"Thomas Begin, B. Baynat, I. G. Lassous, Thiago Abreu","doi":"10.1016/j.peva.2015.12.003","DOIUrl":"https://doi.org/10.1016/j.peva.2015.12.003","url":null,"abstract":"","PeriodicalId":19766,"journal":{"name":"Perform. Evaluation","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82142285","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2015-01-22DOI: 10.1016/j.peva.2016.02.001
Murtuza Ali Abidini, O. Boxma, J. Resing
{"title":"Analysis and optimization of vacation and polling models with retrials","authors":"Murtuza Ali Abidini, O. Boxma, J. Resing","doi":"10.1016/j.peva.2016.02.001","DOIUrl":"https://doi.org/10.1016/j.peva.2016.02.001","url":null,"abstract":"","PeriodicalId":19766,"journal":{"name":"Perform. Evaluation","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80592073","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-07-23DOI: 10.1016/j.peva.2015.01.001.
Thomas M. M. Meyfroyt, S. Borst, O. Boxma, D. Denteneer
{"title":"A data propagation model for wireless gossiping","authors":"Thomas M. M. Meyfroyt, S. Borst, O. Boxma, D. Denteneer","doi":"10.1016/j.peva.2015.01.001.","DOIUrl":"https://doi.org/10.1016/j.peva.2015.01.001.","url":null,"abstract":"","PeriodicalId":19766,"journal":{"name":"Perform. Evaluation","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73621810","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
MapReduce is a scalable parallel computing framework for big data processing. It exhibits multiple processing phases, and thus an efficient job scheduling mechanism is crucial for ensuring efficient resource utilization. This work studies the scheduling challenge that results from the overlapping of the "map" and "shuffle" phases in MapReduce. We propose a new, general model for this scheduling problem. Further, we prove that scheduling to minimize average response time in this model is strongly NP-hard in the offline case and that no online algorithm can be constant-competitive in the online case. However, we provide two online algorithms that match the performance of the offline optimal when given a slightly faster service rate.
{"title":"Joint optimization of overlapping phases in MapReduce","authors":"Minghong Lin, Li Zhang, A. Wierman, Jian Tan","doi":"10.1145/2567529.2567534","DOIUrl":"https://doi.org/10.1145/2567529.2567534","url":null,"abstract":"MapReduce is a scalable parallel computing framework for big data processing. It exhibits multiple processing phases, and thus an efficient job scheduling mechanism is crucial for ensuring efficient resource utilization. This work studies the scheduling challenge that results from the overlapping of the \"map\" and \"shuffle\" phases in MapReduce. We propose a new, general model for this scheduling problem. Further, we prove that scheduling to minimize average response time in this model is strongly NP-hard in the offline case and that no online algorithm can be constant-competitive in the online case. However, we provide two online algorithms that match the performance of the offline optimal when given a slightly faster service rate.","PeriodicalId":19766,"journal":{"name":"Perform. Evaluation","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2013-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81419408","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
We address the problem of developing a well-performing and implementable scheduler of users with wireless connection to the base station. The main feature of such real-life systems is that the quality conditions of the user channels are time-varying, which turn into the time-varying transmission rate due to different modulation and coding schemes. We assume that this phenomenon follows a Markovian law and most of the discussion is dedicated to the case of three quality conditions of each user, for which we characterize an optimal index policy and show that threshold policies (of giving higher priority to users with higher transmission rate) are not necessarily optimal. For the general case of arbitrary number of quality conditions we design a scheduler and propose its two practical approximations, and illustrate the performance of the proposed index-based schedulers and existing alternatives in a variety of simulation scenarios.
{"title":"Scheduling of users with markovian time-varying transmission rates","authors":"Fabio Cecchi, P. Jacko","doi":"10.1145/2465529.2465550","DOIUrl":"https://doi.org/10.1145/2465529.2465550","url":null,"abstract":"We address the problem of developing a well-performing and implementable scheduler of users with wireless connection to the base station. The main feature of such real-life systems is that the quality conditions of the user channels are time-varying, which turn into the time-varying transmission rate due to different modulation and coding schemes. We assume that this phenomenon follows a Markovian law and most of the discussion is dedicated to the case of three quality conditions of each user, for which we characterize an optimal index policy and show that threshold policies (of giving higher priority to users with higher transmission rate) are not necessarily optimal. For the general case of arbitrary number of quality conditions we design a scheduler and propose its two practical approximations, and illustrate the performance of the proposed index-based schedulers and existing alternatives in a variety of simulation scenarios.","PeriodicalId":19766,"journal":{"name":"Perform. Evaluation","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2013-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73021875","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-09-01DOI: 10.1016/j.peva.2012.05.008
Naoki Tsukada, R. Hirade, N. Miyoshi
{"title":"Fluid limit analysis of FIFO and RR caching for independent reference models","authors":"Naoki Tsukada, R. Hirade, N. Miyoshi","doi":"10.1016/j.peva.2012.05.008","DOIUrl":"https://doi.org/10.1016/j.peva.2012.05.008","url":null,"abstract":"","PeriodicalId":19766,"journal":{"name":"Perform. Evaluation","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90263385","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：